/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/combinations/Problem05_label46+token_ring.03.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 22:03:46,094 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 22:03:46,169 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-21 22:03:46,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 22:03:46,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 22:03:46,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 22:03:46,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 22:03:46,199 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 22:03:46,199 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 22:03:46,202 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 22:03:46,203 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 22:03:46,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 22:03:46,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 22:03:46,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 22:03:46,205 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 22:03:46,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 22:03:46,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 22:03:46,205 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 22:03:46,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 22:03:46,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 22:03:46,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 22:03:46,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 22:03:46,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 22:03:46,206 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 22:03:46,207 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 22:03:46,207 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 22:03:46,207 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 22:03:46,207 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 22:03:46,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 22:03:46,207 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 22:03:46,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 22:03:46,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 22:03:46,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 22:03:46,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 22:03:46,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 22:03:46,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 22:03:46,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 22:03:46,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 22:03:46,209 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 22:03:46,209 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 22:03:46,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 22:03:46,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 22:03:46,210 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 22:03:46,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 22:03:46,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 22:03:46,210 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 22:03:46,210 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-21 22:03:46,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 22:03:46,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 22:03:46,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 22:03:46,383 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 22:03:46,383 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 22:03:46,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/Problem05_label46+token_ring.03.cil-1.c [2023-12-21 22:03:47,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 22:03:47,937 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 22:03:47,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label46+token_ring.03.cil-1.c [2023-12-21 22:03:47,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ccdc65c/3a679861eace4d919e55032e69e266d7/FLAGb29b1015c [2023-12-21 22:03:48,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ccdc65c/3a679861eace4d919e55032e69e266d7 [2023-12-21 22:03:48,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 22:03:48,005 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 22:03:48,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 22:03:48,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 22:03:48,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 22:03:48,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:03:48" (1/1) ... [2023-12-21 22:03:48,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15530e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:03:48, skipping insertion in model container [2023-12-21 22:03:48,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:03:48" (1/1) ... [2023-12-21 22:03:48,178 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 22:03:49,389 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label46+token_ring.03.cil-1.c[382357,382370] [2023-12-21 22:03:49,413 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label46+token_ring.03.cil-1.c[383339,383352] [2023-12-21 22:03:49,533 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 22:03:49,545 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 22:03:50,163 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label46+token_ring.03.cil-1.c[382357,382370] [2023-12-21 22:03:50,166 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label46+token_ring.03.cil-1.c[383339,383352] [2023-12-21 22:03:50,185 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 22:03:50,231 INFO L206 MainTranslator]: Completed translation [2023-12-21 22:03:50,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:03:50 WrapperNode [2023-12-21 22:03:50,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 22:03:50,233 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 22:03:50,233 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 22:03:50,233 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 22:03:50,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:03:50" (1/1) ... [2023-12-21 22:03:50,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:03:50" (1/1) ... [2023-12-21 22:03:50,627 INFO L138 Inliner]: procedures = 51, calls = 51, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 12674 [2023-12-21 22:03:50,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 22:03:50,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 22:03:50,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 22:03:50,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 22:03:50,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:03:50" (1/1) ... [2023-12-21 22:03:50,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:03:50" (1/1) ... [2023-12-21 22:03:50,686 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:03:50" (1/1) ... [2023-12-21 22:03:50,843 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-21 22:03:50,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:03:50" (1/1) ... [2023-12-21 22:03:50,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:03:50" (1/1) ... [2023-12-21 22:03:50,987 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:03:50" (1/1) ... [2023-12-21 22:03:51,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:03:50" (1/1) ... [2023-12-21 22:03:51,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:03:50" (1/1) ... [2023-12-21 22:03:51,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:03:50" (1/1) ... [2023-12-21 22:03:51,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 22:03:51,179 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 22:03:51,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 22:03:51,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 22:03:51,179 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:03:50" (1/1) ... [2023-12-21 22:03:51,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 22:03:51,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 22:03:51,202 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-21 22:03:51,212 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-21 22:03:51,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 22:03:51,230 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-12-21 22:03:51,230 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-12-21 22:03:51,230 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-12-21 22:03:51,230 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-12-21 22:03:51,230 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-12-21 22:03:51,231 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-12-21 22:03:51,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 22:03:51,231 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-12-21 22:03:51,231 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-12-21 22:03:51,231 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-12-21 22:03:51,231 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-12-21 22:03:51,231 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-12-21 22:03:51,231 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-12-21 22:03:51,231 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-12-21 22:03:51,231 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-12-21 22:03:51,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 22:03:51,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 22:03:51,301 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 22:03:51,302 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 22:03:58,520 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 22:03:58,654 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 22:03:58,654 INFO L309 CfgBuilder]: Removed 7 assume(true) statements. [2023-12-21 22:03:58,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:03:58 BoogieIcfgContainer [2023-12-21 22:03:58,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 22:03:58,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 22:03:58,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 22:03:58,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 22:03:58,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 10:03:48" (1/3) ... [2023-12-21 22:03:58,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9e5c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:03:58, skipping insertion in model container [2023-12-21 22:03:58,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:03:50" (2/3) ... [2023-12-21 22:03:58,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9e5c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:03:58, skipping insertion in model container [2023-12-21 22:03:58,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:03:58" (3/3) ... [2023-12-21 22:03:58,660 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.03.cil-1.c [2023-12-21 22:03:58,671 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 22:03:58,671 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-21 22:03:58,721 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 22:03:58,725 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;@5522b06b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 22:03:58,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-21 22:03:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 2272 states, 2243 states have (on average 1.8849754792688365) internal successors, (4228), 2248 states have internal predecessors, (4228), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-21 22:03:58,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:03:58,746 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:03:58,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:03:58,747 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:03:58,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:03:58,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1198396318, now seen corresponding path program 1 times [2023-12-21 22:03:58,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:03:58,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185965839] [2023-12-21 22:03:58,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:03:58,762 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-21 22:03:58,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:03:58,784 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-21 22:03:58,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-21 22:03:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:03:58,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:03:58,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:03:58,998 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-21 22:03:58,998 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:03:58,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:03:58,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185965839] [2023-12-21 22:03:58,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185965839] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:03:58,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:03:58,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:03:59,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964902899] [2023-12-21 22:03:59,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:03:59,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 22:03:59,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:03:59,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 22:03:59,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 22:03:59,034 INFO L87 Difference]: Start difference. First operand has 2272 states, 2243 states have (on average 1.8849754792688365) internal successors, (4228), 2248 states have internal predecessors, (4228), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:03:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:03:59,468 INFO L93 Difference]: Finished difference Result 4686 states and 8770 transitions. [2023-12-21 22:03:59,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 22:03:59,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2023-12-21 22:03:59,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:03:59,486 INFO L225 Difference]: With dead ends: 4686 [2023-12-21 22:03:59,486 INFO L226 Difference]: Without dead ends: 2417 [2023-12-21 22:03:59,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 22:03:59,494 INFO L413 NwaCegarLoop]: 4125 mSDtfsCounter, 4341 mSDsluCounter, 8321 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4352 SdHoareTripleChecker+Valid, 12446 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 22:03:59,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4352 Valid, 12446 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 22:03:59,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2023-12-21 22:03:59,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2404. [2023-12-21 22:03:59,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2404 states, 2358 states have (on average 1.8379983036471585) internal successors, (4334), 2362 states have internal predecessors, (4334), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2023-12-21 22:03:59,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2404 states and 4395 transitions. [2023-12-21 22:03:59,577 INFO L78 Accepts]: Start accepts. Automaton has 2404 states and 4395 transitions. Word has length 72 [2023-12-21 22:03:59,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:03:59,577 INFO L495 AbstractCegarLoop]: Abstraction has 2404 states and 4395 transitions. [2023-12-21 22:03:59,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:03:59,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 4395 transitions. [2023-12-21 22:03:59,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:03:59,579 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:03:59,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:03:59,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-21 22:03:59,786 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-21 22:03:59,786 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:03:59,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:03:59,787 INFO L85 PathProgramCache]: Analyzing trace with hash -934532770, now seen corresponding path program 1 times [2023-12-21 22:03:59,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:03:59,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289062164] [2023-12-21 22:03:59,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:03:59,788 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-21 22:03:59,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:03:59,791 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-21 22:03:59,808 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-21 22:03:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:03:59,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:03:59,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:03:59,947 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-21 22:03:59,947 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:03:59,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:03:59,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289062164] [2023-12-21 22:03:59,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [289062164] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:03:59,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:03:59,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:03:59,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592274793] [2023-12-21 22:03:59,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:03:59,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 22:03:59,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:03:59,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 22:03:59,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 22:03:59,949 INFO L87 Difference]: Start difference. First operand 2404 states and 4395 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:00,182 INFO L93 Difference]: Finished difference Result 2678 states and 4824 transitions. [2023-12-21 22:04:00,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 22:04:00,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2023-12-21 22:04:00,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:00,190 INFO L225 Difference]: With dead ends: 2678 [2023-12-21 22:04:00,191 INFO L226 Difference]: Without dead ends: 2404 [2023-12-21 22:04:00,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 22:04:00,192 INFO L413 NwaCegarLoop]: 4097 mSDtfsCounter, 4233 mSDsluCounter, 8128 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4244 SdHoareTripleChecker+Valid, 12225 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:00,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4244 Valid, 12225 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:04:00,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2023-12-21 22:04:00,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2404. [2023-12-21 22:04:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2404 states, 2358 states have (on average 1.8350296861747244) internal successors, (4327), 2362 states have internal predecessors, (4327), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2023-12-21 22:04:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2404 states and 4388 transitions. [2023-12-21 22:04:00,256 INFO L78 Accepts]: Start accepts. Automaton has 2404 states and 4388 transitions. Word has length 72 [2023-12-21 22:04:00,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:00,257 INFO L495 AbstractCegarLoop]: Abstraction has 2404 states and 4388 transitions. [2023-12-21 22:04:00,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:00,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 4388 transitions. [2023-12-21 22:04:00,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:04:00,261 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:00,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:04:00,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-21 22:04:00,464 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-21 22:04:00,465 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:00,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:00,466 INFO L85 PathProgramCache]: Analyzing trace with hash -233284382, now seen corresponding path program 1 times [2023-12-21 22:04:00,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:00,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503439569] [2023-12-21 22:04:00,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:00,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-21 22:04:00,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:00,490 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-21 22:04:00,540 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-21 22:04:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:00,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:04:00,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:00,638 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-21 22:04:00,638 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:00,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:00,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503439569] [2023-12-21 22:04:00,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503439569] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:00,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:00,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:04:00,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780694206] [2023-12-21 22:04:00,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:00,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 22:04:00,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:00,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 22:04:00,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 22:04:00,641 INFO L87 Difference]: Start difference. First operand 2404 states and 4388 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:00,868 INFO L93 Difference]: Finished difference Result 2678 states and 4810 transitions. [2023-12-21 22:04:00,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 22:04:00,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2023-12-21 22:04:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:00,875 INFO L225 Difference]: With dead ends: 2678 [2023-12-21 22:04:00,875 INFO L226 Difference]: Without dead ends: 2404 [2023-12-21 22:04:00,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 22:04:00,877 INFO L413 NwaCegarLoop]: 4094 mSDtfsCounter, 4227 mSDsluCounter, 8124 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4238 SdHoareTripleChecker+Valid, 12218 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:00,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4238 Valid, 12218 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:04:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2023-12-21 22:04:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2404. [2023-12-21 22:04:00,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2404 states, 2358 states have (on average 1.83206106870229) internal successors, (4320), 2362 states have internal predecessors, (4320), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2023-12-21 22:04:00,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2404 states and 4381 transitions. [2023-12-21 22:04:00,913 INFO L78 Accepts]: Start accepts. Automaton has 2404 states and 4381 transitions. Word has length 72 [2023-12-21 22:04:00,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:00,913 INFO L495 AbstractCegarLoop]: Abstraction has 2404 states and 4381 transitions. [2023-12-21 22:04:00,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:00,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 4381 transitions. [2023-12-21 22:04:00,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:04:00,914 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:00,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:04:00,920 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-21 22:04:01,118 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-21 22:04:01,118 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:01,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:01,119 INFO L85 PathProgramCache]: Analyzing trace with hash 66431198, now seen corresponding path program 1 times [2023-12-21 22:04:01,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:01,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995538334] [2023-12-21 22:04:01,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:01,119 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-21 22:04:01,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:01,120 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-21 22:04:01,149 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-21 22:04:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:01,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:04:01,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:01,220 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-21 22:04:01,220 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:01,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:01,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995538334] [2023-12-21 22:04:01,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995538334] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:01,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:01,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:04:01,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464746192] [2023-12-21 22:04:01,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:01,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 22:04:01,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:01,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 22:04:01,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 22:04:01,222 INFO L87 Difference]: Start difference. First operand 2404 states and 4381 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:01,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:01,443 INFO L93 Difference]: Finished difference Result 2678 states and 4796 transitions. [2023-12-21 22:04:01,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 22:04:01,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2023-12-21 22:04:01,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:01,451 INFO L225 Difference]: With dead ends: 2678 [2023-12-21 22:04:01,451 INFO L226 Difference]: Without dead ends: 2404 [2023-12-21 22:04:01,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 22:04:01,452 INFO L413 NwaCegarLoop]: 4091 mSDtfsCounter, 4221 mSDsluCounter, 8120 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4232 SdHoareTripleChecker+Valid, 12211 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:01,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4232 Valid, 12211 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:04:01,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2023-12-21 22:04:01,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2404. [2023-12-21 22:04:01,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2404 states, 2358 states have (on average 1.8290924512298559) internal successors, (4313), 2362 states have internal predecessors, (4313), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2023-12-21 22:04:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2404 states to 2404 states and 4374 transitions. [2023-12-21 22:04:01,490 INFO L78 Accepts]: Start accepts. Automaton has 2404 states and 4374 transitions. Word has length 72 [2023-12-21 22:04:01,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:01,490 INFO L495 AbstractCegarLoop]: Abstraction has 2404 states and 4374 transitions. [2023-12-21 22:04:01,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2404 states and 4374 transitions. [2023-12-21 22:04:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:04:01,491 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:01,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:04:01,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-21 22:04:01,693 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-21 22:04:01,693 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:01,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:01,694 INFO L85 PathProgramCache]: Analyzing trace with hash -478089886, now seen corresponding path program 1 times [2023-12-21 22:04:01,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:01,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619160200] [2023-12-21 22:04:01,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:01,694 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-21 22:04:01,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:01,713 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-21 22:04:01,740 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-21 22:04:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:01,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:04:01,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 22:04:01,842 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:01,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:01,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619160200] [2023-12-21 22:04:01,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619160200] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:01,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:01,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:04:01,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140268819] [2023-12-21 22:04:01,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:01,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 22:04:01,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:01,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 22:04:01,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 22:04:01,844 INFO L87 Difference]: Start difference. First operand 2404 states and 4374 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:02,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:02,109 INFO L93 Difference]: Finished difference Result 2736 states and 4874 transitions. [2023-12-21 22:04:02,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 22:04:02,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2023-12-21 22:04:02,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:02,116 INFO L225 Difference]: With dead ends: 2736 [2023-12-21 22:04:02,116 INFO L226 Difference]: Without dead ends: 2462 [2023-12-21 22:04:02,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 22:04:02,118 INFO L413 NwaCegarLoop]: 4089 mSDtfsCounter, 4248 mSDsluCounter, 8116 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4259 SdHoareTripleChecker+Valid, 12205 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:02,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4259 Valid, 12205 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:04:02,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2023-12-21 22:04:02,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2462. [2023-12-21 22:04:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2462 states, 2410 states have (on average 1.8174273858921162) internal successors, (4380), 2414 states have internal predecessors, (4380), 33 states have call successors, (33), 17 states have call predecessors, (33), 17 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2023-12-21 22:04:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2462 states to 2462 states and 4445 transitions. [2023-12-21 22:04:02,159 INFO L78 Accepts]: Start accepts. Automaton has 2462 states and 4445 transitions. Word has length 72 [2023-12-21 22:04:02,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:02,159 INFO L495 AbstractCegarLoop]: Abstraction has 2462 states and 4445 transitions. [2023-12-21 22:04:02,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2462 states and 4445 transitions. [2023-12-21 22:04:02,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:04:02,160 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:02,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:04:02,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-21 22:04:02,363 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-21 22:04:02,364 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:02,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:02,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1214274301, now seen corresponding path program 1 times [2023-12-21 22:04:02,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:02,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154434329] [2023-12-21 22:04:02,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:02,368 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-21 22:04:02,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:02,369 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-21 22:04:02,370 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-21 22:04:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:02,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:04:02,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:02,500 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-21 22:04:02,500 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:02,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:02,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154434329] [2023-12-21 22:04:02,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154434329] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:02,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:02,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:04:02,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95058611] [2023-12-21 22:04:02,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:02,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 22:04:02,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:02,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 22:04:02,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 22:04:02,503 INFO L87 Difference]: Start difference. First operand 2462 states and 4445 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:02,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:02,773 INFO L93 Difference]: Finished difference Result 2852 states and 5016 transitions. [2023-12-21 22:04:02,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 22:04:02,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2023-12-21 22:04:02,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:02,782 INFO L225 Difference]: With dead ends: 2852 [2023-12-21 22:04:02,782 INFO L226 Difference]: Without dead ends: 2520 [2023-12-21 22:04:02,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 22:04:02,785 INFO L413 NwaCegarLoop]: 4086 mSDtfsCounter, 4241 mSDsluCounter, 8112 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4252 SdHoareTripleChecker+Valid, 12198 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:02,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4252 Valid, 12198 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:04:02,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2023-12-21 22:04:02,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 2520. [2023-12-21 22:04:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2520 states, 2462 states have (on average 1.804630381803412) internal successors, (4443), 2466 states have internal predecessors, (4443), 35 states have call successors, (35), 21 states have call predecessors, (35), 21 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2023-12-21 22:04:02,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2520 states and 4512 transitions. [2023-12-21 22:04:02,842 INFO L78 Accepts]: Start accepts. Automaton has 2520 states and 4512 transitions. Word has length 72 [2023-12-21 22:04:02,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:02,842 INFO L495 AbstractCegarLoop]: Abstraction has 2520 states and 4512 transitions. [2023-12-21 22:04:02,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:02,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2520 states and 4512 transitions. [2023-12-21 22:04:02,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:04:02,848 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:02,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:04:02,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-21 22:04:03,052 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-21 22:04:03,052 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:03,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:03,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1271205759, now seen corresponding path program 1 times [2023-12-21 22:04:03,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:03,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633640074] [2023-12-21 22:04:03,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:03,053 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-21 22:04:03,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:03,055 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-21 22:04:03,056 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-21 22:04:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:03,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:04:03,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:03,171 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-21 22:04:03,171 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:03,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:03,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633640074] [2023-12-21 22:04:03,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633640074] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:03,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:03,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:04:03,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845199789] [2023-12-21 22:04:03,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:03,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 22:04:03,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:03,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 22:04:03,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 22:04:03,173 INFO L87 Difference]: Start difference. First operand 2520 states and 4512 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:03,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:03,499 INFO L93 Difference]: Finished difference Result 2968 states and 5150 transitions. [2023-12-21 22:04:03,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 22:04:03,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2023-12-21 22:04:03,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:03,507 INFO L225 Difference]: With dead ends: 2968 [2023-12-21 22:04:03,507 INFO L226 Difference]: Without dead ends: 2578 [2023-12-21 22:04:03,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 22:04:03,509 INFO L413 NwaCegarLoop]: 4083 mSDtfsCounter, 4234 mSDsluCounter, 8108 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4245 SdHoareTripleChecker+Valid, 12191 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:03,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4245 Valid, 12191 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:04:03,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2023-12-21 22:04:03,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2578. [2023-12-21 22:04:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2578 states, 2514 states have (on average 1.7907716785998409) internal successors, (4502), 2518 states have internal predecessors, (4502), 37 states have call successors, (37), 25 states have call predecessors, (37), 25 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2023-12-21 22:04:03,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 4575 transitions. [2023-12-21 22:04:03,564 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 4575 transitions. Word has length 72 [2023-12-21 22:04:03,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:03,564 INFO L495 AbstractCegarLoop]: Abstraction has 2578 states and 4575 transitions. [2023-12-21 22:04:03,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 4575 transitions. [2023-12-21 22:04:03,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:04:03,565 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:03,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:04:03,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-21 22:04:03,769 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-21 22:04:03,769 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:03,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:03,770 INFO L85 PathProgramCache]: Analyzing trace with hash 202160710, now seen corresponding path program 1 times [2023-12-21 22:04:03,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:03,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817304586] [2023-12-21 22:04:03,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:03,771 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-21 22:04:03,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:03,772 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-21 22:04:03,773 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-21 22:04:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:03,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:04:03,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:03,849 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-21 22:04:03,849 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:03,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:03,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817304586] [2023-12-21 22:04:03,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817304586] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:03,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:03,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:04:03,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894853386] [2023-12-21 22:04:03,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:03,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:04:03,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:03,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:04:03,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:04:03,851 INFO L87 Difference]: Start difference. First operand 2578 states and 4575 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:03,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:03,939 INFO L93 Difference]: Finished difference Result 3069 states and 5255 transitions. [2023-12-21 22:04:03,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 22:04:03,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2023-12-21 22:04:03,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:03,947 INFO L225 Difference]: With dead ends: 3069 [2023-12-21 22:04:03,947 INFO L226 Difference]: Without dead ends: 2622 [2023-12-21 22:04:03,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:04:03,950 INFO L413 NwaCegarLoop]: 4147 mSDtfsCounter, 29 mSDsluCounter, 8287 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 12434 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:03,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 12434 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:03,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2023-12-21 22:04:03,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 2582. [2023-12-21 22:04:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2582 states, 2518 states have (on average 1.7871326449563145) internal successors, (4500), 2522 states have internal predecessors, (4500), 37 states have call successors, (37), 25 states have call predecessors, (37), 25 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2023-12-21 22:04:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 4573 transitions. [2023-12-21 22:04:04,003 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 4573 transitions. Word has length 72 [2023-12-21 22:04:04,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:04,004 INFO L495 AbstractCegarLoop]: Abstraction has 2582 states and 4573 transitions. [2023-12-21 22:04:04,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:04,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 4573 transitions. [2023-12-21 22:04:04,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:04:04,005 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:04,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:04:04,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-21 22:04:04,208 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-21 22:04:04,209 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:04,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:04,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1095647048, now seen corresponding path program 1 times [2023-12-21 22:04:04,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:04,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648333604] [2023-12-21 22:04:04,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:04,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-21 22:04:04,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:04,229 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-21 22:04:04,255 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-21 22:04:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:04,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:04:04,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:04,328 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-21 22:04:04,328 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:04,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648333604] [2023-12-21 22:04:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648333604] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:04,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:04,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:04:04,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876750328] [2023-12-21 22:04:04,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:04,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:04:04,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:04,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:04:04,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:04:04,330 INFO L87 Difference]: Start difference. First operand 2582 states and 4573 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:04,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:04,407 INFO L93 Difference]: Finished difference Result 3065 states and 5235 transitions. [2023-12-21 22:04:04,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 22:04:04,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2023-12-21 22:04:04,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:04,430 INFO L225 Difference]: With dead ends: 3065 [2023-12-21 22:04:04,431 INFO L226 Difference]: Without dead ends: 2614 [2023-12-21 22:04:04,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:04:04,435 INFO L413 NwaCegarLoop]: 4147 mSDtfsCounter, 20 mSDsluCounter, 8288 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 12435 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:04,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 12435 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:04,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2614 states. [2023-12-21 22:04:04,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2614 to 2586. [2023-12-21 22:04:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2586 states, 2522 states have (on average 1.7835051546391754) internal successors, (4498), 2526 states have internal predecessors, (4498), 37 states have call successors, (37), 25 states have call predecessors, (37), 25 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2023-12-21 22:04:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 4571 transitions. [2023-12-21 22:04:04,481 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 4571 transitions. Word has length 72 [2023-12-21 22:04:04,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:04,481 INFO L495 AbstractCegarLoop]: Abstraction has 2586 states and 4571 transitions. [2023-12-21 22:04:04,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:04,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 4571 transitions. [2023-12-21 22:04:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:04:04,482 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:04,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:04:04,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-21 22:04:04,685 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-21 22:04:04,686 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:04,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:04,686 INFO L85 PathProgramCache]: Analyzing trace with hash -276160250, now seen corresponding path program 1 times [2023-12-21 22:04:04,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:04,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304444206] [2023-12-21 22:04:04,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:04,686 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-21 22:04:04,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:04,687 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-21 22:04:04,707 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-21 22:04:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:04,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:04:04,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:04,805 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-21 22:04:04,805 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:04,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:04,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304444206] [2023-12-21 22:04:04,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304444206] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:04,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:04,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 22:04:04,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608609834] [2023-12-21 22:04:04,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:04,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:04:04,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:04,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:04:04,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:04:04,807 INFO L87 Difference]: Start difference. First operand 2586 states and 4571 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:04,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:04,894 INFO L93 Difference]: Finished difference Result 3423 states and 5681 transitions. [2023-12-21 22:04:04,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:04:04,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2023-12-21 22:04:04,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:04,905 INFO L225 Difference]: With dead ends: 3423 [2023-12-21 22:04:04,906 INFO L226 Difference]: Without dead ends: 2968 [2023-12-21 22:04:04,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 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-21 22:04:04,908 INFO L413 NwaCegarLoop]: 4183 mSDtfsCounter, 4119 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4119 SdHoareTripleChecker+Valid, 4351 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:04,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4119 Valid, 4351 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:04,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2023-12-21 22:04:04,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2962. [2023-12-21 22:04:04,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2962 states, 2850 states have (on average 1.729122807017544) internal successors, (4928), 2855 states have internal predecessors, (4928), 64 states have call successors, (64), 45 states have call predecessors, (64), 46 states have return successors, (64), 62 states have call predecessors, (64), 62 states have call successors, (64) [2023-12-21 22:04:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2962 states and 5056 transitions. [2023-12-21 22:04:04,967 INFO L78 Accepts]: Start accepts. Automaton has 2962 states and 5056 transitions. Word has length 72 [2023-12-21 22:04:04,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:04,968 INFO L495 AbstractCegarLoop]: Abstraction has 2962 states and 5056 transitions. [2023-12-21 22:04:04,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:04,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2962 states and 5056 transitions. [2023-12-21 22:04:04,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:04:04,969 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:04,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:04:04,982 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-21 22:04:05,172 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-21 22:04:05,173 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:05,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:05,183 INFO L85 PathProgramCache]: Analyzing trace with hash 247160421, now seen corresponding path program 1 times [2023-12-21 22:04:05,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:05,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830341890] [2023-12-21 22:04:05,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:05,183 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-21 22:04:05,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:05,184 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-21 22:04:05,192 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-21 22:04:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:05,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:04:05,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:05,257 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-21 22:04:05,257 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:05,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:05,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830341890] [2023-12-21 22:04:05,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830341890] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:05,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:05,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:04:05,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022199] [2023-12-21 22:04:05,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:05,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:04:05,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:05,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:04:05,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:04:05,259 INFO L87 Difference]: Start difference. First operand 2962 states and 5056 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:05,345 INFO L93 Difference]: Finished difference Result 3873 states and 6281 transitions. [2023-12-21 22:04:05,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 22:04:05,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2023-12-21 22:04:05,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:05,350 INFO L225 Difference]: With dead ends: 3873 [2023-12-21 22:04:05,350 INFO L226 Difference]: Without dead ends: 3042 [2023-12-21 22:04:05,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:04:05,352 INFO L413 NwaCegarLoop]: 4150 mSDtfsCounter, 11 mSDsluCounter, 8294 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12444 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:05,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12444 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:05,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2023-12-21 22:04:05,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2978. [2023-12-21 22:04:05,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2978 states, 2866 states have (on average 1.7229588276343335) internal successors, (4938), 2871 states have internal predecessors, (4938), 64 states have call successors, (64), 45 states have call predecessors, (64), 46 states have return successors, (64), 62 states have call predecessors, (64), 62 states have call successors, (64) [2023-12-21 22:04:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2978 states to 2978 states and 5066 transitions. [2023-12-21 22:04:05,402 INFO L78 Accepts]: Start accepts. Automaton has 2978 states and 5066 transitions. Word has length 72 [2023-12-21 22:04:05,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:05,402 INFO L495 AbstractCegarLoop]: Abstraction has 2978 states and 5066 transitions. [2023-12-21 22:04:05,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:05,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2978 states and 5066 transitions. [2023-12-21 22:04:05,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:04:05,403 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:05,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:04:05,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-21 22:04:05,606 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-21 22:04:05,606 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:05,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:05,607 INFO L85 PathProgramCache]: Analyzing trace with hash -596845081, now seen corresponding path program 1 times [2023-12-21 22:04:05,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:05,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434603057] [2023-12-21 22:04:05,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:05,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-21 22:04:05,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:05,608 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-21 22:04:05,610 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-21 22:04:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:05,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:04:05,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:05,736 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-21 22:04:05,736 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:05,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:05,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434603057] [2023-12-21 22:04:05,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434603057] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:05,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:05,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:04:05,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211664251] [2023-12-21 22:04:05,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:05,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:04:05,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:05,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:04:05,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:04:05,737 INFO L87 Difference]: Start difference. First operand 2978 states and 5066 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:05,821 INFO L93 Difference]: Finished difference Result 3833 states and 6202 transitions. [2023-12-21 22:04:05,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 22:04:05,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2023-12-21 22:04:05,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:05,827 INFO L225 Difference]: With dead ends: 3833 [2023-12-21 22:04:05,827 INFO L226 Difference]: Without dead ends: 2986 [2023-12-21 22:04:05,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:04:05,829 INFO L413 NwaCegarLoop]: 4147 mSDtfsCounter, 2 mSDsluCounter, 8289 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12436 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:05,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 12436 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:05,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2023-12-21 22:04:05,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2982. [2023-12-21 22:04:05,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2982 states, 2870 states have (on average 1.7177700348432057) internal successors, (4930), 2875 states have internal predecessors, (4930), 64 states have call successors, (64), 45 states have call predecessors, (64), 46 states have return successors, (64), 62 states have call predecessors, (64), 62 states have call successors, (64) [2023-12-21 22:04:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 5058 transitions. [2023-12-21 22:04:05,884 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 5058 transitions. Word has length 72 [2023-12-21 22:04:05,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:05,884 INFO L495 AbstractCegarLoop]: Abstraction has 2982 states and 5058 transitions. [2023-12-21 22:04:05,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 22:04:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 5058 transitions. [2023-12-21 22:04:05,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-21 22:04:05,885 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:05,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:04:05,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-21 22:04:06,088 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-21 22:04:06,089 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:06,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:06,089 INFO L85 PathProgramCache]: Analyzing trace with hash -574212827, now seen corresponding path program 1 times [2023-12-21 22:04:06,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:06,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82229831] [2023-12-21 22:04:06,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:06,090 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-21 22:04:06,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:06,091 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-21 22:04:06,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-21 22:04:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:06,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:04:06,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:06,267 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-21 22:04:06,267 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:06,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:06,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82229831] [2023-12-21 22:04:06,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82229831] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:06,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:06,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 22:04:06,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018967114] [2023-12-21 22:04:06,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:06,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:04:06,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:06,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:04:06,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:04:06,269 INFO L87 Difference]: Start difference. First operand 2982 states and 5058 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-21 22:04:06,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:06,362 INFO L93 Difference]: Finished difference Result 4625 states and 7164 transitions. [2023-12-21 22:04:06,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:04:06,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 72 [2023-12-21 22:04:06,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:06,369 INFO L225 Difference]: With dead ends: 4625 [2023-12-21 22:04:06,369 INFO L226 Difference]: Without dead ends: 3774 [2023-12-21 22:04:06,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 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-21 22:04:06,372 INFO L413 NwaCegarLoop]: 4146 mSDtfsCounter, 4074 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4074 SdHoareTripleChecker+Valid, 4312 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:06,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4074 Valid, 4312 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:06,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3774 states. [2023-12-21 22:04:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3774 to 3770. [2023-12-21 22:04:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3770 states, 3554 states have (on average 1.625773776027012) internal successors, (5778), 3565 states have internal predecessors, (5778), 122 states have call successors, (122), 89 states have call predecessors, (122), 92 states have return successors, (124), 116 states have call predecessors, (124), 120 states have call successors, (124) [2023-12-21 22:04:06,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3770 states to 3770 states and 6024 transitions. [2023-12-21 22:04:06,543 INFO L78 Accepts]: Start accepts. Automaton has 3770 states and 6024 transitions. Word has length 72 [2023-12-21 22:04:06,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:06,544 INFO L495 AbstractCegarLoop]: Abstraction has 3770 states and 6024 transitions. [2023-12-21 22:04:06,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-21 22:04:06,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3770 states and 6024 transitions. [2023-12-21 22:04:06,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-21 22:04:06,545 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:06,546 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 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-21 22:04:06,551 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-21 22:04:06,749 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-21 22:04:06,749 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:06,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:06,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1795205584, now seen corresponding path program 1 times [2023-12-21 22:04:06,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:06,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235403329] [2023-12-21 22:04:06,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:06,750 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-21 22:04:06,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:06,751 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-21 22:04:06,775 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-21 22:04:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:06,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 22:04:06,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:06,941 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-21 22:04:06,941 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:06,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:06,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235403329] [2023-12-21 22:04:06,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235403329] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:06,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:06,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:04:06,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364026289] [2023-12-21 22:04:06,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:06,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:04:06,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:06,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:04:06,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:04:06,948 INFO L87 Difference]: Start difference. First operand 3770 states and 6024 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-21 22:04:07,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:07,316 INFO L93 Difference]: Finished difference Result 7088 states and 10185 transitions. [2023-12-21 22:04:07,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 22:04:07,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 116 [2023-12-21 22:04:07,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:07,326 INFO L225 Difference]: With dead ends: 7088 [2023-12-21 22:04:07,327 INFO L226 Difference]: Without dead ends: 5450 [2023-12-21 22:04:07,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 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-21 22:04:07,331 INFO L413 NwaCegarLoop]: 4154 mSDtfsCounter, 4192 mSDsluCounter, 4221 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4198 SdHoareTripleChecker+Valid, 8375 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:07,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4198 Valid, 8375 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:04:07,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5450 states. [2023-12-21 22:04:07,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5450 to 5446. [2023-12-21 22:04:07,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5446 states, 5027 states have (on average 1.5116371593395663) internal successors, (7599), 5055 states have internal predecessors, (7599), 225 states have call successors, (225), 169 states have call predecessors, (225), 192 states have return successors, (271), 223 states have call predecessors, (271), 223 states have call successors, (271) [2023-12-21 22:04:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5446 states to 5446 states and 8095 transitions. [2023-12-21 22:04:07,575 INFO L78 Accepts]: Start accepts. Automaton has 5446 states and 8095 transitions. Word has length 116 [2023-12-21 22:04:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:07,575 INFO L495 AbstractCegarLoop]: Abstraction has 5446 states and 8095 transitions. [2023-12-21 22:04:07,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-21 22:04:07,576 INFO L276 IsEmpty]: Start isEmpty. Operand 5446 states and 8095 transitions. [2023-12-21 22:04:07,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-21 22:04:07,579 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:07,579 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 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-21 22:04:07,602 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-21 22:04:07,780 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-21 22:04:07,780 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:07,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:07,780 INFO L85 PathProgramCache]: Analyzing trace with hash 756621010, now seen corresponding path program 1 times [2023-12-21 22:04:07,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:07,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362404535] [2023-12-21 22:04:07,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:07,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:04:07,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:07,782 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-21 22:04:07,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-21 22:04:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:07,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:04:07,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-21 22:04:07,882 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:07,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:07,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362404535] [2023-12-21 22:04:07,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362404535] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:07,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:07,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:04:07,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193683569] [2023-12-21 22:04:07,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:07,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:04:07,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:07,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:04:07,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:04:07,883 INFO L87 Difference]: Start difference. First operand 5446 states and 8095 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 22:04:08,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:08,000 INFO L93 Difference]: Finished difference Result 8754 states and 12202 transitions. [2023-12-21 22:04:08,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:04:08,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 116 [2023-12-21 22:04:08,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:08,010 INFO L225 Difference]: With dead ends: 8754 [2023-12-21 22:04:08,010 INFO L226 Difference]: Without dead ends: 5440 [2023-12-21 22:04:08,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 114 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-21 22:04:08,016 INFO L413 NwaCegarLoop]: 4146 mSDtfsCounter, 200 mSDsluCounter, 3957 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 8103 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:08,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 8103 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:08,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2023-12-21 22:04:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5440. [2023-12-21 22:04:08,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5440 states, 5024 states have (on average 1.511345541401274) internal successors, (7593), 5051 states have internal predecessors, (7593), 222 states have call successors, (222), 169 states have call predecessors, (222), 192 states have return successors, (268), 220 states have call predecessors, (268), 220 states have call successors, (268) [2023-12-21 22:04:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5440 states to 5440 states and 8083 transitions. [2023-12-21 22:04:08,143 INFO L78 Accepts]: Start accepts. Automaton has 5440 states and 8083 transitions. Word has length 116 [2023-12-21 22:04:08,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:08,144 INFO L495 AbstractCegarLoop]: Abstraction has 5440 states and 8083 transitions. [2023-12-21 22:04:08,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 22:04:08,144 INFO L276 IsEmpty]: Start isEmpty. Operand 5440 states and 8083 transitions. [2023-12-21 22:04:08,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-21 22:04:08,146 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:08,146 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 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-21 22:04:08,164 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-21 22:04:08,364 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-21 22:04:08,364 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:08,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:08,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1046648875, now seen corresponding path program 1 times [2023-12-21 22:04:08,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:08,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252801890] [2023-12-21 22:04:08,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:08,366 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-21 22:04:08,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:08,367 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-21 22:04:08,370 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-21 22:04:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:08,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 22:04:08,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-21 22:04:08,552 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:08,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:08,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252801890] [2023-12-21 22:04:08,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252801890] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:08,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:08,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:04:08,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480009012] [2023-12-21 22:04:08,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:08,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:04:08,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:08,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:04:08,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:04:08,554 INFO L87 Difference]: Start difference. First operand 5440 states and 8083 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-21 22:04:08,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:08,914 INFO L93 Difference]: Finished difference Result 12097 states and 16350 transitions. [2023-12-21 22:04:08,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 22:04:08,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 118 [2023-12-21 22:04:08,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:08,930 INFO L225 Difference]: With dead ends: 12097 [2023-12-21 22:04:08,931 INFO L226 Difference]: Without dead ends: 8789 [2023-12-21 22:04:08,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 116 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-21 22:04:08,938 INFO L413 NwaCegarLoop]: 4143 mSDtfsCounter, 4190 mSDsluCounter, 4203 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4196 SdHoareTripleChecker+Valid, 8346 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:08,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4196 Valid, 8346 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:04:08,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8789 states. [2023-12-21 22:04:09,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8789 to 8673. [2023-12-21 22:04:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8673 states, 7826 states have (on average 1.4091489905443393) internal successors, (11028), 7906 states have internal predecessors, (11028), 425 states have call successors, (425), 321 states have call predecessors, (425), 420 states have return successors, (603), 447 states have call predecessors, (603), 423 states have call successors, (603) [2023-12-21 22:04:09,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8673 states to 8673 states and 12056 transitions. [2023-12-21 22:04:09,302 INFO L78 Accepts]: Start accepts. Automaton has 8673 states and 12056 transitions. Word has length 118 [2023-12-21 22:04:09,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:09,302 INFO L495 AbstractCegarLoop]: Abstraction has 8673 states and 12056 transitions. [2023-12-21 22:04:09,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-21 22:04:09,302 INFO L276 IsEmpty]: Start isEmpty. Operand 8673 states and 12056 transitions. [2023-12-21 22:04:09,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-21 22:04:09,305 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:09,305 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 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-21 22:04:09,311 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-21 22:04:09,511 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-21 22:04:09,511 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:09,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:09,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1116967699, now seen corresponding path program 1 times [2023-12-21 22:04:09,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:09,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140092720] [2023-12-21 22:04:09,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:09,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:04:09,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:09,513 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-21 22:04:09,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-21 22:04:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:09,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:04:09,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-21 22:04:09,631 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:09,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:09,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140092720] [2023-12-21 22:04:09,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140092720] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:09,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:09,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:04:09,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176566025] [2023-12-21 22:04:09,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:09,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:04:09,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:09,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:04:09,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:04:09,633 INFO L87 Difference]: Start difference. First operand 8673 states and 12056 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 22:04:09,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:09,826 INFO L93 Difference]: Finished difference Result 13773 states and 18367 transitions. [2023-12-21 22:04:09,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:04:09,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 118 [2023-12-21 22:04:09,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:09,839 INFO L225 Difference]: With dead ends: 13773 [2023-12-21 22:04:09,839 INFO L226 Difference]: Without dead ends: 7232 [2023-12-21 22:04:09,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 116 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-21 22:04:09,849 INFO L413 NwaCegarLoop]: 4145 mSDtfsCounter, 198 mSDsluCounter, 3957 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 8102 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:09,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 8102 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:09,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7232 states. [2023-12-21 22:04:10,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7232 to 7232. [2023-12-21 22:04:10,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7232 states, 6576 states have (on average 1.444647201946472) internal successors, (9500), 6643 states have internal predecessors, (9500), 322 states have call successors, (322), 245 states have call predecessors, (322), 332 states have return successors, (464), 344 states have call predecessors, (464), 320 states have call successors, (464) [2023-12-21 22:04:10,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7232 states to 7232 states and 10286 transitions. [2023-12-21 22:04:10,049 INFO L78 Accepts]: Start accepts. Automaton has 7232 states and 10286 transitions. Word has length 118 [2023-12-21 22:04:10,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:10,049 INFO L495 AbstractCegarLoop]: Abstraction has 7232 states and 10286 transitions. [2023-12-21 22:04:10,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 22:04:10,049 INFO L276 IsEmpty]: Start isEmpty. Operand 7232 states and 10286 transitions. [2023-12-21 22:04:10,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-21 22:04:10,052 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:10,052 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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-21 22:04:10,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-21 22:04:10,255 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-21 22:04:10,257 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:10,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:10,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1963387408, now seen corresponding path program 1 times [2023-12-21 22:04:10,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:10,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497993900] [2023-12-21 22:04:10,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:10,258 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-21 22:04:10,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:10,258 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-21 22:04:10,280 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-21 22:04:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:10,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 22:04:10,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-21 22:04:10,433 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:10,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:10,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497993900] [2023-12-21 22:04:10,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497993900] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:10,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:10,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:04:10,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291919638] [2023-12-21 22:04:10,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:10,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:04:10,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:10,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:04:10,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:04:10,435 INFO L87 Difference]: Start difference. First operand 7232 states and 10286 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-21 22:04:11,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:11,027 INFO L93 Difference]: Finished difference Result 16488 states and 21779 transitions. [2023-12-21 22:04:11,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 22:04:11,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 120 [2023-12-21 22:04:11,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:11,089 INFO L225 Difference]: With dead ends: 16488 [2023-12-21 22:04:11,089 INFO L226 Difference]: Without dead ends: 11388 [2023-12-21 22:04:11,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 118 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-21 22:04:11,113 INFO L413 NwaCegarLoop]: 4159 mSDtfsCounter, 4172 mSDsluCounter, 4204 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4178 SdHoareTripleChecker+Valid, 8363 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:11,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4178 Valid, 8363 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:04:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11388 states. [2023-12-21 22:04:11,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11388 to 11384. [2023-12-21 22:04:11,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11384 states, 10173 states have (on average 1.3703922146859333) internal successors, (13941), 10305 states have internal predecessors, (13941), 593 states have call successors, (593), 441 states have call predecessors, (593), 616 states have return successors, (891), 639 states have call predecessors, (891), 591 states have call successors, (891) [2023-12-21 22:04:11,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11384 states to 11384 states and 15425 transitions. [2023-12-21 22:04:11,467 INFO L78 Accepts]: Start accepts. Automaton has 11384 states and 15425 transitions. Word has length 120 [2023-12-21 22:04:11,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:11,467 INFO L495 AbstractCegarLoop]: Abstraction has 11384 states and 15425 transitions. [2023-12-21 22:04:11,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-21 22:04:11,468 INFO L276 IsEmpty]: Start isEmpty. Operand 11384 states and 15425 transitions. [2023-12-21 22:04:11,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-21 22:04:11,472 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:11,472 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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-21 22:04:11,476 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 (19)] Ended with exit code 0 [2023-12-21 22:04:11,675 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-21 22:04:11,676 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:11,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:11,676 INFO L85 PathProgramCache]: Analyzing trace with hash 316024466, now seen corresponding path program 1 times [2023-12-21 22:04:11,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:11,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288153347] [2023-12-21 22:04:11,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:11,676 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-21 22:04:11,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:11,677 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-21 22:04:11,711 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-21 22:04:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:11,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:04:11,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-21 22:04:11,768 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:11,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:11,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288153347] [2023-12-21 22:04:11,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288153347] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:11,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:11,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:04:11,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855414128] [2023-12-21 22:04:11,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:11,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:04:11,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:11,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:04:11,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:04:11,769 INFO L87 Difference]: Start difference. First operand 11384 states and 15425 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 22:04:12,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:12,178 INFO L93 Difference]: Finished difference Result 20632 states and 26868 transitions. [2023-12-21 22:04:12,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:04:12,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 120 [2023-12-21 22:04:12,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:12,193 INFO L225 Difference]: With dead ends: 20632 [2023-12-21 22:04:12,193 INFO L226 Difference]: Without dead ends: 11380 [2023-12-21 22:04:12,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 118 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-21 22:04:12,202 INFO L413 NwaCegarLoop]: 4144 mSDtfsCounter, 196 mSDsluCounter, 3957 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 8101 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:12,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 8101 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:12,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11380 states. [2023-12-21 22:04:12,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11380 to 11380. [2023-12-21 22:04:12,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11380 states, 10172 states have (on average 1.3703303185214313) internal successors, (13939), 10303 states have internal predecessors, (13939), 590 states have call successors, (590), 441 states have call predecessors, (590), 616 states have return successors, (888), 636 states have call predecessors, (888), 588 states have call successors, (888) [2023-12-21 22:04:12,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11380 states to 11380 states and 15417 transitions. [2023-12-21 22:04:12,538 INFO L78 Accepts]: Start accepts. Automaton has 11380 states and 15417 transitions. Word has length 120 [2023-12-21 22:04:12,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:12,538 INFO L495 AbstractCegarLoop]: Abstraction has 11380 states and 15417 transitions. [2023-12-21 22:04:12,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-21 22:04:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 11380 states and 15417 transitions. [2023-12-21 22:04:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-21 22:04:12,544 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:12,544 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 22:04:12,549 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-21 22:04:12,747 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-21 22:04:12,747 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:12,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:12,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1783787179, now seen corresponding path program 1 times [2023-12-21 22:04:12,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:12,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968664883] [2023-12-21 22:04:12,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:12,748 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-21 22:04:12,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:12,749 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-21 22:04:12,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-21 22:04:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:12,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:04:12,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-21 22:04:12,909 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:12,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:12,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968664883] [2023-12-21 22:04:12,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968664883] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:12,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:12,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:04:12,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410645276] [2023-12-21 22:04:12,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:12,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:04:12,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:12,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:04:12,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:04:12,911 INFO L87 Difference]: Start difference. First operand 11380 states and 15417 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 22:04:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:13,618 INFO L93 Difference]: Finished difference Result 27287 states and 35246 transitions. [2023-12-21 22:04:13,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:04:13,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 122 [2023-12-21 22:04:13,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:13,651 INFO L225 Difference]: With dead ends: 27287 [2023-12-21 22:04:13,651 INFO L226 Difference]: Without dead ends: 14752 [2023-12-21 22:04:13,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 120 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-21 22:04:13,670 INFO L413 NwaCegarLoop]: 4290 mSDtfsCounter, 150 mSDsluCounter, 4137 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 8427 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:13,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 8427 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:13,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14752 states. [2023-12-21 22:04:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14752 to 14752. [2023-12-21 22:04:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14752 states, 13088 states have (on average 1.3355745721271393) internal successors, (17480), 13247 states have internal predecessors, (17480), 834 states have call successors, (834), 613 states have call predecessors, (834), 828 states have return successors, (1266), 892 states have call predecessors, (1266), 832 states have call successors, (1266) [2023-12-21 22:04:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14752 states to 14752 states and 19580 transitions. [2023-12-21 22:04:14,163 INFO L78 Accepts]: Start accepts. Automaton has 14752 states and 19580 transitions. Word has length 122 [2023-12-21 22:04:14,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:14,163 INFO L495 AbstractCegarLoop]: Abstraction has 14752 states and 19580 transitions. [2023-12-21 22:04:14,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-12-21 22:04:14,163 INFO L276 IsEmpty]: Start isEmpty. Operand 14752 states and 19580 transitions. [2023-12-21 22:04:14,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-21 22:04:14,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:14,173 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:04:14,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-21 22:04:14,456 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-21 22:04:14,456 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:14,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:14,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1874354907, now seen corresponding path program 1 times [2023-12-21 22:04:14,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:14,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99085785] [2023-12-21 22:04:14,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:14,457 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-21 22:04:14,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:14,458 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-21 22:04:14,484 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-21 22:04:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:14,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:04:14,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:14,673 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-21 22:04:14,674 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:14,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:14,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99085785] [2023-12-21 22:04:14,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99085785] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:14,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:14,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 22:04:14,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482198353] [2023-12-21 22:04:14,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:14,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:04:14,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:14,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:04:14,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:04:14,675 INFO L87 Difference]: Start difference. First operand 14752 states and 19580 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-21 22:04:15,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:15,396 INFO L93 Difference]: Finished difference Result 30815 states and 39540 transitions. [2023-12-21 22:04:15,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:04:15,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 153 [2023-12-21 22:04:15,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:15,433 INFO L225 Difference]: With dead ends: 30815 [2023-12-21 22:04:15,433 INFO L226 Difference]: Without dead ends: 18194 [2023-12-21 22:04:15,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 151 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-21 22:04:15,454 INFO L413 NwaCegarLoop]: 4142 mSDtfsCounter, 4042 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4042 SdHoareTripleChecker+Valid, 4310 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:15,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4042 Valid, 4310 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:15,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18194 states. [2023-12-21 22:04:16,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18194 to 18158. [2023-12-21 22:04:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18158 states, 16030 states have (on average 1.3081721771678103) internal successors, (20970), 16221 states have internal predecessors, (20970), 1078 states have call successors, (1078), 785 states have call predecessors, (1078), 1048 states have return successors, (1614), 1152 states have call predecessors, (1614), 1076 states have call successors, (1614) [2023-12-21 22:04:16,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18158 states to 18158 states and 23662 transitions. [2023-12-21 22:04:16,158 INFO L78 Accepts]: Start accepts. Automaton has 18158 states and 23662 transitions. Word has length 153 [2023-12-21 22:04:16,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:16,158 INFO L495 AbstractCegarLoop]: Abstraction has 18158 states and 23662 transitions. [2023-12-21 22:04:16,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-12-21 22:04:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 18158 states and 23662 transitions. [2023-12-21 22:04:16,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-12-21 22:04:16,170 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:16,170 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:04:16,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-12-21 22:04:16,373 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-21 22:04:16,374 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:16,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:16,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1555146198, now seen corresponding path program 1 times [2023-12-21 22:04:16,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:16,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602552898] [2023-12-21 22:04:16,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:16,375 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-21 22:04:16,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:16,376 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-21 22:04:16,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 (23)] Waiting until timeout for monitored process [2023-12-21 22:04:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:16,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 22:04:16,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:16,535 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-12-21 22:04:16,535 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:16,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:16,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602552898] [2023-12-21 22:04:16,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602552898] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:16,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:16,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 22:04:16,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680336897] [2023-12-21 22:04:16,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:16,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:04:16,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:16,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:04:16,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:04:16,541 INFO L87 Difference]: Start difference. First operand 18158 states and 23662 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-21 22:04:17,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:17,349 INFO L93 Difference]: Finished difference Result 34400 states and 43723 transitions. [2023-12-21 22:04:17,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 22:04:17,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 174 [2023-12-21 22:04:17,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:17,375 INFO L225 Difference]: With dead ends: 34400 [2023-12-21 22:04:17,375 INFO L226 Difference]: Without dead ends: 18374 [2023-12-21 22:04:17,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 172 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-21 22:04:17,389 INFO L413 NwaCegarLoop]: 4106 mSDtfsCounter, 4180 mSDsluCounter, 4178 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4186 SdHoareTripleChecker+Valid, 8284 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:17,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4186 Valid, 8284 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 22:04:17,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18374 states. [2023-12-21 22:04:18,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18374 to 18374. [2023-12-21 22:04:18,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18374 states, 16214 states have (on average 1.2977673615394103) internal successors, (21042), 16421 states have internal predecessors, (21042), 1078 states have call successors, (1078), 785 states have call predecessors, (1078), 1080 states have return successors, (1482), 1168 states have call predecessors, (1482), 1076 states have call successors, (1482) [2023-12-21 22:04:18,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18374 states to 18374 states and 23602 transitions. [2023-12-21 22:04:18,112 INFO L78 Accepts]: Start accepts. Automaton has 18374 states and 23602 transitions. Word has length 174 [2023-12-21 22:04:18,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:18,113 INFO L495 AbstractCegarLoop]: Abstraction has 18374 states and 23602 transitions. [2023-12-21 22:04:18,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-21 22:04:18,113 INFO L276 IsEmpty]: Start isEmpty. Operand 18374 states and 23602 transitions. [2023-12-21 22:04:18,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-12-21 22:04:18,122 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:18,122 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:04:18,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-21 22:04:18,326 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-21 22:04:18,326 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:18,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:18,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1459612921, now seen corresponding path program 1 times [2023-12-21 22:04:18,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:18,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478228835] [2023-12-21 22:04:18,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:18,328 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-21 22:04:18,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:18,329 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-21 22:04:18,357 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-21 22:04:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:18,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:04:18,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-21 22:04:18,444 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:18,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:18,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478228835] [2023-12-21 22:04:18,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478228835] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:18,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:18,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:04:18,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653926596] [2023-12-21 22:04:18,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:18,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:04:18,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:18,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:04:18,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:04:18,445 INFO L87 Difference]: Start difference. First operand 18374 states and 23602 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-21 22:04:18,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:18,944 INFO L93 Difference]: Finished difference Result 28574 states and 36058 transitions. [2023-12-21 22:04:18,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:04:18,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 175 [2023-12-21 22:04:18,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:18,970 INFO L225 Difference]: With dead ends: 28574 [2023-12-21 22:04:18,970 INFO L226 Difference]: Without dead ends: 15718 [2023-12-21 22:04:18,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 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-21 22:04:18,988 INFO L413 NwaCegarLoop]: 4279 mSDtfsCounter, 155 mSDsluCounter, 4138 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 8417 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:18,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 8417 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:18,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15718 states. [2023-12-21 22:04:19,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15718 to 15714. [2023-12-21 22:04:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15714 states, 13902 states have (on average 1.3120414328873544) internal successors, (18240), 14083 states have internal predecessors, (18240), 894 states have call successors, (894), 649 states have call predecessors, (894), 916 states have return successors, (1258), 982 states have call predecessors, (1258), 892 states have call successors, (1258) [2023-12-21 22:04:19,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15714 states to 15714 states and 20392 transitions. [2023-12-21 22:04:19,626 INFO L78 Accepts]: Start accepts. Automaton has 15714 states and 20392 transitions. Word has length 175 [2023-12-21 22:04:19,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:19,626 INFO L495 AbstractCegarLoop]: Abstraction has 15714 states and 20392 transitions. [2023-12-21 22:04:19,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2023-12-21 22:04:19,626 INFO L276 IsEmpty]: Start isEmpty. Operand 15714 states and 20392 transitions. [2023-12-21 22:04:19,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-12-21 22:04:19,636 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:19,636 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 22:04:19,642 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-21 22:04:19,840 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-21 22:04:19,840 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:19,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:19,841 INFO L85 PathProgramCache]: Analyzing trace with hash -267114560, now seen corresponding path program 1 times [2023-12-21 22:04:19,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:19,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84691846] [2023-12-21 22:04:19,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:19,841 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-21 22:04:19,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:19,842 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-21 22:04:19,843 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-21 22:04:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:19,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:04:19,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-21 22:04:19,980 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:19,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:19,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84691846] [2023-12-21 22:04:19,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84691846] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:19,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:19,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:04:19,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69890904] [2023-12-21 22:04:19,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:19,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:04:19,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:19,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:04:19,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:04:19,982 INFO L87 Difference]: Start difference. First operand 15714 states and 20392 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-21 22:04:20,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:20,567 INFO L93 Difference]: Finished difference Result 27338 states and 34534 transitions. [2023-12-21 22:04:20,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:04:20,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 209 [2023-12-21 22:04:20,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:20,596 INFO L225 Difference]: With dead ends: 27338 [2023-12-21 22:04:20,596 INFO L226 Difference]: Without dead ends: 15718 [2023-12-21 22:04:20,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 207 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-21 22:04:20,614 INFO L413 NwaCegarLoop]: 4293 mSDtfsCounter, 152 mSDsluCounter, 4138 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 8431 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:20,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 8431 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:20,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15718 states. [2023-12-21 22:04:21,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15718 to 15714. [2023-12-21 22:04:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15714 states, 13902 states have (on average 1.3093080132355057) internal successors, (18202), 14083 states have internal predecessors, (18202), 894 states have call successors, (894), 649 states have call predecessors, (894), 916 states have return successors, (1240), 982 states have call predecessors, (1240), 892 states have call successors, (1240) [2023-12-21 22:04:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15714 states to 15714 states and 20336 transitions. [2023-12-21 22:04:21,164 INFO L78 Accepts]: Start accepts. Automaton has 15714 states and 20336 transitions. Word has length 209 [2023-12-21 22:04:21,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:21,165 INFO L495 AbstractCegarLoop]: Abstraction has 15714 states and 20336 transitions. [2023-12-21 22:04:21,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-21 22:04:21,165 INFO L276 IsEmpty]: Start isEmpty. Operand 15714 states and 20336 transitions. [2023-12-21 22:04:21,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2023-12-21 22:04:21,173 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:21,173 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:04:21,180 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-21 22:04:21,378 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-21 22:04:21,378 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:21,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:21,378 INFO L85 PathProgramCache]: Analyzing trace with hash -787292961, now seen corresponding path program 1 times [2023-12-21 22:04:21,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:21,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942795213] [2023-12-21 22:04:21,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:21,379 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-21 22:04:21,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:21,380 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-21 22:04:21,383 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-21 22:04:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:21,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 22:04:21,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-12-21 22:04:21,650 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:21,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:21,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942795213] [2023-12-21 22:04:21,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942795213] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:21,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:21,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:04:21,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078096796] [2023-12-21 22:04:21,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:21,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 22:04:21,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:21,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 22:04:21,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 22:04:21,652 INFO L87 Difference]: Start difference. First operand 15714 states and 20336 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 22:04:22,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:22,366 INFO L93 Difference]: Finished difference Result 29412 states and 37403 transitions. [2023-12-21 22:04:22,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 22:04:22,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 210 [2023-12-21 22:04:22,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:22,391 INFO L225 Difference]: With dead ends: 29412 [2023-12-21 22:04:22,391 INFO L226 Difference]: Without dead ends: 15828 [2023-12-21 22:04:22,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 207 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-21 22:04:22,407 INFO L413 NwaCegarLoop]: 4076 mSDtfsCounter, 4147 mSDsluCounter, 4039 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4155 SdHoareTripleChecker+Valid, 8115 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:22,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4155 Valid, 8115 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 22:04:22,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15828 states. [2023-12-21 22:04:23,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15828 to 15828. [2023-12-21 22:04:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15828 states, 14084 states have (on average 1.268389662027833) internal successors, (17864), 14203 states have internal predecessors, (17864), 894 states have call successors, (894), 689 states have call predecessors, (894), 848 states have return successors, (1100), 936 states have call predecessors, (1100), 892 states have call successors, (1100) [2023-12-21 22:04:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15828 states to 15828 states and 19858 transitions. [2023-12-21 22:04:23,064 INFO L78 Accepts]: Start accepts. Automaton has 15828 states and 19858 transitions. Word has length 210 [2023-12-21 22:04:23,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:23,064 INFO L495 AbstractCegarLoop]: Abstraction has 15828 states and 19858 transitions. [2023-12-21 22:04:23,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 22:04:23,065 INFO L276 IsEmpty]: Start isEmpty. Operand 15828 states and 19858 transitions. [2023-12-21 22:04:23,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2023-12-21 22:04:23,075 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:23,075 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:04:23,082 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-21 22:04:23,279 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-21 22:04:23,280 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:23,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:23,280 INFO L85 PathProgramCache]: Analyzing trace with hash 715948824, now seen corresponding path program 1 times [2023-12-21 22:04:23,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:23,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075702049] [2023-12-21 22:04:23,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:23,280 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-21 22:04:23,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:23,281 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-21 22:04:23,309 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-21 22:04:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:23,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:04:23,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:23,550 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-12-21 22:04:23,550 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:23,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:23,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075702049] [2023-12-21 22:04:23,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1075702049] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:23,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:23,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 22:04:23,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009160214] [2023-12-21 22:04:23,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:23,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:04:23,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:23,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:04:23,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:04:23,552 INFO L87 Difference]: Start difference. First operand 15828 states and 19858 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 22:04:24,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:24,234 INFO L93 Difference]: Finished difference Result 31389 states and 37874 transitions. [2023-12-21 22:04:24,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:04:24,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 240 [2023-12-21 22:04:24,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:24,258 INFO L225 Difference]: With dead ends: 31389 [2023-12-21 22:04:24,258 INFO L226 Difference]: Without dead ends: 17692 [2023-12-21 22:04:24,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 238 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-21 22:04:24,267 INFO L413 NwaCegarLoop]: 4175 mSDtfsCounter, 4008 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4008 SdHoareTripleChecker+Valid, 4340 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:24,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4008 Valid, 4340 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:24,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17692 states. [2023-12-21 22:04:24,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17692 to 17652. [2023-12-21 22:04:24,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17652 states, 15668 states have (on average 1.250446770487618) internal successors, (19592), 15795 states have internal predecessors, (19592), 1030 states have call successors, (1030), 785 states have call predecessors, (1030), 952 states have return successors, (1244), 1072 states have call predecessors, (1244), 1028 states have call successors, (1244) [2023-12-21 22:04:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17652 states to 17652 states and 21866 transitions. [2023-12-21 22:04:24,936 INFO L78 Accepts]: Start accepts. Automaton has 17652 states and 21866 transitions. Word has length 240 [2023-12-21 22:04:24,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:24,936 INFO L495 AbstractCegarLoop]: Abstraction has 17652 states and 21866 transitions. [2023-12-21 22:04:24,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-21 22:04:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 17652 states and 21866 transitions. [2023-12-21 22:04:24,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-12-21 22:04:24,948 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:24,948 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 22:04:24,955 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-21 22:04:25,153 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-21 22:04:25,153 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:25,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:25,153 INFO L85 PathProgramCache]: Analyzing trace with hash 55930708, now seen corresponding path program 1 times [2023-12-21 22:04:25,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:25,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452260215] [2023-12-21 22:04:25,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:25,154 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-21 22:04:25,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:25,156 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-21 22:04:25,159 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-21 22:04:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:25,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:04:25,297 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-21 22:04:25,334 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:25,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:25,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452260215] [2023-12-21 22:04:25,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452260215] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:25,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:25,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:04:25,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712386297] [2023-12-21 22:04:25,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:25,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:04:25,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:25,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:04:25,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:04:25,337 INFO L87 Difference]: Start difference. First operand 17652 states and 21866 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 22:04:25,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:25,721 INFO L93 Difference]: Finished difference Result 21924 states and 26755 transitions. [2023-12-21 22:04:25,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:04:25,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 243 [2023-12-21 22:04:25,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:25,729 INFO L225 Difference]: With dead ends: 21924 [2023-12-21 22:04:25,729 INFO L226 Difference]: Without dead ends: 5866 [2023-12-21 22:04:25,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 241 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-21 22:04:25,743 INFO L413 NwaCegarLoop]: 4220 mSDtfsCounter, 147 mSDsluCounter, 4098 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 8318 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:25,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 8318 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:25,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5866 states. [2023-12-21 22:04:25,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5866 to 5866. [2023-12-21 22:04:25,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5866 states, 5370 states have (on average 1.4029795158286777) internal successors, (7534), 5391 states have internal predecessors, (7534), 282 states have call successors, (282), 197 states have call predecessors, (282), 212 states have return successors, (296), 278 states have call predecessors, (296), 280 states have call successors, (296) [2023-12-21 22:04:25,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5866 states to 5866 states and 8112 transitions. [2023-12-21 22:04:25,951 INFO L78 Accepts]: Start accepts. Automaton has 5866 states and 8112 transitions. Word has length 243 [2023-12-21 22:04:25,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:25,951 INFO L495 AbstractCegarLoop]: Abstraction has 5866 states and 8112 transitions. [2023-12-21 22:04:25,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 22:04:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 5866 states and 8112 transitions. [2023-12-21 22:04:25,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-21 22:04:25,956 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:25,956 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:04:25,963 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-21 22:04:26,161 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-21 22:04:26,161 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:26,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:26,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1238197477, now seen corresponding path program 1 times [2023-12-21 22:04:26,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:26,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926991470] [2023-12-21 22:04:26,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:26,162 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-21 22:04:26,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:26,163 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-21 22:04:26,189 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-21 22:04:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:26,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:04:26,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-21 22:04:26,336 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:26,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:26,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926991470] [2023-12-21 22:04:26,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926991470] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:26,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:26,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:04:26,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936187622] [2023-12-21 22:04:26,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:26,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:04:26,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:26,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:04:26,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:04:26,337 INFO L87 Difference]: Start difference. First operand 5866 states and 8112 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 22:04:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:26,652 INFO L93 Difference]: Finished difference Result 10530 states and 13418 transitions. [2023-12-21 22:04:26,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:04:26,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 244 [2023-12-21 22:04:26,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:26,661 INFO L225 Difference]: With dead ends: 10530 [2023-12-21 22:04:26,661 INFO L226 Difference]: Without dead ends: 6352 [2023-12-21 22:04:26,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 242 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-21 22:04:26,666 INFO L413 NwaCegarLoop]: 4145 mSDtfsCounter, 4106 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4106 SdHoareTripleChecker+Valid, 4307 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:26,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4106 Valid, 4307 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:26,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6352 states. [2023-12-21 22:04:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6352 to 6312. [2023-12-21 22:04:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6312 states, 5756 states have (on average 1.379256428075052) internal successors, (7939), 5779 states have internal predecessors, (7939), 316 states have call successors, (316), 221 states have call predecessors, (316), 238 states have return successors, (342), 312 states have call predecessors, (342), 314 states have call successors, (342) [2023-12-21 22:04:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6312 states to 6312 states and 8597 transitions. [2023-12-21 22:04:26,916 INFO L78 Accepts]: Start accepts. Automaton has 6312 states and 8597 transitions. Word has length 244 [2023-12-21 22:04:26,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:26,916 INFO L495 AbstractCegarLoop]: Abstraction has 6312 states and 8597 transitions. [2023-12-21 22:04:26,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 22:04:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 6312 states and 8597 transitions. [2023-12-21 22:04:26,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-12-21 22:04:26,920 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:26,920 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 22:04:26,927 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-21 22:04:27,125 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-21 22:04:27,125 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:27,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:27,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1790888744, now seen corresponding path program 1 times [2023-12-21 22:04:27,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:27,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106130661] [2023-12-21 22:04:27,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:27,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 22:04:27,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:27,127 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-21 22:04:27,128 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-21 22:04:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:27,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:04:27,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:27,355 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-12-21 22:04:27,356 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:27,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:27,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106130661] [2023-12-21 22:04:27,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106130661] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:27,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:27,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:04:27,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045401278] [2023-12-21 22:04:27,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:27,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:04:27,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:27,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:04:27,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:04:27,357 INFO L87 Difference]: Start difference. First operand 6312 states and 8597 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 22:04:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:27,699 INFO L93 Difference]: Finished difference Result 11322 states and 14303 transitions. [2023-12-21 22:04:27,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:04:27,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 245 [2023-12-21 22:04:27,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:27,708 INFO L225 Difference]: With dead ends: 11322 [2023-12-21 22:04:27,709 INFO L226 Difference]: Without dead ends: 6738 [2023-12-21 22:04:27,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 243 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-21 22:04:27,714 INFO L413 NwaCegarLoop]: 4156 mSDtfsCounter, 4092 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4092 SdHoareTripleChecker+Valid, 4318 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:27,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4092 Valid, 4318 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:27,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6738 states. [2023-12-21 22:04:28,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6738 to 6674. [2023-12-21 22:04:28,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6674 states, 6066 states have (on average 1.3608638311902408) internal successors, (8255), 6091 states have internal predecessors, (8255), 346 states have call successors, (346), 241 states have call predecessors, (346), 260 states have return successors, (386), 342 states have call predecessors, (386), 344 states have call successors, (386) [2023-12-21 22:04:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6674 states to 6674 states and 8987 transitions. [2023-12-21 22:04:28,054 INFO L78 Accepts]: Start accepts. Automaton has 6674 states and 8987 transitions. Word has length 245 [2023-12-21 22:04:28,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:28,054 INFO L495 AbstractCegarLoop]: Abstraction has 6674 states and 8987 transitions. [2023-12-21 22:04:28,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 22:04:28,055 INFO L276 IsEmpty]: Start isEmpty. Operand 6674 states and 8987 transitions. [2023-12-21 22:04:28,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2023-12-21 22:04:28,059 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:28,059 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 22:04:28,066 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-21 22:04:28,260 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-21 22:04:28,260 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:28,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:28,261 INFO L85 PathProgramCache]: Analyzing trace with hash 54719686, now seen corresponding path program 1 times [2023-12-21 22:04:28,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:28,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375294756] [2023-12-21 22:04:28,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:28,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-21 22:04:28,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:28,262 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-21 22:04:28,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-21 22:04:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:28,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:04:28,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-21 22:04:28,431 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:28,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:28,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [375294756] [2023-12-21 22:04:28,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [375294756] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:28,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:28,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:04:28,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907600388] [2023-12-21 22:04:28,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:28,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:04:28,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:28,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:04:28,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:04:28,433 INFO L87 Difference]: Start difference. First operand 6674 states and 8987 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-21 22:04:28,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:28,708 INFO L93 Difference]: Finished difference Result 9450 states and 12153 transitions. [2023-12-21 22:04:28,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:04:28,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 247 [2023-12-21 22:04:28,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:28,718 INFO L225 Difference]: With dead ends: 9450 [2023-12-21 22:04:28,718 INFO L226 Difference]: Without dead ends: 6676 [2023-12-21 22:04:28,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 245 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-21 22:04:28,722 INFO L413 NwaCegarLoop]: 4225 mSDtfsCounter, 135 mSDsluCounter, 4088 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 8313 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:28,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 8313 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:28,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6676 states. [2023-12-21 22:04:28,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6676 to 6674. [2023-12-21 22:04:28,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6674 states, 6066 states have (on average 1.3549291130893504) internal successors, (8219), 6091 states have internal predecessors, (8219), 346 states have call successors, (346), 241 states have call predecessors, (346), 260 states have return successors, (386), 342 states have call predecessors, (386), 344 states have call successors, (386) [2023-12-21 22:04:28,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6674 states to 6674 states and 8951 transitions. [2023-12-21 22:04:28,975 INFO L78 Accepts]: Start accepts. Automaton has 6674 states and 8951 transitions. Word has length 247 [2023-12-21 22:04:28,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:28,975 INFO L495 AbstractCegarLoop]: Abstraction has 6674 states and 8951 transitions. [2023-12-21 22:04:28,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-21 22:04:28,976 INFO L276 IsEmpty]: Start isEmpty. Operand 6674 states and 8951 transitions. [2023-12-21 22:04:28,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2023-12-21 22:04:28,980 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:28,980 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 22:04:28,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-12-21 22:04:29,185 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-21 22:04:29,185 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:29,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:29,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1850332348, now seen corresponding path program 1 times [2023-12-21 22:04:29,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:29,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642447520] [2023-12-21 22:04:29,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:29,186 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-21 22:04:29,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:29,187 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-21 22:04:29,188 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-21 22:04:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:29,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:04:29,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:29,359 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2023-12-21 22:04:29,360 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:29,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:29,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642447520] [2023-12-21 22:04:29,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642447520] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:29,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:29,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:04:29,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803765450] [2023-12-21 22:04:29,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:29,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:04:29,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:29,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:04:29,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:04:29,361 INFO L87 Difference]: Start difference. First operand 6674 states and 8951 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 22:04:29,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:29,678 INFO L93 Difference]: Finished difference Result 10408 states and 13139 transitions. [2023-12-21 22:04:29,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:04:29,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 249 [2023-12-21 22:04:29,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:29,686 INFO L225 Difference]: With dead ends: 10408 [2023-12-21 22:04:29,686 INFO L226 Difference]: Without dead ends: 6674 [2023-12-21 22:04:29,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 247 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-21 22:04:29,690 INFO L413 NwaCegarLoop]: 4200 mSDtfsCounter, 141 mSDsluCounter, 4075 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 8275 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:29,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 8275 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:29,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2023-12-21 22:04:29,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 6674. [2023-12-21 22:04:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6674 states, 6066 states have (on average 1.3480052753049785) internal successors, (8177), 6091 states have internal predecessors, (8177), 346 states have call successors, (346), 241 states have call predecessors, (346), 260 states have return successors, (386), 342 states have call predecessors, (386), 344 states have call successors, (386) [2023-12-21 22:04:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6674 states to 6674 states and 8909 transitions. [2023-12-21 22:04:30,002 INFO L78 Accepts]: Start accepts. Automaton has 6674 states and 8909 transitions. Word has length 249 [2023-12-21 22:04:30,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:30,002 INFO L495 AbstractCegarLoop]: Abstraction has 6674 states and 8909 transitions. [2023-12-21 22:04:30,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 22:04:30,003 INFO L276 IsEmpty]: Start isEmpty. Operand 6674 states and 8909 transitions. [2023-12-21 22:04:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2023-12-21 22:04:30,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:30,007 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 22:04:30,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 (32)] Forceful destruction successful, exit code 0 [2023-12-21 22:04:30,212 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-21 22:04:30,212 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:30,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:30,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1216795212, now seen corresponding path program 1 times [2023-12-21 22:04:30,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:30,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140812832] [2023-12-21 22:04:30,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:30,213 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-21 22:04:30,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:30,229 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-21 22:04:30,256 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-21 22:04:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:30,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:04:30,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:30,377 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2023-12-21 22:04:30,377 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:30,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:30,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140812832] [2023-12-21 22:04:30,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140812832] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:30,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:30,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:04:30,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710679104] [2023-12-21 22:04:30,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:30,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:04:30,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:30,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:04:30,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:04:30,380 INFO L87 Difference]: Start difference. First operand 6674 states and 8909 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 22:04:30,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:30,620 INFO L93 Difference]: Finished difference Result 7908 states and 10274 transitions. [2023-12-21 22:04:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:04:30,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 252 [2023-12-21 22:04:30,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:30,628 INFO L225 Difference]: With dead ends: 7908 [2023-12-21 22:04:30,628 INFO L226 Difference]: Without dead ends: 6056 [2023-12-21 22:04:30,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 250 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-21 22:04:30,631 INFO L413 NwaCegarLoop]: 4227 mSDtfsCounter, 161 mSDsluCounter, 4091 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 8318 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:30,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 8318 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2023-12-21 22:04:30,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 6056. [2023-12-21 22:04:30,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6056 states, 5534 states have (on average 1.372967112396097) internal successors, (7598), 5556 states have internal predecessors, (7598), 297 states have call successors, (297), 207 states have call predecessors, (297), 223 states have return successors, (315), 293 states have call predecessors, (315), 295 states have call successors, (315) [2023-12-21 22:04:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 8210 transitions. [2023-12-21 22:04:30,855 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 8210 transitions. Word has length 252 [2023-12-21 22:04:30,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:30,855 INFO L495 AbstractCegarLoop]: Abstraction has 6056 states and 8210 transitions. [2023-12-21 22:04:30,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 3 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-21 22:04:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 8210 transitions. [2023-12-21 22:04:30,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2023-12-21 22:04:30,859 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:30,859 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 22:04:30,864 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-21 22:04:31,062 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-21 22:04:31,062 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:31,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1420919488, now seen corresponding path program 2 times [2023-12-21 22:04:31,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:31,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323311714] [2023-12-21 22:04:31,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 22:04:31,063 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-21 22:04:31,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:31,064 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-21 22:04:31,065 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-21 22:04:31,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 22:04:31,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 22:04:31,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:04:31,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:31,210 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2023-12-21 22:04:31,210 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:31,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:31,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323311714] [2023-12-21 22:04:31,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323311714] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:31,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:31,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:04:31,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344139702] [2023-12-21 22:04:31,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:31,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:04:31,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:31,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:04:31,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:04:31,211 INFO L87 Difference]: Start difference. First operand 6056 states and 8210 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-21 22:04:31,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:31,470 INFO L93 Difference]: Finished difference Result 7100 states and 9340 transitions. [2023-12-21 22:04:31,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:04:31,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 254 [2023-12-21 22:04:31,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:31,477 INFO L225 Difference]: With dead ends: 7100 [2023-12-21 22:04:31,477 INFO L226 Difference]: Without dead ends: 5866 [2023-12-21 22:04:31,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 252 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-21 22:04:31,483 INFO L413 NwaCegarLoop]: 4262 mSDtfsCounter, 156 mSDsluCounter, 4099 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 8361 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:31,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 8361 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:31,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5866 states. [2023-12-21 22:04:31,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5866 to 5866. [2023-12-21 22:04:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5866 states, 5370 states have (on average 1.3810055865921789) internal successors, (7416), 5391 states have internal predecessors, (7416), 282 states have call successors, (282), 197 states have call predecessors, (282), 212 states have return successors, (296), 278 states have call predecessors, (296), 280 states have call successors, (296) [2023-12-21 22:04:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5866 states to 5866 states and 7994 transitions. [2023-12-21 22:04:31,699 INFO L78 Accepts]: Start accepts. Automaton has 5866 states and 7994 transitions. Word has length 254 [2023-12-21 22:04:31,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:31,700 INFO L495 AbstractCegarLoop]: Abstraction has 5866 states and 7994 transitions. [2023-12-21 22:04:31,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-21 22:04:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 5866 states and 7994 transitions. [2023-12-21 22:04:31,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2023-12-21 22:04:31,703 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:31,704 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 22:04:31,712 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-21 22:04:31,908 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-21 22:04:31,909 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:31,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:31,909 INFO L85 PathProgramCache]: Analyzing trace with hash -359844910, now seen corresponding path program 3 times [2023-12-21 22:04:31,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:31,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791051880] [2023-12-21 22:04:31,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 22:04:31,910 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-21 22:04:31,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:31,911 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-21 22:04:31,938 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-21 22:04:32,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-21 22:04:32,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 22:04:32,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 22:04:32,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:32,326 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 124 proven. 159 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 22:04:32,327 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 22:04:32,444 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2023-12-21 22:04:32,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:32,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791051880] [2023-12-21 22:04:32,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791051880] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 22:04:32,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 22:04:32,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2023-12-21 22:04:32,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309240091] [2023-12-21 22:04:32,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:32,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 22:04:32,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:32,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 22:04:32,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 22:04:32,446 INFO L87 Difference]: Start difference. First operand 5866 states and 7994 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-21 22:04:33,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:33,130 INFO L93 Difference]: Finished difference Result 5868 states and 7995 transitions. [2023-12-21 22:04:33,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 22:04:33,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 255 [2023-12-21 22:04:33,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:33,141 INFO L225 Difference]: With dead ends: 5868 [2023-12-21 22:04:33,141 INFO L226 Difference]: Without dead ends: 5865 [2023-12-21 22:04:33,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 22:04:33,144 INFO L413 NwaCegarLoop]: 4429 mSDtfsCounter, 4434 mSDsluCounter, 13020 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4434 SdHoareTripleChecker+Valid, 17449 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:33,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4434 Valid, 17449 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 22:04:33,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5865 states. [2023-12-21 22:04:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5865 to 5865. [2023-12-21 22:04:33,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5865 states, 5370 states have (on average 1.380633147113594) internal successors, (7414), 5390 states have internal predecessors, (7414), 281 states have call successors, (281), 197 states have call predecessors, (281), 212 states have return successors, (296), 278 states have call predecessors, (296), 280 states have call successors, (296) [2023-12-21 22:04:33,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5865 states to 5865 states and 7991 transitions. [2023-12-21 22:04:33,475 INFO L78 Accepts]: Start accepts. Automaton has 5865 states and 7991 transitions. Word has length 255 [2023-12-21 22:04:33,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:33,478 INFO L495 AbstractCegarLoop]: Abstraction has 5865 states and 7991 transitions. [2023-12-21 22:04:33,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-21 22:04:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 5865 states and 7991 transitions. [2023-12-21 22:04:33,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2023-12-21 22:04:33,489 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:33,490 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 22:04:33,497 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-21 22:04:33,695 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-21 22:04:33,695 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:33,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2141762810, now seen corresponding path program 1 times [2023-12-21 22:04:33,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:33,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759724014] [2023-12-21 22:04:33,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:33,696 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-21 22:04:33,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:33,697 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-21 22:04:33,698 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-21 22:04:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 22:04:33,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 22:04:33,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 22:04:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2023-12-21 22:04:33,825 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 22:04:33,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 22:04:33,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759724014] [2023-12-21 22:04:33,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759724014] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 22:04:33,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 22:04:33,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 22:04:33,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274689590] [2023-12-21 22:04:33,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 22:04:33,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 22:04:33,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 22:04:33,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 22:04:33,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 22:04:33,827 INFO L87 Difference]: Start difference. First operand 5865 states and 7991 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-21 22:04:34,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 22:04:34,078 INFO L93 Difference]: Finished difference Result 6918 states and 9121 transitions. [2023-12-21 22:04:34,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 22:04:34,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 259 [2023-12-21 22:04:34,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 22:04:34,102 INFO L225 Difference]: With dead ends: 6918 [2023-12-21 22:04:34,103 INFO L226 Difference]: Without dead ends: 5875 [2023-12-21 22:04:34,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 257 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-21 22:04:34,105 INFO L413 NwaCegarLoop]: 4137 mSDtfsCounter, 3 mSDsluCounter, 4123 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8260 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 22:04:34,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8260 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 22:04:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5875 states. [2023-12-21 22:04:34,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5875 to 5867. [2023-12-21 22:04:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5867 states, 5372 states have (on average 1.3804914370811616) internal successors, (7416), 5392 states have internal predecessors, (7416), 281 states have call successors, (281), 197 states have call predecessors, (281), 212 states have return successors, (296), 278 states have call predecessors, (296), 280 states have call successors, (296) [2023-12-21 22:04:34,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5867 states to 5867 states and 7993 transitions. [2023-12-21 22:04:34,353 INFO L78 Accepts]: Start accepts. Automaton has 5867 states and 7993 transitions. Word has length 259 [2023-12-21 22:04:34,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 22:04:34,353 INFO L495 AbstractCegarLoop]: Abstraction has 5867 states and 7993 transitions. [2023-12-21 22:04:34,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-12-21 22:04:34,353 INFO L276 IsEmpty]: Start isEmpty. Operand 5867 states and 7993 transitions. [2023-12-21 22:04:34,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2023-12-21 22:04:34,357 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 22:04:34,357 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 22:04:34,362 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-21 22:04:34,561 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-21 22:04:34,562 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 22:04:34,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 22:04:34,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1095694939, now seen corresponding path program 1 times [2023-12-21 22:04:34,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 22:04:34,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258938399] [2023-12-21 22:04:34,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 22:04:34,563 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-21 22:04:34,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 22:04:34,564 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-21 22:04:34,565 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-21 22:04:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 22:04:34,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 22:04:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 22:04:34,898 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-21 22:04:34,898 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 22:04:34,899 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-21 22:04:34,901 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-21 22:04:34,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2023-12-21 22:04:35,108 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-21 22:04:35,111 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 22:04:35,114 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 22:04:35,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 10:04:35 BoogieIcfgContainer [2023-12-21 22:04:35,260 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 22:04:35,260 INFO L158 Benchmark]: Toolchain (without parser) took 47255.28ms. Allocated memory was 328.2MB in the beginning and 2.7GB in the end (delta: 2.4GB). Free memory was 256.6MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-12-21 22:04:35,260 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 197.1MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 22:04:35,260 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2225.33ms. Allocated memory was 328.2MB in the beginning and 542.1MB in the end (delta: 213.9MB). Free memory was 256.3MB in the beginning and 381.5MB in the end (delta: -125.2MB). Peak memory consumption was 105.2MB. Max. memory is 8.0GB. [2023-12-21 22:04:35,260 INFO L158 Benchmark]: Boogie Procedure Inliner took 395.13ms. Allocated memory is still 542.1MB. Free memory was 381.5MB in the beginning and 390.4MB in the end (delta: -8.9MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. [2023-12-21 22:04:35,260 INFO L158 Benchmark]: Boogie Preprocessor took 549.02ms. Allocated memory is still 542.1MB. Free memory was 390.4MB in the beginning and 373.6MB in the end (delta: 16.8MB). Peak memory consumption was 68.7MB. Max. memory is 8.0GB. [2023-12-21 22:04:35,261 INFO L158 Benchmark]: RCFGBuilder took 7476.28ms. Allocated memory was 542.1MB in the beginning and 1.8GB in the end (delta: 1.2GB). Free memory was 373.6MB in the beginning and 1.6GB in the end (delta: -1.2GB). Peak memory consumption was 613.4MB. Max. memory is 8.0GB. [2023-12-21 22:04:35,261 INFO L158 Benchmark]: TraceAbstraction took 36603.51ms. Allocated memory was 1.8GB in the beginning and 2.7GB in the end (delta: 946.9MB). Free memory was 1.6GB in the beginning and 1.4GB in the end (delta: 164.3MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2023-12-21 22:04:35,261 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 197.1MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2225.33ms. Allocated memory was 328.2MB in the beginning and 542.1MB in the end (delta: 213.9MB). Free memory was 256.3MB in the beginning and 381.5MB in the end (delta: -125.2MB). Peak memory consumption was 105.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 395.13ms. Allocated memory is still 542.1MB. Free memory was 381.5MB in the beginning and 390.4MB in the end (delta: -8.9MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 549.02ms. Allocated memory is still 542.1MB. Free memory was 390.4MB in the beginning and 373.6MB in the end (delta: 16.8MB). Peak memory consumption was 68.7MB. Max. memory is 8.0GB. * RCFGBuilder took 7476.28ms. Allocated memory was 542.1MB in the beginning and 1.8GB in the end (delta: 1.2GB). Free memory was 373.6MB in the beginning and 1.6GB in the end (delta: -1.2GB). Peak memory consumption was 613.4MB. Max. memory is 8.0GB. * TraceAbstraction took 36603.51ms. Allocated memory was 1.8GB in the beginning and 2.7GB in the end (delta: 946.9MB). Free memory was 1.6GB in the beginning and 1.4GB in the end (delta: 164.3MB). Peak memory consumption was 1.1GB. 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: 11173]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int d= 4; [L34] int c= 3; [L35] int e= 5; [L36] int a= 1; [L37] int f= 6; [L38] int b= 2; [L40] int a9 = 18; [L41] int a27 = 1; [L42] int a2 = 10; [L43] int a16 = 1; [L44] int a15 = 1; [L45] int a12 = 4; [L46] int a25 = 1; [L47] int a20 = 5; [L11177] int m_pc = 0; [L11178] int t1_pc = 0; [L11179] int t2_pc = 0; [L11180] int t3_pc = 0; [L11181] int m_st ; [L11182] int t1_st ; [L11183] int t2_st ; [L11184] int t3_st ; [L11185] int m_i ; [L11186] int t1_i ; [L11187] int t2_i ; [L11188] int t3_i ; [L11189] int M_E = 2; [L11190] int T1_E = 2; [L11191] int T2_E = 2; [L11192] int T3_E = 2; [L11193] int E_M = 2; [L11194] int E_1 = 2; [L11195] int E_2 = 2; [L11196] int E_3 = 2; [L11202] int token ; [L11204] int local ; [L11901] COND FALSE !(__VERIFIER_nondet_int()) [L11904] CALL main2() [L11888] int __retres1 ; [L11892] CALL init_model() [L11801] m_i = 1 [L11802] t1_i = 1 [L11803] t2_i = 1 [L11804] t3_i = 1 [L11892] RET init_model() [L11893] CALL start_simulation() [L11829] int kernel_st ; [L11830] int tmp ; [L11831] int tmp___0 ; [L11835] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11836] FCALL update_channels() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11837] CALL init_threads() [L11457] COND TRUE m_i == 1 [L11458] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11462] COND TRUE t1_i == 1 [L11463] t1_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11467] COND TRUE t2_i == 1 [L11468] t2_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11472] COND TRUE t3_i == 1 [L11473] t3_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11837] RET init_threads() [L11838] CALL fire_delta_events() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11594] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11599] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11604] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11609] COND FALSE !(T3_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11614] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11619] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11624] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11629] COND FALSE !(E_3 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11838] RET fire_delta_events() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11839] CALL activate_threads() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11687] int tmp ; [L11688] int tmp___0 ; [L11689] int tmp___1 ; [L11690] int tmp___2 ; [L11694] CALL, EXPR is_master_triggered() [L11370] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11373] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11383] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11385] return (__retres1); [L11694] RET, EXPR is_master_triggered() [L11694] tmp = is_master_triggered() [L11696] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=0, token=0] [L11702] CALL, EXPR is_transmit1_triggered() [L11389] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11392] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11402] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11404] return (__retres1); [L11702] RET, EXPR is_transmit1_triggered() [L11702] tmp___0 = is_transmit1_triggered() [L11704] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, token=0] [L11710] CALL, EXPR is_transmit2_triggered() [L11408] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11411] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11421] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11423] return (__retres1); [L11710] RET, EXPR is_transmit2_triggered() [L11710] tmp___1 = is_transmit2_triggered() [L11712] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L11718] CALL, EXPR is_transmit3_triggered() [L11427] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11430] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11440] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11442] return (__retres1); [L11718] RET, EXPR is_transmit3_triggered() [L11718] tmp___2 = is_transmit3_triggered() [L11720] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=0, token=0] [L11839] RET activate_threads() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11840] CALL reset_delta_events() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11642] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11647] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11652] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11657] COND FALSE !(T3_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11662] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11667] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11672] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11677] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11840] RET reset_delta_events() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11843] COND TRUE 1 [L11846] kernel_st = 1 [L11847] CALL eval() [L11513] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11517] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11520] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11482] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11485] COND TRUE m_st == 0 [L11486] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11508] return (__retres1); [L11520] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11520] tmp = exists_runnable_thread() [L11522] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L11527] COND TRUE m_st == 0 [L11528] int tmp_ndt_1; [L11529] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L11530] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0, token=0] [L11527-L11538] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L11541] COND TRUE t1_st == 0 [L11542] int tmp_ndt_2; [L11543] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L11544] COND TRUE, EXPR \read(tmp_ndt_2) [L11546] EXPR t1_st = 1 [L11547] CALL, EXPR transmit1() [L11265] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11276] COND TRUE 1 [L11278] t1_pc = 1 [L11279] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11547] RET, EXPR transmit1() [L11541-L11552] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=0, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L11555] COND TRUE t2_st == 0 [L11556] int tmp_ndt_3; [L11557] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L11558] COND TRUE, EXPR \read(tmp_ndt_3) [L11560] EXPR t2_st = 1 [L11561] CALL, EXPR transmit2() [L11301] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=0, t2_st=1, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11312] COND TRUE 1 [L11314] t2_pc = 1 [L11315] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L11561] RET, EXPR transmit2() [L11555-L11566] { int tmp_ndt_3; tmp_ndt_3 = __VERIFIER_nondet_int(); if (tmp_ndt_3) { { t2_st = 1; transmit2(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L11569] COND TRUE t3_st == 0 [L11570] int tmp_ndt_4; [L11571] EXPR tmp_ndt_4 = __VERIFIER_nondet_int() [L11572] COND TRUE, EXPR \read(tmp_ndt_4) [L11574] EXPR t3_st = 1 [L11575] CALL, EXPR transmit3() [L11337] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L11348] COND TRUE 1 [L11350] t3_pc = 1 [L11351] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11575] RET, EXPR transmit3() [L11569-L11580] { int tmp_ndt_4; tmp_ndt_4 = __VERIFIER_nondet_int(); if (tmp_ndt_4) { { t3_st = 1; transmit3(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=0] [L11517] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=0] [L11520] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11482] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11485] COND TRUE m_st == 0 [L11486] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11508] return (__retres1); [L11520] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=0] [L11520] tmp = exists_runnable_thread() [L11522] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=0] [L11527] COND TRUE m_st == 0 [L11528] int tmp_ndt_1; [L11529] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L11530] COND TRUE, EXPR \read(tmp_ndt_1) [L11532] EXPR m_st = 1 [L11533] CALL, EXPR master() [L11207] int tmp_var = __VERIFIER_nondet_int(); [L11209] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11220] COND TRUE 1 [L11223] token = __VERIFIER_nondet_int() [L11224] local = token [L11225] E_1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11226] CALL immediate_notify() VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11734] CALL activate_threads() VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11687] int tmp ; [L11688] int tmp___0 ; [L11689] int tmp___1 ; [L11690] int tmp___2 ; [L11694] CALL, EXPR is_master_triggered() [L11370] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11373] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11383] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11385] return (__retres1); [L11694] RET, EXPR is_master_triggered() [L11694] tmp = is_master_triggered() [L11696] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=0] [L11702] CALL, EXPR is_transmit1_triggered() [L11389] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11392] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11393] COND TRUE E_1 == 1 [L11394] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11404] return (__retres1); [L11702] RET, EXPR is_transmit1_triggered() [L11702] tmp___0 = is_transmit1_triggered() [L11704] COND TRUE \read(tmp___0) [L11705] t1_st = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, token=0] [L11710] CALL, EXPR is_transmit2_triggered() [L11408] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11411] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11412] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11421] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11423] return (__retres1); [L11710] RET, EXPR is_transmit2_triggered() [L11710] tmp___1 = is_transmit2_triggered() [L11712] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L11718] CALL, EXPR is_transmit3_triggered() [L11427] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11430] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11431] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11440] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11442] return (__retres1); [L11718] RET, EXPR is_transmit3_triggered() [L11718] tmp___2 = is_transmit3_triggered() [L11720] COND FALSE !(\read(tmp___2)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=1, tmp___1=0, tmp___2=0, token=0] [L11734] RET activate_threads() VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11226] RET immediate_notify() VAL [E_1=1, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11227] E_1 = 2 [L11228] m_pc = 1 [L11229] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11533] RET, EXPR master() [L11527-L11538] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=0] [L11541] COND TRUE t1_st == 0 [L11542] int tmp_ndt_2; [L11543] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L11544] COND TRUE, EXPR \read(tmp_ndt_2) [L11546] EXPR t1_st = 1 [L11547] CALL, EXPR transmit1() [L11265] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L11268] COND TRUE t1_pc == 1 [L11284] token += 1 [L11285] E_2 = 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11286] CALL immediate_notify() VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11734] CALL activate_threads() VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11687] int tmp ; [L11688] int tmp___0 ; [L11689] int tmp___1 ; [L11690] int tmp___2 ; [L11694] CALL, EXPR is_master_triggered() [L11370] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11373] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11374] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11383] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11385] return (__retres1); [L11694] RET, EXPR is_master_triggered() [L11694] tmp = is_master_triggered() [L11696] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=1] [L11702] CALL, EXPR is_transmit1_triggered() [L11389] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11392] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11393] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11402] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11404] return (__retres1); [L11702] RET, EXPR is_transmit1_triggered() [L11702] tmp___0 = is_transmit1_triggered() [L11704] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=1] [L11710] CALL, EXPR is_transmit2_triggered() [L11408] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11411] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11412] COND TRUE E_2 == 1 [L11413] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11423] return (__retres1); [L11710] RET, EXPR is_transmit2_triggered() [L11710] tmp___1 = is_transmit2_triggered() [L11712] COND TRUE \read(tmp___1) [L11713] t2_st = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, token=1] [L11718] CALL, EXPR is_transmit3_triggered() [L11427] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11430] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11431] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11440] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11442] return (__retres1); [L11718] RET, EXPR is_transmit3_triggered() [L11718] tmp___2 = is_transmit3_triggered() [L11720] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=1, tmp___2=0, token=1] [L11734] RET activate_threads() VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11286] RET immediate_notify() VAL [E_1=2, E_2=1, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11287] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11276] COND TRUE 1 [L11278] t1_pc = 1 [L11279] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11547] RET, EXPR transmit1() [L11541-L11552] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=0, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=1] [L11555] COND TRUE t2_st == 0 [L11556] int tmp_ndt_3; [L11557] EXPR tmp_ndt_3 = __VERIFIER_nondet_int() [L11558] COND TRUE, EXPR \read(tmp_ndt_3) [L11560] EXPR t2_st = 1 [L11561] CALL, EXPR transmit2() [L11301] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=1] [L11304] COND TRUE t2_pc == 1 [L11320] token += 1 [L11321] E_3 = 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11322] CALL immediate_notify() VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11734] CALL activate_threads() VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11687] int tmp ; [L11688] int tmp___0 ; [L11689] int tmp___1 ; [L11690] int tmp___2 ; [L11694] CALL, EXPR is_master_triggered() [L11370] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11373] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11374] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11383] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11385] return (__retres1); [L11694] RET, EXPR is_master_triggered() [L11694] tmp = is_master_triggered() [L11696] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, tmp=0, token=2] [L11702] CALL, EXPR is_transmit1_triggered() [L11389] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11392] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11393] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11402] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11404] return (__retres1); [L11702] RET, EXPR is_transmit1_triggered() [L11702] tmp___0 = is_transmit1_triggered() [L11704] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, token=2] [L11710] CALL, EXPR is_transmit2_triggered() [L11408] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11411] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11412] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11421] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11423] return (__retres1); [L11710] RET, EXPR is_transmit2_triggered() [L11710] tmp___1 = is_transmit2_triggered() [L11712] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, tmp=0, tmp___0=0, tmp___1=0, token=2] [L11718] CALL, EXPR is_transmit3_triggered() [L11427] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11430] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11431] COND TRUE E_3 == 1 [L11432] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=2, token=2] [L11442] return (__retres1); [L11718] RET, EXPR is_transmit3_triggered() [L11718] tmp___2 = is_transmit3_triggered() [L11720] COND TRUE \read(tmp___2) [L11721] t3_st = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=0, tmp=0, tmp___0=0, tmp___1=0, tmp___2=1, token=2] [L11734] RET activate_threads() VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=0, token=2] [L11322] RET immediate_notify() VAL [E_1=2, E_2=2, E_3=1, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=0, token=2] [L11323] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=1, t3_i=1, t3_pc=1, t3_st=0, token=2] [L11312] COND TRUE 1 [L11314] t2_pc = 1 [L11315] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L11561] RET, EXPR transmit2() [L11555-L11566] { int tmp_ndt_3; tmp_ndt_3 = __VERIFIER_nondet_int(); if (tmp_ndt_3) { { t2_st = 1; transmit2(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=0, tmp=1, token=2] [L11569] COND TRUE t3_st == 0 [L11570] int tmp_ndt_4; [L11571] EXPR tmp_ndt_4 = __VERIFIER_nondet_int() [L11572] COND TRUE, EXPR \read(tmp_ndt_4) [L11574] EXPR t3_st = 1 [L11575] CALL, EXPR transmit3() [L11337] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L11340] COND TRUE t3_pc == 1 [L11356] token += 1 [L11357] E_M = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11358] CALL immediate_notify() VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11734] CALL activate_threads() VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11687] int tmp ; [L11688] int tmp___0 ; [L11689] int tmp___1 ; [L11690] int tmp___2 ; [L11694] CALL, EXPR is_master_triggered() [L11370] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11373] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11374] COND TRUE E_M == 1 [L11375] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11385] return (__retres1); [L11694] RET, EXPR is_master_triggered() [L11694] tmp = is_master_triggered() [L11696] COND TRUE \read(tmp) [L11697] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, token=3] [L11702] CALL, EXPR is_transmit1_triggered() [L11389] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11392] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11393] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11402] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11404] return (__retres1); [L11702] RET, EXPR is_transmit1_triggered() [L11702] tmp___0 = is_transmit1_triggered() [L11704] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, token=3] [L11710] CALL, EXPR is_transmit2_triggered() [L11408] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11411] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11412] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11421] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11423] return (__retres1); [L11710] RET, EXPR is_transmit2_triggered() [L11710] tmp___1 = is_transmit2_triggered() [L11712] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, token=3] [L11718] CALL, EXPR is_transmit3_triggered() [L11427] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11430] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11431] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11440] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11442] return (__retres1); [L11718] RET, EXPR is_transmit3_triggered() [L11718] tmp___2 = is_transmit3_triggered() [L11720] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, token=3] [L11734] RET activate_threads() VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, \old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11358] RET immediate_notify() VAL [E_1=2, E_2=2, E_3=2, E_M=1, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11359] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L11348] COND TRUE 1 [L11350] t3_pc = 1 [L11351] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L11575] RET, EXPR transmit3() [L11569-L11580] { int tmp_ndt_4; tmp_ndt_4 = __VERIFIER_nondet_int(); if (tmp_ndt_4) { { t3_st = 1; transmit3(); } } else { } } VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=3] [L11517] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=3] [L11520] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L11482] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L11485] COND TRUE m_st == 0 [L11486] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, __retres1=1, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L11508] return (__retres1); [L11520] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=3] [L11520] tmp = exists_runnable_thread() [L11522] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=0, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, token=3] [L11527] COND TRUE m_st == 0 [L11528] int tmp_ndt_1; [L11529] tmp_ndt_1 = __VERIFIER_nondet_int() [L11530] COND TRUE \read(tmp_ndt_1) [L11532] m_st = 1 [L11533] CALL master() [L11207] int tmp_var = __VERIFIER_nondet_int(); [L11209] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L11212] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L11234] COND FALSE !(token != local + 3) VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L11239] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L11240] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L11245] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L11246] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L11247] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L11248] CALL error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L11173] reach_error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, M_E=2, T1_E=2, T2_E=2, T3_E=2, a12=4, a15=1, a16=1, a20=5, a25=1, a27=1, a2=10, a9=18, a=1, b=2, c=3, d=4, e=5, f=6, local=0, m_i=1, m_pc=1, m_st=1, t1_i=1, t1_pc=1, t1_st=2, t2_i=1, t2_pc=1, t2_st=2, t3_i=1, t3_pc=1, t3_st=2, token=3] - UnprovableResult [Line: 11133]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 2272 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 36.4s, OverallIterations: 36, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.2s, AutomataDifference: 13.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81467 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81357 mSDsluCounter, 319739 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 173901 mSDsCounter, 426 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4011 IncrementalHoareTripleChecker+Invalid, 4437 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 426 mSolverCounterUnsat, 145838 mSDtfsCounter, 4011 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5410 GetRequests, 5337 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18374occurred in iteration=22, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 481 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 5435 NumberOfCodeBlocks, 5406 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 5394 ConstructedInterpolants, 0 QuantifiedInterpolants, 8886 SizeOfPredicates, 4 NumberOfNonLiveVariables, 10764 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 36 InterpolantComputations, 35 PerfectInterpolantSequences, 3817/3976 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-21 22:04:35,290 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 0 Received shutdown request...