/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/psyco/psyco_abp_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 18:10:57,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 18:10:57,625 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-22 18:10:57,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 18:10:57,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 18:10:57,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 18:10:57,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 18:10:57,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 18:10:57,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 18:10:57,656 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 18:10:57,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 18:10:57,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 18:10:57,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 18:10:57,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 18:10:57,658 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 18:10:57,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 18:10:57,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 18:10:57,659 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 18:10:57,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 18:10:57,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 18:10:57,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 18:10:57,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 18:10:57,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 18:10:57,661 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 18:10:57,661 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 18:10:57,661 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 18:10:57,662 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 18:10:57,662 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 18:10:57,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 18:10:57,662 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 18:10:57,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 18:10:57,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 18:10:57,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 18:10:57,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 18:10:57,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 18:10:57,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 18:10:57,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 18:10:57,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 18:10:57,664 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 18:10:57,664 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 18:10:57,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 18:10:57,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 18:10:57,665 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 18:10:57,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 18:10:57,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 18:10:57,665 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 18:10:57,665 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-22 18:10:57,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 18:10:57,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 18:10:57,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 18:10:57,882 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 18:10:57,882 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 18:10:57,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_abp_1-1.c [2023-12-22 18:10:59,040 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 18:10:59,264 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 18:10:59,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-1.c [2023-12-22 18:10:59,280 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/838176cdc/55c9731933ac4a47ad0ead5cc62accad/FLAG640c82f45 [2023-12-22 18:10:59,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/838176cdc/55c9731933ac4a47ad0ead5cc62accad [2023-12-22 18:10:59,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 18:10:59,301 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 18:10:59,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 18:10:59,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 18:10:59,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 18:10:59,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 06:10:59" (1/1) ... [2023-12-22 18:10:59,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d9b410b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:10:59, skipping insertion in model container [2023-12-22 18:10:59,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 06:10:59" (1/1) ... [2023-12-22 18:10:59,348 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 18:10:59,538 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-1.c[24818,24831] [2023-12-22 18:10:59,543 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 18:10:59,554 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 18:10:59,634 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_abp_1-1.c[24818,24831] [2023-12-22 18:10:59,636 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 18:10:59,661 INFO L206 MainTranslator]: Completed translation [2023-12-22 18:10:59,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:10:59 WrapperNode [2023-12-22 18:10:59,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 18:10:59,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 18:10:59,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 18:10:59,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 18:10:59,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:10:59" (1/1) ... [2023-12-22 18:10:59,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:10:59" (1/1) ... [2023-12-22 18:10:59,708 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 417 [2023-12-22 18:10:59,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 18:10:59,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 18:10:59,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 18:10:59,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 18:10:59,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:10:59" (1/1) ... [2023-12-22 18:10:59,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:10:59" (1/1) ... [2023-12-22 18:10:59,726 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:10:59" (1/1) ... [2023-12-22 18:10:59,744 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-22 18:10:59,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:10:59" (1/1) ... [2023-12-22 18:10:59,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:10:59" (1/1) ... [2023-12-22 18:10:59,766 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:10:59" (1/1) ... [2023-12-22 18:10:59,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:10:59" (1/1) ... [2023-12-22 18:10:59,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:10:59" (1/1) ... [2023-12-22 18:10:59,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:10:59" (1/1) ... [2023-12-22 18:10:59,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 18:10:59,781 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 18:10:59,784 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 18:10:59,784 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 18:10:59,785 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:10:59" (1/1) ... [2023-12-22 18:10:59,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 18:10:59,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 18:10:59,842 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-22 18:10:59,876 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-22 18:10:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 18:10:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 18:10:59,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 18:10:59,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 18:10:59,963 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 18:10:59,965 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 18:11:00,421 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 18:11:00,445 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 18:11:00,446 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-22 18:11:00,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 06:11:00 BoogieIcfgContainer [2023-12-22 18:11:00,446 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 18:11:00,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 18:11:00,448 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 18:11:00,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 18:11:00,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 06:10:59" (1/3) ... [2023-12-22 18:11:00,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9c52b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 06:11:00, skipping insertion in model container [2023-12-22 18:11:00,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 06:10:59" (2/3) ... [2023-12-22 18:11:00,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9c52b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 06:11:00, skipping insertion in model container [2023-12-22 18:11:00,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 06:11:00" (3/3) ... [2023-12-22 18:11:00,452 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2023-12-22 18:11:00,466 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 18:11:00,466 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-22 18:11:00,497 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 18:11:00,501 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;@7138f6be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 18:11:00,501 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-22 18:11:00,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 106 states have (on average 1.971698113207547) internal successors, (209), 107 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-22 18:11:00,508 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 18:11:00,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 18:11:00,509 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 18:11:00,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 18:11:00,512 INFO L85 PathProgramCache]: Analyzing trace with hash 659597034, now seen corresponding path program 1 times [2023-12-22 18:11:00,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 18:11:00,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120606938] [2023-12-22 18:11:00,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 18:11:00,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 18:11:00,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 18:11:00,523 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-22 18:11:00,529 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-22 18:11:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 18:11:00,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-22 18:11:00,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 18:11:00,589 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-22 18:11:00,589 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 18:11:00,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 18:11:00,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120606938] [2023-12-22 18:11:00,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120606938] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 18:11:00,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 18:11:00,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 18:11:00,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176906701] [2023-12-22 18:11:00,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 18:11:00,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-22 18:11:00,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 18:11:00,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-22 18:11:00,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-22 18:11:00,613 INFO L87 Difference]: Start difference. First operand has 108 states, 106 states have (on average 1.971698113207547) internal successors, (209), 107 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 18:11:00,638 INFO L93 Difference]: Finished difference Result 215 states and 417 transitions. [2023-12-22 18:11:00,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-22 18:11:00,640 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-22 18:11:00,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 18:11:00,646 INFO L225 Difference]: With dead ends: 215 [2023-12-22 18:11:00,646 INFO L226 Difference]: Without dead ends: 105 [2023-12-22 18:11:00,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-22 18:11:00,651 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 18:11:00,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 18:11:00,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-22 18:11:00,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-12-22 18:11:00,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.6923076923076923) internal successors, (176), 104 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 176 transitions. [2023-12-22 18:11:00,681 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 176 transitions. Word has length 9 [2023-12-22 18:11:00,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 18:11:00,681 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 176 transitions. [2023-12-22 18:11:00,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:00,682 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 176 transitions. [2023-12-22 18:11:00,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-22 18:11:00,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 18:11:00,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 18:11:00,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-22 18:11:00,885 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-22 18:11:00,886 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 18:11:00,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 18:11:00,887 INFO L85 PathProgramCache]: Analyzing trace with hash -494840934, now seen corresponding path program 1 times [2023-12-22 18:11:00,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 18:11:00,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069718077] [2023-12-22 18:11:00,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 18:11:00,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 18:11:00,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 18:11:00,889 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-22 18:11:00,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-22 18:11:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 18:11:00,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 18:11:00,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 18:11:00,970 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-22 18:11:00,970 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 18:11:00,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 18:11:00,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069718077] [2023-12-22 18:11:00,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069718077] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 18:11:00,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 18:11:00,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 18:11:00,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618607720] [2023-12-22 18:11:00,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 18:11:00,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 18:11:00,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 18:11:00,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 18:11:00,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 18:11:00,973 INFO L87 Difference]: Start difference. First operand 105 states and 176 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:01,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 18:11:01,015 INFO L93 Difference]: Finished difference Result 213 states and 357 transitions. [2023-12-22 18:11:01,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 18:11:01,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-22 18:11:01,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 18:11:01,017 INFO L225 Difference]: With dead ends: 213 [2023-12-22 18:11:01,017 INFO L226 Difference]: Without dead ends: 109 [2023-12-22 18:11:01,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-22 18:11:01,018 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 5 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 18:11:01,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 329 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 18:11:01,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-22 18:11:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-12-22 18:11:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.6759259259259258) internal successors, (181), 108 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:01,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 181 transitions. [2023-12-22 18:11:01,025 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 181 transitions. Word has length 10 [2023-12-22 18:11:01,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 18:11:01,025 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 181 transitions. [2023-12-22 18:11:01,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:01,026 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 181 transitions. [2023-12-22 18:11:01,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-22 18:11:01,026 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 18:11:01,026 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 18:11:01,041 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-22 18:11:01,227 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-22 18:11:01,227 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 18:11:01,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 18:11:01,228 INFO L85 PathProgramCache]: Analyzing trace with hash -312666617, now seen corresponding path program 1 times [2023-12-22 18:11:01,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 18:11:01,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668524483] [2023-12-22 18:11:01,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 18:11:01,230 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-22 18:11:01,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 18:11:01,245 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-22 18:11:01,246 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-22 18:11:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 18:11:01,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 18:11:01,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 18:11:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 18:11:01,371 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 18:11:01,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 18:11:01,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668524483] [2023-12-22 18:11:01,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668524483] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 18:11:01,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 18:11:01,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-22 18:11:01,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303458588] [2023-12-22 18:11:01,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 18:11:01,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 18:11:01,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 18:11:01,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 18:11:01,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-22 18:11:01,373 INFO L87 Difference]: Start difference. First operand 109 states and 181 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:01,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 18:11:01,582 INFO L93 Difference]: Finished difference Result 325 states and 540 transitions. [2023-12-22 18:11:01,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 18:11:01,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-22 18:11:01,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 18:11:01,585 INFO L225 Difference]: With dead ends: 325 [2023-12-22 18:11:01,585 INFO L226 Difference]: Without dead ends: 196 [2023-12-22 18:11:01,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-22 18:11:01,587 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 147 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 18:11:01,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 385 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 18:11:01,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-12-22 18:11:01,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 183. [2023-12-22 18:11:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.6483516483516483) internal successors, (300), 182 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 300 transitions. [2023-12-22 18:11:01,605 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 300 transitions. Word has length 16 [2023-12-22 18:11:01,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 18:11:01,605 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 300 transitions. [2023-12-22 18:11:01,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 300 transitions. [2023-12-22 18:11:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-22 18:11:01,606 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 18:11:01,606 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 18:11:01,616 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-22 18:11:01,815 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-22 18:11:01,816 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 18:11:01,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 18:11:01,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1648516733, now seen corresponding path program 1 times [2023-12-22 18:11:01,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 18:11:01,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823194507] [2023-12-22 18:11:01,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 18:11:01,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 18:11:01,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 18:11:01,837 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-22 18:11:01,868 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-22 18:11:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 18:11:01,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 18:11:01,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 18:11:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 18:11:01,906 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 18:11:01,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 18:11:01,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823194507] [2023-12-22 18:11:01,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823194507] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 18:11:01,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 18:11:01,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 18:11:01,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558822757] [2023-12-22 18:11:01,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 18:11:01,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 18:11:01,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 18:11:01,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 18:11:01,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 18:11:01,908 INFO L87 Difference]: Start difference. First operand 183 states and 300 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:01,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 18:11:01,930 INFO L93 Difference]: Finished difference Result 313 states and 513 transitions. [2023-12-22 18:11:01,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 18:11:01,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-22 18:11:01,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 18:11:01,932 INFO L225 Difference]: With dead ends: 313 [2023-12-22 18:11:01,932 INFO L226 Difference]: Without dead ends: 132 [2023-12-22 18:11:01,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-22 18:11:01,933 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 33 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 18:11:01,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 304 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 18:11:01,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-12-22 18:11:01,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2023-12-22 18:11:01,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.627906976744186) internal successors, (210), 129 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:01,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 210 transitions. [2023-12-22 18:11:01,939 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 210 transitions. Word has length 17 [2023-12-22 18:11:01,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 18:11:01,939 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 210 transitions. [2023-12-22 18:11:01,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:01,939 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 210 transitions. [2023-12-22 18:11:01,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-22 18:11:01,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 18:11:01,940 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 18:11:01,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-22 18:11:02,142 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-22 18:11:02,142 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 18:11:02,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 18:11:02,143 INFO L85 PathProgramCache]: Analyzing trace with hash -389555126, now seen corresponding path program 1 times [2023-12-22 18:11:02,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 18:11:02,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812202921] [2023-12-22 18:11:02,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 18:11:02,143 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-22 18:11:02,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 18:11:02,144 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-22 18:11:02,148 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-22 18:11:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 18:11:02,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 18:11:02,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 18:11:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-22 18:11:02,197 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 18:11:02,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 18:11:02,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812202921] [2023-12-22 18:11:02,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812202921] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 18:11:02,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 18:11:02,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 18:11:02,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683061549] [2023-12-22 18:11:02,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 18:11:02,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 18:11:02,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 18:11:02,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 18:11:02,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 18:11:02,199 INFO L87 Difference]: Start difference. First operand 130 states and 210 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:02,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 18:11:02,229 INFO L93 Difference]: Finished difference Result 266 states and 430 transitions. [2023-12-22 18:11:02,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 18:11:02,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-22 18:11:02,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 18:11:02,231 INFO L225 Difference]: With dead ends: 266 [2023-12-22 18:11:02,231 INFO L226 Difference]: Without dead ends: 138 [2023-12-22 18:11:02,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-22 18:11:02,233 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 35 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 18:11:02,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 303 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 18:11:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-22 18:11:02,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2023-12-22 18:11:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.6074074074074074) internal successors, (217), 135 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 217 transitions. [2023-12-22 18:11:02,239 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 217 transitions. Word has length 23 [2023-12-22 18:11:02,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 18:11:02,240 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 217 transitions. [2023-12-22 18:11:02,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 217 transitions. [2023-12-22 18:11:02,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-22 18:11:02,240 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 18:11:02,241 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 18:11:02,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-22 18:11:02,444 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-22 18:11:02,444 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 18:11:02,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 18:11:02,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1410664843, now seen corresponding path program 1 times [2023-12-22 18:11:02,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 18:11:02,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22932209] [2023-12-22 18:11:02,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 18:11:02,446 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-22 18:11:02,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 18:11:02,447 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-22 18:11:02,448 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-22 18:11:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 18:11:02,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 18:11:02,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 18:11:02,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 18:11:02,519 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 18:11:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 18:11:02,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 18:11:02,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22932209] [2023-12-22 18:11:02,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22932209] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 18:11:02,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 18:11:02,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-22 18:11:02,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802025351] [2023-12-22 18:11:02,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 18:11:02,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 18:11:02,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 18:11:02,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 18:11:02,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 18:11:02,553 INFO L87 Difference]: Start difference. First operand 136 states and 217 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:02,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 18:11:02,701 INFO L93 Difference]: Finished difference Result 255 states and 409 transitions. [2023-12-22 18:11:02,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 18:11:02,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-22 18:11:02,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 18:11:02,703 INFO L225 Difference]: With dead ends: 255 [2023-12-22 18:11:02,704 INFO L226 Difference]: Without dead ends: 227 [2023-12-22 18:11:02,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 18:11:02,705 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 451 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 18:11:02,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 702 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 18:11:02,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-12-22 18:11:02,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 219. [2023-12-22 18:11:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.591743119266055) internal successors, (347), 218 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 347 transitions. [2023-12-22 18:11:02,713 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 347 transitions. Word has length 25 [2023-12-22 18:11:02,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 18:11:02,713 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 347 transitions. [2023-12-22 18:11:02,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:02,714 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 347 transitions. [2023-12-22 18:11:02,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-22 18:11:02,714 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 18:11:02,714 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 18:11:02,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-22 18:11:02,917 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-22 18:11:02,918 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 18:11:02,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 18:11:02,919 INFO L85 PathProgramCache]: Analyzing trace with hash 792380695, now seen corresponding path program 1 times [2023-12-22 18:11:02,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 18:11:02,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386504955] [2023-12-22 18:11:02,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 18:11:02,919 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-22 18:11:02,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 18:11:02,924 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-22 18:11:02,928 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-22 18:11:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 18:11:02,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 18:11:02,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 18:11:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 18:11:03,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 18:11:03,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 18:11:03,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 18:11:03,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386504955] [2023-12-22 18:11:03,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386504955] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 18:11:03,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 18:11:03,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-22 18:11:03,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609645788] [2023-12-22 18:11:03,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 18:11:03,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 18:11:03,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 18:11:03,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 18:11:03,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 18:11:03,158 INFO L87 Difference]: Start difference. First operand 219 states and 347 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 18:11:03,268 INFO L93 Difference]: Finished difference Result 461 states and 726 transitions. [2023-12-22 18:11:03,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 18:11:03,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-22 18:11:03,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 18:11:03,270 INFO L225 Difference]: With dead ends: 461 [2023-12-22 18:11:03,270 INFO L226 Difference]: Without dead ends: 242 [2023-12-22 18:11:03,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-22 18:11:03,271 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 37 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 18:11:03,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 740 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 18:11:03,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-12-22 18:11:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 238. [2023-12-22 18:11:03,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.5738396624472575) internal successors, (373), 237 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:03,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 373 transitions. [2023-12-22 18:11:03,276 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 373 transitions. Word has length 26 [2023-12-22 18:11:03,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 18:11:03,276 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 373 transitions. [2023-12-22 18:11:03,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:03,276 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 373 transitions. [2023-12-22 18:11:03,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-22 18:11:03,277 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 18:11:03,277 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 18:11:03,284 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-22 18:11:03,477 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-22 18:11:03,478 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 18:11:03,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 18:11:03,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1341514950, now seen corresponding path program 1 times [2023-12-22 18:11:03,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 18:11:03,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532790139] [2023-12-22 18:11:03,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 18:11:03,479 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-22 18:11:03,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 18:11:03,480 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-22 18:11:03,481 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-22 18:11:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 18:11:03,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 18:11:03,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 18:11:03,532 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-22 18:11:03,532 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 18:11:03,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 18:11:03,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532790139] [2023-12-22 18:11:03,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532790139] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 18:11:03,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 18:11:03,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 18:11:03,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684987933] [2023-12-22 18:11:03,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 18:11:03,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 18:11:03,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 18:11:03,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 18:11:03,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 18:11:03,534 INFO L87 Difference]: Start difference. First operand 238 states and 373 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:03,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 18:11:03,568 INFO L93 Difference]: Finished difference Result 490 states and 771 transitions. [2023-12-22 18:11:03,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 18:11:03,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-12-22 18:11:03,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 18:11:03,570 INFO L225 Difference]: With dead ends: 490 [2023-12-22 18:11:03,570 INFO L226 Difference]: Without dead ends: 254 [2023-12-22 18:11:03,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 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-22 18:11:03,572 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 36 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 18:11:03,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 304 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 18:11:03,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-22 18:11:03,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2023-12-22 18:11:03,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.549800796812749) internal successors, (389), 251 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 389 transitions. [2023-12-22 18:11:03,579 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 389 transitions. Word has length 33 [2023-12-22 18:11:03,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 18:11:03,579 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 389 transitions. [2023-12-22 18:11:03,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:03,580 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 389 transitions. [2023-12-22 18:11:03,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-22 18:11:03,580 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 18:11:03,581 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 18:11:03,598 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-22 18:11:03,784 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-22 18:11:03,784 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 18:11:03,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 18:11:03,785 INFO L85 PathProgramCache]: Analyzing trace with hash -928838230, now seen corresponding path program 1 times [2023-12-22 18:11:03,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 18:11:03,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637063768] [2023-12-22 18:11:03,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 18:11:03,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 18:11:03,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 18:11:03,787 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-22 18:11:03,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-22 18:11:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 18:11:03,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-22 18:11:03,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 18:11:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-22 18:11:03,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 18:11:03,976 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-22 18:11:03,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 18:11:03,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637063768] [2023-12-22 18:11:03,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637063768] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 18:11:03,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 18:11:03,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-22 18:11:03,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805316082] [2023-12-22 18:11:03,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 18:11:03,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-22 18:11:03,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 18:11:03,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-22 18:11:03,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-22 18:11:03,978 INFO L87 Difference]: Start difference. First operand 252 states and 389 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 18:11:04,424 INFO L93 Difference]: Finished difference Result 764 states and 1171 transitions. [2023-12-22 18:11:04,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-22 18:11:04,425 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-12-22 18:11:04,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 18:11:04,427 INFO L225 Difference]: With dead ends: 764 [2023-12-22 18:11:04,427 INFO L226 Difference]: Without dead ends: 486 [2023-12-22 18:11:04,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-22 18:11:04,429 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 390 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-22 18:11:04,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1133 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-22 18:11:04,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2023-12-22 18:11:04,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 455. [2023-12-22 18:11:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 454 states have (on average 1.5330396475770924) internal successors, (696), 454 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:04,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 696 transitions. [2023-12-22 18:11:04,460 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 696 transitions. Word has length 36 [2023-12-22 18:11:04,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 18:11:04,460 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 696 transitions. [2023-12-22 18:11:04,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:04,460 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 696 transitions. [2023-12-22 18:11:04,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-22 18:11:04,464 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 18:11:04,464 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 18:11:04,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-22 18:11:04,666 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-22 18:11:04,666 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 18:11:04,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 18:11:04,667 INFO L85 PathProgramCache]: Analyzing trace with hash -63935831, now seen corresponding path program 1 times [2023-12-22 18:11:04,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 18:11:04,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563715181] [2023-12-22 18:11:04,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 18:11:04,667 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-22 18:11:04,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 18:11:04,668 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-22 18:11:04,670 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-22 18:11:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 18:11:04,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-22 18:11:04,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 18:11:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 18:11:04,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 18:11:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 18:11:04,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 18:11:04,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563715181] [2023-12-22 18:11:04,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563715181] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 18:11:04,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 18:11:04,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-22 18:11:04,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092589668] [2023-12-22 18:11:04,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 18:11:04,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-22 18:11:04,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 18:11:04,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-22 18:11:04,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-22 18:11:04,990 INFO L87 Difference]: Start difference. First operand 455 states and 696 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:05,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 18:11:05,110 INFO L93 Difference]: Finished difference Result 460 states and 700 transitions. [2023-12-22 18:11:05,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-22 18:11:05,111 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-12-22 18:11:05,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 18:11:05,113 INFO L225 Difference]: With dead ends: 460 [2023-12-22 18:11:05,113 INFO L226 Difference]: Without dead ends: 458 [2023-12-22 18:11:05,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-22 18:11:05,114 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 95 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 18:11:05,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 608 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 18:11:05,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2023-12-22 18:11:05,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2023-12-22 18:11:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.531868131868132) internal successors, (697), 455 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:05,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 697 transitions. [2023-12-22 18:11:05,124 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 697 transitions. Word has length 39 [2023-12-22 18:11:05,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 18:11:05,124 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 697 transitions. [2023-12-22 18:11:05,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:05,125 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 697 transitions. [2023-12-22 18:11:05,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-22 18:11:05,125 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 18:11:05,125 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 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] [2023-12-22 18:11:05,153 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-22 18:11:05,328 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-22 18:11:05,329 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 18:11:05,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 18:11:05,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1244893848, now seen corresponding path program 1 times [2023-12-22 18:11:05,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 18:11:05,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97961066] [2023-12-22 18:11:05,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 18:11:05,330 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-22 18:11:05,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 18:11:05,331 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-22 18:11:05,332 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-22 18:11:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 18:11:05,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 18:11:05,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 18:11:05,387 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-22 18:11:05,387 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 18:11:05,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 18:11:05,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97961066] [2023-12-22 18:11:05,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97961066] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 18:11:05,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 18:11:05,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 18:11:05,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921123541] [2023-12-22 18:11:05,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 18:11:05,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 18:11:05,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 18:11:05,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 18:11:05,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 18:11:05,389 INFO L87 Difference]: Start difference. First operand 456 states and 697 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:05,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 18:11:05,415 INFO L93 Difference]: Finished difference Result 680 states and 1032 transitions. [2023-12-22 18:11:05,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 18:11:05,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-12-22 18:11:05,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 18:11:05,417 INFO L225 Difference]: With dead ends: 680 [2023-12-22 18:11:05,417 INFO L226 Difference]: Without dead ends: 230 [2023-12-22 18:11:05,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-22 18:11:05,418 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 31 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-22 18:11:05,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 199 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 18:11:05,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-12-22 18:11:05,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2023-12-22 18:11:05,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.449339207048458) internal successors, (329), 227 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:05,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 329 transitions. [2023-12-22 18:11:05,423 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 329 transitions. Word has length 46 [2023-12-22 18:11:05,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 18:11:05,423 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 329 transitions. [2023-12-22 18:11:05,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:05,424 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 329 transitions. [2023-12-22 18:11:05,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-22 18:11:05,424 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 18:11:05,424 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 18:11:05,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-22 18:11:05,627 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-22 18:11:05,628 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 18:11:05,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 18:11:05,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1299424459, now seen corresponding path program 1 times [2023-12-22 18:11:05,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 18:11:05,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690855334] [2023-12-22 18:11:05,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 18:11:05,629 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-22 18:11:05,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 18:11:05,630 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-22 18:11:05,631 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-22 18:11:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 18:11:05,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-22 18:11:05,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 18:11:05,730 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-22 18:11:05,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 18:11:05,833 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-22 18:11:05,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 18:11:05,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690855334] [2023-12-22 18:11:05,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690855334] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 18:11:05,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 18:11:05,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-22 18:11:05,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53442704] [2023-12-22 18:11:05,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 18:11:05,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-22 18:11:05,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 18:11:05,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-22 18:11:05,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-22 18:11:05,835 INFO L87 Difference]: Start difference. First operand 228 states and 329 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:05,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 18:11:05,949 INFO L93 Difference]: Finished difference Result 516 states and 750 transitions. [2023-12-22 18:11:05,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 18:11:05,950 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-12-22 18:11:05,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 18:11:05,951 INFO L225 Difference]: With dead ends: 516 [2023-12-22 18:11:05,952 INFO L226 Difference]: Without dead ends: 349 [2023-12-22 18:11:05,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-22 18:11:05,952 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 212 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 18:11:05,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 685 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 18:11:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-12-22 18:11:05,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 325. [2023-12-22 18:11:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.4444444444444444) internal successors, (468), 324 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 468 transitions. [2023-12-22 18:11:05,959 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 468 transitions. Word has length 54 [2023-12-22 18:11:05,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 18:11:05,959 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 468 transitions. [2023-12-22 18:11:05,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 468 transitions. [2023-12-22 18:11:05,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-22 18:11:05,960 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 18:11:05,960 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 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] [2023-12-22 18:11:05,979 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-22 18:11:06,163 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-22 18:11:06,164 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 18:11:06,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 18:11:06,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1638903899, now seen corresponding path program 1 times [2023-12-22 18:11:06,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 18:11:06,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499533245] [2023-12-22 18:11:06,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 18:11:06,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 18:11:06,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 18:11:06,181 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-22 18:11:06,222 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-22 18:11:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 18:11:06,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-22 18:11:06,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 18:11:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 18:11:06,428 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 18:11:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 18:11:06,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 18:11:06,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499533245] [2023-12-22 18:11:06,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499533245] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 18:11:06,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 18:11:06,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-22 18:11:06,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568519290] [2023-12-22 18:11:06,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 18:11:06,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-22 18:11:06,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 18:11:06,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-22 18:11:06,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-22 18:11:06,696 INFO L87 Difference]: Start difference. First operand 325 states and 468 transitions. Second operand has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:06,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 18:11:06,843 INFO L93 Difference]: Finished difference Result 336 states and 475 transitions. [2023-12-22 18:11:06,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-22 18:11:06,844 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-12-22 18:11:06,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 18:11:06,846 INFO L225 Difference]: With dead ends: 336 [2023-12-22 18:11:06,846 INFO L226 Difference]: Without dead ends: 334 [2023-12-22 18:11:06,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-22 18:11:06,846 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 154 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-22 18:11:06,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 842 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-22 18:11:06,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-12-22 18:11:06,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 326. [2023-12-22 18:11:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.436923076923077) internal successors, (467), 325 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:06,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 467 transitions. [2023-12-22 18:11:06,854 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 467 transitions. Word has length 55 [2023-12-22 18:11:06,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 18:11:06,854 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 467 transitions. [2023-12-22 18:11:06,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:06,854 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 467 transitions. [2023-12-22 18:11:06,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-22 18:11:06,854 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 18:11:06,855 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 18:11:06,873 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-22 18:11:07,058 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-22 18:11:07,058 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 18:11:07,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 18:11:07,059 INFO L85 PathProgramCache]: Analyzing trace with hash -552158346, now seen corresponding path program 1 times [2023-12-22 18:11:07,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 18:11:07,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2119860198] [2023-12-22 18:11:07,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 18:11:07,059 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-22 18:11:07,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 18:11:07,061 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-22 18:11:07,067 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-22 18:11:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 18:11:07,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-22 18:11:07,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 18:11:07,276 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 18:11:07,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 18:11:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 44 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-22 18:11:07,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 18:11:07,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2119860198] [2023-12-22 18:11:07,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2119860198] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 18:11:07,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 18:11:07,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2023-12-22 18:11:07,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439814126] [2023-12-22 18:11:07,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 18:11:07,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-22 18:11:07,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 18:11:07,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-22 18:11:07,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-12-22 18:11:07,580 INFO L87 Difference]: Start difference. First operand 326 states and 467 transitions. Second operand has 13 states, 13 states have (on average 8.538461538461538) internal successors, (111), 13 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 18:11:07,932 INFO L93 Difference]: Finished difference Result 352 states and 486 transitions. [2023-12-22 18:11:07,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-22 18:11:07,933 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.538461538461538) internal successors, (111), 13 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-12-22 18:11:07,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 18:11:07,934 INFO L225 Difference]: With dead ends: 352 [2023-12-22 18:11:07,934 INFO L226 Difference]: Without dead ends: 350 [2023-12-22 18:11:07,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2023-12-22 18:11:07,935 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 291 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 18:11:07,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1779 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 18:11:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2023-12-22 18:11:07,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 326. [2023-12-22 18:11:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.4276923076923076) internal successors, (464), 325 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:07,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 464 transitions. [2023-12-22 18:11:07,943 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 464 transitions. Word has length 62 [2023-12-22 18:11:07,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 18:11:07,943 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 464 transitions. [2023-12-22 18:11:07,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.538461538461538) internal successors, (111), 13 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:07,944 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 464 transitions. [2023-12-22 18:11:07,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-12-22 18:11:07,944 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 18:11:07,944 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 18:11:07,961 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-22 18:11:08,148 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-22 18:11:08,148 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 18:11:08,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 18:11:08,149 INFO L85 PathProgramCache]: Analyzing trace with hash 461425032, now seen corresponding path program 1 times [2023-12-22 18:11:08,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 18:11:08,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253792505] [2023-12-22 18:11:08,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 18:11:08,149 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-22 18:11:08,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 18:11:08,150 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-22 18:11:08,152 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-22 18:11:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 18:11:08,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-22 18:11:08,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 18:11:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-22 18:11:08,268 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 18:11:08,407 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 38 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-22 18:11:08,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 18:11:08,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253792505] [2023-12-22 18:11:08,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253792505] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 18:11:08,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 18:11:08,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-22 18:11:08,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014438802] [2023-12-22 18:11:08,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 18:11:08,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-22 18:11:08,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 18:11:08,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-22 18:11:08,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-22 18:11:08,409 INFO L87 Difference]: Start difference. First operand 326 states and 464 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 18:11:08,686 INFO L93 Difference]: Finished difference Result 749 states and 1081 transitions. [2023-12-22 18:11:08,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-22 18:11:08,687 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2023-12-22 18:11:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 18:11:08,690 INFO L225 Difference]: With dead ends: 749 [2023-12-22 18:11:08,690 INFO L226 Difference]: Without dead ends: 585 [2023-12-22 18:11:08,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-12-22 18:11:08,692 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 1287 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 18:11:08,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 1072 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 18:11:08,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2023-12-22 18:11:08,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 565. [2023-12-22 18:11:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 1.4202127659574468) internal successors, (801), 564 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 801 transitions. [2023-12-22 18:11:08,720 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 801 transitions. Word has length 72 [2023-12-22 18:11:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 18:11:08,720 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 801 transitions. [2023-12-22 18:11:08,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:08,721 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 801 transitions. [2023-12-22 18:11:08,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-22 18:11:08,721 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 18:11:08,721 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 5, 5, 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] [2023-12-22 18:11:08,724 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-22 18:11:08,923 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-22 18:11:08,924 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 18:11:08,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 18:11:08,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1880758362, now seen corresponding path program 1 times [2023-12-22 18:11:08,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 18:11:08,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934279391] [2023-12-22 18:11:08,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 18:11:08,925 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-22 18:11:08,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 18:11:08,926 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-22 18:11:08,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-22 18:11:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 18:11:08,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-22 18:11:08,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 18:11:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 18:11:09,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 18:11:09,648 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 18:11:09,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 18:11:09,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934279391] [2023-12-22 18:11:09,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934279391] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 18:11:09,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 18:11:09,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-22 18:11:09,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13596206] [2023-12-22 18:11:09,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 18:11:09,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-22 18:11:09,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 18:11:09,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-22 18:11:09,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-22 18:11:09,650 INFO L87 Difference]: Start difference. First operand 565 states and 801 transitions. Second operand has 16 states, 16 states have (on average 10.125) internal successors, (162), 16 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:09,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 18:11:09,899 INFO L93 Difference]: Finished difference Result 754 states and 1060 transitions. [2023-12-22 18:11:09,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-22 18:11:09,899 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.125) internal successors, (162), 16 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2023-12-22 18:11:09,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 18:11:09,902 INFO L225 Difference]: With dead ends: 754 [2023-12-22 18:11:09,902 INFO L226 Difference]: Without dead ends: 751 [2023-12-22 18:11:09,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2023-12-22 18:11:09,903 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 310 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 18:11:09,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1766 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 18:11:09,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2023-12-22 18:11:09,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 740. [2023-12-22 18:11:09,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 1.412719891745602) internal successors, (1044), 739 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1044 transitions. [2023-12-22 18:11:09,919 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1044 transitions. Word has length 85 [2023-12-22 18:11:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 18:11:09,919 INFO L495 AbstractCegarLoop]: Abstraction has 740 states and 1044 transitions. [2023-12-22 18:11:09,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.125) internal successors, (162), 16 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1044 transitions. [2023-12-22 18:11:09,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-22 18:11:09,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 18:11:09,924 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 18:11:09,942 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-22 18:11:10,143 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-22 18:11:10,143 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 18:11:10,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 18:11:10,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1467654423, now seen corresponding path program 1 times [2023-12-22 18:11:10,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 18:11:10,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692299205] [2023-12-22 18:11:10,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 18:11:10,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-22 18:11:10,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 18:11:10,161 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-22 18:11:10,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-22 18:11:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 18:11:10,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-22 18:11:10,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 18:11:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 36 proven. 385 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-22 18:11:10,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 18:11:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 36 proven. 385 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-22 18:11:10,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 18:11:10,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692299205] [2023-12-22 18:11:10,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [692299205] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 18:11:10,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 18:11:10,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-22 18:11:10,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570102055] [2023-12-22 18:11:10,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 18:11:10,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-22 18:11:10,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 18:11:10,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-22 18:11:10,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-12-22 18:11:10,818 INFO L87 Difference]: Start difference. First operand 740 states and 1044 transitions. Second operand has 16 states, 16 states have (on average 15.125) internal successors, (242), 16 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:11,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 18:11:11,149 INFO L93 Difference]: Finished difference Result 752 states and 1051 transitions. [2023-12-22 18:11:11,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-22 18:11:11,150 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 15.125) internal successors, (242), 16 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2023-12-22 18:11:11,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 18:11:11,153 INFO L225 Difference]: With dead ends: 752 [2023-12-22 18:11:11,153 INFO L226 Difference]: Without dead ends: 748 [2023-12-22 18:11:11,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-12-22 18:11:11,153 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 788 mSDsluCounter, 2320 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 2642 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-22 18:11:11,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 2642 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-22 18:11:11,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2023-12-22 18:11:11,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 740. [2023-12-22 18:11:11,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 1.4100135317997293) internal successors, (1042), 739 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1042 transitions. [2023-12-22 18:11:11,164 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1042 transitions. Word has length 146 [2023-12-22 18:11:11,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 18:11:11,165 INFO L495 AbstractCegarLoop]: Abstraction has 740 states and 1042 transitions. [2023-12-22 18:11:11,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.125) internal successors, (242), 16 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1042 transitions. [2023-12-22 18:11:11,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-22 18:11:11,166 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 18:11:11,166 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 9, 9, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 18:11:11,169 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-22 18:11:11,369 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-22 18:11:11,369 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 18:11:11,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 18:11:11,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1758804477, now seen corresponding path program 1 times [2023-12-22 18:11:11,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 18:11:11,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486315358] [2023-12-22 18:11:11,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 18:11:11,370 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-22 18:11:11,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 18:11:11,371 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-22 18:11:11,373 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-22 18:11:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 18:11:11,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-22 18:11:11,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 18:11:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 18:11:11,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 18:11:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 36 proven. 417 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 18:11:12,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 18:11:12,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486315358] [2023-12-22 18:11:12,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486315358] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 18:11:12,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 18:11:12,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-12-22 18:11:12,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165300821] [2023-12-22 18:11:12,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 18:11:12,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-22 18:11:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 18:11:12,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-22 18:11:12,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2023-12-22 18:11:12,864 INFO L87 Difference]: Start difference. First operand 740 states and 1042 transitions. Second operand has 26 states, 26 states have (on average 11.0) internal successors, (286), 26 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 18:11:13,572 INFO L93 Difference]: Finished difference Result 748 states and 1047 transitions. [2023-12-22 18:11:13,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-22 18:11:13,573 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 11.0) internal successors, (286), 26 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2023-12-22 18:11:13,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 18:11:13,575 INFO L225 Difference]: With dead ends: 748 [2023-12-22 18:11:13,575 INFO L226 Difference]: Without dead ends: 746 [2023-12-22 18:11:13,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=859, Unknown=0, NotChecked=0, Total=992 [2023-12-22 18:11:13,576 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 549 mSDsluCounter, 5045 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 5366 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-22 18:11:13,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 5366 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-22 18:11:13,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2023-12-22 18:11:13,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 740. [2023-12-22 18:11:13,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 1.4073071718538566) internal successors, (1040), 739 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:13,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1040 transitions. [2023-12-22 18:11:13,589 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1040 transitions. Word has length 147 [2023-12-22 18:11:13,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 18:11:13,590 INFO L495 AbstractCegarLoop]: Abstraction has 740 states and 1040 transitions. [2023-12-22 18:11:13,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 11.0) internal successors, (286), 26 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:13,590 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1040 transitions. [2023-12-22 18:11:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-12-22 18:11:13,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 18:11:13,592 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 12, 12, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 18:11:13,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-22 18:11:13,796 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-22 18:11:13,797 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 18:11:13,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 18:11:13,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1760206870, now seen corresponding path program 1 times [2023-12-22 18:11:13,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 18:11:13,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608981573] [2023-12-22 18:11:13,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 18:11:13,798 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-22 18:11:13,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 18:11:13,799 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-22 18:11:13,801 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-22 18:11:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 18:11:13,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-22 18:11:13,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 18:11:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-22 18:11:14,144 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 18:11:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 125 proven. 650 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-22 18:11:14,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 18:11:14,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608981573] [2023-12-22 18:11:14,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608981573] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 18:11:14,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 18:11:14,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-12-22 18:11:14,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592345060] [2023-12-22 18:11:14,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 18:11:14,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-22 18:11:14,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 18:11:14,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-22 18:11:14,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2023-12-22 18:11:14,581 INFO L87 Difference]: Start difference. First operand 740 states and 1040 transitions. Second operand has 20 states, 20 states have (on average 15.25) internal successors, (305), 20 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:15,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 18:11:15,469 INFO L93 Difference]: Finished difference Result 1961 states and 2751 transitions. [2023-12-22 18:11:15,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-22 18:11:15,471 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 15.25) internal successors, (305), 20 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2023-12-22 18:11:15,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 18:11:15,476 INFO L225 Difference]: With dead ends: 1961 [2023-12-22 18:11:15,476 INFO L226 Difference]: Without dead ends: 1558 [2023-12-22 18:11:15,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=478, Unknown=0, NotChecked=0, Total=756 [2023-12-22 18:11:15,477 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 4125 mSDsluCounter, 4234 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4125 SdHoareTripleChecker+Valid, 4636 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-22 18:11:15,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4125 Valid, 4636 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-22 18:11:15,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2023-12-22 18:11:15,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1472. [2023-12-22 18:11:15,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1472 states, 1471 states have (on average 1.4092454112848403) internal successors, (2073), 1471 states have internal predecessors, (2073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 2073 transitions. [2023-12-22 18:11:15,495 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 2073 transitions. Word has length 192 [2023-12-22 18:11:15,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 18:11:15,495 INFO L495 AbstractCegarLoop]: Abstraction has 1472 states and 2073 transitions. [2023-12-22 18:11:15,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 15.25) internal successors, (305), 20 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 18:11:15,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 2073 transitions. [2023-12-22 18:11:15,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2023-12-22 18:11:15,516 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 18:11:15,516 INFO L195 NwaCegarLoop]: trace histogram [35, 34, 34, 25, 25, 16, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 18:11:15,537 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-22 18:11:15,720 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-22 18:11:15,721 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 18:11:15,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 18:11:15,722 INFO L85 PathProgramCache]: Analyzing trace with hash -114181807, now seen corresponding path program 2 times [2023-12-22 18:11:15,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 18:11:15,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404844676] [2023-12-22 18:11:15,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-22 18:11:15,723 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-22 18:11:15,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 18:11:15,733 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-22 18:11:15,753 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-22 18:11:16,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-22 18:11:16,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-22 18:11:16,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-22 18:11:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-22 18:11:16,509 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-22 18:11:16,509 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-22 18:11:16,510 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-22 18:11:16,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-22 18:11:16,723 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-22 18:11:16,727 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 18:11:16,730 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-22 18:11:16,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 06:11:16 BoogieIcfgContainer [2023-12-22 18:11:16,858 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-22 18:11:16,858 INFO L158 Benchmark]: Toolchain (without parser) took 17558.25ms. Allocated memory was 299.9MB in the beginning and 440.4MB in the end (delta: 140.5MB). Free memory was 254.5MB in the beginning and 315.2MB in the end (delta: -60.7MB). Peak memory consumption was 82.4MB. Max. memory is 8.0GB. [2023-12-22 18:11:16,859 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 243.3MB. Free memory was 191.9MB in the beginning and 191.8MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-22 18:11:16,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.91ms. Allocated memory is still 299.9MB. Free memory was 254.3MB in the beginning and 233.6MB in the end (delta: 20.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-22 18:11:16,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.71ms. Allocated memory is still 299.9MB. Free memory was 233.3MB in the beginning and 230.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-22 18:11:16,859 INFO L158 Benchmark]: Boogie Preprocessor took 66.15ms. Allocated memory is still 299.9MB. Free memory was 230.4MB in the beginning and 227.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-22 18:11:16,859 INFO L158 Benchmark]: RCFGBuilder took 664.81ms. Allocated memory is still 299.9MB. Free memory was 227.0MB in the beginning and 238.8MB in the end (delta: -11.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-22 18:11:16,860 INFO L158 Benchmark]: TraceAbstraction took 16410.22ms. Allocated memory was 299.9MB in the beginning and 440.4MB in the end (delta: 140.5MB). Free memory was 238.3MB in the beginning and 315.2MB in the end (delta: -76.9MB). Peak memory consumption was 63.5MB. Max. memory is 8.0GB. [2023-12-22 18:11:16,860 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.38ms. Allocated memory is still 243.3MB. Free memory was 191.9MB in the beginning and 191.8MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 358.91ms. Allocated memory is still 299.9MB. Free memory was 254.3MB in the beginning and 233.6MB in the end (delta: 20.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.71ms. Allocated memory is still 299.9MB. Free memory was 233.3MB in the beginning and 230.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 66.15ms. Allocated memory is still 299.9MB. Free memory was 230.4MB in the beginning and 227.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 664.81ms. Allocated memory is still 299.9MB. Free memory was 227.0MB in the beginning and 238.8MB in the end (delta: -11.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 16410.22ms. Allocated memory was 299.9MB in the beginning and 440.4MB in the end (delta: 140.5MB). Free memory was 238.3MB in the beginning and 315.2MB in the end (delta: -76.9MB). Peak memory consumption was 63.5MB. 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: 571]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L7] int m_Protocol = 1; [L8] int m_msg_2 = 2; [L9] int m_recv_ack_2 = 3; [L10] int m_msg_1_1 = 4; [L11] int m_msg_1_2 = 5; [L12] int m_recv_ack_1_1 = 6; [L13] int m_recv_ack_1_2 = 7; [L18] int q = 0; [L19] int method_id; [L22] int this_expect = 0; [L23] int this_buffer_empty = 0; VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=0, this_buffer_empty=0, this_expect=0] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=0, this_buffer_empty=0, this_expect=0] [L45] COND TRUE q == 0 [L46] COND TRUE __VERIFIER_nondet_int() [L50] method_id = 1 VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, q=0, this_buffer_empty=0, this_expect=0] [L52] COND FALSE !(0) [L56] q = 1 [L58] this_expect=0 [L58] this_buffer_empty=1 VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, q=1, this_buffer_empty=1, this_expect=0] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, q=1, this_buffer_empty=1, this_expect=0] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, q=1, this_buffer_empty=1, this_expect=0] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=0] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=1] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=1] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=1] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=1] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=1] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=1] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P3=2, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=1] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=1] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=1] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=1] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=1] [L265] COND FALSE !(q == 3) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=1] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=1] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P6=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L265] COND FALSE !(q == 3) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L365] COND FALSE !(q == 4) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=2] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=2] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=2] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=2] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=2] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=3] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=3] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=3] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P3=2, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=3] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=3] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=3] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=3] [L265] COND FALSE !(q == 3) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P6=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L265] COND FALSE !(q == 3) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L365] COND FALSE !(q == 4) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=4] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=4] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=4] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=4] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=4] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=5] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=5] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=5] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=5] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=5] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=5] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P3=2, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=5] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=5] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=5] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=5] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=5] [L265] COND FALSE !(q == 3) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=5] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=5] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P6=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L265] COND FALSE !(q == 3) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L365] COND FALSE !(q == 4) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=6] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=6] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=6] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=6] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=6] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=7] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=7] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=7] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=7] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=7] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=7] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P3=2, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=7] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=7] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=7] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=7] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=7] [L265] COND FALSE !(q == 3) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=7] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=7] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P6=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L265] COND FALSE !(q == 3) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L365] COND FALSE !(q == 4) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=8] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=8] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=8] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=8] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=8] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=9] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=9] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=9] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=9] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=9] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=9] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P3=2, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=9] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=9] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=9] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=9] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=9] [L265] COND FALSE !(q == 3) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=9] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=9] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P6=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L265] COND FALSE !(q == 3) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L365] COND FALSE !(q == 4) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=10] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=10] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=10] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=10] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=10] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=11] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=11] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=11] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=11] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=11] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=11] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P3=2, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=11] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=11] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=11] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=11] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=11] [L265] COND FALSE !(q == 3) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=11] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=11] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P6=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L265] COND FALSE !(q == 3) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L365] COND FALSE !(q == 4) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=12] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=12] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=12] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=12] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=12] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=13] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=13] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=13] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=13] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=13] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=13] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P3=2, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=13] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=13] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=13] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=13] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=13] [L265] COND FALSE !(q == 3) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=13] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=13] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P6=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L265] COND FALSE !(q == 3) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L365] COND FALSE !(q == 4) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=14] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=14] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=14] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=14] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=14] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=15] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=15] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=15] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=15] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=15] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=15] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P3=2, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=15] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=15] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=15] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=15] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=15] [L265] COND FALSE !(q == 3) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=15] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=15] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P6=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L265] COND FALSE !(q == 3) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L365] COND FALSE !(q == 4) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=16] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=16] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=16] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=16] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=16] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=17] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND TRUE this_expect > 16 [L41] this_expect = -16 VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=-16] [L45] COND FALSE !(q == 0) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=-16] [L65] COND FALSE !(q == 1) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=-16] [L165] COND FALSE !(q == 2) VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=-16] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=-16] [L288] COND TRUE (((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2)))) VAL [P1=0, P3=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=-16] [L571] reach_error() VAL [P1=0, P3=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=-16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 20, TraceHistogramMax: 35, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8976 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8976 mSDsluCounter, 23997 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19977 mSDsCounter, 471 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3447 IncrementalHoareTripleChecker+Invalid, 3918 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 471 mSolverCounterUnsat, 4020 mSDtfsCounter, 3447 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2058 GetRequests, 1893 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1472occurred in iteration=19, InterpolantAutomatonStates: 165, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 253 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 1487 NumberOfCodeBlocks, 1487 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2001 ConstructedInterpolants, 0 QuantifiedInterpolants, 13744 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1944 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 31 InterpolantComputations, 7 PerfectInterpolantSequences, 908/4418 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-22 18:11:16,880 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...