./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/psyco/psyco_abp_1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/psyco/psyco_abp_1-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39adc6d5c92d5d4be7746cac0afbcc96f3b450588f18f3eb2d03a3ab1e20a3ef --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 04:34:05,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 04:34:05,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 04:34:05,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 04:34:05,188 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 04:34:05,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 04:34:05,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 04:34:05,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 04:34:05,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 04:34:05,211 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 04:34:05,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 04:34:05,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 04:34:05,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 04:34:05,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 04:34:05,215 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 04:34:05,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 04:34:05,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 04:34:05,216 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 04:34:05,217 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 04:34:05,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 04:34:05,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 04:34:05,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 04:34:05,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 04:34:05,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 04:34:05,221 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 04:34:05,221 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 04:34:05,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 04:34:05,222 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 04:34:05,222 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 04:34:05,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 04:34:05,223 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 04:34:05,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 04:34:05,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 04:34:05,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 04:34:05,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 04:34:05,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 04:34:05,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 04:34:05,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 04:34:05,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 04:34:05,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 04:34:05,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 04:34:05,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 04:34:05,226 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 39adc6d5c92d5d4be7746cac0afbcc96f3b450588f18f3eb2d03a3ab1e20a3ef [2024-11-16 04:34:05,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 04:34:05,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 04:34:05,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 04:34:05,462 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 04:34:05,463 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 04:34:05,464 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_abp_1-1.c [2024-11-16 04:34:06,795 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 04:34:06,986 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 04:34:06,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c [2024-11-16 04:34:06,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c5be28c/eff25b6d454a45b1a333977b01556668/FLAG2b0dddfcb [2024-11-16 04:34:07,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c5be28c/eff25b6d454a45b1a333977b01556668 [2024-11-16 04:34:07,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 04:34:07,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 04:34:07,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 04:34:07,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 04:34:07,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 04:34:07,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:34:07" (1/1) ... [2024-11-16 04:34:07,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca0eb9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:07, skipping insertion in model container [2024-11-16 04:34:07,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:34:07" (1/1) ... [2024-11-16 04:34:07,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 04:34:07,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831] [2024-11-16 04:34:07,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 04:34:07,350 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 04:34:07,393 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831] [2024-11-16 04:34:07,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 04:34:07,411 INFO L204 MainTranslator]: Completed translation [2024-11-16 04:34:07,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:07 WrapperNode [2024-11-16 04:34:07,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 04:34:07,412 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 04:34:07,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 04:34:07,413 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 04:34:07,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:07" (1/1) ... [2024-11-16 04:34:07,436 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:07" (1/1) ... [2024-11-16 04:34:07,477 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 457 [2024-11-16 04:34:07,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 04:34:07,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 04:34:07,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 04:34:07,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 04:34:07,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:07" (1/1) ... [2024-11-16 04:34:07,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:07" (1/1) ... [2024-11-16 04:34:07,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:07" (1/1) ... [2024-11-16 04:34:07,525 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]. [2024-11-16 04:34:07,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:07" (1/1) ... [2024-11-16 04:34:07,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:07" (1/1) ... [2024-11-16 04:34:07,540 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:07" (1/1) ... [2024-11-16 04:34:07,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:07" (1/1) ... [2024-11-16 04:34:07,545 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:07" (1/1) ... [2024-11-16 04:34:07,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:07" (1/1) ... [2024-11-16 04:34:07,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 04:34:07,555 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 04:34:07,555 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 04:34:07,555 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 04:34:07,556 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:07" (1/1) ... [2024-11-16 04:34:07,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 04:34:07,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:34:07,586 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) [2024-11-16 04:34:07,590 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 [2024-11-16 04:34:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 04:34:07,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 04:34:07,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 04:34:07,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 04:34:07,702 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 04:34:07,704 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 04:34:08,244 INFO L? ?]: Removed 289 outVars from TransFormulas that were not future-live. [2024-11-16 04:34:08,244 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 04:34:08,257 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 04:34:08,257 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 04:34:08,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:34:08 BoogieIcfgContainer [2024-11-16 04:34:08,258 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 04:34:08,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 04:34:08,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 04:34:08,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 04:34:08,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:34:07" (1/3) ... [2024-11-16 04:34:08,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f7b2df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:34:08, skipping insertion in model container [2024-11-16 04:34:08,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:34:07" (2/3) ... [2024-11-16 04:34:08,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f7b2df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:34:08, skipping insertion in model container [2024-11-16 04:34:08,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:34:08" (3/3) ... [2024-11-16 04:34:08,265 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2024-11-16 04:34:08,278 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 04:34:08,278 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 04:34:08,327 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 04:34:08,332 INFO L333 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, 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;@68ac3243, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 04:34:08,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 04:34:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 111 states have (on average 1.927927927927928) internal successors, (214), 112 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:08,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 04:34:08,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:08,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:34:08,342 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:08,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:08,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1953855060, now seen corresponding path program 1 times [2024-11-16 04:34:08,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:08,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734444942] [2024-11-16 04:34:08,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:08,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:08,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:08,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:08,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734444942] [2024-11-16 04:34:08,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734444942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:34:08,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:34:08,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:34:08,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802969434] [2024-11-16 04:34:08,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:34:08,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:34:08,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:08,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:34:08,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:34:08,515 INFO L87 Difference]: Start difference. First operand has 113 states, 111 states have (on average 1.927927927927928) internal successors, (214), 112 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:08,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:08,765 INFO L93 Difference]: Finished difference Result 326 states and 630 transitions. [2024-11-16 04:34:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:34:08,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2024-11-16 04:34:08,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:08,775 INFO L225 Difference]: With dead ends: 326 [2024-11-16 04:34:08,775 INFO L226 Difference]: Without dead ends: 194 [2024-11-16 04:34:08,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:34:08,779 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 136 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:08,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 307 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 04:34:08,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-16 04:34:08,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2024-11-16 04:34:08,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6888888888888889) internal successors, (304), 180 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:08,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 304 transitions. [2024-11-16 04:34:08,811 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 304 transitions. Word has length 12 [2024-11-16 04:34:08,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:08,811 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 304 transitions. [2024-11-16 04:34:08,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 304 transitions. [2024-11-16 04:34:08,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-16 04:34:08,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:08,813 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:34:08,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 04:34:08,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:08,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:08,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1550673184, now seen corresponding path program 1 times [2024-11-16 04:34:08,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:08,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002462139] [2024-11-16 04:34:08,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:08,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:08,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:08,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002462139] [2024-11-16 04:34:08,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002462139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:34:08,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:34:08,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:34:08,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663497046] [2024-11-16 04:34:08,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:34:08,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:34:08,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:08,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:34:08,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:34:08,873 INFO L87 Difference]: Start difference. First operand 181 states and 304 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:08,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:08,903 INFO L93 Difference]: Finished difference Result 369 states and 618 transitions. [2024-11-16 04:34:08,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:34:08,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-11-16 04:34:08,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:08,904 INFO L225 Difference]: With dead ends: 369 [2024-11-16 04:34:08,904 INFO L226 Difference]: Without dead ends: 190 [2024-11-16 04:34:08,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:34:08,906 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 5 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:08,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 337 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 04:34:08,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-16 04:34:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-16 04:34:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.6613756613756614) internal successors, (314), 189 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 314 transitions. [2024-11-16 04:34:08,915 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 314 transitions. Word has length 13 [2024-11-16 04:34:08,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:08,915 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 314 transitions. [2024-11-16 04:34:08,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 314 transitions. [2024-11-16 04:34:08,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-16 04:34:08,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:08,917 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:34:08,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 04:34:08,918 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:08,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:08,918 INFO L85 PathProgramCache]: Analyzing trace with hash 679636942, now seen corresponding path program 1 times [2024-11-16 04:34:08,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:08,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493037824] [2024-11-16 04:34:08,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:08,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:09,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:09,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493037824] [2024-11-16 04:34:09,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493037824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:34:09,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:34:09,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 04:34:09,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226375979] [2024-11-16 04:34:09,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:34:09,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 04:34:09,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:09,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 04:34:09,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 04:34:09,131 INFO L87 Difference]: Start difference. First operand 190 states and 314 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:09,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:09,247 INFO L93 Difference]: Finished difference Result 283 states and 460 transitions. [2024-11-16 04:34:09,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 04:34:09,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-16 04:34:09,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:09,249 INFO L225 Difference]: With dead ends: 283 [2024-11-16 04:34:09,249 INFO L226 Difference]: Without dead ends: 275 [2024-11-16 04:34:09,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 04:34:09,250 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 115 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:09,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 393 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 04:34:09,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-16 04:34:09,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2024-11-16 04:34:09,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.65) internal successors, (429), 260 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:09,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 429 transitions. [2024-11-16 04:34:09,262 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 429 transitions. Word has length 20 [2024-11-16 04:34:09,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:09,262 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 429 transitions. [2024-11-16 04:34:09,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:09,263 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 429 transitions. [2024-11-16 04:34:09,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-16 04:34:09,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:09,263 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:34:09,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 04:34:09,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:09,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:09,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1590007687, now seen corresponding path program 1 times [2024-11-16 04:34:09,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:09,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033813819] [2024-11-16 04:34:09,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:09,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:09,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:09,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:09,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033813819] [2024-11-16 04:34:09,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033813819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:34:09,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:34:09,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:34:09,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542006830] [2024-11-16 04:34:09,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:34:09,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:34:09,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:09,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:34:09,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:34:09,309 INFO L87 Difference]: Start difference. First operand 261 states and 429 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) [2024-11-16 04:34:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:09,330 INFO L93 Difference]: Finished difference Result 402 states and 654 transitions. [2024-11-16 04:34:09,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:34:09,330 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 21 [2024-11-16 04:34:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:09,331 INFO L225 Difference]: With dead ends: 402 [2024-11-16 04:34:09,331 INFO L226 Difference]: Without dead ends: 144 [2024-11-16 04:34:09,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:34:09,332 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 34 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:09,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 312 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 04:34:09,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-16 04:34:09,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2024-11-16 04:34:09,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.5857142857142856) internal successors, (222), 140 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:09,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 222 transitions. [2024-11-16 04:34:09,337 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 222 transitions. Word has length 21 [2024-11-16 04:34:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:09,338 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 222 transitions. [2024-11-16 04:34:09,338 INFO L472 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) [2024-11-16 04:34:09,338 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 222 transitions. [2024-11-16 04:34:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-16 04:34:09,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:09,339 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:34:09,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 04:34:09,339 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:09,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:09,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2023311320, now seen corresponding path program 1 times [2024-11-16 04:34:09,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:09,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902312896] [2024-11-16 04:34:09,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:09,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:09,401 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:09,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:09,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902312896] [2024-11-16 04:34:09,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902312896] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 04:34:09,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874230092] [2024-11-16 04:34:09,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:09,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:09,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:34:09,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 04:34:09,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 04:34:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:09,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 04:34:09,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:34:09,496 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 04:34:09,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 04:34:09,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874230092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:34:09,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 04:34:09,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-16 04:34:09,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101223829] [2024-11-16 04:34:09,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:34:09,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:34:09,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:09,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:34:09,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 04:34:09,499 INFO L87 Difference]: Start difference. First operand 141 states and 222 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:09,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:09,518 INFO L93 Difference]: Finished difference Result 254 states and 400 transitions. [2024-11-16 04:34:09,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:34:09,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 28 [2024-11-16 04:34:09,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:09,519 INFO L225 Difference]: With dead ends: 254 [2024-11-16 04:34:09,519 INFO L226 Difference]: Without dead ends: 121 [2024-11-16 04:34:09,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 04:34:09,520 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 102 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:09,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 185 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 04:34:09,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-16 04:34:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2024-11-16 04:34:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 117 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 182 transitions. [2024-11-16 04:34:09,525 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 182 transitions. Word has length 28 [2024-11-16 04:34:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:09,525 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 182 transitions. [2024-11-16 04:34:09,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:09,525 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 182 transitions. [2024-11-16 04:34:09,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-16 04:34:09,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:09,526 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:34:09,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 04:34:09,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:09,731 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:09,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:09,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1987316991, now seen corresponding path program 1 times [2024-11-16 04:34:09,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:09,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270032827] [2024-11-16 04:34:09,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:09,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:09,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:09,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270032827] [2024-11-16 04:34:09,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270032827] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 04:34:09,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801425207] [2024-11-16 04:34:09,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:09,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:09,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:34:09,786 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 04:34:09,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 04:34:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:09,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 04:34:09,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:34:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:09,902 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 04:34:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:09,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801425207] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 04:34:09,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 04:34:09,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-16 04:34:09,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696668629] [2024-11-16 04:34:09,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 04:34:09,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 04:34:09,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:09,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 04:34:09,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-16 04:34:09,933 INFO L87 Difference]: Start difference. First operand 118 states and 182 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:10,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:10,073 INFO L93 Difference]: Finished difference Result 472 states and 764 transitions. [2024-11-16 04:34:10,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 04:34:10,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 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 30 [2024-11-16 04:34:10,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:10,075 INFO L225 Difference]: With dead ends: 472 [2024-11-16 04:34:10,075 INFO L226 Difference]: Without dead ends: 373 [2024-11-16 04:34:10,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-16 04:34:10,077 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 716 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:10,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 645 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 04:34:10,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-16 04:34:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 322. [2024-11-16 04:34:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 321 states have (on average 1.6853582554517135) internal successors, (541), 321 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 541 transitions. [2024-11-16 04:34:10,093 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 541 transitions. Word has length 30 [2024-11-16 04:34:10,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:10,093 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 541 transitions. [2024-11-16 04:34:10,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 541 transitions. [2024-11-16 04:34:10,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-16 04:34:10,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:10,096 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:34:10,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 04:34:10,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 04:34:10,297 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:10,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:10,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1790803486, now seen corresponding path program 1 times [2024-11-16 04:34:10,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:10,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268975376] [2024-11-16 04:34:10,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:10,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:10,351 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:10,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:10,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268975376] [2024-11-16 04:34:10,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268975376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 04:34:10,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979679849] [2024-11-16 04:34:10,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:10,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:10,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:34:10,355 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 04:34:10,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 04:34:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:10,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 04:34:10,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:34:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:10,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 04:34:10,461 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:10,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979679849] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 04:34:10,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 04:34:10,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-16 04:34:10,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101750959] [2024-11-16 04:34:10,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 04:34:10,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 04:34:10,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:10,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 04:34:10,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 04:34:10,463 INFO L87 Difference]: Start difference. First operand 322 states and 541 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:10,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:10,568 INFO L93 Difference]: Finished difference Result 616 states and 1046 transitions. [2024-11-16 04:34:10,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 04:34:10,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-16 04:34:10,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:10,570 INFO L225 Difference]: With dead ends: 616 [2024-11-16 04:34:10,570 INFO L226 Difference]: Without dead ends: 603 [2024-11-16 04:34:10,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 04:34:10,571 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 244 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:10,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 574 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 04:34:10,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-16 04:34:10,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 593. [2024-11-16 04:34:10,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 592 states have (on average 1.6672297297297298) internal successors, (987), 592 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 987 transitions. [2024-11-16 04:34:10,580 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 987 transitions. Word has length 30 [2024-11-16 04:34:10,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:10,580 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 987 transitions. [2024-11-16 04:34:10,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:10,580 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 987 transitions. [2024-11-16 04:34:10,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-16 04:34:10,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:10,581 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:34:10,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 04:34:10,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:10,782 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:10,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:10,782 INFO L85 PathProgramCache]: Analyzing trace with hash -271717653, now seen corresponding path program 1 times [2024-11-16 04:34:10,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:10,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810325709] [2024-11-16 04:34:10,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:10,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:10,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:11,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:11,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810325709] [2024-11-16 04:34:11,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810325709] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 04:34:11,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048002733] [2024-11-16 04:34:11,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:11,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:11,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:34:11,014 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 04:34:11,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 04:34:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:11,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 04:34:11,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:34:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:11,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 04:34:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:11,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048002733] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 04:34:11,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 04:34:11,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-16 04:34:11,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663058870] [2024-11-16 04:34:11,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 04:34:11,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 04:34:11,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:11,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 04:34:11,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 04:34:11,268 INFO L87 Difference]: Start difference. First operand 593 states and 987 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) [2024-11-16 04:34:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:11,428 INFO L93 Difference]: Finished difference Result 770 states and 1271 transitions. [2024-11-16 04:34:11,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 04:34:11,429 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 31 [2024-11-16 04:34:11,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:11,431 INFO L225 Difference]: With dead ends: 770 [2024-11-16 04:34:11,431 INFO L226 Difference]: Without dead ends: 752 [2024-11-16 04:34:11,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 04:34:11,432 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 247 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:11,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1251 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 04:34:11,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-11-16 04:34:11,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 735. [2024-11-16 04:34:11,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 734 states have (on average 1.6553133514986376) internal successors, (1215), 734 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1215 transitions. [2024-11-16 04:34:11,443 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1215 transitions. Word has length 31 [2024-11-16 04:34:11,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:11,443 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1215 transitions. [2024-11-16 04:34:11,444 INFO L472 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) [2024-11-16 04:34:11,445 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1215 transitions. [2024-11-16 04:34:11,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-16 04:34:11,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:11,447 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:34:11,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 04:34:11,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:11,648 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:11,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:11,648 INFO L85 PathProgramCache]: Analyzing trace with hash 677090825, now seen corresponding path program 1 times [2024-11-16 04:34:11,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:11,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464256028] [2024-11-16 04:34:11,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:11,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 04:34:11,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:11,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464256028] [2024-11-16 04:34:11,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464256028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:34:11,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:34:11,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:34:11,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857630859] [2024-11-16 04:34:11,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:34:11,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:34:11,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:11,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:34:11,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:34:11,683 INFO L87 Difference]: Start difference. First operand 735 states and 1215 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:11,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:11,706 INFO L93 Difference]: Finished difference Result 1385 states and 2268 transitions. [2024-11-16 04:34:11,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:34:11,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 32 [2024-11-16 04:34:11,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:11,709 INFO L225 Difference]: With dead ends: 1385 [2024-11-16 04:34:11,710 INFO L226 Difference]: Without dead ends: 678 [2024-11-16 04:34:11,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:34:11,712 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 34 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:11,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 250 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 04:34:11,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-11-16 04:34:11,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 675. [2024-11-16 04:34:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 1.599406528189911) internal successors, (1078), 674 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:11,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1078 transitions. [2024-11-16 04:34:11,736 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1078 transitions. Word has length 32 [2024-11-16 04:34:11,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:11,736 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 1078 transitions. [2024-11-16 04:34:11,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1078 transitions. [2024-11-16 04:34:11,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 04:34:11,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:11,739 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:34:11,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 04:34:11,739 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:11,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:11,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1877772037, now seen corresponding path program 1 times [2024-11-16 04:34:11,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:11,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092789287] [2024-11-16 04:34:11,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:11,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-16 04:34:11,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:11,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092789287] [2024-11-16 04:34:11,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092789287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:34:11,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:34:11,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:34:11,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513662649] [2024-11-16 04:34:11,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:34:11,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:34:11,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:11,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:34:11,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:34:11,793 INFO L87 Difference]: Start difference. First operand 675 states and 1078 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:11,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:11,816 INFO L93 Difference]: Finished difference Result 1305 states and 2095 transitions. [2024-11-16 04:34:11,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:34:11,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-16 04:34:11,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:11,819 INFO L225 Difference]: With dead ends: 1305 [2024-11-16 04:34:11,819 INFO L226 Difference]: Without dead ends: 678 [2024-11-16 04:34:11,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:34:11,820 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 69 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 218 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 [2024-11-16 04:34:11,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 218 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 04:34:11,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-11-16 04:34:11,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 675. [2024-11-16 04:34:11,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 1.5875370919881306) internal successors, (1070), 674 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1070 transitions. [2024-11-16 04:34:11,833 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1070 transitions. Word has length 41 [2024-11-16 04:34:11,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:11,833 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 1070 transitions. [2024-11-16 04:34:11,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:11,834 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1070 transitions. [2024-11-16 04:34:11,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-16 04:34:11,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:11,835 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-11-16 04:34:11,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 04:34:11,835 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:11,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:11,836 INFO L85 PathProgramCache]: Analyzing trace with hash 734552282, now seen corresponding path program 1 times [2024-11-16 04:34:11,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:11,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001783955] [2024-11-16 04:34:11,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:11,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:12,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:12,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001783955] [2024-11-16 04:34:12,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001783955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 04:34:12,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856439900] [2024-11-16 04:34:12,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:12,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:12,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:34:12,100 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 04:34:12,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 04:34:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:12,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 04:34:12,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:34:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 04:34:12,235 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 04:34:12,440 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 04:34:12,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856439900] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 04:34:12,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 04:34:12,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-16 04:34:12,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540216282] [2024-11-16 04:34:12,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 04:34:12,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 04:34:12,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:12,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 04:34:12,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-16 04:34:12,444 INFO L87 Difference]: Start difference. First operand 675 states and 1070 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:12,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:12,791 INFO L93 Difference]: Finished difference Result 1583 states and 2519 transitions. [2024-11-16 04:34:12,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 04:34:12,792 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-16 04:34:12,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:12,794 INFO L225 Difference]: With dead ends: 1583 [2024-11-16 04:34:12,794 INFO L226 Difference]: Without dead ends: 933 [2024-11-16 04:34:12,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-16 04:34:12,795 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 547 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:12,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 952 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 04:34:12,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2024-11-16 04:34:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 901. [2024-11-16 04:34:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.5755555555555556) internal successors, (1418), 900 states have internal predecessors, (1418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:12,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1418 transitions. [2024-11-16 04:34:12,807 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1418 transitions. Word has length 42 [2024-11-16 04:34:12,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:12,807 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1418 transitions. [2024-11-16 04:34:12,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:12,807 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1418 transitions. [2024-11-16 04:34:12,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-16 04:34:12,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:12,808 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-11-16 04:34:12,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-16 04:34:13,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-16 04:34:13,009 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:13,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:13,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1344163238, now seen corresponding path program 1 times [2024-11-16 04:34:13,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:13,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128148453] [2024-11-16 04:34:13,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:13,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 04:34:13,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:13,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128148453] [2024-11-16 04:34:13,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128148453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 04:34:13,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645936949] [2024-11-16 04:34:13,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:13,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:13,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:34:13,066 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 04:34:13,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-16 04:34:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:13,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 04:34:13,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:34:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 04:34:13,157 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 04:34:13,188 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 04:34:13,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645936949] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 04:34:13,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 04:34:13,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-16 04:34:13,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892095442] [2024-11-16 04:34:13,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 04:34:13,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 04:34:13,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:13,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 04:34:13,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 04:34:13,190 INFO L87 Difference]: Start difference. First operand 901 states and 1418 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:13,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:13,270 INFO L93 Difference]: Finished difference Result 914 states and 1430 transitions. [2024-11-16 04:34:13,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 04:34:13,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-16 04:34:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:13,273 INFO L225 Difference]: With dead ends: 914 [2024-11-16 04:34:13,273 INFO L226 Difference]: Without dead ends: 901 [2024-11-16 04:34:13,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 04:34:13,274 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 192 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:13,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 443 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 04:34:13,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2024-11-16 04:34:13,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2024-11-16 04:34:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.528888888888889) internal successors, (1376), 900 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1376 transitions. [2024-11-16 04:34:13,286 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1376 transitions. Word has length 43 [2024-11-16 04:34:13,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:13,286 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1376 transitions. [2024-11-16 04:34:13,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:13,287 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1376 transitions. [2024-11-16 04:34:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-16 04:34:13,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:13,287 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1, 1] [2024-11-16 04:34:13,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-16 04:34:13,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:13,492 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:13,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:13,493 INFO L85 PathProgramCache]: Analyzing trace with hash 487462298, now seen corresponding path program 1 times [2024-11-16 04:34:13,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:13,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810831538] [2024-11-16 04:34:13,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:13,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:13,747 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:13,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:13,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810831538] [2024-11-16 04:34:13,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810831538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 04:34:13,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162768463] [2024-11-16 04:34:13,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:13,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:13,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:34:13,749 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 04:34:13,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-16 04:34:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:13,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 04:34:13,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:34:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:13,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 04:34:14,140 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:14,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162768463] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 04:34:14,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 04:34:14,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-16 04:34:14,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107345380] [2024-11-16 04:34:14,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 04:34:14,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 04:34:14,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:14,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 04:34:14,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 04:34:14,142 INFO L87 Difference]: Start difference. First operand 901 states and 1376 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:14,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:14,237 INFO L93 Difference]: Finished difference Result 925 states and 1408 transitions. [2024-11-16 04:34:14,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 04:34:14,237 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 45 [2024-11-16 04:34:14,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:14,240 INFO L225 Difference]: With dead ends: 925 [2024-11-16 04:34:14,240 INFO L226 Difference]: Without dead ends: 922 [2024-11-16 04:34:14,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 04:34:14,241 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 146 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:14,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 699 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 04:34:14,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-16 04:34:14,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 901. [2024-11-16 04:34:14,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.5277777777777777) internal successors, (1375), 900 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1375 transitions. [2024-11-16 04:34:14,252 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1375 transitions. Word has length 45 [2024-11-16 04:34:14,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:14,252 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1375 transitions. [2024-11-16 04:34:14,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:14,253 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1375 transitions. [2024-11-16 04:34:14,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-16 04:34:14,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:14,253 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1] [2024-11-16 04:34:14,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-16 04:34:14,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:14,454 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:14,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:14,455 INFO L85 PathProgramCache]: Analyzing trace with hash -826934184, now seen corresponding path program 1 times [2024-11-16 04:34:14,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:14,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847323636] [2024-11-16 04:34:14,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:14,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:14,480 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-16 04:34:14,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:14,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847323636] [2024-11-16 04:34:14,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847323636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:34:14,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:34:14,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:34:14,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127861292] [2024-11-16 04:34:14,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:34:14,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:34:14,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:14,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:34:14,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:34:14,482 INFO L87 Difference]: Start difference. First operand 901 states and 1375 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:14,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:14,528 INFO L93 Difference]: Finished difference Result 1831 states and 2765 transitions. [2024-11-16 04:34:14,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:34:14,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-11-16 04:34:14,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:14,531 INFO L225 Difference]: With dead ends: 1831 [2024-11-16 04:34:14,531 INFO L226 Difference]: Without dead ends: 978 [2024-11-16 04:34:14,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:34:14,533 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 33 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:14,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 250 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 04:34:14,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-11-16 04:34:14,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 975. [2024-11-16 04:34:14,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 974 states have (on average 1.4774127310061602) internal successors, (1439), 974 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:14,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1439 transitions. [2024-11-16 04:34:14,546 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1439 transitions. Word has length 46 [2024-11-16 04:34:14,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:14,546 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1439 transitions. [2024-11-16 04:34:14,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:14,547 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1439 transitions. [2024-11-16 04:34:14,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-16 04:34:14,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:14,547 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:34:14,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 04:34:14,547 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:14,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:14,547 INFO L85 PathProgramCache]: Analyzing trace with hash -2034605559, now seen corresponding path program 1 times [2024-11-16 04:34:14,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:14,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252309274] [2024-11-16 04:34:14,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:14,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:14,581 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-16 04:34:14,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:14,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252309274] [2024-11-16 04:34:14,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252309274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:34:14,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:34:14,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:34:14,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832060177] [2024-11-16 04:34:14,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:34:14,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:34:14,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:14,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:34:14,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:34:14,583 INFO L87 Difference]: Start difference. First operand 975 states and 1439 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:14,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:14,604 INFO L93 Difference]: Finished difference Result 1411 states and 2077 transitions. [2024-11-16 04:34:14,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:34:14,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-16 04:34:14,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:14,607 INFO L225 Difference]: With dead ends: 1411 [2024-11-16 04:34:14,607 INFO L226 Difference]: Without dead ends: 546 [2024-11-16 04:34:14,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:34:14,608 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 31 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:14,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 208 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 04:34:14,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-16 04:34:14,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 543. [2024-11-16 04:34:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 1.4409594095940959) internal successors, (781), 542 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 781 transitions. [2024-11-16 04:34:14,616 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 781 transitions. Word has length 59 [2024-11-16 04:34:14,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:14,616 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 781 transitions. [2024-11-16 04:34:14,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 781 transitions. [2024-11-16 04:34:14,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-16 04:34:14,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:14,616 INFO L215 NwaCegarLoop]: trace histogram [5, 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, 1] [2024-11-16 04:34:14,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 04:34:14,617 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:14,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:14,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1163038295, now seen corresponding path program 1 times [2024-11-16 04:34:14,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:14,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331968782] [2024-11-16 04:34:14,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:14,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:14,746 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 31 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 04:34:14,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:14,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331968782] [2024-11-16 04:34:14,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331968782] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 04:34:14,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562061219] [2024-11-16 04:34:14,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:14,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:14,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:34:14,748 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 04:34:14,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-16 04:34:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:14,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 04:34:14,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:34:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 04:34:14,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 04:34:14,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562061219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:34:14,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 04:34:14,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-16 04:34:14,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770765025] [2024-11-16 04:34:14,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:34:14,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 04:34:14,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:14,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 04:34:14,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 04:34:14,887 INFO L87 Difference]: Start difference. First operand 543 states and 781 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:14,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:14,929 INFO L93 Difference]: Finished difference Result 547 states and 784 transitions. [2024-11-16 04:34:14,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 04:34:14,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-16 04:34:14,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:14,931 INFO L225 Difference]: With dead ends: 547 [2024-11-16 04:34:14,931 INFO L226 Difference]: Without dead ends: 543 [2024-11-16 04:34:14,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 04:34:14,932 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 173 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:14,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 386 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 04:34:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-16 04:34:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2024-11-16 04:34:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 1.437269372693727) internal successors, (779), 542 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 779 transitions. [2024-11-16 04:34:14,942 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 779 transitions. Word has length 61 [2024-11-16 04:34:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:14,943 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 779 transitions. [2024-11-16 04:34:14,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 779 transitions. [2024-11-16 04:34:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-16 04:34:14,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:14,943 INFO L215 NwaCegarLoop]: trace histogram [5, 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, 1, 1] [2024-11-16 04:34:14,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-16 04:34:15,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-16 04:34:15,148 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:15,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:15,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1645732770, now seen corresponding path program 1 times [2024-11-16 04:34:15,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:15,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886255486] [2024-11-16 04:34:15,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:15,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:15,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:15,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886255486] [2024-11-16 04:34:15,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886255486] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 04:34:15,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490896253] [2024-11-16 04:34:15,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:15,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:15,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:34:15,372 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 04:34:15,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-16 04:34:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:15,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 04:34:15,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:34:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:15,565 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 04:34:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:15,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490896253] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 04:34:15,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 04:34:15,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-16 04:34:15,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527612372] [2024-11-16 04:34:15,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 04:34:15,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 04:34:15,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:15,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 04:34:15,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-16 04:34:15,832 INFO L87 Difference]: Start difference. First operand 543 states and 779 transitions. Second operand has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 11 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:15,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:15,944 INFO L93 Difference]: Finished difference Result 613 states and 874 transitions. [2024-11-16 04:34:15,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 04:34:15,944 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 11 states have internal predecessors, (122), 0 states have call successors, (0), 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 [2024-11-16 04:34:15,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:15,946 INFO L225 Difference]: With dead ends: 613 [2024-11-16 04:34:15,946 INFO L226 Difference]: Without dead ends: 610 [2024-11-16 04:34:15,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-16 04:34:15,947 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 170 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:15,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 891 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 04:34:15,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-16 04:34:15,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-16 04:34:15,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 609 states have (on average 1.4269293924466337) internal successors, (869), 609 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 869 transitions. [2024-11-16 04:34:15,957 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 869 transitions. Word has length 62 [2024-11-16 04:34:15,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:15,958 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 869 transitions. [2024-11-16 04:34:15,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.090909090909092) internal successors, (122), 11 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:15,958 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 869 transitions. [2024-11-16 04:34:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-16 04:34:15,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:15,958 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1, 1] [2024-11-16 04:34:15,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-16 04:34:16,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-16 04:34:16,160 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:16,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:16,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1866464873, now seen corresponding path program 1 times [2024-11-16 04:34:16,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:16,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137143266] [2024-11-16 04:34:16,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:16,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:16,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:16,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137143266] [2024-11-16 04:34:16,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137143266] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 04:34:16,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926259258] [2024-11-16 04:34:16,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:16,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:16,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:34:16,418 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 04:34:16,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-16 04:34:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:16,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-16 04:34:16,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:34:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:16,644 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 04:34:16,832 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 52 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-16 04:34:16,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926259258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 04:34:16,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 04:34:16,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 12 [2024-11-16 04:34:16,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825528643] [2024-11-16 04:34:16,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 04:34:16,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 04:34:16,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:16,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 04:34:16,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-16 04:34:16,834 INFO L87 Difference]: Start difference. First operand 610 states and 869 transitions. Second operand has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:17,098 INFO L93 Difference]: Finished difference Result 709 states and 1010 transitions. [2024-11-16 04:34:17,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 04:34:17,098 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-16 04:34:17,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:17,100 INFO L225 Difference]: With dead ends: 709 [2024-11-16 04:34:17,100 INFO L226 Difference]: Without dead ends: 698 [2024-11-16 04:34:17,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-16 04:34:17,101 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 245 mSDsluCounter, 2018 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 2259 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:17,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 2259 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 04:34:17,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-16 04:34:17,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-11-16 04:34:17,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.3974175035868006) internal successors, (974), 697 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:17,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 974 transitions. [2024-11-16 04:34:17,110 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 974 transitions. Word has length 70 [2024-11-16 04:34:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:17,110 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 974 transitions. [2024-11-16 04:34:17,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 974 transitions. [2024-11-16 04:34:17,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-16 04:34:17,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:17,111 INFO L215 NwaCegarLoop]: trace histogram [8, 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, 1, 1] [2024-11-16 04:34:17,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-16 04:34:17,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-16 04:34:17,316 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:17,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:17,316 INFO L85 PathProgramCache]: Analyzing trace with hash 254273521, now seen corresponding path program 1 times [2024-11-16 04:34:17,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:17,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7504636] [2024-11-16 04:34:17,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:17,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 28 proven. 129 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 04:34:17,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:17,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7504636] [2024-11-16 04:34:17,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7504636] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 04:34:17,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468090899] [2024-11-16 04:34:17,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:17,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:17,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:34:17,631 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 04:34:17,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-16 04:34:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:17,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-16 04:34:17,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:34:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 28 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:17,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 04:34:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 61 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:18,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468090899] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 04:34:18,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 04:34:18,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2024-11-16 04:34:18,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69391074] [2024-11-16 04:34:18,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 04:34:18,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-16 04:34:18,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:18,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-16 04:34:18,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-11-16 04:34:18,425 INFO L87 Difference]: Start difference. First operand 698 states and 974 transitions. Second operand has 21 states, 21 states have (on average 11.571428571428571) internal successors, (243), 21 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:18,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:18,689 INFO L93 Difference]: Finished difference Result 701 states and 976 transitions. [2024-11-16 04:34:18,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 04:34:18,690 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 11.571428571428571) internal successors, (243), 21 states have internal predecessors, (243), 0 states have call successors, (0), 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 95 [2024-11-16 04:34:18,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:18,692 INFO L225 Difference]: With dead ends: 701 [2024-11-16 04:34:18,692 INFO L226 Difference]: Without dead ends: 698 [2024-11-16 04:34:18,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2024-11-16 04:34:18,693 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 323 mSDsluCounter, 2105 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 2314 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:18,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 2314 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 04:34:18,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-16 04:34:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-11-16 04:34:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.39454806312769) internal successors, (972), 697 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:18,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 972 transitions. [2024-11-16 04:34:18,701 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 972 transitions. Word has length 95 [2024-11-16 04:34:18,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:18,701 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 972 transitions. [2024-11-16 04:34:18,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 11.571428571428571) internal successors, (243), 21 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:18,702 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 972 transitions. [2024-11-16 04:34:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 04:34:18,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:18,702 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:34:18,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-16 04:34:18,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:18,903 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:18,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:18,903 INFO L85 PathProgramCache]: Analyzing trace with hash 990631969, now seen corresponding path program 1 times [2024-11-16 04:34:18,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:18,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878480584] [2024-11-16 04:34:18,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:18,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 65 proven. 143 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-16 04:34:19,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:19,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878480584] [2024-11-16 04:34:19,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878480584] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 04:34:19,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526416617] [2024-11-16 04:34:19,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:19,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:19,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:34:19,018 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 04:34:19,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-16 04:34:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:19,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 04:34:19,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:34:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 65 proven. 143 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-16 04:34:19,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 04:34:19,307 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 65 proven. 143 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-16 04:34:19,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526416617] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 04:34:19,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 04:34:19,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-16 04:34:19,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882928575] [2024-11-16 04:34:19,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 04:34:19,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 04:34:19,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:19,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 04:34:19,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-16 04:34:19,310 INFO L87 Difference]: Start difference. First operand 698 states and 972 transitions. Second operand has 13 states, 13 states have (on average 13.461538461538462) internal successors, (175), 13 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:19,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:19,417 INFO L93 Difference]: Finished difference Result 1891 states and 2647 transitions. [2024-11-16 04:34:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 04:34:19,418 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 13.461538461538462) internal successors, (175), 13 states have internal predecessors, (175), 0 states have call successors, (0), 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 111 [2024-11-16 04:34:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:19,421 INFO L225 Difference]: With dead ends: 1891 [2024-11-16 04:34:19,421 INFO L226 Difference]: Without dead ends: 1458 [2024-11-16 04:34:19,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-16 04:34:19,422 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 1265 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:19,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 1345 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 04:34:19,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2024-11-16 04:34:19,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1369. [2024-11-16 04:34:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1368 states have (on average 1.4071637426900585) internal successors, (1925), 1368 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1925 transitions. [2024-11-16 04:34:19,438 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1925 transitions. Word has length 111 [2024-11-16 04:34:19,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:19,439 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1925 transitions. [2024-11-16 04:34:19,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.461538461538462) internal successors, (175), 13 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1925 transitions. [2024-11-16 04:34:19,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 04:34:19,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:19,441 INFO L215 NwaCegarLoop]: trace histogram [13, 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, 1, 1] [2024-11-16 04:34:19,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-16 04:34:19,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:19,643 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:19,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1336808752, now seen corresponding path program 1 times [2024-11-16 04:34:19,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:19,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121035469] [2024-11-16 04:34:19,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:19,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:20,152 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 48 proven. 459 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-16 04:34:20,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:20,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121035469] [2024-11-16 04:34:20,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121035469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 04:34:20,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881216136] [2024-11-16 04:34:20,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:20,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:20,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:34:20,155 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 04:34:20,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-16 04:34:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:20,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-16 04:34:20,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:34:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 48 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:20,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 04:34:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 164 proven. 367 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:34:21,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881216136] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 04:34:21,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 04:34:21,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 32 [2024-11-16 04:34:21,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087514103] [2024-11-16 04:34:21,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 04:34:21,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-16 04:34:21,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:21,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-16 04:34:21,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2024-11-16 04:34:21,618 INFO L87 Difference]: Start difference. First operand 1369 states and 1925 transitions. Second operand has 32 states, 32 states have (on average 12.5625) internal successors, (402), 32 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:21,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:21,910 INFO L93 Difference]: Finished difference Result 1372 states and 1927 transitions. [2024-11-16 04:34:21,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-16 04:34:21,911 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 12.5625) internal successors, (402), 32 states have internal predecessors, (402), 0 states have call successors, (0), 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 162 [2024-11-16 04:34:21,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:21,914 INFO L225 Difference]: With dead ends: 1372 [2024-11-16 04:34:21,914 INFO L226 Difference]: Without dead ends: 1369 [2024-11-16 04:34:21,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 309 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2024-11-16 04:34:21,915 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 669 mSDsluCounter, 3598 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 3939 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:21,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 3939 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 04:34:21,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2024-11-16 04:34:21,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1369. [2024-11-16 04:34:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1368 states have (on average 1.404970760233918) internal successors, (1922), 1368 states have internal predecessors, (1922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1922 transitions. [2024-11-16 04:34:21,938 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1922 transitions. Word has length 162 [2024-11-16 04:34:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:21,938 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1922 transitions. [2024-11-16 04:34:21,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 12.5625) internal successors, (402), 32 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:21,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1922 transitions. [2024-11-16 04:34:21,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-16 04:34:21,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:21,941 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 15, 15, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:34:21,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-16 04:34:22,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-16 04:34:22,145 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:22,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:22,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1625878874, now seen corresponding path program 2 times [2024-11-16 04:34:22,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:22,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288050488] [2024-11-16 04:34:22,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:22,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:34:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1493 backedges. 179 proven. 1259 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-16 04:34:22,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:34:22,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288050488] [2024-11-16 04:34:22,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288050488] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 04:34:22,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211845911] [2024-11-16 04:34:22,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 04:34:22,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:22,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:34:22,790 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 04:34:22,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-16 04:34:22,980 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 04:34:22,981 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 04:34:22,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-16 04:34:22,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:34:23,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1493 backedges. 179 proven. 1259 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-16 04:34:23,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 04:34:23,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1493 backedges. 179 proven. 1259 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-16 04:34:23,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211845911] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 04:34:23,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 04:34:23,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2024-11-16 04:34:23,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530473970] [2024-11-16 04:34:23,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 04:34:23,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-16 04:34:23,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:34:23,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-16 04:34:23,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2024-11-16 04:34:23,513 INFO L87 Difference]: Start difference. First operand 1369 states and 1922 transitions. Second operand has 20 states, 20 states have (on average 17.3) internal successors, (346), 20 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:23,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:34:23,752 INFO L93 Difference]: Finished difference Result 3281 states and 4606 transitions. [2024-11-16 04:34:23,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-16 04:34:23,752 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 17.3) internal successors, (346), 20 states have internal predecessors, (346), 0 states have call successors, (0), 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 261 [2024-11-16 04:34:23,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:34:23,757 INFO L225 Difference]: With dead ends: 3281 [2024-11-16 04:34:23,757 INFO L226 Difference]: Without dead ends: 2356 [2024-11-16 04:34:23,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 515 SyntacticMatches, 9 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2024-11-16 04:34:23,759 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 2442 mSDsluCounter, 1959 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2442 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 04:34:23,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2442 Valid, 2153 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 04:34:23,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2024-11-16 04:34:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 2230. [2024-11-16 04:34:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2230 states, 2229 states have (on average 1.4069089277703006) internal successors, (3136), 2229 states have internal predecessors, (3136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 3136 transitions. [2024-11-16 04:34:23,781 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 3136 transitions. Word has length 261 [2024-11-16 04:34:23,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:34:23,781 INFO L471 AbstractCegarLoop]: Abstraction has 2230 states and 3136 transitions. [2024-11-16 04:34:23,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 17.3) internal successors, (346), 20 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:34:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 3136 transitions. [2024-11-16 04:34:23,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2024-11-16 04:34:23,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:34:23,785 INFO L215 NwaCegarLoop]: trace histogram [35, 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, 1, 1] [2024-11-16 04:34:23,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-16 04:34:23,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 04:34:23,986 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:34:23,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:34:23,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2084813854, now seen corresponding path program 1 times [2024-11-16 04:34:23,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:34:23,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103827137] [2024-11-16 04:34:23,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:34:23,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:34:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 04:34:24,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 04:34:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 04:34:24,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 04:34:24,540 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 04:34:24,541 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 04:34:24,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 04:34:24,544 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:34:24,690 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 04:34:24,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:34:24 BoogieIcfgContainer [2024-11-16 04:34:24,692 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 04:34:24,693 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 04:34:24,693 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 04:34:24,693 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 04:34:24,694 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:34:08" (3/4) ... [2024-11-16 04:34:24,695 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 04:34:24,837 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 04:34:24,839 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 04:34:24,839 INFO L158 Benchmark]: Toolchain (without parser) took 17823.30ms. Allocated memory was 167.8MB in the beginning and 511.7MB in the end (delta: 343.9MB). Free memory was 95.3MB in the beginning and 395.2MB in the end (delta: -300.0MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2024-11-16 04:34:24,839 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 04:34:24,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.52ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 95.1MB in the beginning and 191.8MB in the end (delta: -96.6MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2024-11-16 04:34:24,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.81ms. Allocated memory is still 226.5MB. Free memory was 191.8MB in the beginning and 186.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 04:34:24,840 INFO L158 Benchmark]: Boogie Preprocessor took 76.04ms. Allocated memory is still 226.5MB. Free memory was 186.5MB in the beginning and 183.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 04:34:24,840 INFO L158 Benchmark]: IcfgBuilder took 702.64ms. Allocated memory is still 226.5MB. Free memory was 183.4MB in the beginning and 132.0MB in the end (delta: 51.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-16 04:34:24,840 INFO L158 Benchmark]: TraceAbstraction took 16432.07ms. Allocated memory was 226.5MB in the beginning and 511.7MB in the end (delta: 285.2MB). Free memory was 130.9MB in the beginning and 429.8MB in the end (delta: -298.9MB). Peak memory consumption was 251.0MB. Max. memory is 16.1GB. [2024-11-16 04:34:24,840 INFO L158 Benchmark]: Witness Printer took 145.63ms. Allocated memory is still 511.7MB. Free memory was 429.8MB in the beginning and 395.2MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-16 04:34:24,841 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.18ms. Allocated memory is still 167.8MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.52ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 95.1MB in the beginning and 191.8MB in the end (delta: -96.6MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.81ms. Allocated memory is still 226.5MB. Free memory was 191.8MB in the beginning and 186.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.04ms. Allocated memory is still 226.5MB. Free memory was 186.5MB in the beginning and 183.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 702.64ms. Allocated memory is still 226.5MB. Free memory was 183.4MB in the beginning and 132.0MB in the end (delta: 51.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16432.07ms. Allocated memory was 226.5MB in the beginning and 511.7MB in the end (delta: 285.2MB). Free memory was 130.9MB in the beginning and 429.8MB in the end (delta: -298.9MB). Peak memory consumption was 251.0MB. Max. memory is 16.1GB. * Witness Printer took 145.63ms. Allocated memory is still 511.7MB. Free memory was 429.8MB in the beginning and 395.2MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * 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; 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] [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 [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=0, this_buffer_empty=0, this_expect=0] [L45] COND TRUE q == 0 [L46] COND TRUE __VERIFIER_nondet_int() [L48] COND TRUE 1 [L50] method_id = 1 VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, 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, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=1, this_buffer_empty=1, this_expect=0] [L45] COND FALSE !(q == 0) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, 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, P3=0, P4=0, P6=0, P8=0, 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, 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 [P3=0, P4=0, P6=0, P8=0, 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, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=1] [L45] COND FALSE !(q == 0) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=1] [L65] COND FALSE !(q == 1) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=1] [L165] COND FALSE !(q == 2) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, 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 [P3=0, P4=0, P6=0, P8=0, 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, 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 [P4=0, P6=0, P8=0, 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, 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 [P1=1, P3=0, P4=0, P6=-1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=1] [L45] COND FALSE !(q == 0) VAL [P1=1, P3=0, P4=0, P6=-1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=1] [L65] COND FALSE !(q == 1) VAL [P1=1, P3=0, P4=0, P6=-1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=1] [L165] COND FALSE !(q == 2) VAL [P1=1, P3=0, P4=0, P6=-1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=1] [L265] COND FALSE !(q == 3) VAL [P1=1, P3=0, P4=0, P6=-1, P8=0, 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, 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 [P3=0, P4=0, P6=-1, P8=0, 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, 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 [P3=0, P4=0, P8=0, 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, 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 [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=2] [L45] COND FALSE !(q == 0) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=2] [L65] COND FALSE !(q == 1) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=2] [L165] COND FALSE !(q == 2) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=2] [L265] COND FALSE !(q == 3) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=2] [L365] COND FALSE !(q == 4) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, 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 [P3=0, P4=0, P6=0, P8=0, P9=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, 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 [P3=0, P4=0, P6=0, P8=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, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=1, this_buffer_empty=1, this_expect=2] [L45] COND FALSE !(q == 0) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, 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, P3=0, P4=0, P6=0, P8=0, 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, 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 [P3=0, P4=0, P6=0, P8=0, 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, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=3] [L45] COND FALSE !(q == 0) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=3] [L65] COND FALSE !(q == 1) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=3] [L165] COND FALSE !(q == 2) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, 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 [P3=0, P4=0, P6=0, P8=0, 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, 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 [P4=0, P6=0, P8=0, 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, 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 [P1=1, P3=0, P4=0, P6=-1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=3] [L45] COND FALSE !(q == 0) VAL [P1=1, P3=0, P4=0, P6=-1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=3] [L65] COND FALSE !(q == 1) VAL [P1=1, P3=0, P4=0, P6=-1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=3] [L165] COND FALSE !(q == 2) VAL [P1=1, P3=0, P4=0, P6=-1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=3] [L265] COND FALSE !(q == 3) VAL [P1=1, P3=0, P4=0, P6=-1, P8=0, 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, 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 [P3=0, P4=0, P6=-1, P8=0, 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, 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 [P3=0, P4=0, P8=0, 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, 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 [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=4] [L45] COND FALSE !(q == 0) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=4] [L65] COND FALSE !(q == 1) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=4] [L165] COND FALSE !(q == 2) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=4] [L265] COND FALSE !(q == 3) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=4] [L365] COND FALSE !(q == 4) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, 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 [P3=0, P4=0, P6=0, P8=0, P9=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, 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 [P3=0, P4=0, P6=0, P8=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, 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 [P1=-2, P3=0, P4=0, P6=0, P8=0, 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, q=1, this_buffer_empty=1, this_expect=4] [L45] COND FALSE !(q == 0) VAL [P1=-2, P3=0, P4=0, P6=0, P8=0, 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, 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=-2, P3=0, P4=0, P6=0, P8=0, 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, 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 [P3=0, P4=0, P6=0, P8=0, 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, 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 [P1=0, P3=1, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=5] [L45] COND FALSE !(q == 0) VAL [P1=0, P3=1, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=5] [L65] COND FALSE !(q == 1) VAL [P1=0, P3=1, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=5] [L165] COND FALSE !(q == 2) VAL [P1=0, P3=1, P4=0, P6=0, P8=0, 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, 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 [P3=1, P4=0, P6=0, P8=0, 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, 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 [P4=0, P6=0, P8=0, 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, 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 [P1=1, P3=0, P4=0, P6=-1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=5] [L45] COND FALSE !(q == 0) VAL [P1=1, P3=0, P4=0, P6=-1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=5] [L65] COND FALSE !(q == 1) VAL [P1=1, P3=0, P4=0, P6=-1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=5] [L165] COND FALSE !(q == 2) VAL [P1=1, P3=0, P4=0, P6=-1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=5] [L265] COND FALSE !(q == 3) VAL [P1=1, P3=0, P4=0, P6=-1, P8=0, 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, 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 [P3=0, P4=0, P6=-1, P8=0, 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, 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 [P3=0, P4=0, P8=0, 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, 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 [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=6] [L45] COND FALSE !(q == 0) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=6] [L65] COND FALSE !(q == 1) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=6] [L165] COND FALSE !(q == 2) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=6] [L265] COND FALSE !(q == 3) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=6] [L365] COND FALSE !(q == 4) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, 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 [P3=0, P4=0, P6=0, P8=0, P9=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, 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 [P3=0, P4=0, P6=0, P8=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, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=1, this_buffer_empty=1, this_expect=6] [L45] COND FALSE !(q == 0) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, 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, P3=0, P4=0, P6=0, P8=0, 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, 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 [P3=0, P4=0, P6=0, P8=0, 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, 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 [P1=0, P3=1, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=7] [L45] COND FALSE !(q == 0) VAL [P1=0, P3=1, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=7] [L65] COND FALSE !(q == 1) VAL [P1=0, P3=1, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=7] [L165] COND FALSE !(q == 2) VAL [P1=0, P3=1, P4=0, P6=0, P8=0, 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, 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 [P3=1, P4=0, P6=0, P8=0, 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, 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 [P4=0, P6=0, P8=0, 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, 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 [P1=1, P3=0, P4=0, P6=-2, P8=0, 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, q=4, this_buffer_empty=1, this_expect=7] [L45] COND FALSE !(q == 0) VAL [P1=1, P3=0, P4=0, P6=-2, P8=0, 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, q=4, this_buffer_empty=1, this_expect=7] [L65] COND FALSE !(q == 1) VAL [P1=1, P3=0, P4=0, P6=-2, P8=0, 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, q=4, this_buffer_empty=1, this_expect=7] [L165] COND FALSE !(q == 2) VAL [P1=1, P3=0, P4=0, P6=-2, P8=0, 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, q=4, this_buffer_empty=1, this_expect=7] [L265] COND FALSE !(q == 3) VAL [P1=1, P3=0, P4=0, P6=-2, P8=0, 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, 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 [P3=0, P4=0, P6=-2, P8=0, 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, 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 [P3=0, P4=0, P8=0, 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, 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 [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=8] [L45] COND FALSE !(q == 0) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=8] [L65] COND FALSE !(q == 1) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=8] [L165] COND FALSE !(q == 2) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=8] [L265] COND FALSE !(q == 3) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=8] [L365] COND FALSE !(q == 4) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, 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 [P3=0, P4=0, P6=0, P8=0, P9=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, 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 [P3=0, P4=0, P6=0, P8=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, 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 [P1=-2, P3=0, P4=0, P6=0, P8=0, 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, q=1, this_buffer_empty=1, this_expect=8] [L45] COND FALSE !(q == 0) VAL [P1=-2, P3=0, P4=0, P6=0, P8=0, 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, 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=-2, P3=0, P4=0, P6=0, P8=0, 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, 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 [P3=0, P4=0, P6=0, P8=0, 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, 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 [P1=0, P3=-1, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=9] [L45] COND FALSE !(q == 0) VAL [P1=0, P3=-1, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=9] [L65] COND FALSE !(q == 1) VAL [P1=0, P3=-1, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=9] [L165] COND FALSE !(q == 2) VAL [P1=0, P3=-1, P4=0, P6=0, P8=0, 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, 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 [P3=-1, P4=0, P6=0, P8=0, 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, 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 [P4=0, P6=0, P8=0, 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, 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 [P1=1, P3=0, P4=0, P6=1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=9] [L45] COND FALSE !(q == 0) VAL [P1=1, P3=0, P4=0, P6=1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=9] [L65] COND FALSE !(q == 1) VAL [P1=1, P3=0, P4=0, P6=1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=9] [L165] COND FALSE !(q == 2) VAL [P1=1, P3=0, P4=0, P6=1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=9] [L265] COND FALSE !(q == 3) VAL [P1=1, P3=0, P4=0, P6=1, P8=0, 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, 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 [P3=0, P4=0, P6=1, P8=0, 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, 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 [P3=0, P4=0, P8=0, 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, 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 [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=10] [L45] COND FALSE !(q == 0) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=10] [L65] COND FALSE !(q == 1) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=10] [L165] COND FALSE !(q == 2) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=10] [L265] COND FALSE !(q == 3) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=10] [L365] COND FALSE !(q == 4) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, 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 [P3=0, P4=0, P6=0, P8=0, P9=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, 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 [P3=0, P4=0, P6=0, P8=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, 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 [P1=-2, P3=0, P4=0, P6=0, P8=0, 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, q=1, this_buffer_empty=1, this_expect=10] [L45] COND FALSE !(q == 0) VAL [P1=-2, P3=0, P4=0, P6=0, P8=0, 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, 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=-2, P3=0, P4=0, P6=0, P8=0, 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, 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 [P3=0, P4=0, P6=0, P8=0, 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, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=11] [L45] COND FALSE !(q == 0) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=11] [L65] COND FALSE !(q == 1) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=11] [L165] COND FALSE !(q == 2) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, 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 [P3=0, P4=0, P6=0, P8=0, 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, 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 [P4=0, P6=0, P8=0, 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, 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 [P1=1, P3=0, P4=0, P6=-1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=11] [L45] COND FALSE !(q == 0) VAL [P1=1, P3=0, P4=0, P6=-1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=11] [L65] COND FALSE !(q == 1) VAL [P1=1, P3=0, P4=0, P6=-1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=11] [L165] COND FALSE !(q == 2) VAL [P1=1, P3=0, P4=0, P6=-1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=11] [L265] COND FALSE !(q == 3) VAL [P1=1, P3=0, P4=0, P6=-1, P8=0, 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, 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 [P3=0, P4=0, P6=-1, P8=0, 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, 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 [P3=0, P4=0, P8=0, 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, 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 [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=12] [L45] COND FALSE !(q == 0) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=12] [L65] COND FALSE !(q == 1) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=12] [L165] COND FALSE !(q == 2) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=12] [L265] COND FALSE !(q == 3) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=12] [L365] COND FALSE !(q == 4) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, 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 [P3=0, P4=0, P6=0, P8=0, P9=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, 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 [P3=0, P4=0, P6=0, P8=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, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=1, this_buffer_empty=1, this_expect=12] [L45] COND FALSE !(q == 0) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, 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, P3=0, P4=0, P6=0, P8=0, 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, 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 [P3=0, P4=0, P6=0, P8=0, 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, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=13] [L45] COND FALSE !(q == 0) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=13] [L65] COND FALSE !(q == 1) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=13] [L165] COND FALSE !(q == 2) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, 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 [P3=0, P4=0, P6=0, P8=0, 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, 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 [P4=0, P6=0, P8=0, 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, 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 [P1=1, P3=0, P4=0, P6=1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=13] [L45] COND FALSE !(q == 0) VAL [P1=1, P3=0, P4=0, P6=1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=13] [L65] COND FALSE !(q == 1) VAL [P1=1, P3=0, P4=0, P6=1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=13] [L165] COND FALSE !(q == 2) VAL [P1=1, P3=0, P4=0, P6=1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=13] [L265] COND FALSE !(q == 3) VAL [P1=1, P3=0, P4=0, P6=1, P8=0, 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, 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 [P3=0, P4=0, P6=1, P8=0, 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, 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 [P3=0, P4=0, P8=0, 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, 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 [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=14] [L45] COND FALSE !(q == 0) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=14] [L65] COND FALSE !(q == 1) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=14] [L165] COND FALSE !(q == 2) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=14] [L265] COND FALSE !(q == 3) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=14] [L365] COND FALSE !(q == 4) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, 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 [P3=0, P4=0, P6=0, P8=0, P9=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, 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 [P3=0, P4=0, P6=0, P8=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, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=1, this_buffer_empty=1, this_expect=14] [L45] COND FALSE !(q == 0) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, 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, P3=0, P4=0, P6=0, P8=0, 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, 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 [P3=0, P4=0, P6=0, P8=0, 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, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=15] [L45] COND FALSE !(q == 0) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=15] [L65] COND FALSE !(q == 1) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=15] [L165] COND FALSE !(q == 2) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, 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 [P3=0, P4=0, P6=0, P8=0, 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, 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 [P4=0, P6=0, P8=0, 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, 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 [P1=1, P3=0, P4=0, P6=1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=15] [L45] COND FALSE !(q == 0) VAL [P1=1, P3=0, P4=0, P6=1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=15] [L65] COND FALSE !(q == 1) VAL [P1=1, P3=0, P4=0, P6=1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=15] [L165] COND FALSE !(q == 2) VAL [P1=1, P3=0, P4=0, P6=1, P8=0, 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, q=4, this_buffer_empty=1, this_expect=15] [L265] COND FALSE !(q == 3) VAL [P1=1, P3=0, P4=0, P6=1, P8=0, 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, 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 [P3=0, P4=0, P6=1, P8=0, 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, 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 [P3=0, P4=0, P8=0, 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, 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 [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=16] [L45] COND FALSE !(q == 0) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=16] [L65] COND FALSE !(q == 1) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=16] [L165] COND FALSE !(q == 2) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=16] [L265] COND FALSE !(q == 3) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, q=5, this_buffer_empty=0, this_expect=16] [L365] COND FALSE !(q == 4) VAL [P1=1, P3=0, P4=0, P6=0, P8=0, P9=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, 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 [P3=0, P4=0, P6=0, P8=0, P9=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, 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 [P3=0, P4=0, P6=0, P8=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, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=1, this_buffer_empty=1, this_expect=16] [L45] COND FALSE !(q == 0) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, 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, P3=0, P4=0, P6=0, P8=0, 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, 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 [P3=0, P4=0, P6=0, P8=0, 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, 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 [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=-16] [L45] COND FALSE !(q == 0) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=-16] [L65] COND FALSE !(q == 1) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, q=3, this_buffer_empty=0, this_expect=-16] [L165] COND FALSE !(q == 2) VAL [P1=0, P3=0, P4=0, P6=0, P8=0, 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, 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 [P3=0, P4=0, P6=0, P8=0, 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, 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 [P4=0, P6=0, P8=0, 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, q=3] [L571] reach_error() VAL [P4=0, P6=0, P8=0, 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, q=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 23, TraceHistogramMax: 35, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7938 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7938 mSDsluCounter, 20311 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16164 mSDsCounter, 275 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3270 IncrementalHoareTripleChecker+Invalid, 3545 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 275 mSolverCounterUnsat, 4147 mSDtfsCounter, 3270 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2176 GetRequests, 2009 SyntacticMatches, 13 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2230occurred in iteration=22, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 391 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2817 NumberOfCodeBlocks, 2817 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 3320 ConstructedInterpolants, 0 QuantifiedInterpolants, 16102 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4637 ConjunctsInSsa, 185 ConjunctsInUnsatCore, 48 InterpolantComputations, 10 PerfectInterpolantSequences, 1957/8314 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! [2024-11-16 04:34:24,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE