./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 023d838f 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-023d838-m [2024-11-09 20:08:50,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 20:08:50,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 20:08:50,769 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 20:08:50,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 20:08:50,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 20:08:50,797 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 20:08:50,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 20:08:50,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 20:08:50,799 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 20:08:50,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 20:08:50,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 20:08:50,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 20:08:50,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 20:08:50,801 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 20:08:50,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 20:08:50,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 20:08:50,802 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 20:08:50,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 20:08:50,802 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 20:08:50,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 20:08:50,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 20:08:50,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 20:08:50,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 20:08:50,804 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 20:08:50,804 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 20:08:50,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 20:08:50,805 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 20:08:50,805 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 20:08:50,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 20:08:50,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 20:08:50,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 20:08:50,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:08:50,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 20:08:50,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 20:08:50,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 20:08:50,807 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 20:08:50,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 20:08:50,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 20:08:50,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 20:08:50,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 20:08:50,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 20:08:50,809 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-09 20:08:51,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 20:08:51,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 20:08:51,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 20:08:51,089 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 20:08:51,090 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 20:08:51,091 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-09 20:08:52,456 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 20:08:52,683 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 20:08:52,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-1.c [2024-11-09 20:08:52,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a703025/f0b7c38328ef4e18a4332bb3543728dd/FLAGecdbf05d5 [2024-11-09 20:08:52,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a703025/f0b7c38328ef4e18a4332bb3543728dd [2024-11-09 20:08:52,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 20:08:52,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 20:08:52,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 20:08:52,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 20:08:52,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 20:08:52,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:08:52" (1/1) ... [2024-11-09 20:08:52,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cb1eaaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:52, skipping insertion in model container [2024-11-09 20:08:52,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:08:52" (1/1) ... [2024-11-09 20:08:52,753 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 20:08:53,018 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-09 20:08:53,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:08:53,045 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 20:08:53,137 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-09 20:08:53,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:08:53,171 INFO L204 MainTranslator]: Completed translation [2024-11-09 20:08:53,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:53 WrapperNode [2024-11-09 20:08:53,172 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 20:08:53,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 20:08:53,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 20:08:53,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 20:08:53,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:53" (1/1) ... [2024-11-09 20:08:53,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:53" (1/1) ... [2024-11-09 20:08:53,254 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 457 [2024-11-09 20:08:53,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 20:08:53,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 20:08:53,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 20:08:53,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 20:08:53,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:53" (1/1) ... [2024-11-09 20:08:53,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:53" (1/1) ... [2024-11-09 20:08:53,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:53" (1/1) ... [2024-11-09 20:08:53,300 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-09 20:08:53,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:53" (1/1) ... [2024-11-09 20:08:53,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:53" (1/1) ... [2024-11-09 20:08:53,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:53" (1/1) ... [2024-11-09 20:08:53,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:53" (1/1) ... [2024-11-09 20:08:53,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:53" (1/1) ... [2024-11-09 20:08:53,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:53" (1/1) ... [2024-11-09 20:08:53,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 20:08:53,331 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 20:08:53,331 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 20:08:53,331 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 20:08:53,332 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:53" (1/1) ... [2024-11-09 20:08:53,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:08:53,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:08:53,372 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-09 20:08:53,380 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-09 20:08:53,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 20:08:53,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 20:08:53,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 20:08:53,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 20:08:53,596 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 20:08:53,598 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 20:08:54,318 INFO L? ?]: Removed 289 outVars from TransFormulas that were not future-live. [2024-11-09 20:08:54,319 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 20:08:54,338 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 20:08:54,338 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 20:08:54,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:08:54 BoogieIcfgContainer [2024-11-09 20:08:54,340 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 20:08:54,342 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 20:08:54,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 20:08:54,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 20:08:54,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:08:52" (1/3) ... [2024-11-09 20:08:54,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160134cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:08:54, skipping insertion in model container [2024-11-09 20:08:54,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:53" (2/3) ... [2024-11-09 20:08:54,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160134cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:08:54, skipping insertion in model container [2024-11-09 20:08:54,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:08:54" (3/3) ... [2024-11-09 20:08:54,349 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2024-11-09 20:08:54,365 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 20:08:54,365 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 20:08:54,430 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 20:08:54,438 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;@2d1216ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 20:08:54,439 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 20:08:54,443 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-09 20:08:54,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 20:08:54,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:08:54,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:08:54,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:08:54,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:08:54,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1953855060, now seen corresponding path program 1 times [2024-11-09 20:08:54,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:08:54,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134199067] [2024-11-09 20:08:54,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:08:54,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:08:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:08:54,707 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-09 20:08:54,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:08:54,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134199067] [2024-11-09 20:08:54,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134199067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:08:54,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:08:54,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:08:54,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576382490] [2024-11-09 20:08:54,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:08:54,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:08:54,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:08:54,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:08:54,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:08:54,736 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-09 20:08:55,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:08:55,051 INFO L93 Difference]: Finished difference Result 326 states and 630 transitions. [2024-11-09 20:08:55,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:08:55,053 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-09 20:08:55,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:08:55,064 INFO L225 Difference]: With dead ends: 326 [2024-11-09 20:08:55,064 INFO L226 Difference]: Without dead ends: 194 [2024-11-09 20:08:55,068 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-09 20:08:55,072 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 136 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 20:08:55,074 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.3s Time] [2024-11-09 20:08:55,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-09 20:08:55,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 181. [2024-11-09 20:08:55,126 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-09 20:08:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 304 transitions. [2024-11-09 20:08:55,132 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 304 transitions. Word has length 12 [2024-11-09 20:08:55,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:08:55,133 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 304 transitions. [2024-11-09 20:08:55,137 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-09 20:08:55,137 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 304 transitions. [2024-11-09 20:08:55,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 20:08:55,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:08:55,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:08:55,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 20:08:55,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:08:55,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:08:55,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1550673184, now seen corresponding path program 1 times [2024-11-09 20:08:55,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:08:55,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268460222] [2024-11-09 20:08:55,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:08:55,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:08:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:08:55,237 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-09 20:08:55,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:08:55,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268460222] [2024-11-09 20:08:55,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268460222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:08:55,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:08:55,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:08:55,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903526503] [2024-11-09 20:08:55,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:08:55,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:08:55,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:08:55,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:08:55,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:08:55,242 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-09 20:08:55,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:08:55,296 INFO L93 Difference]: Finished difference Result 369 states and 618 transitions. [2024-11-09 20:08:55,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:08:55,297 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-09 20:08:55,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:08:55,299 INFO L225 Difference]: With dead ends: 369 [2024-11-09 20:08:55,299 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 20:08:55,300 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-09 20:08:55,301 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-09 20:08:55,302 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-09 20:08:55,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 20:08:55,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-09 20:08:55,313 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-09 20:08:55,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 314 transitions. [2024-11-09 20:08:55,314 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 314 transitions. Word has length 13 [2024-11-09 20:08:55,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:08:55,314 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 314 transitions. [2024-11-09 20:08:55,315 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-09 20:08:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 314 transitions. [2024-11-09 20:08:55,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 20:08:55,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:08:55,316 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:08:55,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 20:08:55,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:08:55,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:08:55,317 INFO L85 PathProgramCache]: Analyzing trace with hash 679636942, now seen corresponding path program 1 times [2024-11-09 20:08:55,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:08:55,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260348094] [2024-11-09 20:08:55,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:08:55,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:08:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:08:55,639 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-09 20:08:55,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:08:55,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260348094] [2024-11-09 20:08:55,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260348094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:08:55,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:08:55,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 20:08:55,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695192208] [2024-11-09 20:08:55,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:08:55,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 20:08:55,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:08:55,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 20:08:55,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:08:55,642 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-09 20:08:55,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:08:55,789 INFO L93 Difference]: Finished difference Result 283 states and 460 transitions. [2024-11-09 20:08:55,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 20:08:55,790 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-09 20:08:55,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:08:55,792 INFO L225 Difference]: With dead ends: 283 [2024-11-09 20:08:55,792 INFO L226 Difference]: Without dead ends: 275 [2024-11-09 20:08:55,793 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-09 20:08:55,794 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-09 20:08:55,795 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-09 20:08:55,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-09 20:08:55,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 261. [2024-11-09 20:08:55,812 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-09 20:08:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 429 transitions. [2024-11-09 20:08:55,814 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 429 transitions. Word has length 20 [2024-11-09 20:08:55,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:08:55,814 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 429 transitions. [2024-11-09 20:08:55,818 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-09 20:08:55,818 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 429 transitions. [2024-11-09 20:08:55,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 20:08:55,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:08:55,819 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-09 20:08:55,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 20:08:55,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:08:55,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:08:55,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1590007687, now seen corresponding path program 1 times [2024-11-09 20:08:55,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:08:55,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041374408] [2024-11-09 20:08:55,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:08:55,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:08:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:08:55,879 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-09 20:08:55,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:08:55,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041374408] [2024-11-09 20:08:55,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041374408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:08:55,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:08:55,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:08:55,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367684834] [2024-11-09 20:08:55,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:08:55,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:08:55,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:08:55,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:08:55,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:08:55,883 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-09 20:08:55,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:08:55,915 INFO L93 Difference]: Finished difference Result 402 states and 654 transitions. [2024-11-09 20:08:55,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:08:55,916 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-09 20:08:55,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:08:55,917 INFO L225 Difference]: With dead ends: 402 [2024-11-09 20:08:55,917 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 20:08:55,921 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-09 20:08:55,923 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-09 20:08:55,923 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-09 20:08:55,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 20:08:55,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2024-11-09 20:08:55,941 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-09 20:08:55,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 222 transitions. [2024-11-09 20:08:55,942 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 222 transitions. Word has length 21 [2024-11-09 20:08:55,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:08:55,943 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 222 transitions. [2024-11-09 20:08:55,943 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-09 20:08:55,943 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 222 transitions. [2024-11-09 20:08:55,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 20:08:55,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:08:55,945 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-09 20:08:55,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 20:08:55,946 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:08:55,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:08:55,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2023311320, now seen corresponding path program 1 times [2024-11-09 20:08:55,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:08:55,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944203340] [2024-11-09 20:08:55,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:08:55,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:08:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:08:56,018 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-09 20:08:56,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:08:56,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944203340] [2024-11-09 20:08:56,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944203340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 20:08:56,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477942053] [2024-11-09 20:08:56,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:08:56,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 20:08:56,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:08:56,022 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-09 20:08:56,024 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-09 20:08:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:08:56,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 20:08:56,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:08:56,128 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-09 20:08:56,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:08:56,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477942053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:08:56,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 20:08:56,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-09 20:08:56,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541675766] [2024-11-09 20:08:56,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:08:56,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:08:56,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:08:56,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:08:56,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:08:56,131 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-09 20:08:56,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:08:56,159 INFO L93 Difference]: Finished difference Result 254 states and 400 transitions. [2024-11-09 20:08:56,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:08:56,160 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-09 20:08:56,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:08:56,161 INFO L225 Difference]: With dead ends: 254 [2024-11-09 20:08:56,161 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 20:08:56,162 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-09 20:08:56,163 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-09 20:08:56,164 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-09 20:08:56,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 20:08:56,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2024-11-09 20:08:56,173 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-09 20:08:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 182 transitions. [2024-11-09 20:08:56,173 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 182 transitions. Word has length 28 [2024-11-09 20:08:56,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:08:56,174 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 182 transitions. [2024-11-09 20:08:56,174 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-09 20:08:56,178 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 182 transitions. [2024-11-09 20:08:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 20:08:56,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:08:56,179 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-09 20:08:56,200 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-09 20:08:56,380 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-09 20:08:56,381 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:08:56,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:08:56,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1987316991, now seen corresponding path program 1 times [2024-11-09 20:08:56,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:08:56,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426706541] [2024-11-09 20:08:56,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:08:56,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:08:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:08:56,466 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-09 20:08:56,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:08:56,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426706541] [2024-11-09 20:08:56,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426706541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 20:08:56,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35080907] [2024-11-09 20:08:56,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:08:56,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 20:08:56,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:08:56,477 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-09 20:08:56,482 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-09 20:08:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:08:56,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 20:08:56,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:08:56,612 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-09 20:08:56,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 20:08:56,653 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-09 20:08:56,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35080907] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 20:08:56,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 20:08:56,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-09 20:08:56,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033961575] [2024-11-09 20:08:56,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 20:08:56,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 20:08:56,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:08:56,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 20:08:56,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 20:08:56,657 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-09 20:08:56,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:08:56,819 INFO L93 Difference]: Finished difference Result 472 states and 764 transitions. [2024-11-09 20:08:56,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 20:08:56,820 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-09 20:08:56,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:08:56,822 INFO L225 Difference]: With dead ends: 472 [2024-11-09 20:08:56,822 INFO L226 Difference]: Without dead ends: 373 [2024-11-09 20:08:56,822 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-09 20:08:56,823 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-09 20:08:56,823 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-09 20:08:56,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-09 20:08:56,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 322. [2024-11-09 20:08:56,835 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-09 20:08:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 541 transitions. [2024-11-09 20:08:56,836 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 541 transitions. Word has length 30 [2024-11-09 20:08:56,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:08:56,837 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 541 transitions. [2024-11-09 20:08:56,837 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-09 20:08:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 541 transitions. [2024-11-09 20:08:56,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 20:08:56,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:08:56,839 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-09 20:08:56,858 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-09 20:08:57,040 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-09 20:08:57,040 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:08:57,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:08:57,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1790803486, now seen corresponding path program 1 times [2024-11-09 20:08:57,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:08:57,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463038987] [2024-11-09 20:08:57,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:08:57,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:08:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:08:57,109 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-09 20:08:57,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:08:57,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463038987] [2024-11-09 20:08:57,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463038987] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 20:08:57,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202287943] [2024-11-09 20:08:57,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:08:57,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 20:08:57,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:08:57,112 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-09 20:08:57,113 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-09 20:08:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:08:57,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 20:08:57,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:08:57,229 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-09 20:08:57,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 20:08:57,261 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-09 20:08:57,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202287943] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 20:08:57,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 20:08:57,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-09 20:08:57,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181003318] [2024-11-09 20:08:57,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 20:08:57,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 20:08:57,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:08:57,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 20:08:57,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:08:57,264 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-09 20:08:57,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:08:57,396 INFO L93 Difference]: Finished difference Result 616 states and 1046 transitions. [2024-11-09 20:08:57,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 20:08:57,397 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-09 20:08:57,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:08:57,399 INFO L225 Difference]: With dead ends: 616 [2024-11-09 20:08:57,399 INFO L226 Difference]: Without dead ends: 603 [2024-11-09 20:08:57,400 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-09 20:08:57,401 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-09 20:08:57,401 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-09 20:08:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-09 20:08:57,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 593. [2024-11-09 20:08:57,411 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-09 20:08:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 987 transitions. [2024-11-09 20:08:57,413 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 987 transitions. Word has length 30 [2024-11-09 20:08:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:08:57,413 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 987 transitions. [2024-11-09 20:08:57,413 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-09 20:08:57,414 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 987 transitions. [2024-11-09 20:08:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 20:08:57,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:08:57,415 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-09 20:08:57,434 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-09 20:08:57,616 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-09 20:08:57,616 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:08:57,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:08:57,617 INFO L85 PathProgramCache]: Analyzing trace with hash -271717653, now seen corresponding path program 1 times [2024-11-09 20:08:57,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:08:57,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590030856] [2024-11-09 20:08:57,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:08:57,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:08:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:08:57,846 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-09 20:08:57,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:08:57,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590030856] [2024-11-09 20:08:57,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590030856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 20:08:57,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79639538] [2024-11-09 20:08:57,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:08:57,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 20:08:57,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:08:57,849 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-09 20:08:57,850 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-09 20:08:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:08:57,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 20:08:57,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:08:58,018 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-09 20:08:58,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 20:08:58,156 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-09 20:08:58,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79639538] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 20:08:58,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 20:08:58,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-09 20:08:58,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119050602] [2024-11-09 20:08:58,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 20:08:58,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 20:08:58,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:08:58,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 20:08:58,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 20:08:58,162 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-09 20:08:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:08:58,369 INFO L93 Difference]: Finished difference Result 770 states and 1271 transitions. [2024-11-09 20:08:58,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 20:08:58,369 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-09 20:08:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:08:58,372 INFO L225 Difference]: With dead ends: 770 [2024-11-09 20:08:58,373 INFO L226 Difference]: Without dead ends: 752 [2024-11-09 20:08:58,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 20:08:58,375 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 247 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 20:08:58,375 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.2s Time] [2024-11-09 20:08:58,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-11-09 20:08:58,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 735. [2024-11-09 20:08:58,388 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-09 20:08:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1215 transitions. [2024-11-09 20:08:58,390 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1215 transitions. Word has length 31 [2024-11-09 20:08:58,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:08:58,391 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1215 transitions. [2024-11-09 20:08:58,391 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-09 20:08:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1215 transitions. [2024-11-09 20:08:58,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 20:08:58,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:08:58,392 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-09 20:08:58,409 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-09 20:08:58,592 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-09 20:08:58,593 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:08:58,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:08:58,593 INFO L85 PathProgramCache]: Analyzing trace with hash 677090825, now seen corresponding path program 1 times [2024-11-09 20:08:58,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:08:58,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888535310] [2024-11-09 20:08:58,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:08:58,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:08:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:08:58,624 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-09 20:08:58,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:08:58,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888535310] [2024-11-09 20:08:58,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888535310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:08:58,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:08:58,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:08:58,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180250152] [2024-11-09 20:08:58,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:08:58,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:08:58,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:08:58,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:08:58,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:08:58,625 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-09 20:08:58,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:08:58,653 INFO L93 Difference]: Finished difference Result 1385 states and 2268 transitions. [2024-11-09 20:08:58,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:08:58,654 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-09 20:08:58,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:08:58,656 INFO L225 Difference]: With dead ends: 1385 [2024-11-09 20:08:58,656 INFO L226 Difference]: Without dead ends: 678 [2024-11-09 20:08:58,657 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-09 20:08:58,657 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-09 20:08:58,658 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-09 20:08:58,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-11-09 20:08:58,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 675. [2024-11-09 20:08:58,669 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-09 20:08:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1078 transitions. [2024-11-09 20:08:58,672 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1078 transitions. Word has length 32 [2024-11-09 20:08:58,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:08:58,672 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 1078 transitions. [2024-11-09 20:08:58,672 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-09 20:08:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1078 transitions. [2024-11-09 20:08:58,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 20:08:58,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:08:58,675 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-09 20:08:58,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 20:08:58,675 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:08:58,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:08:58,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1877772037, now seen corresponding path program 1 times [2024-11-09 20:08:58,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:08:58,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62708300] [2024-11-09 20:08:58,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:08:58,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:08:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:08:58,743 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-09 20:08:58,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:08:58,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62708300] [2024-11-09 20:08:58,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62708300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:08:58,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:08:58,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:08:58,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586411633] [2024-11-09 20:08:58,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:08:58,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:08:58,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:08:58,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:08:58,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:08:58,745 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-09 20:08:58,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:08:58,772 INFO L93 Difference]: Finished difference Result 1305 states and 2095 transitions. [2024-11-09 20:08:58,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:08:58,773 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-09 20:08:58,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:08:58,777 INFO L225 Difference]: With dead ends: 1305 [2024-11-09 20:08:58,777 INFO L226 Difference]: Without dead ends: 678 [2024-11-09 20:08:58,778 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-09 20:08:58,778 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-09 20:08:58,778 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-09 20:08:58,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-11-09 20:08:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 675. [2024-11-09 20:08:58,790 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-09 20:08:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1070 transitions. [2024-11-09 20:08:58,794 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1070 transitions. Word has length 41 [2024-11-09 20:08:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:08:58,795 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 1070 transitions. [2024-11-09 20:08:58,795 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-09 20:08:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1070 transitions. [2024-11-09 20:08:58,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 20:08:58,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:08:58,796 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-09 20:08:58,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 20:08:58,796 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:08:58,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:08:58,796 INFO L85 PathProgramCache]: Analyzing trace with hash 734552282, now seen corresponding path program 1 times [2024-11-09 20:08:58,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:08:58,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498779690] [2024-11-09 20:08:58,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:08:58,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:08:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:08:59,024 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-09 20:08:59,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:08:59,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498779690] [2024-11-09 20:08:59,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498779690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 20:08:59,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713340165] [2024-11-09 20:08:59,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:08:59,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 20:08:59,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:08:59,026 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-09 20:08:59,028 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-09 20:08:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:08:59,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 20:08:59,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:08:59,201 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-09 20:08:59,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 20:08:59,492 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-09 20:08:59,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713340165] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 20:08:59,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 20:08:59,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-09 20:08:59,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302218915] [2024-11-09 20:08:59,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 20:08:59,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 20:08:59,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:08:59,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 20:08:59,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-09 20:08:59,495 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-09 20:08:59,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:08:59,918 INFO L93 Difference]: Finished difference Result 1583 states and 2519 transitions. [2024-11-09 20:08:59,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 20:08:59,919 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-09 20:08:59,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:08:59,924 INFO L225 Difference]: With dead ends: 1583 [2024-11-09 20:08:59,924 INFO L226 Difference]: Without dead ends: 933 [2024-11-09 20:08:59,924 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-09 20:08:59,925 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 547 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-09 20:08:59,925 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.4s Time] [2024-11-09 20:08:59,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2024-11-09 20:08:59,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 901. [2024-11-09 20:08:59,939 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-09 20:08:59,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1418 transitions. [2024-11-09 20:08:59,941 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1418 transitions. Word has length 42 [2024-11-09 20:08:59,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:08:59,942 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1418 transitions. [2024-11-09 20:08:59,942 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-09 20:08:59,942 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1418 transitions. [2024-11-09 20:08:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 20:08:59,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:08:59,942 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-09 20:08:59,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 20:09:00,143 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-09 20:09:00,143 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:09:00,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:09:00,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1344163238, now seen corresponding path program 1 times [2024-11-09 20:09:00,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:09:00,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977356549] [2024-11-09 20:09:00,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:00,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:09:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:00,221 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-09 20:09:00,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:09:00,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977356549] [2024-11-09 20:09:00,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977356549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 20:09:00,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085163814] [2024-11-09 20:09:00,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:00,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 20:09:00,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:09:00,224 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-09 20:09:00,225 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-09 20:09:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:00,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 20:09:00,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:09:00,347 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-09 20:09:00,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 20:09:00,386 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-09 20:09:00,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085163814] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 20:09:00,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 20:09:00,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-09 20:09:00,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152310650] [2024-11-09 20:09:00,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 20:09:00,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 20:09:00,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:09:00,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 20:09:00,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:09:00,388 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-09 20:09:00,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:09:00,489 INFO L93 Difference]: Finished difference Result 914 states and 1430 transitions. [2024-11-09 20:09:00,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 20:09:00,490 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-09 20:09:00,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:09:00,493 INFO L225 Difference]: With dead ends: 914 [2024-11-09 20:09:00,493 INFO L226 Difference]: Without dead ends: 901 [2024-11-09 20:09:00,494 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-09 20:09:00,494 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-09 20:09:00,494 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-09 20:09:00,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2024-11-09 20:09:00,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2024-11-09 20:09:00,524 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-09 20:09:00,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1376 transitions. [2024-11-09 20:09:00,528 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1376 transitions. Word has length 43 [2024-11-09 20:09:00,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:09:00,529 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1376 transitions. [2024-11-09 20:09:00,529 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-09 20:09:00,530 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1376 transitions. [2024-11-09 20:09:00,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 20:09:00,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:09:00,531 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-09 20:09:00,547 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-09 20:09:00,733 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-09 20:09:00,733 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:09:00,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:09:00,734 INFO L85 PathProgramCache]: Analyzing trace with hash 487462298, now seen corresponding path program 1 times [2024-11-09 20:09:00,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:09:00,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670055117] [2024-11-09 20:09:00,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:00,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:09:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:01,070 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-09 20:09:01,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:09:01,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670055117] [2024-11-09 20:09:01,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670055117] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 20:09:01,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717114960] [2024-11-09 20:09:01,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:01,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 20:09:01,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:09:01,073 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-09 20:09:01,074 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-09 20:09:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:01,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 20:09:01,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:09:01,327 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-09 20:09:01,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 20:09:01,566 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-09 20:09:01,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717114960] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 20:09:01,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 20:09:01,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-09 20:09:01,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277732504] [2024-11-09 20:09:01,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 20:09:01,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 20:09:01,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:09:01,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 20:09:01,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 20:09:01,569 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-09 20:09:01,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:09:01,691 INFO L93 Difference]: Finished difference Result 925 states and 1408 transitions. [2024-11-09 20:09:01,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 20:09:01,691 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-09 20:09:01,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:09:01,695 INFO L225 Difference]: With dead ends: 925 [2024-11-09 20:09:01,695 INFO L226 Difference]: Without dead ends: 922 [2024-11-09 20:09:01,695 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-09 20:09:01,696 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-09 20:09:01,696 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-09 20:09:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2024-11-09 20:09:01,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 901. [2024-11-09 20:09:01,709 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-09 20:09:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1375 transitions. [2024-11-09 20:09:01,712 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1375 transitions. Word has length 45 [2024-11-09 20:09:01,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:09:01,712 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1375 transitions. [2024-11-09 20:09:01,712 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-09 20:09:01,712 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1375 transitions. [2024-11-09 20:09:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 20:09:01,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:09:01,713 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-09 20:09:01,730 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-09 20:09:01,917 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-09 20:09:01,917 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:09:01,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:09:01,918 INFO L85 PathProgramCache]: Analyzing trace with hash -826934184, now seen corresponding path program 1 times [2024-11-09 20:09:01,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:09:01,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490012577] [2024-11-09 20:09:01,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:01,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:09:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:01,950 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-09 20:09:01,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:09:01,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490012577] [2024-11-09 20:09:01,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490012577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:09:01,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:09:01,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:09:01,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452936258] [2024-11-09 20:09:01,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:09:01,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:09:01,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:09:01,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:09:01,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:09:01,952 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-09 20:09:01,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:09:01,983 INFO L93 Difference]: Finished difference Result 1831 states and 2765 transitions. [2024-11-09 20:09:01,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:09:01,984 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-09 20:09:01,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:09:01,988 INFO L225 Difference]: With dead ends: 1831 [2024-11-09 20:09:01,988 INFO L226 Difference]: Without dead ends: 978 [2024-11-09 20:09:01,989 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-09 20:09:01,990 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-09 20:09:01,990 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-09 20:09:01,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-11-09 20:09:02,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 975. [2024-11-09 20:09:02,008 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-09 20:09:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1439 transitions. [2024-11-09 20:09:02,011 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1439 transitions. Word has length 46 [2024-11-09 20:09:02,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:09:02,011 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1439 transitions. [2024-11-09 20:09:02,011 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-09 20:09:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1439 transitions. [2024-11-09 20:09:02,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 20:09:02,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:09:02,012 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-09 20:09:02,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 20:09:02,013 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:09:02,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:09:02,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2034605559, now seen corresponding path program 1 times [2024-11-09 20:09:02,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:09:02,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050448789] [2024-11-09 20:09:02,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:02,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:09:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:02,058 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-09 20:09:02,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:09:02,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050448789] [2024-11-09 20:09:02,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050448789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:09:02,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:09:02,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:09:02,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481647077] [2024-11-09 20:09:02,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:09:02,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:09:02,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:09:02,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:09:02,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:09:02,060 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-09 20:09:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:09:02,101 INFO L93 Difference]: Finished difference Result 1411 states and 2077 transitions. [2024-11-09 20:09:02,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:09:02,102 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-09 20:09:02,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:09:02,104 INFO L225 Difference]: With dead ends: 1411 [2024-11-09 20:09:02,104 INFO L226 Difference]: Without dead ends: 546 [2024-11-09 20:09:02,105 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-09 20:09:02,105 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-09 20:09:02,106 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-09 20:09:02,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-09 20:09:02,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 543. [2024-11-09 20:09:02,114 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-09 20:09:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 781 transitions. [2024-11-09 20:09:02,116 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 781 transitions. Word has length 59 [2024-11-09 20:09:02,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:09:02,116 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 781 transitions. [2024-11-09 20:09:02,116 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-09 20:09:02,116 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 781 transitions. [2024-11-09 20:09:02,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 20:09:02,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:09:02,117 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-09 20:09:02,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 20:09:02,117 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:09:02,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:09:02,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1163038295, now seen corresponding path program 1 times [2024-11-09 20:09:02,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:09:02,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657352903] [2024-11-09 20:09:02,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:02,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:09:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:02,283 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-09 20:09:02,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:09:02,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657352903] [2024-11-09 20:09:02,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657352903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 20:09:02,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663614020] [2024-11-09 20:09:02,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:02,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 20:09:02,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:09:02,286 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-09 20:09:02,288 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-09 20:09:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:02,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 20:09:02,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:09:02,460 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-09 20:09:02,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:09:02,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663614020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:09:02,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 20:09:02,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-09 20:09:02,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116571334] [2024-11-09 20:09:02,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:09:02,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 20:09:02,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:09:02,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 20:09:02,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 20:09:02,462 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-09 20:09:02,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:09:02,520 INFO L93 Difference]: Finished difference Result 547 states and 784 transitions. [2024-11-09 20:09:02,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 20:09:02,520 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-09 20:09:02,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:09:02,522 INFO L225 Difference]: With dead ends: 547 [2024-11-09 20:09:02,522 INFO L226 Difference]: Without dead ends: 543 [2024-11-09 20:09:02,523 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-09 20:09:02,523 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-09 20:09:02,524 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-09 20:09:02,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-09 20:09:02,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2024-11-09 20:09:02,535 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-09 20:09:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 779 transitions. [2024-11-09 20:09:02,537 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 779 transitions. Word has length 61 [2024-11-09 20:09:02,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:09:02,537 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 779 transitions. [2024-11-09 20:09:02,537 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-09 20:09:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 779 transitions. [2024-11-09 20:09:02,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 20:09:02,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:09:02,538 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-09 20:09:02,555 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-09 20:09:02,742 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-09 20:09:02,743 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:09:02,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:09:02,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1645732770, now seen corresponding path program 1 times [2024-11-09 20:09:02,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:09:02,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160126089] [2024-11-09 20:09:02,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:02,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:09:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:02,984 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-09 20:09:02,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:09:02,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160126089] [2024-11-09 20:09:02,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160126089] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 20:09:02,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502642334] [2024-11-09 20:09:02,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:02,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 20:09:02,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:09:02,987 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-09 20:09:02,989 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-09 20:09:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:03,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 20:09:03,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:09:03,248 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-09 20:09:03,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 20:09:03,606 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-09 20:09:03,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502642334] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 20:09:03,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 20:09:03,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-09 20:09:03,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805425177] [2024-11-09 20:09:03,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 20:09:03,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 20:09:03,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:09:03,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 20:09:03,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-09 20:09:03,609 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-09 20:09:03,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:09:03,730 INFO L93 Difference]: Finished difference Result 613 states and 874 transitions. [2024-11-09 20:09:03,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 20:09:03,731 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-09 20:09:03,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:09:03,733 INFO L225 Difference]: With dead ends: 613 [2024-11-09 20:09:03,733 INFO L226 Difference]: Without dead ends: 610 [2024-11-09 20:09:03,734 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-09 20:09:03,734 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-09 20:09:03,734 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-09 20:09:03,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-09 20:09:03,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-09 20:09:03,745 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-09 20:09:03,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 869 transitions. [2024-11-09 20:09:03,746 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 869 transitions. Word has length 62 [2024-11-09 20:09:03,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:09:03,746 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 869 transitions. [2024-11-09 20:09:03,747 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-09 20:09:03,747 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 869 transitions. [2024-11-09 20:09:03,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 20:09:03,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:09:03,747 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-09 20:09:03,765 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-09 20:09:03,951 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-09 20:09:03,952 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:09:03,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:09:03,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1866464873, now seen corresponding path program 1 times [2024-11-09 20:09:03,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:09:03,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018739140] [2024-11-09 20:09:03,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:03,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:09:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:04,377 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-09 20:09:04,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:09:04,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018739140] [2024-11-09 20:09:04,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018739140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 20:09:04,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651594393] [2024-11-09 20:09:04,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:04,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 20:09:04,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:09:04,380 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-09 20:09:04,382 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-09 20:09:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:04,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 20:09:04,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:09:04,660 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-09 20:09:04,660 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 20:09:04,921 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-09 20:09:04,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651594393] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 20:09:04,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 20:09:04,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 12 [2024-11-09 20:09:04,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995045924] [2024-11-09 20:09:04,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 20:09:04,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 20:09:04,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:09:04,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 20:09:04,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 20:09:04,923 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-09 20:09:05,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:09:05,267 INFO L93 Difference]: Finished difference Result 709 states and 1010 transitions. [2024-11-09 20:09:05,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 20:09:05,267 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-09 20:09:05,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:09:05,270 INFO L225 Difference]: With dead ends: 709 [2024-11-09 20:09:05,270 INFO L226 Difference]: Without dead ends: 698 [2024-11-09 20:09:05,271 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-09 20:09:05,271 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 245 mSDsluCounter, 2018 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 20:09:05,271 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.3s Time] [2024-11-09 20:09:05,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-09 20:09:05,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-11-09 20:09:05,286 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-09 20:09:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 974 transitions. [2024-11-09 20:09:05,287 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 974 transitions. Word has length 70 [2024-11-09 20:09:05,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:09:05,288 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 974 transitions. [2024-11-09 20:09:05,288 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-09 20:09:05,288 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 974 transitions. [2024-11-09 20:09:05,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 20:09:05,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:09:05,290 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-09 20:09:05,308 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-09 20:09:05,490 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-09 20:09:05,491 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:09:05,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:09:05,491 INFO L85 PathProgramCache]: Analyzing trace with hash 254273521, now seen corresponding path program 1 times [2024-11-09 20:09:05,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:09:05,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378488208] [2024-11-09 20:09:05,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:05,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:09:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:05,918 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-09 20:09:05,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:09:05,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378488208] [2024-11-09 20:09:05,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378488208] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 20:09:05,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585417638] [2024-11-09 20:09:05,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:05,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 20:09:05,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:09:05,920 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-09 20:09:05,922 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-09 20:09:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:06,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 20:09:06,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:09:06,348 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-09 20:09:06,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 20:09:06,944 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-09 20:09:06,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585417638] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 20:09:06,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 20:09:06,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2024-11-09 20:09:06,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299634450] [2024-11-09 20:09:06,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 20:09:06,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 20:09:06,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:09:06,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 20:09:06,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-11-09 20:09:06,947 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-09 20:09:07,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:09:07,309 INFO L93 Difference]: Finished difference Result 701 states and 976 transitions. [2024-11-09 20:09:07,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 20:09:07,310 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-09 20:09:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:09:07,313 INFO L225 Difference]: With dead ends: 701 [2024-11-09 20:09:07,313 INFO L226 Difference]: Without dead ends: 698 [2024-11-09 20:09:07,313 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-09 20:09:07,314 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 323 mSDsluCounter, 2105 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-09 20:09:07,314 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.3s Time] [2024-11-09 20:09:07,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-11-09 20:09:07,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-11-09 20:09:07,329 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-09 20:09:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 972 transitions. [2024-11-09 20:09:07,331 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 972 transitions. Word has length 95 [2024-11-09 20:09:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:09:07,331 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 972 transitions. [2024-11-09 20:09:07,331 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-09 20:09:07,331 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 972 transitions. [2024-11-09 20:09:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 20:09:07,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:09:07,333 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-09 20:09:07,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 20:09:07,533 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-09 20:09:07,533 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:09:07,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:09:07,534 INFO L85 PathProgramCache]: Analyzing trace with hash 990631969, now seen corresponding path program 1 times [2024-11-09 20:09:07,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:09:07,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232113185] [2024-11-09 20:09:07,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:07,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:09:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:07,695 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-09 20:09:07,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:09:07,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232113185] [2024-11-09 20:09:07,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232113185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 20:09:07,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121267571] [2024-11-09 20:09:07,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:07,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 20:09:07,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:09:07,697 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-09 20:09:07,699 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-09 20:09:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:07,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 20:09:07,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:09:07,937 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-09 20:09:07,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 20:09:08,077 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-09 20:09:08,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121267571] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 20:09:08,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 20:09:08,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-09 20:09:08,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858761790] [2024-11-09 20:09:08,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 20:09:08,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 20:09:08,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:09:08,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 20:09:08,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 20:09:08,080 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-09 20:09:08,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:09:08,235 INFO L93 Difference]: Finished difference Result 1891 states and 2647 transitions. [2024-11-09 20:09:08,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 20:09:08,236 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-09 20:09:08,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:09:08,240 INFO L225 Difference]: With dead ends: 1891 [2024-11-09 20:09:08,240 INFO L226 Difference]: Without dead ends: 1458 [2024-11-09 20:09:08,241 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-09 20:09:08,242 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-09 20:09:08,242 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-09 20:09:08,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2024-11-09 20:09:08,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1369. [2024-11-09 20:09:08,276 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-09 20:09:08,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1925 transitions. [2024-11-09 20:09:08,278 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1925 transitions. Word has length 111 [2024-11-09 20:09:08,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:09:08,278 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1925 transitions. [2024-11-09 20:09:08,279 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-09 20:09:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1925 transitions. [2024-11-09 20:09:08,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 20:09:08,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:09:08,280 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-09 20:09:08,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 20:09:08,480 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-09 20:09:08,481 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:09:08,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:09:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1336808752, now seen corresponding path program 1 times [2024-11-09 20:09:08,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:09:08,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503435610] [2024-11-09 20:09:08,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:08,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:09:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:09,155 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-09 20:09:09,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:09:09,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503435610] [2024-11-09 20:09:09,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503435610] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 20:09:09,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527545073] [2024-11-09 20:09:09,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:09,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 20:09:09,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:09:09,158 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-09 20:09:09,159 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-09 20:09:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:09,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 20:09:09,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:09:09,869 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-09 20:09:09,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 20:09:10,898 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-09 20:09:10,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527545073] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 20:09:10,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 20:09:10,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 32 [2024-11-09 20:09:10,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462060143] [2024-11-09 20:09:10,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 20:09:10,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 20:09:10,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:09:10,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 20:09:10,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2024-11-09 20:09:10,901 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-09 20:09:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:09:11,223 INFO L93 Difference]: Finished difference Result 1372 states and 1927 transitions. [2024-11-09 20:09:11,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 20:09:11,224 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-09 20:09:11,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:09:11,231 INFO L225 Difference]: With dead ends: 1372 [2024-11-09 20:09:11,231 INFO L226 Difference]: Without dead ends: 1369 [2024-11-09 20:09:11,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 309 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 20:09:11,232 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-09 20:09:11,233 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-09 20:09:11,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2024-11-09 20:09:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1369. [2024-11-09 20:09:11,255 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-09 20:09:11,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1922 transitions. [2024-11-09 20:09:11,258 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1922 transitions. Word has length 162 [2024-11-09 20:09:11,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:09:11,258 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1922 transitions. [2024-11-09 20:09:11,259 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-09 20:09:11,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1922 transitions. [2024-11-09 20:09:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-09 20:09:11,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:09:11,262 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-09 20:09:11,280 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-09 20:09:11,462 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-09 20:09:11,463 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:09:11,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:09:11,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1625878874, now seen corresponding path program 2 times [2024-11-09 20:09:11,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:09:11,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305000040] [2024-11-09 20:09:11,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:11,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:09:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:12,168 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-09 20:09:12,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:09:12,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305000040] [2024-11-09 20:09:12,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305000040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 20:09:12,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611907006] [2024-11-09 20:09:12,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 20:09:12,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 20:09:12,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:09:12,170 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-09 20:09:12,172 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-09 20:09:12,408 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 20:09:12,408 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 20:09:12,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 20:09:12,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:09:12,651 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-09 20:09:12,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 20:09:13,015 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-09 20:09:13,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611907006] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 20:09:13,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 20:09:13,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2024-11-09 20:09:13,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168184358] [2024-11-09 20:09:13,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 20:09:13,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 20:09:13,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:09:13,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 20:09:13,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2024-11-09 20:09:13,018 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-09 20:09:13,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:09:13,265 INFO L93 Difference]: Finished difference Result 3281 states and 4606 transitions. [2024-11-09 20:09:13,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 20:09:13,265 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-09 20:09:13,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:09:13,273 INFO L225 Difference]: With dead ends: 3281 [2024-11-09 20:09:13,273 INFO L226 Difference]: Without dead ends: 2356 [2024-11-09 20:09:13,274 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-09 20:09:13,275 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-09 20:09:13,275 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-09 20:09:13,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2356 states. [2024-11-09 20:09:13,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2356 to 2230. [2024-11-09 20:09:13,303 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-09 20:09:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2230 states to 2230 states and 3136 transitions. [2024-11-09 20:09:13,307 INFO L78 Accepts]: Start accepts. Automaton has 2230 states and 3136 transitions. Word has length 261 [2024-11-09 20:09:13,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:09:13,307 INFO L471 AbstractCegarLoop]: Abstraction has 2230 states and 3136 transitions. [2024-11-09 20:09:13,307 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-09 20:09:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2230 states and 3136 transitions. [2024-11-09 20:09:13,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2024-11-09 20:09:13,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:09:13,313 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-09 20:09:13,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-09 20:09:13,517 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-09 20:09:13,518 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:09:13,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:09:13,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2084813854, now seen corresponding path program 1 times [2024-11-09 20:09:13,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:09:13,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708654160] [2024-11-09 20:09:13,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:13,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:09:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 20:09:13,884 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 20:09:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 20:09:14,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 20:09:14,308 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 20:09:14,309 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 20:09:14,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 20:09:14,314 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-09 20:09:14,501 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 20:09:14,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 08:09:14 BoogieIcfgContainer [2024-11-09 20:09:14,505 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 20:09:14,505 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 20:09:14,505 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 20:09:14,505 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 20:09:14,506 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:08:54" (3/4) ... [2024-11-09 20:09:14,506 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 20:09:14,684 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 20:09:14,684 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 20:09:14,684 INFO L158 Benchmark]: Toolchain (without parser) took 21966.84ms. Allocated memory was 148.9MB in the beginning and 482.3MB in the end (delta: 333.4MB). Free memory was 100.7MB in the beginning and 318.8MB in the end (delta: -218.1MB). Peak memory consumption was 115.6MB. Max. memory is 16.1GB. [2024-11-09 20:09:14,685 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory was 66.6MB in the beginning and 66.4MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 20:09:14,685 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.00ms. Allocated memory is still 148.9MB. Free memory was 100.7MB in the beginning and 78.2MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 20:09:14,685 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.62ms. Allocated memory is still 148.9MB. Free memory was 78.2MB in the beginning and 73.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 20:09:14,686 INFO L158 Benchmark]: Boogie Preprocessor took 70.83ms. Allocated memory is still 148.9MB. Free memory was 73.4MB in the beginning and 70.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 20:09:14,686 INFO L158 Benchmark]: IcfgBuilder took 1008.94ms. Allocated memory is still 148.9MB. Free memory was 70.5MB in the beginning and 69.9MB in the end (delta: 577.9kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 20:09:14,686 INFO L158 Benchmark]: TraceAbstraction took 20162.83ms. Allocated memory was 148.9MB in the beginning and 482.3MB in the end (delta: 333.4MB). Free memory was 69.2MB in the beginning and 352.3MB in the end (delta: -283.2MB). Peak memory consumption was 199.4MB. Max. memory is 16.1GB. [2024-11-09 20:09:14,688 INFO L158 Benchmark]: Witness Printer took 178.61ms. Allocated memory is still 482.3MB. Free memory was 352.3MB in the beginning and 318.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-09 20:09:14,689 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.17ms. Allocated memory is still 100.7MB. Free memory was 66.6MB in the beginning and 66.4MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.00ms. Allocated memory is still 148.9MB. Free memory was 100.7MB in the beginning and 78.2MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.62ms. Allocated memory is still 148.9MB. Free memory was 78.2MB in the beginning and 73.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.83ms. Allocated memory is still 148.9MB. Free memory was 73.4MB in the beginning and 70.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 1008.94ms. Allocated memory is still 148.9MB. Free memory was 70.5MB in the beginning and 69.9MB in the end (delta: 577.9kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 20162.83ms. Allocated memory was 148.9MB in the beginning and 482.3MB in the end (delta: 333.4MB). Free memory was 69.2MB in the beginning and 352.3MB in the end (delta: -283.2MB). Peak memory consumption was 199.4MB. Max. memory is 16.1GB. * Witness Printer took 178.61ms. Allocated memory is still 482.3MB. Free memory was 352.3MB in the beginning and 318.8MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. 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: 19.9s, OverallIterations: 23, TraceHistogramMax: 35, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7938 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7938 mSDsluCounter, 20311 SdHoareTripleChecker+Invalid, 2.4s 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.5s 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.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 391 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 9.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-09 20:09:14,738 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