./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 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/psyco/psyco_abp_1-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39adc6d5c92d5d4be7746cac0afbcc96f3b450588f18f3eb2d03a3ab1e20a3ef --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 00:51:15,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:51:15,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:51:15,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:51:15,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:51:15,184 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:51:15,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:51:15,188 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:51:15,189 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:51:15,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:51:15,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:51:15,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:51:15,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:51:15,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:51:15,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:51:15,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:51:15,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:51:15,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:51:15,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:51:15,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:51:15,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:51:15,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:51:15,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:51:15,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:51:15,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:51:15,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:51:15,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:51:15,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:51:15,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:51:15,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:51:15,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:51:15,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:51:15,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:51:15,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:51:15,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:51:15,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:51:15,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:51:15,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:51:15,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:51:15,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:51:15,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:51:15,256 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 00:51:15,299 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:51:15,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:51:15,300 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:51:15,300 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:51:15,301 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:51:15,301 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:51:15,302 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:51:15,302 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:51:15,302 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:51:15,303 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:51:15,303 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:51:15,305 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:51:15,305 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:51:15,306 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:51:15,306 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:51:15,306 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:51:15,307 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:51:15,307 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:51:15,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:51:15,308 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:51:15,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:51:15,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:51:15,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:51:15,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:51:15,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:51:15,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:51:15,310 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:51:15,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:51:15,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:51:15,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:51:15,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:51:15,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:51:15,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:51:15,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:51:15,313 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:51:15,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:51:15,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:51:15,314 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:51:15,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:51:15,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:51:15,315 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:51:15,315 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Taipan 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 [2022-11-26 00:51:15,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:51:15,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:51:15,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:51:15,663 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:51:15,663 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:51:15,665 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/psyco/psyco_abp_1-1.c [2022-11-26 00:51:19,133 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:51:19,435 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:51:19,436 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/sv-benchmarks/c/psyco/psyco_abp_1-1.c [2022-11-26 00:51:19,453 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/data/d0cdb3a6f/516cfab5450b4c46834a7e7cfcd37296/FLAGffdcfda89 [2022-11-26 00:51:19,471 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/data/d0cdb3a6f/516cfab5450b4c46834a7e7cfcd37296 [2022-11-26 00:51:19,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:51:19,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:51:19,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:51:19,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:51:19,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:51:19,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:51:19" (1/1) ... [2022-11-26 00:51:19,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46321aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:51:19, skipping insertion in model container [2022-11-26 00:51:19,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:51:19" (1/1) ... [2022-11-26 00:51:19,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:51:19,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:51:19,860 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831] [2022-11-26 00:51:19,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:51:19,882 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:51:20,026 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831] [2022-11-26 00:51:20,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:51:20,080 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:51:20,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:51:20 WrapperNode [2022-11-26 00:51:20,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:51:20,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:51:20,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:51:20,086 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:51:20,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:51:20" (1/1) ... [2022-11-26 00:51:20,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:51:20" (1/1) ... [2022-11-26 00:51:20,183 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 417 [2022-11-26 00:51:20,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:51:20,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:51:20,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:51:20,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:51:20,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:51:20" (1/1) ... [2022-11-26 00:51:20,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:51:20" (1/1) ... [2022-11-26 00:51:20,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:51:20" (1/1) ... [2022-11-26 00:51:20,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:51:20" (1/1) ... [2022-11-26 00:51:20,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:51:20" (1/1) ... [2022-11-26 00:51:20,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:51:20" (1/1) ... [2022-11-26 00:51:20,235 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:51:20" (1/1) ... [2022-11-26 00:51:20,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:51:20" (1/1) ... [2022-11-26 00:51:20,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:51:20,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:51:20,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:51:20,249 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:51:20,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:51:20" (1/1) ... [2022-11-26 00:51:20,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:51:20,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:51:20,288 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:51:20,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:51:20,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:51:20,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:51:20,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:51:20,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:51:20,492 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:51:20,495 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:51:21,697 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:51:21,740 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:51:21,740 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-26 00:51:21,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:51:21 BoogieIcfgContainer [2022-11-26 00:51:21,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:51:21,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:51:21,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:51:21,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:51:21,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:51:19" (1/3) ... [2022-11-26 00:51:21,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b07075a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:51:21, skipping insertion in model container [2022-11-26 00:51:21,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:51:20" (2/3) ... [2022-11-26 00:51:21,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b07075a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:51:21, skipping insertion in model container [2022-11-26 00:51:21,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:51:21" (3/3) ... [2022-11-26 00:51:21,766 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2022-11-26 00:51:21,788 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:51:21,788 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-26 00:51:21,856 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:51:21,864 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@188fc806, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:51:21,865 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-26 00:51:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 105 states have (on average 1.9714285714285715) internal successors, (207), 106 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:21,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:51:21,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:21,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:21,882 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:51:21,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:21,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1655152119, now seen corresponding path program 1 times [2022-11-26 00:51:21,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:21,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308104382] [2022-11-26 00:51:21,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:21,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:22,206 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:22,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308104382] [2022-11-26 00:51:22,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308104382] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:51:22,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:51:22,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:51:22,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004764280] [2022-11-26 00:51:22,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:22,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-26 00:51:22,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:22,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-26 00:51:22,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 00:51:22,271 INFO L87 Difference]: Start difference. First operand has 107 states, 105 states have (on average 1.9714285714285715) internal successors, (207), 106 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:22,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:22,364 INFO L93 Difference]: Finished difference Result 213 states and 413 transitions. [2022-11-26 00:51:22,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-26 00:51:22,371 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-26 00:51:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:22,389 INFO L225 Difference]: With dead ends: 213 [2022-11-26 00:51:22,389 INFO L226 Difference]: Without dead ends: 104 [2022-11-26 00:51:22,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 00:51:22,397 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:22,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:51:22,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-26 00:51:22,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-11-26 00:51:22,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.6893203883495145) internal successors, (174), 103 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:22,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 174 transitions. [2022-11-26 00:51:22,449 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 174 transitions. Word has length 8 [2022-11-26 00:51:22,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:22,449 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 174 transitions. [2022-11-26 00:51:22,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:22,450 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 174 transitions. [2022-11-26 00:51:22,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:51:22,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:22,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:22,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:51:22,452 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:51:22,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:22,453 INFO L85 PathProgramCache]: Analyzing trace with hash 762379355, now seen corresponding path program 1 times [2022-11-26 00:51:22,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:22,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539470105] [2022-11-26 00:51:22,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:22,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:22,574 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:22,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539470105] [2022-11-26 00:51:22,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539470105] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:51:22,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:51:22,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:51:22,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712976605] [2022-11-26 00:51:22,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:22,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:51:22,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:22,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:51:22,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:51:22,580 INFO L87 Difference]: Start difference. First operand 104 states and 174 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:22,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:22,679 INFO L93 Difference]: Finished difference Result 210 states and 351 transitions. [2022-11-26 00:51:22,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:51:22,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 00:51:22,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:22,682 INFO L225 Difference]: With dead ends: 210 [2022-11-26 00:51:22,682 INFO L226 Difference]: Without dead ends: 107 [2022-11-26 00:51:22,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:51:22,685 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 4 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 323 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.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:22,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 323 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:51:22,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-26 00:51:22,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-11-26 00:51:22,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.669811320754717) internal successors, (177), 106 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:22,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 177 transitions. [2022-11-26 00:51:22,699 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 177 transitions. Word has length 9 [2022-11-26 00:51:22,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:22,700 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 177 transitions. [2022-11-26 00:51:22,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 177 transitions. [2022-11-26 00:51:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-26 00:51:22,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:22,702 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:22,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:51:22,703 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:51:22,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:22,704 INFO L85 PathProgramCache]: Analyzing trace with hash -197013714, now seen corresponding path program 1 times [2022-11-26 00:51:22,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:22,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722679703] [2022-11-26 00:51:22,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:22,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:23,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:23,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722679703] [2022-11-26 00:51:23,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722679703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:51:23,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:51:23,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:51:23,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908495816] [2022-11-26 00:51:23,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:23,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:51:23,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:23,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:51:23,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:51:23,864 INFO L87 Difference]: Start difference. First operand 107 states and 177 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:24,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:24,306 INFO L93 Difference]: Finished difference Result 218 states and 355 transitions. [2022-11-26 00:51:24,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:51:24,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-26 00:51:24,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:24,316 INFO L225 Difference]: With dead ends: 218 [2022-11-26 00:51:24,316 INFO L226 Difference]: Without dead ends: 194 [2022-11-26 00:51:24,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:51:24,326 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 153 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:24,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 519 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 00:51:24,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-26 00:51:24,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2022-11-26 00:51:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.6571428571428573) internal successors, (290), 175 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 290 transitions. [2022-11-26 00:51:24,361 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 290 transitions. Word has length 14 [2022-11-26 00:51:24,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:24,362 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 290 transitions. [2022-11-26 00:51:24,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:24,362 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 290 transitions. [2022-11-26 00:51:24,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-26 00:51:24,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:24,365 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:24,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:51:24,365 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:51:24,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:24,367 INFO L85 PathProgramCache]: Analyzing trace with hash 938789430, now seen corresponding path program 1 times [2022-11-26 00:51:24,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:24,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271971778] [2022-11-26 00:51:24,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:24,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:24,425 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:24,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271971778] [2022-11-26 00:51:24,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271971778] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:51:24,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:51:24,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:51:24,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486647393] [2022-11-26 00:51:24,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:24,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:51:24,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:24,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:51:24,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:51:24,431 INFO L87 Difference]: Start difference. First operand 176 states and 290 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:24,479 INFO L93 Difference]: Finished difference Result 302 states and 496 transitions. [2022-11-26 00:51:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:51:24,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-11-26 00:51:24,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:24,481 INFO L225 Difference]: With dead ends: 302 [2022-11-26 00:51:24,481 INFO L226 Difference]: Without dead ends: 128 [2022-11-26 00:51:24,486 INFO L412 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 [2022-11-26 00:51:24,494 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 32 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:24,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 295 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:51:24,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-26 00:51:24,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2022-11-26 00:51:24,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.624) internal successors, (203), 125 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:24,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 203 transitions. [2022-11-26 00:51:24,519 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 203 transitions. Word has length 15 [2022-11-26 00:51:24,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:24,525 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 203 transitions. [2022-11-26 00:51:24,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:24,525 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 203 transitions. [2022-11-26 00:51:24,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-26 00:51:24,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:24,527 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:24,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:51:24,527 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:51:24,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:24,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1693191315, now seen corresponding path program 1 times [2022-11-26 00:51:24,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:24,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800914212] [2022-11-26 00:51:24,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:24,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:51:24,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:24,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800914212] [2022-11-26 00:51:24,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800914212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:51:24,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:51:24,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:51:24,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835649994] [2022-11-26 00:51:24,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:24,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:51:24,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:24,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:51:24,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:51:24,635 INFO L87 Difference]: Start difference. First operand 126 states and 203 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:24,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:24,684 INFO L93 Difference]: Finished difference Result 257 states and 414 transitions. [2022-11-26 00:51:24,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:51:24,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 [2022-11-26 00:51:24,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:24,686 INFO L225 Difference]: With dead ends: 257 [2022-11-26 00:51:24,687 INFO L226 Difference]: Without dead ends: 133 [2022-11-26 00:51:24,687 INFO L412 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 [2022-11-26 00:51:24,689 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 34 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:24,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 294 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:51:24,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-26 00:51:24,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-11-26 00:51:24,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.6) internal successors, (208), 130 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:24,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 208 transitions. [2022-11-26 00:51:24,719 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 208 transitions. Word has length 20 [2022-11-26 00:51:24,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:24,720 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 208 transitions. [2022-11-26 00:51:24,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:24,720 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 208 transitions. [2022-11-26 00:51:24,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 00:51:24,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:24,726 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:24,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 00:51:24,727 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:51:24,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:24,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1475234708, now seen corresponding path program 1 times [2022-11-26 00:51:24,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:24,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701845478] [2022-11-26 00:51:24,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:24,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:24,869 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:24,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701845478] [2022-11-26 00:51:24,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701845478] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:51:24,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315984250] [2022-11-26 00:51:24,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:24,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:51:24,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:51:24,878 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:51:24,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:51:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:24,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:51:25,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:51:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:25,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:51:25,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:25,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315984250] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:51:25,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1895028688] [2022-11-26 00:51:25,150 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-26 00:51:25,150 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:51:25,155 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:51:25,163 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:51:25,163 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:51:27,722 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:51:31,124 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2190#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) 0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= ~m_Protocol~0 1) (= 3 |ULTIMATE.start_main_~q~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P1~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) (ite (and (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (< |ULTIMATE.start_main_~this_expect~0#1| 0)) (+ (- 2) (mod |ULTIMATE.start_main_~this_expect~0#1| 2)) (mod |ULTIMATE.start_main_~this_expect~0#1| 2))) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (= 2 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P1~0#1| 2147483647) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 00:51:31,125 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:51:31,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:51:31,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-26 00:51:31,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555493434] [2022-11-26 00:51:31,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:51:31,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:51:31,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:31,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:51:31,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:51:31,128 INFO L87 Difference]: Start difference. First operand 131 states and 208 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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) [2022-11-26 00:51:31,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:31,433 INFO L93 Difference]: Finished difference Result 248 states and 393 transitions. [2022-11-26 00:51:31,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:51:31,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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 22 [2022-11-26 00:51:31,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:31,436 INFO L225 Difference]: With dead ends: 248 [2022-11-26 00:51:31,436 INFO L226 Difference]: Without dead ends: 233 [2022-11-26 00:51:31,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:51:31,437 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 316 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:31,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 826 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 00:51:31,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-11-26 00:51:31,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 211. [2022-11-26 00:51:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.6428571428571428) internal successors, (345), 210 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 345 transitions. [2022-11-26 00:51:31,461 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 345 transitions. Word has length 22 [2022-11-26 00:51:31,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:31,461 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 345 transitions. [2022-11-26 00:51:31,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 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) [2022-11-26 00:51:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 345 transitions. [2022-11-26 00:51:31,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-26 00:51:31,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:31,463 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:31,493 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-26 00:51:31,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-26 00:51:31,664 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:51:31,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:31,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1500920786, now seen corresponding path program 1 times [2022-11-26 00:51:31,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:31,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243510872] [2022-11-26 00:51:31,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:31,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:32,072 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:32,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:32,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243510872] [2022-11-26 00:51:32,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243510872] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:51:32,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063467114] [2022-11-26 00:51:32,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:32,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:51:32,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:51:32,075 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:51:32,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:51:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:32,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-26 00:51:32,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:51:32,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:32,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:51:32,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:32,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063467114] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:51:32,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1238395921] [2022-11-26 00:51:32,594 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-26 00:51:32,595 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:51:32,595 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:51:32,595 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:51:32,596 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:51:34,418 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:51:37,897 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2835#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (or (and (not (= |ULTIMATE.start_main_~P3~0#1| (ite (and (< |ULTIMATE.start_main_~this_expect~0#1| 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (+ (- 2) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (= |ULTIMATE.start_main_~P3~0#1| 0)) (and (= |ULTIMATE.start_main_~P3~0#1| 0) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))) (= 7 ~m_recv_ack_1_2~0) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (= 3 |ULTIMATE.start_main_~method_id~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= |ULTIMATE.start_main_~P1~0#1| 0) (= ~m_Protocol~0 1) (= 3 |ULTIMATE.start_main_~q~0#1|) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 00:51:37,898 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:51:37,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:51:37,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 10 [2022-11-26 00:51:37,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567352669] [2022-11-26 00:51:37,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:51:37,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-26 00:51:37,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:37,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-26 00:51:37,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2022-11-26 00:51:37,901 INFO L87 Difference]: Start difference. First operand 211 states and 345 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 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) [2022-11-26 00:51:38,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:38,138 INFO L93 Difference]: Finished difference Result 235 states and 377 transitions. [2022-11-26 00:51:38,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:51:38,139 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 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 23 [2022-11-26 00:51:38,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:38,140 INFO L225 Difference]: With dead ends: 235 [2022-11-26 00:51:38,140 INFO L226 Difference]: Without dead ends: 231 [2022-11-26 00:51:38,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2022-11-26 00:51:38,142 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 106 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:38,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 723 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:51:38,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-11-26 00:51:38,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2022-11-26 00:51:38,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6228070175438596) internal successors, (370), 228 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 370 transitions. [2022-11-26 00:51:38,169 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 370 transitions. Word has length 23 [2022-11-26 00:51:38,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:38,170 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 370 transitions. [2022-11-26 00:51:38,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 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) [2022-11-26 00:51:38,170 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 370 transitions. [2022-11-26 00:51:38,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-26 00:51:38,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:38,174 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:38,189 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:51:38,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:51:38,382 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:51:38,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:38,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1554530707, now seen corresponding path program 1 times [2022-11-26 00:51:38,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:38,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057800548] [2022-11-26 00:51:38,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:38,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-26 00:51:38,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:38,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057800548] [2022-11-26 00:51:38,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057800548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:51:38,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:51:38,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:51:38,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805154840] [2022-11-26 00:51:38,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:51:38,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:51:38,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:38,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:51:38,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:51:38,457 INFO L87 Difference]: Start difference. First operand 229 states and 370 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:38,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:38,496 INFO L93 Difference]: Finished difference Result 428 states and 688 transitions. [2022-11-26 00:51:38,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:51:38,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 29 [2022-11-26 00:51:38,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:38,498 INFO L225 Difference]: With dead ends: 428 [2022-11-26 00:51:38,498 INFO L226 Difference]: Without dead ends: 201 [2022-11-26 00:51:38,499 INFO L412 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 [2022-11-26 00:51:38,501 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 69 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:38,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 202 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:51:38,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-26 00:51:38,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2022-11-26 00:51:38,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 1.5707070707070707) internal successors, (311), 198 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:38,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 311 transitions. [2022-11-26 00:51:38,508 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 311 transitions. Word has length 29 [2022-11-26 00:51:38,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:38,510 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 311 transitions. [2022-11-26 00:51:38,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:38,511 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 311 transitions. [2022-11-26 00:51:38,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:51:38,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:38,513 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-26 00:51:38,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 00:51:38,513 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:51:38,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:38,515 INFO L85 PathProgramCache]: Analyzing trace with hash -2135712591, now seen corresponding path program 1 times [2022-11-26 00:51:38,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:38,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652670894] [2022-11-26 00:51:38,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:38,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:38,955 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:51:38,955 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:38,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652670894] [2022-11-26 00:51:38,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652670894] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:51:38,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118033696] [2022-11-26 00:51:38,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:38,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:51:38,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:51:38,957 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:51:38,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:51:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:39,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-26 00:51:39,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:51:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-26 00:51:39,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:51:39,469 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:51:39,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118033696] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:51:39,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1390613594] [2022-11-26 00:51:39,473 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-26 00:51:39,473 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:51:39,473 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:51:39,474 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:51:39,474 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:51:41,244 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:51:45,668 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4210#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) 0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= ~m_Protocol~0 1) (<= 0 (+ |ULTIMATE.start_main_~P1~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) (ite (and (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (< |ULTIMATE.start_main_~this_expect~0#1| 0)) (+ (- 2) (mod |ULTIMATE.start_main_~this_expect~0#1| 2)) (mod |ULTIMATE.start_main_~this_expect~0#1| 2))) (= |ULTIMATE.start_main_~q~0#1| 4) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (= 2 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P1~0#1| 2147483647) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 00:51:45,669 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:51:45,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:51:45,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 11 [2022-11-26 00:51:45,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163844323] [2022-11-26 00:51:45,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:51:45,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-26 00:51:45,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:45,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-26 00:51:45,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2022-11-26 00:51:45,672 INFO L87 Difference]: Start difference. First operand 199 states and 311 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:46,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:46,673 INFO L93 Difference]: Finished difference Result 596 states and 919 transitions. [2022-11-26 00:51:46,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-26 00:51:46,675 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 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 [2022-11-26 00:51:46,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:46,678 INFO L225 Difference]: With dead ends: 596 [2022-11-26 00:51:46,678 INFO L226 Difference]: Without dead ends: 415 [2022-11-26 00:51:46,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=197, Invalid=1209, Unknown=0, NotChecked=0, Total=1406 [2022-11-26 00:51:46,680 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 618 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:46,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1016 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-26 00:51:46,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-11-26 00:51:46,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 349. [2022-11-26 00:51:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.5804597701149425) internal successors, (550), 348 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:46,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 550 transitions. [2022-11-26 00:51:46,697 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 550 transitions. Word has length 32 [2022-11-26 00:51:46,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:46,698 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 550 transitions. [2022-11-26 00:51:46,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:46,699 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 550 transitions. [2022-11-26 00:51:46,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-26 00:51:46,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:46,700 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-26 00:51:46,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:51:46,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:51:46,907 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:51:46,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:46,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1771134383, now seen corresponding path program 1 times [2022-11-26 00:51:46,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:46,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194127738] [2022-11-26 00:51:46,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:46,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:47,075 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:51:47,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:47,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194127738] [2022-11-26 00:51:47,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194127738] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:51:47,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865082722] [2022-11-26 00:51:47,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:47,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:51:47,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:51:47,079 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:51:47,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:51:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:47,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 00:51:47,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:51:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:51:47,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:51:47,336 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:51:47,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865082722] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:51:47,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [249423333] [2022-11-26 00:51:47,340 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-26 00:51:47,340 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:51:47,341 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:51:47,341 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:51:47,341 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:51:48,764 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:51:52,423 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5461#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (= 3 |ULTIMATE.start_main_~method_id~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= |ULTIMATE.start_main_~P3~0#1| (ite (and (< |ULTIMATE.start_main_~this_expect~0#1| 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (+ (- 2) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))) (= |ULTIMATE.start_main_~P1~0#1| 0) (= ~m_Protocol~0 1) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= |ULTIMATE.start_main_~q~0#1| 4) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (= |ULTIMATE.start_main_~P3~0#1| 0) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 00:51:52,423 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:51:52,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:51:52,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-11-26 00:51:52,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510684481] [2022-11-26 00:51:52,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:51:52,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:51:52,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:51:52,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:51:52,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2022-11-26 00:51:52,425 INFO L87 Difference]: Start difference. First operand 349 states and 550 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:52,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:52,560 INFO L93 Difference]: Finished difference Result 363 states and 562 transitions. [2022-11-26 00:51:52,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:51:52,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-26 00:51:52,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:52,563 INFO L225 Difference]: With dead ends: 363 [2022-11-26 00:51:52,563 INFO L226 Difference]: Without dead ends: 351 [2022-11-26 00:51:52,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2022-11-26 00:51:52,565 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 220 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:52,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 421 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:51:52,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-11-26 00:51:52,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2022-11-26 00:51:52,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.5344827586206897) internal successors, (534), 348 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 534 transitions. [2022-11-26 00:51:52,588 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 534 transitions. Word has length 33 [2022-11-26 00:51:52,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:52,589 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 534 transitions. [2022-11-26 00:51:52,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:52,589 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 534 transitions. [2022-11-26 00:51:52,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-26 00:51:52,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:52,592 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-26 00:51:52,599 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-26 00:51:52,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:51:52,798 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:51:52,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:52,800 INFO L85 PathProgramCache]: Analyzing trace with hash -886789566, now seen corresponding path program 1 times [2022-11-26 00:51:52,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:51:52,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433260963] [2022-11-26 00:51:52,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:52,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:51:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:53,598 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:51:53,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433260963] [2022-11-26 00:51:53,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433260963] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:51:53,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486477857] [2022-11-26 00:51:53,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:53,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:51:53,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:51:53,600 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:51:53,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 00:51:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:53,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-26 00:51:53,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:51:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:53,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:51:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:54,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486477857] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:51:54,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [350515627] [2022-11-26 00:51:54,356 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-26 00:51:54,357 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:51:54,358 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:51:54,358 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:51:54,358 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:51:55,869 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:52:00,343 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6454#(and (or (and (= (ite (and (< |ULTIMATE.start_main_~P6~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 0))) (+ (- 2) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (mod |ULTIMATE.start_main_~P6~0#1| 2)) 1) (not (= (ite (and (< |ULTIMATE.start_main_~P6~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 0))) (+ (- 2) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (ite (and (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (< |ULTIMATE.start_main_~this_expect~0#1| 0)) (+ (- 2) (mod |ULTIMATE.start_main_~this_expect~0#1| 2)) (mod |ULTIMATE.start_main_~this_expect~0#1| 2))))) (and (= (ite (and (< |ULTIMATE.start_main_~P6~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 0))) (+ (- 2) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (mod |ULTIMATE.start_main_~P6~0#1| 2)) 1) (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)))) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) 1) (= 7 ~m_recv_ack_1_2~0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= ~m_Protocol~0 1) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= |ULTIMATE.start_main_~q~0#1| 4) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (= 5 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P1~0#1| 2147483647) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 00:52:00,343 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:52:00,343 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:52:00,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 9 [2022-11-26 00:52:00,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822000398] [2022-11-26 00:52:00,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:52:00,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-26 00:52:00,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:52:00,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-26 00:52:00,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=902, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 00:52:00,345 INFO L87 Difference]: Start difference. First operand 349 states and 534 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:00,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:52:00,611 INFO L93 Difference]: Finished difference Result 376 states and 566 transitions. [2022-11-26 00:52:00,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:52:00,612 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-26 00:52:00,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:52:00,614 INFO L225 Difference]: With dead ends: 376 [2022-11-26 00:52:00,614 INFO L226 Difference]: Without dead ends: 374 [2022-11-26 00:52:00,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=154, Invalid=902, Unknown=0, NotChecked=0, Total=1056 [2022-11-26 00:52:00,615 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 116 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:52:00,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 905 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:52:00,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-11-26 00:52:00,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 349. [2022-11-26 00:52:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.5316091954022988) internal successors, (533), 348 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 533 transitions. [2022-11-26 00:52:00,639 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 533 transitions. Word has length 35 [2022-11-26 00:52:00,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:52:00,640 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 533 transitions. [2022-11-26 00:52:00,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:00,640 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 533 transitions. [2022-11-26 00:52:00,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-26 00:52:00,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:52:00,644 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-26 00:52:00,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 00:52:00,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:52:00,850 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:52:00,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:52:00,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1595435041, now seen corresponding path program 1 times [2022-11-26 00:52:00,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:52:00,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625018580] [2022-11-26 00:52:00,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:00,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:52:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-26 00:52:00,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:52:00,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625018580] [2022-11-26 00:52:00,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625018580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:52:00,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:52:00,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:52:00,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707982947] [2022-11-26 00:52:00,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:52:00,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:52:00,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:52:00,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:52:00,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:52:00,917 INFO L87 Difference]: Start difference. First operand 349 states and 533 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:00,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:52:00,962 INFO L93 Difference]: Finished difference Result 669 states and 1016 transitions. [2022-11-26 00:52:00,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:52:00,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-26 00:52:00,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:52:00,964 INFO L225 Difference]: With dead ends: 669 [2022-11-26 00:52:00,965 INFO L226 Difference]: Without dead ends: 361 [2022-11-26 00:52:00,965 INFO L412 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 [2022-11-26 00:52:00,967 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 32 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:52:00,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 234 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:52:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-11-26 00:52:00,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 359. [2022-11-26 00:52:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.488826815642458) internal successors, (533), 358 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 533 transitions. [2022-11-26 00:52:00,986 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 533 transitions. Word has length 36 [2022-11-26 00:52:00,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:52:00,986 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 533 transitions. [2022-11-26 00:52:00,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:00,987 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 533 transitions. [2022-11-26 00:52:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-26 00:52:00,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:52:00,988 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-26 00:52:00,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-26 00:52:00,988 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:52:00,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:52:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash 852693590, now seen corresponding path program 1 times [2022-11-26 00:52:00,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:52:00,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269457982] [2022-11-26 00:52:00,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:00,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:52:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:01,063 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-26 00:52:01,063 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:52:01,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269457982] [2022-11-26 00:52:01,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269457982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:52:01,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:52:01,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:52:01,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240167107] [2022-11-26 00:52:01,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:52:01,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:52:01,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:52:01,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:52:01,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:52:01,068 INFO L87 Difference]: Start difference. First operand 359 states and 533 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:52:01,109 INFO L93 Difference]: Finished difference Result 463 states and 685 transitions. [2022-11-26 00:52:01,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:52:01,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 47 [2022-11-26 00:52:01,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:52:01,114 INFO L225 Difference]: With dead ends: 463 [2022-11-26 00:52:01,115 INFO L226 Difference]: Without dead ends: 219 [2022-11-26 00:52:01,115 INFO L412 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 [2022-11-26 00:52:01,117 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 29 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:52:01,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 192 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:52:01,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-11-26 00:52:01,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2022-11-26 00:52:01,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.4490740740740742) internal successors, (313), 216 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 313 transitions. [2022-11-26 00:52:01,129 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 313 transitions. Word has length 47 [2022-11-26 00:52:01,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:52:01,131 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 313 transitions. [2022-11-26 00:52:01,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:01,131 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 313 transitions. [2022-11-26 00:52:01,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-26 00:52:01,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:52:01,132 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-26 00:52:01,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-26 00:52:01,133 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:52:01,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:52:01,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1301360374, now seen corresponding path program 1 times [2022-11-26 00:52:01,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:52:01,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091922082] [2022-11-26 00:52:01,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:01,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:52:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-26 00:52:01,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:52:01,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091922082] [2022-11-26 00:52:01,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091922082] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:52:01,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017429500] [2022-11-26 00:52:01,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:01,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:52:01,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:52:01,789 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:52:01,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 00:52:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:01,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-26 00:52:01,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:52:02,058 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-26 00:52:02,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:52:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:52:02,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017429500] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:52:02,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1468488648] [2022-11-26 00:52:02,631 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2022-11-26 00:52:02,632 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:52:02,632 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:52:02,632 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:52:02,633 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:52:04,312 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:52:09,889 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9384#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (not (= |ULTIMATE.start_main_~P1~0#1| 0)) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (not (= |ULTIMATE.start_main_~P8~0#1| 1)) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= ~m_Protocol~0 1) (<= 0 (+ |ULTIMATE.start_main_~P1~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)) (not (= |ULTIMATE.start_main_~P1~0#1| 1)) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= 5 |ULTIMATE.start_main_~q~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (not (= |ULTIMATE.start_main_~P8~0#1| 0)) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~P1~0#1| 2147483647) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (= 6 |ULTIMATE.start_main_~method_id~0#1|) (= |#NULL.base| 0) (= |ULTIMATE.start_main_~P8~0#1| (ite (and (< |ULTIMATE.start_main_~this_expect~0#1| 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (+ (- 2) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))))' at error location [2022-11-26 00:52:09,889 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:52:09,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:52:09,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 8] total 12 [2022-11-26 00:52:09,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637612593] [2022-11-26 00:52:09,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:52:09,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 00:52:09,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:52:09,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 00:52:09,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1635, Unknown=0, NotChecked=0, Total=1892 [2022-11-26 00:52:09,892 INFO L87 Difference]: Start difference. First operand 217 states and 313 transitions. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:10,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:52:10,401 INFO L93 Difference]: Finished difference Result 322 states and 450 transitions. [2022-11-26 00:52:10,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-26 00:52:10,402 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 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 49 [2022-11-26 00:52:10,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:52:10,403 INFO L225 Difference]: With dead ends: 322 [2022-11-26 00:52:10,403 INFO L226 Difference]: Without dead ends: 315 [2022-11-26 00:52:10,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=301, Invalid=2051, Unknown=0, NotChecked=0, Total=2352 [2022-11-26 00:52:10,405 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 710 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:52:10,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 892 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:52:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-11-26 00:52:10,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 272. [2022-11-26 00:52:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 1.4538745387453875) internal successors, (394), 271 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 394 transitions. [2022-11-26 00:52:10,417 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 394 transitions. Word has length 49 [2022-11-26 00:52:10,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:52:10,417 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 394 transitions. [2022-11-26 00:52:10,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:10,418 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 394 transitions. [2022-11-26 00:52:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-26 00:52:10,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:52:10,419 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-26 00:52:10,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 00:52:10,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-26 00:52:10,626 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:52:10,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:52:10,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1676014596, now seen corresponding path program 1 times [2022-11-26 00:52:10,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:52:10,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167622959] [2022-11-26 00:52:10,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:10,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:52:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:11,400 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:11,400 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:52:11,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167622959] [2022-11-26 00:52:11,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167622959] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:52:11,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159603893] [2022-11-26 00:52:11,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:11,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:52:11,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:52:11,403 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:52:11,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 00:52:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:11,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-26 00:52:11,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:52:11,818 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:11,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:52:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:12,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159603893] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:52:12,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [28735714] [2022-11-26 00:52:12,397 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-26 00:52:12,397 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:52:12,398 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:52:12,398 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:52:12,398 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:52:14,000 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:52:19,791 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10380#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (= ~m_Protocol~0 1) (= 7 |ULTIMATE.start_main_~method_id~0#1|) (or (and (not (= |ULTIMATE.start_main_~P9~0#1| (ite (and (< |ULTIMATE.start_main_~this_expect~0#1| 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (+ (- 2) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (= |ULTIMATE.start_main_~P9~0#1| 1)) (and (= |ULTIMATE.start_main_~P9~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= 5 |ULTIMATE.start_main_~q~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= |ULTIMATE.start_main_~P1~0#1| 1) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 00:52:19,792 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:52:19,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:52:19,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2022-11-26 00:52:19,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823727079] [2022-11-26 00:52:19,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:52:19,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 00:52:19,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:52:19,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 00:52:19,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1826, Unknown=0, NotChecked=0, Total=2070 [2022-11-26 00:52:19,794 INFO L87 Difference]: Start difference. First operand 272 states and 394 transitions. Second operand has 13 states, 13 states have (on average 8.846153846153847) internal successors, (115), 13 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:20,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:52:20,047 INFO L93 Difference]: Finished difference Result 281 states and 399 transitions. [2022-11-26 00:52:20,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 00:52:20,047 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.846153846153847) internal successors, (115), 13 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-11-26 00:52:20,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:52:20,049 INFO L225 Difference]: With dead ends: 281 [2022-11-26 00:52:20,049 INFO L226 Difference]: Without dead ends: 278 [2022-11-26 00:52:20,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 110 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=250, Invalid=1912, Unknown=0, NotChecked=0, Total=2162 [2022-11-26 00:52:20,050 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 220 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:52:20,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 943 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:52:20,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-11-26 00:52:20,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 272. [2022-11-26 00:52:20,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 1.4391143911439115) internal successors, (390), 271 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:20,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 390 transitions. [2022-11-26 00:52:20,062 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 390 transitions. Word has length 50 [2022-11-26 00:52:20,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:52:20,062 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 390 transitions. [2022-11-26 00:52:20,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.846153846153847) internal successors, (115), 13 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:20,063 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 390 transitions. [2022-11-26 00:52:20,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-26 00:52:20,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:52:20,064 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-26 00:52:20,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-26 00:52:20,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-26 00:52:20,270 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:52:20,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:52:20,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1374353121, now seen corresponding path program 1 times [2022-11-26 00:52:20,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:52:20,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43541029] [2022-11-26 00:52:20,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:20,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:52:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:21,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:52:21,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43541029] [2022-11-26 00:52:21,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43541029] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:52:21,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036820295] [2022-11-26 00:52:21,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:21,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:52:21,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:52:21,247 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:52:21,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-26 00:52:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:21,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-26 00:52:21,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:52:21,854 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:21,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:52:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:22,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036820295] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:52:22,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [662818782] [2022-11-26 00:52:22,545 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-26 00:52:22,546 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:52:22,546 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:52:22,546 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:52:22,547 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:52:24,607 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:52:30,182 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11360#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (or (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)) (not (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) (ite (and (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (< |ULTIMATE.start_main_~this_expect~0#1| 0)) (+ (- 2) (mod |ULTIMATE.start_main_~this_expect~0#1| 2)) (mod |ULTIMATE.start_main_~this_expect~0#1| 2))))) (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) 0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= ~m_Protocol~0 1) (<= 0 (+ |ULTIMATE.start_main_~P1~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (= |ULTIMATE.start_main_~q~0#1| 1) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (= 2 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P1~0#1| 2147483647) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 00:52:30,182 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:52:30,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:52:30,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 10] total 17 [2022-11-26 00:52:30,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739914511] [2022-11-26 00:52:30,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:52:30,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 00:52:30,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:52:30,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 00:52:30,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2188, Unknown=0, NotChecked=0, Total=2450 [2022-11-26 00:52:30,185 INFO L87 Difference]: Start difference. First operand 272 states and 390 transitions. Second operand has 17 states, 17 states have (on average 6.529411764705882) internal successors, (111), 17 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:30,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:52:30,513 INFO L93 Difference]: Finished difference Result 282 states and 396 transitions. [2022-11-26 00:52:30,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 00:52:30,513 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.529411764705882) internal successors, (111), 17 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-11-26 00:52:30,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:52:30,516 INFO L225 Difference]: With dead ends: 282 [2022-11-26 00:52:30,516 INFO L226 Difference]: Without dead ends: 279 [2022-11-26 00:52:30,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 127 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=271, Invalid=2279, Unknown=0, NotChecked=0, Total=2550 [2022-11-26 00:52:30,518 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 255 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:52:30,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1216 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 00:52:30,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-26 00:52:30,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 272. [2022-11-26 00:52:30,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 1.4280442804428044) internal successors, (387), 271 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 387 transitions. [2022-11-26 00:52:30,532 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 387 transitions. Word has length 56 [2022-11-26 00:52:30,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:52:30,533 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 387 transitions. [2022-11-26 00:52:30,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.529411764705882) internal successors, (111), 17 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:30,533 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 387 transitions. [2022-11-26 00:52:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-26 00:52:30,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:52:30,534 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-26 00:52:30,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-26 00:52:30,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:52:30,741 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:52:30,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:52:30,741 INFO L85 PathProgramCache]: Analyzing trace with hash 806051951, now seen corresponding path program 1 times [2022-11-26 00:52:30,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:52:30,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639080178] [2022-11-26 00:52:30,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:30,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:52:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:31,966 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 91 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-26 00:52:31,966 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:52:31,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639080178] [2022-11-26 00:52:31,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639080178] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:52:31,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942774328] [2022-11-26 00:52:31,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:31,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:52:31,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:52:31,971 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:52:32,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-26 00:52:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:32,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-26 00:52:32,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:52:32,564 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:32,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:52:33,604 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:33,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942774328] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:52:33,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1590700938] [2022-11-26 00:52:33,606 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-26 00:52:33,606 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:52:33,607 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:52:33,607 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:52:33,607 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:52:35,564 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:52:41,598 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12472#(and (or (and (= (ite (and (< |ULTIMATE.start_main_~P6~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 0))) (+ (- 2) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (mod |ULTIMATE.start_main_~P6~0#1| 2)) 1) (not (= (ite (and (< |ULTIMATE.start_main_~P6~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 0))) (+ (- 2) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (ite (and (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (< |ULTIMATE.start_main_~this_expect~0#1| 0)) (+ (- 2) (mod |ULTIMATE.start_main_~this_expect~0#1| 2)) (mod |ULTIMATE.start_main_~this_expect~0#1| 2))))) (and (= (ite (and (< |ULTIMATE.start_main_~P6~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 0))) (+ (- 2) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (mod |ULTIMATE.start_main_~P6~0#1| 2)) 1) (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)))) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) 1) (= 7 ~m_recv_ack_1_2~0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= ~m_Protocol~0 1) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= |ULTIMATE.start_main_~q~0#1| 4) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (= 5 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P1~0#1| 2147483647) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 00:52:41,598 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:52:41,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:52:41,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2022-11-26 00:52:41,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233776412] [2022-11-26 00:52:41,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:52:41,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-26 00:52:41,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:52:41,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-26 00:52:41,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=2688, Unknown=0, NotChecked=0, Total=2970 [2022-11-26 00:52:41,602 INFO L87 Difference]: Start difference. First operand 272 states and 387 transitions. Second operand has 22 states, 22 states have (on average 9.181818181818182) internal successors, (202), 22 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:42,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:52:42,048 INFO L93 Difference]: Finished difference Result 299 states and 423 transitions. [2022-11-26 00:52:42,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-26 00:52:42,048 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.181818181818182) internal successors, (202), 22 states have internal predecessors, (202), 0 states have call successors, (0), 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 77 [2022-11-26 00:52:42,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:52:42,050 INFO L225 Difference]: With dead ends: 299 [2022-11-26 00:52:42,050 INFO L226 Difference]: Without dead ends: 294 [2022-11-26 00:52:42,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 186 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=295, Invalid=2897, Unknown=0, NotChecked=0, Total=3192 [2022-11-26 00:52:42,052 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 335 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:52:42,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 2300 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 00:52:42,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-26 00:52:42,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2022-11-26 00:52:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.4158075601374571) internal successors, (412), 291 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 412 transitions. [2022-11-26 00:52:42,066 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 412 transitions. Word has length 77 [2022-11-26 00:52:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:52:42,067 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 412 transitions. [2022-11-26 00:52:42,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.181818181818182) internal successors, (202), 22 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 412 transitions. [2022-11-26 00:52:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-26 00:52:42,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:52:42,073 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:52:42,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-26 00:52:42,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-26 00:52:42,287 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:52:42,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:52:42,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1627393088, now seen corresponding path program 1 times [2022-11-26 00:52:42,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:52:42,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706662257] [2022-11-26 00:52:42,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:42,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:52:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:44,249 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 318 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-26 00:52:44,249 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:52:44,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706662257] [2022-11-26 00:52:44,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706662257] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:52:44,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134501852] [2022-11-26 00:52:44,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:44,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:52:44,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:52:44,252 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:52:44,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-26 00:52:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:44,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-26 00:52:44,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:52:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 318 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-26 00:52:44,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:52:47,210 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 28 proven. 330 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-26 00:52:47,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134501852] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:52:47,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [961181286] [2022-11-26 00:52:47,217 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-11-26 00:52:47,217 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:52:47,218 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:52:47,218 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:52:47,218 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:52:49,040 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:52:54,509 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13942#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (= 3 |ULTIMATE.start_main_~method_id~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= |ULTIMATE.start_main_~P3~0#1| (ite (and (< |ULTIMATE.start_main_~this_expect~0#1| 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (+ (- 2) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))) (= |ULTIMATE.start_main_~P1~0#1| 0) (= ~m_Protocol~0 1) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= 5 |ULTIMATE.start_main_~q~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (= |ULTIMATE.start_main_~P3~0#1| 0) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 00:52:54,510 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:52:54,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:52:54,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 16] total 23 [2022-11-26 00:52:54,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775462428] [2022-11-26 00:52:54,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:52:54,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-26 00:52:54,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:52:54,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-26 00:52:54,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=2852, Unknown=0, NotChecked=0, Total=3192 [2022-11-26 00:52:54,513 INFO L87 Difference]: Start difference. First operand 292 states and 412 transitions. Second operand has 23 states, 23 states have (on average 10.304347826086957) internal successors, (237), 23 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:55,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:52:55,408 INFO L93 Difference]: Finished difference Result 605 states and 858 transitions. [2022-11-26 00:52:55,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:52:55,409 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 10.304347826086957) internal successors, (237), 23 states have internal predecessors, (237), 0 states have call successors, (0), 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 130 [2022-11-26 00:52:55,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:52:55,411 INFO L225 Difference]: With dead ends: 605 [2022-11-26 00:52:55,412 INFO L226 Difference]: Without dead ends: 587 [2022-11-26 00:52:55,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 357 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=445, Invalid=3715, Unknown=0, NotChecked=0, Total=4160 [2022-11-26 00:52:55,414 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 2050 mSDsluCounter, 2812 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2050 SdHoareTripleChecker+Valid, 3127 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-26 00:52:55,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2050 Valid, 3127 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-26 00:52:55,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-11-26 00:52:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 550. [2022-11-26 00:52:55,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.4517304189435336) internal successors, (797), 549 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:55,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 797 transitions. [2022-11-26 00:52:55,439 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 797 transitions. Word has length 130 [2022-11-26 00:52:55,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:52:55,440 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 797 transitions. [2022-11-26 00:52:55,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.304347826086957) internal successors, (237), 23 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:52:55,440 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 797 transitions. [2022-11-26 00:52:55,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-26 00:52:55,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:52:55,442 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-26 00:52:55,450 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-26 00:52:55,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-26 00:52:55,651 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:52:55,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:52:55,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1630818142, now seen corresponding path program 1 times [2022-11-26 00:52:55,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:52:55,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436155928] [2022-11-26 00:52:55,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:55,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:52:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 24 proven. 335 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-26 00:52:57,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:52:57,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436155928] [2022-11-26 00:52:57,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436155928] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:52:57,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358109127] [2022-11-26 00:52:57,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:52:57,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:52:57,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:52:57,669 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:52:57,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-26 00:52:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:52:57,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-26 00:52:57,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:52:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 24 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:52:58,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:53:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 24 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:00,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358109127] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:53:00,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1528432815] [2022-11-26 00:53:00,520 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-26 00:53:00,520 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:53:00,521 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:53:00,521 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:53:00,521 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:53:02,424 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:53:09,121 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '16075#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (= ~m_Protocol~0 1) (= 7 |ULTIMATE.start_main_~method_id~0#1|) (or (and (not (= |ULTIMATE.start_main_~P9~0#1| (ite (and (< |ULTIMATE.start_main_~this_expect~0#1| 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (+ (- 2) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (= |ULTIMATE.start_main_~P9~0#1| 1)) (and (= |ULTIMATE.start_main_~P9~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= 5 |ULTIMATE.start_main_~q~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= |ULTIMATE.start_main_~P1~0#1| 1) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 00:53:09,121 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:53:09,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:53:09,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 15] total 33 [2022-11-26 00:53:09,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57459281] [2022-11-26 00:53:09,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:53:09,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-26 00:53:09,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:09,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-26 00:53:09,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=3959, Unknown=0, NotChecked=0, Total=4290 [2022-11-26 00:53:09,126 INFO L87 Difference]: Start difference. First operand 550 states and 797 transitions. Second operand has 33 states, 33 states have (on average 10.303030303030303) internal successors, (340), 33 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:10,399 INFO L93 Difference]: Finished difference Result 578 states and 817 transitions. [2022-11-26 00:53:10,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-26 00:53:10,400 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 10.303030303030303) internal successors, (340), 33 states have internal predecessors, (340), 0 states have call successors, (0), 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 134 [2022-11-26 00:53:10,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:10,403 INFO L225 Difference]: With dead ends: 578 [2022-11-26 00:53:10,403 INFO L226 Difference]: Without dead ends: 564 [2022-11-26 00:53:10,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 358 SyntacticMatches, 14 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2039 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=414, Invalid=5286, Unknown=0, NotChecked=0, Total=5700 [2022-11-26 00:53:10,405 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 989 mSDsluCounter, 5349 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 5661 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:10,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 5661 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-26 00:53:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-11-26 00:53:10,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 550. [2022-11-26 00:53:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.4171220400728597) internal successors, (778), 549 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 778 transitions. [2022-11-26 00:53:10,432 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 778 transitions. Word has length 134 [2022-11-26 00:53:10,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:10,432 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 778 transitions. [2022-11-26 00:53:10,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 10.303030303030303) internal successors, (340), 33 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 778 transitions. [2022-11-26 00:53:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-11-26 00:53:10,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:10,435 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 9, 9, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:10,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-26 00:53:10,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:53:10,643 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:53:10,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:10,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1759770873, now seen corresponding path program 2 times [2022-11-26 00:53:10,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:10,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332552997] [2022-11-26 00:53:10,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:10,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:13,838 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 26 proven. 382 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-26 00:53:13,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:13,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332552997] [2022-11-26 00:53:13,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332552997] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:53:13,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024654419] [2022-11-26 00:53:13,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:53:13,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:53:13,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:53:13,841 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:53:13,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-26 00:53:14,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-11-26 00:53:14,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:53:14,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-26 00:53:14,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:53:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 26 proven. 380 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-26 00:53:14,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:53:16,156 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 85 proven. 323 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-26 00:53:16,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024654419] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:53:16,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2015030400] [2022-11-26 00:53:16,159 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-26 00:53:16,159 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:53:16,159 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:53:16,160 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:53:16,160 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:53:17,968 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:53:24,518 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '18213#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (or (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)) (not (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) (ite (and (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (< |ULTIMATE.start_main_~this_expect~0#1| 0)) (+ (- 2) (mod |ULTIMATE.start_main_~this_expect~0#1| 2)) (mod |ULTIMATE.start_main_~this_expect~0#1| 2))))) (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) 0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= ~m_Protocol~0 1) (<= 0 (+ |ULTIMATE.start_main_~P1~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (= |ULTIMATE.start_main_~q~0#1| 1) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (= 2 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P1~0#1| 2147483647) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 00:53:24,518 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:53:24,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:53:24,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 15] total 28 [2022-11-26 00:53:24,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537277228] [2022-11-26 00:53:24,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:53:24,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-26 00:53:24,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:24,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-26 00:53:24,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=3275, Unknown=0, NotChecked=0, Total=3660 [2022-11-26 00:53:24,523 INFO L87 Difference]: Start difference. First operand 550 states and 778 transitions. Second operand has 28 states, 28 states have (on average 9.285714285714286) internal successors, (260), 28 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:28,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:28,505 INFO L93 Difference]: Finished difference Result 819 states and 1129 transitions. [2022-11-26 00:53:28,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-11-26 00:53:28,506 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.285714285714286) internal successors, (260), 28 states have internal predecessors, (260), 0 states have call successors, (0), 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 140 [2022-11-26 00:53:28,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:28,510 INFO L225 Difference]: With dead ends: 819 [2022-11-26 00:53:28,510 INFO L226 Difference]: Without dead ends: 817 [2022-11-26 00:53:28,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 406 SyntacticMatches, 6 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4642 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1574, Invalid=11766, Unknown=0, NotChecked=0, Total=13340 [2022-11-26 00:53:28,515 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 1589 mSDsluCounter, 3966 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 4289 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:28,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 4289 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-26 00:53:28,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2022-11-26 00:53:28,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 551. [2022-11-26 00:53:28,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.410909090909091) internal successors, (776), 550 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 776 transitions. [2022-11-26 00:53:28,576 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 776 transitions. Word has length 140 [2022-11-26 00:53:28,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:28,577 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 776 transitions. [2022-11-26 00:53:28,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.285714285714286) internal successors, (260), 28 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:28,578 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 776 transitions. [2022-11-26 00:53:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-11-26 00:53:28,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:28,589 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:28,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-26 00:53:28,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:53:28,798 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:53:28,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:28,798 INFO L85 PathProgramCache]: Analyzing trace with hash 385745929, now seen corresponding path program 2 times [2022-11-26 00:53:28,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:28,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085298300] [2022-11-26 00:53:28,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:28,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 30 proven. 527 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-26 00:53:32,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:32,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085298300] [2022-11-26 00:53:32,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085298300] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:53:32,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149600572] [2022-11-26 00:53:32,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:53:32,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:53:32,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:53:32,167 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:53:32,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-26 00:53:32,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-11-26 00:53:32,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:53:32,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-26 00:53:32,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:53:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 30 proven. 527 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-26 00:53:33,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:53:37,640 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 54 proven. 521 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:53:37,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149600572] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:53:37,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1591287304] [2022-11-26 00:53:37,642 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-26 00:53:37,642 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:53:37,643 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:53:37,643 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:53:37,643 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:53:39,551 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:53:45,906 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '20871#(and (or (and (= (ite (and (< |ULTIMATE.start_main_~P6~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 0))) (+ (- 2) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (mod |ULTIMATE.start_main_~P6~0#1| 2)) 1) (not (= (ite (and (< |ULTIMATE.start_main_~P6~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 0))) (+ (- 2) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (ite (and (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (< |ULTIMATE.start_main_~this_expect~0#1| 0)) (+ (- 2) (mod |ULTIMATE.start_main_~this_expect~0#1| 2)) (mod |ULTIMATE.start_main_~this_expect~0#1| 2))))) (and (= (ite (and (< |ULTIMATE.start_main_~P6~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 0))) (+ (- 2) (mod |ULTIMATE.start_main_~P6~0#1| 2)) (mod |ULTIMATE.start_main_~P6~0#1| 2)) 1) (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)))) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) 1) (= 7 ~m_recv_ack_1_2~0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= ~m_Protocol~0 1) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= |ULTIMATE.start_main_~q~0#1| 4) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (= 5 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P1~0#1| 2147483647) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 00:53:45,906 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:53:45,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:53:45,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 20] total 30 [2022-11-26 00:53:45,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843142466] [2022-11-26 00:53:45,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:53:45,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-26 00:53:45,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:45,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-26 00:53:45,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=3449, Unknown=0, NotChecked=0, Total=3906 [2022-11-26 00:53:45,909 INFO L87 Difference]: Start difference. First operand 551 states and 776 transitions. Second operand has 30 states, 30 states have (on average 9.933333333333334) internal successors, (298), 30 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:50,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:50,743 INFO L93 Difference]: Finished difference Result 712 states and 987 transitions. [2022-11-26 00:53:50,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-26 00:53:50,744 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 9.933333333333334) internal successors, (298), 30 states have internal predecessors, (298), 0 states have call successors, (0), 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 161 [2022-11-26 00:53:50,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:50,747 INFO L225 Difference]: With dead ends: 712 [2022-11-26 00:53:50,747 INFO L226 Difference]: Without dead ends: 702 [2022-11-26 00:53:50,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 461 SyntacticMatches, 8 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3696 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=1521, Invalid=9399, Unknown=0, NotChecked=0, Total=10920 [2022-11-26 00:53:50,750 INFO L413 NwaCegarLoop]: 373 mSDtfsCounter, 3122 mSDsluCounter, 4913 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3122 SdHoareTripleChecker+Valid, 5286 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:50,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3122 Valid, 5286 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-26 00:53:50,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-11-26 00:53:50,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 662. [2022-11-26 00:53:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.411497730711044) internal successors, (933), 661 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 933 transitions. [2022-11-26 00:53:50,793 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 933 transitions. Word has length 161 [2022-11-26 00:53:50,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:50,794 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 933 transitions. [2022-11-26 00:53:50,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.933333333333334) internal successors, (298), 30 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:50,795 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 933 transitions. [2022-11-26 00:53:50,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2022-11-26 00:53:50,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:50,801 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 21, 21, 14, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:50,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-26 00:53:51,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-26 00:53:51,010 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:53:51,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:51,010 INFO L85 PathProgramCache]: Analyzing trace with hash 473554572, now seen corresponding path program 2 times [2022-11-26 00:53:51,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:51,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779468236] [2022-11-26 00:53:51,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:51,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2127 backedges. 56 proven. 2018 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-26 00:54:04,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:54:04,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779468236] [2022-11-26 00:54:04,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779468236] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:54:04,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99534433] [2022-11-26 00:54:04,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:54:04,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:54:04,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:54:04,395 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:54:04,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-26 00:54:05,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2022-11-26 00:54:05,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:54:05,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 1933 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-26 00:54:05,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:54:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2127 backedges. 56 proven. 2018 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-26 00:54:05,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:54:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2127 backedges. 56 proven. 2024 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-26 00:54:08,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99534433] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:54:08,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1260426174] [2022-11-26 00:54:08,110 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2022-11-26 00:54:08,110 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:54:08,110 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:54:08,110 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:54:08,111 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:54:09,955 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:54:17,502 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '24335#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (= 3 |ULTIMATE.start_main_~method_id~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= |ULTIMATE.start_main_~P3~0#1| (ite (and (< |ULTIMATE.start_main_~this_expect~0#1| 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (+ (- 2) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))) (= |ULTIMATE.start_main_~P1~0#1| 0) (= ~m_Protocol~0 1) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= 5 |ULTIMATE.start_main_~q~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (= |ULTIMATE.start_main_~P3~0#1| 0) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 00:54:17,502 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:54:17,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:54:17,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 34] total 56 [2022-11-26 00:54:17,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853381818] [2022-11-26 00:54:17,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:54:17,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-26 00:54:17,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:54:17,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-26 00:54:17,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1127, Invalid=6883, Unknown=0, NotChecked=0, Total=8010 [2022-11-26 00:54:17,507 INFO L87 Difference]: Start difference. First operand 662 states and 933 transitions. Second operand has 56 states, 56 states have (on average 13.017857142857142) internal successors, (729), 56 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:54:19,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:54:19,723 INFO L93 Difference]: Finished difference Result 784 states and 1087 transitions. [2022-11-26 00:54:19,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-26 00:54:19,727 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 13.017857142857142) internal successors, (729), 56 states have internal predecessors, (729), 0 states have call successors, (0), 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 298 [2022-11-26 00:54:19,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:54:19,731 INFO L225 Difference]: With dead ends: 784 [2022-11-26 00:54:19,732 INFO L226 Difference]: Without dead ends: 775 [2022-11-26 00:54:19,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 971 GetRequests, 842 SyntacticMatches, 22 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4591 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1667, Invalid=10105, Unknown=0, NotChecked=0, Total=11772 [2022-11-26 00:54:19,735 INFO L413 NwaCegarLoop]: 678 mSDtfsCounter, 2162 mSDsluCounter, 8196 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2162 SdHoareTripleChecker+Valid, 8874 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:54:19,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2162 Valid, 8874 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-26 00:54:19,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-11-26 00:54:19,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 698. [2022-11-26 00:54:19,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.4088952654232425) internal successors, (982), 697 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:54:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 982 transitions. [2022-11-26 00:54:19,782 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 982 transitions. Word has length 298 [2022-11-26 00:54:19,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:54:19,782 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 982 transitions. [2022-11-26 00:54:19,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 13.017857142857142) internal successors, (729), 56 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:54:19,783 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 982 transitions. [2022-11-26 00:54:19,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2022-11-26 00:54:19,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:54:19,793 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 21, 21, 14, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:54:19,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-26 00:54:20,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-26 00:54:20,004 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:54:20,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:54:20,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1459913490, now seen corresponding path program 2 times [2022-11-26 00:54:20,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:54:20,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444843744] [2022-11-26 00:54:20,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:54:20,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:54:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:54:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 56 proven. 2059 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-26 00:54:26,736 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:54:26,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444843744] [2022-11-26 00:54:26,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444843744] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:54:26,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013175553] [2022-11-26 00:54:26,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:54:26,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:54:26,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:54:26,738 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:54:26,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-26 00:54:27,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2022-11-26 00:54:27,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:54:27,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 1945 conjuncts, 136 conjunts are in the unsatisfiable core [2022-11-26 00:54:27,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:54:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 56 proven. 2075 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-26 00:54:29,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:54:45,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2163 backedges. 203 proven. 1958 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:54:45,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013175553] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:54:45,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [385892804] [2022-11-26 00:54:45,969 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-26 00:54:45,969 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:54:45,970 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:54:45,970 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:54:45,970 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:54:47,857 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:54:57,226 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '27897#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (= ~m_Protocol~0 1) (= 7 |ULTIMATE.start_main_~method_id~0#1|) (or (and (not (= |ULTIMATE.start_main_~P9~0#1| (ite (and (< |ULTIMATE.start_main_~this_expect~0#1| 1) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (+ (- 2) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (= |ULTIMATE.start_main_~P9~0#1| 1)) (and (= |ULTIMATE.start_main_~P9~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (= 5 |ULTIMATE.start_main_~q~0#1|) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= |ULTIMATE.start_main_~P1~0#1| 1) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 00:54:57,226 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:54:57,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:54:57,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 43] total 74 [2022-11-26 00:54:57,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333041887] [2022-11-26 00:54:57,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:54:57,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-26 00:54:57,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:54:57,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-26 00:54:57,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1436, Invalid=9906, Unknown=0, NotChecked=0, Total=11342 [2022-11-26 00:54:57,231 INFO L87 Difference]: Start difference. First operand 698 states and 982 transitions. Second operand has 74 states, 74 states have (on average 9.22972972972973) internal successors, (683), 74 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:55:50,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:55:50,867 INFO L93 Difference]: Finished difference Result 1631 states and 2281 transitions. [2022-11-26 00:55:50,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2022-11-26 00:55:50,871 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 9.22972972972973) internal successors, (683), 74 states have internal predecessors, (683), 0 states have call successors, (0), 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 302 [2022-11-26 00:55:50,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:55:50,878 INFO L225 Difference]: With dead ends: 1631 [2022-11-26 00:55:50,878 INFO L226 Difference]: Without dead ends: 1598 [2022-11-26 00:55:50,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1143 GetRequests, 902 SyntacticMatches, 9 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20621 ImplicationChecksByTransitivity, 63.6s TimeCoverageRelationStatistics Valid=8252, Invalid=46270, Unknown=0, NotChecked=0, Total=54522 [2022-11-26 00:55:50,884 INFO L413 NwaCegarLoop]: 693 mSDtfsCounter, 17816 mSDsluCounter, 14357 mSDsCounter, 0 mSdLazyCounter, 2057 mSolverCounterSat, 1081 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17816 SdHoareTripleChecker+Valid, 15050 SdHoareTripleChecker+Invalid, 3138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1081 IncrementalHoareTripleChecker+Valid, 2057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:55:50,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17816 Valid, 15050 Invalid, 3138 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1081 Valid, 2057 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-26 00:55:50,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2022-11-26 00:55:50,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1127. [2022-11-26 00:55:50,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 1126 states have (on average 1.425399644760213) internal successors, (1605), 1126 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:55:50,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1605 transitions. [2022-11-26 00:55:50,969 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1605 transitions. Word has length 302 [2022-11-26 00:55:50,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:55:50,970 INFO L495 AbstractCegarLoop]: Abstraction has 1127 states and 1605 transitions. [2022-11-26 00:55:50,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 9.22972972972973) internal successors, (683), 74 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:55:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1605 transitions. [2022-11-26 00:55:50,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2022-11-26 00:55:50,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:55:50,976 INFO L195 NwaCegarLoop]: trace histogram [30, 29, 21, 21, 14, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:55:50,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-26 00:55:51,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-26 00:55:51,186 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:55:51,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:55:51,187 INFO L85 PathProgramCache]: Analyzing trace with hash 765225555, now seen corresponding path program 3 times [2022-11-26 00:55:51,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:55:51,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721731944] [2022-11-26 00:55:51,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:55:51,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:55:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:55:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2270 backedges. 58 proven. 2164 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-26 00:55:58,476 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:55:58,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721731944] [2022-11-26 00:55:58,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721731944] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:55:58,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984693071] [2022-11-26 00:55:58,477 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 00:55:58,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:55:58,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:55:58,483 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:55:58,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-26 00:55:58,969 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 00:55:58,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:55:58,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 2000 conjuncts, 146 conjunts are in the unsatisfiable core [2022-11-26 00:55:58,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:56:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2270 backedges. 58 proven. 2212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:01,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:56:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2270 backedges. 58 proven. 2212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:56:21,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984693071] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:56:21,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [102404694] [2022-11-26 00:56:21,717 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2022-11-26 00:56:21,717 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:56:21,717 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:56:21,717 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:56:21,717 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:56:23,556 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:56:33,926 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '33170#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 6 ~m_recv_ack_1_1~0) (= 2 ~m_msg_2~0) (= ~m_msg_1_1~0 4) (= 7 ~m_recv_ack_1_2~0) (or (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)) (not (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) (ite (and (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (< |ULTIMATE.start_main_~this_expect~0#1| 0)) (+ (- 2) (mod |ULTIMATE.start_main_~this_expect~0#1| 2)) (mod |ULTIMATE.start_main_~this_expect~0#1| 2))))) (= (ite (and (< |ULTIMATE.start_main_~P1~0#1| 0) (not (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0))) (+ (mod |ULTIMATE.start_main_~P1~0#1| 2) (- 2)) (mod |ULTIMATE.start_main_~P1~0#1| 2)) 0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (= ~m_msg_1_2~0 5) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (= ~m_Protocol~0 1) (<= 0 (+ |ULTIMATE.start_main_~P1~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (= |ULTIMATE.start_main_~q~0#1| 1) (<= 0 (+ |ULTIMATE.start_main_~P2~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P4~0#1| 2147483647) (<= |ULTIMATE.start_main_~P5~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (= 3 ~m_recv_ack_2~0) (= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (= 2 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 |#StackHeapBarrier|) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P1~0#1| 2147483647) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 00:56:33,926 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:56:33,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:56:33,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 31, 46] total 90 [2022-11-26 00:56:33,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752535393] [2022-11-26 00:56:33,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:56:33,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-11-26 00:56:33,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:56:33,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-11-26 00:56:33,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=786, Invalid=14220, Unknown=0, NotChecked=0, Total=15006 [2022-11-26 00:56:33,932 INFO L87 Difference]: Start difference. First operand 1127 states and 1605 transitions. Second operand has 90 states, 90 states have (on average 9.277777777777779) internal successors, (835), 90 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:56:44,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:56:44,687 INFO L93 Difference]: Finished difference Result 1251 states and 1738 transitions. [2022-11-26 00:56:44,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-11-26 00:56:44,688 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 90 states have (on average 9.277777777777779) internal successors, (835), 90 states have internal predecessors, (835), 0 states have call successors, (0), 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 308 [2022-11-26 00:56:44,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:56:44,693 INFO L225 Difference]: With dead ends: 1251 [2022-11-26 00:56:44,693 INFO L226 Difference]: Without dead ends: 1246 [2022-11-26 00:56:44,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1055 GetRequests, 879 SyntacticMatches, 11 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9696 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=1650, Invalid=26072, Unknown=0, NotChecked=0, Total=27722 [2022-11-26 00:56:44,696 INFO L413 NwaCegarLoop]: 845 mSDtfsCounter, 6212 mSDsluCounter, 39559 mSDsCounter, 0 mSdLazyCounter, 4112 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6212 SdHoareTripleChecker+Valid, 40404 SdHoareTripleChecker+Invalid, 4360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 4112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:56:44,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6212 Valid, 40404 Invalid, 4360 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [248 Valid, 4112 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-26 00:56:44,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2022-11-26 00:56:44,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1179. [2022-11-26 00:56:44,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 1178 states have (on average 1.4269949066213923) internal successors, (1681), 1178 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:56:44,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1681 transitions. [2022-11-26 00:56:44,785 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1681 transitions. Word has length 308 [2022-11-26 00:56:44,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:56:44,785 INFO L495 AbstractCegarLoop]: Abstraction has 1179 states and 1681 transitions. [2022-11-26 00:56:44,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 9.277777777777779) internal successors, (835), 90 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:56:44,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1681 transitions. [2022-11-26 00:56:44,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2022-11-26 00:56:44,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:56:44,793 INFO L195 NwaCegarLoop]: trace histogram [35, 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] [2022-11-26 00:56:44,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-26 00:56:45,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-26 00:56:45,003 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-26 00:56:45,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:56:45,004 INFO L85 PathProgramCache]: Analyzing trace with hash -926782826, now seen corresponding path program 1 times [2022-11-26 00:56:45,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:56:45,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580182571] [2022-11-26 00:56:45,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:56:45,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:56:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:56:45,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-26 00:56:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-26 00:56:47,399 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-26 00:56:47,399 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-26 00:56:47,401 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-26 00:56:47,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-26 00:56:47,408 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:56:47,417 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:56:47,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:56:47 BoogieIcfgContainer [2022-11-26 00:56:47,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:56:47,682 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:56:47,683 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:56:47,683 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:56:47,683 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:51:21" (3/4) ... [2022-11-26 00:56:47,686 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-26 00:56:47,976 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:56:47,977 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:56:47,977 INFO L158 Benchmark]: Toolchain (without parser) took 328500.94ms. Allocated memory was 136.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 91.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 189.4MB. Max. memory is 16.1GB. [2022-11-26 00:56:47,978 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 136.3MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:56:47,978 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.82ms. Allocated memory is still 136.3MB. Free memory was 91.1MB in the beginning and 72.8MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-26 00:56:47,978 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.26ms. Allocated memory is still 136.3MB. Free memory was 72.3MB in the beginning and 68.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 00:56:47,979 INFO L158 Benchmark]: Boogie Preprocessor took 63.00ms. Allocated memory is still 136.3MB. Free memory was 68.1MB in the beginning and 64.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 00:56:47,981 INFO L158 Benchmark]: RCFGBuilder took 1496.21ms. Allocated memory was 136.3MB in the beginning and 195.0MB in the end (delta: 58.7MB). Free memory was 64.9MB in the beginning and 134.3MB in the end (delta: -69.4MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2022-11-26 00:56:47,982 INFO L158 Benchmark]: TraceAbstraction took 325931.66ms. Allocated memory was 195.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 133.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 839.2MB. Max. memory is 16.1GB. [2022-11-26 00:56:47,982 INFO L158 Benchmark]: Witness Printer took 294.40ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-26 00:56:47,993 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 136.3MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 604.82ms. Allocated memory is still 136.3MB. Free memory was 91.1MB in the beginning and 72.8MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.26ms. Allocated memory is still 136.3MB. Free memory was 72.3MB in the beginning and 68.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.00ms. Allocated memory is still 136.3MB. Free memory was 68.1MB in the beginning and 64.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1496.21ms. Allocated memory was 136.3MB in the beginning and 195.0MB in the end (delta: 58.7MB). Free memory was 64.9MB in the beginning and 134.3MB in the end (delta: -69.4MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * TraceAbstraction took 325931.66ms. Allocated memory was 195.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 133.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 839.2MB. Max. memory is 16.1GB. * Witness Printer took 294.40ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.2GB 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; [L18] int q = 0; [L19] int method_id; [L22] int this_expect = 0; [L23] int this_buffer_empty = 0; VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=0, this_buffer_empty=0, this_expect=0] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, P1=0, P2=-3, P3=0, P4=0, P5=-5, P6=-4, P7=5, P8=0, P9=4, q=0, this_buffer_empty=0, this_expect=0] [L45] COND TRUE q == 0 [L46] COND TRUE __VERIFIER_nondet_int() [L50] method_id = 1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, P1=0, P2=-3, P3=0, P4=0, P5=-5, P6=-4, P7=5, P8=0, P9=4, q=0, this_buffer_empty=0, this_expect=0] [L52] COND FALSE !(0) [L56] q = 1 [L58] this_expect=0 [L58] this_buffer_empty=1 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, P1=0, P2=-3, P3=0, P4=0, P5=-5, P6=-4, P7=5, P8=0, P9=4, q=1, this_buffer_empty=1, this_expect=0] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, P1=0, P2=6, P3=0, P4=0, P5=8, P6=7, P7=-7, P8=0, P9=-6, q=1, this_buffer_empty=1, this_expect=0] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, P1=0, P2=6, P3=0, P4=0, P5=8, P6=7, P7=-7, P8=0, P9=-6, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=6, P3=0, P4=0, P5=8, P6=7, P7=-7, P8=0, P9=-6, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=6, P3=0, P4=0, P5=8, P6=7, P7=-7, P8=0, P9=-6, q=3, this_buffer_empty=0, this_expect=1] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-8, P3=-1, P4=0, P5=-10, P6=-9, P7=10, P8=0, P9=9, q=3, this_buffer_empty=0, this_expect=1] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-8, P3=-1, P4=0, P5=-10, P6=-9, P7=10, P8=0, P9=9, q=3, this_buffer_empty=0, this_expect=1] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-8, P3=-1, P4=0, P5=-10, P6=-9, P7=10, P8=0, P9=9, q=3, this_buffer_empty=0, this_expect=1] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-8, P3=-1, P4=0, P5=-10, P6=-9, P7=10, P8=0, P9=9, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-8, P3=-1, P4=0, P5=-10, P6=-9, P7=10, P8=0, P9=9, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-8, P3=-1, P4=0, P5=-10, P6=-9, P7=10, P8=0, P9=9, q=4, this_buffer_empty=1, this_expect=1] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=11, P3=0, P4=0, P5=13, P6=-2, P7=-12, P8=0, P9=-11, q=4, this_buffer_empty=1, this_expect=1] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=11, P3=0, P4=0, P5=13, P6=-2, P7=-12, P8=0, P9=-11, q=4, this_buffer_empty=1, this_expect=1] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=11, P3=0, P4=0, P5=13, P6=-2, P7=-12, P8=0, P9=-11, q=4, this_buffer_empty=1, this_expect=1] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=11, P3=0, P4=0, P5=13, P6=-2, P7=-12, P8=0, P9=-11, q=4, this_buffer_empty=1, this_expect=1] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=11, P3=0, P4=0, P5=13, P6=-2, P7=-12, P8=0, P9=-11, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=11, P3=0, P4=0, P5=13, P6=-2, P7=-12, P8=0, P9=-11, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=11, P3=0, P4=0, P5=13, P6=-2, P7=-12, P8=0, P9=-11, q=5, this_buffer_empty=0, this_expect=2] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-13, P3=0, P4=0, P5=15, P6=14, P7=-14, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=2] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-13, P3=0, P4=0, P5=15, P6=14, P7=-14, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=2] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-13, P3=0, P4=0, P5=15, P6=14, P7=-14, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=2] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-13, P3=0, P4=0, P5=15, P6=14, P7=-14, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=2] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-13, P3=0, P4=0, P5=15, P6=14, P7=-14, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=2] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-13, P3=0, P4=0, P5=15, P6=14, P7=-14, P8=0, P9=1, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-13, P3=0, P4=0, P5=15, P6=14, P7=-14, P8=0, P9=1, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-13, P3=0, P4=0, P5=15, P6=14, P7=-14, P8=0, P9=1, q=1, this_buffer_empty=1, this_expect=2] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=0, P2=-15, P3=0, P4=0, P5=18, P6=17, P7=-17, P8=0, P9=-16, q=1, this_buffer_empty=1, this_expect=2] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=0, P2=-15, P3=0, P4=0, P5=18, P6=17, P7=-17, P8=0, P9=-16, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-15, P3=0, P4=0, P5=18, P6=17, P7=-17, P8=0, P9=-16, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-15, P3=0, P4=0, P5=18, P6=17, P7=-17, P8=0, P9=-16, q=3, this_buffer_empty=0, this_expect=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-18, P3=0, P4=0, P5=-20, P6=-19, P7=20, P8=0, P9=19, q=3, this_buffer_empty=0, this_expect=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-18, P3=0, P4=0, P5=-20, P6=-19, P7=20, P8=0, P9=19, q=3, this_buffer_empty=0, this_expect=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-18, P3=0, P4=0, P5=-20, P6=-19, P7=20, P8=0, P9=19, q=3, this_buffer_empty=0, this_expect=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-18, P3=0, P4=0, P5=-20, P6=-19, P7=20, P8=0, P9=19, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-18, P3=0, P4=0, P5=-20, P6=-19, P7=20, P8=0, P9=19, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-18, P3=0, P4=0, P5=-20, P6=-19, P7=20, P8=0, P9=19, q=4, this_buffer_empty=1, this_expect=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=21, P3=0, P4=0, P5=-22, P6=87, P7=22, P8=0, P9=-21, q=4, this_buffer_empty=1, this_expect=3] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=21, P3=0, P4=0, P5=-22, P6=87, P7=22, P8=0, P9=-21, q=4, this_buffer_empty=1, this_expect=3] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=21, P3=0, P4=0, P5=-22, P6=87, P7=22, P8=0, P9=-21, q=4, this_buffer_empty=1, this_expect=3] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=21, P3=0, P4=0, P5=-22, P6=87, P7=22, P8=0, P9=-21, q=4, this_buffer_empty=1, this_expect=3] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=21, P3=0, P4=0, P5=-22, P6=87, P7=22, P8=0, P9=-21, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=21, P3=0, P4=0, P5=-22, P6=87, P7=22, P8=0, P9=-21, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=21, P3=0, P4=0, P5=-22, P6=87, P7=22, P8=0, P9=-21, q=5, this_buffer_empty=0, this_expect=4] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=23, P3=0, P4=0, P5=-24, P6=-23, P7=24, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=23, P3=0, P4=0, P5=-24, P6=-23, P7=24, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=23, P3=0, P4=0, P5=-24, P6=-23, P7=24, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=23, P3=0, P4=0, P5=-24, P6=-23, P7=24, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=23, P3=0, P4=0, P5=-24, P6=-23, P7=24, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=4] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=23, P3=0, P4=0, P5=-24, P6=-23, P7=24, P8=0, P9=0, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=23, P3=0, P4=0, P5=-24, P6=-23, P7=24, P8=0, P9=0, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=23, P3=0, P4=0, P5=-24, P6=-23, P7=24, P8=0, P9=0, q=1, this_buffer_empty=1, this_expect=4] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=25, P3=0, P4=0, P5=27, P6=26, P7=-26, P8=0, P9=-25, q=1, this_buffer_empty=1, this_expect=4] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=25, P3=0, P4=0, P5=27, P6=26, P7=-26, P8=0, P9=-25, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=25, P3=0, P4=0, P5=27, P6=26, P7=-26, P8=0, P9=-25, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=25, P3=0, P4=0, P5=27, P6=26, P7=-26, P8=0, P9=-25, q=3, this_buffer_empty=0, this_expect=5] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-27, P3=0, P4=0, P5=-29, P6=-28, P7=29, P8=0, P9=28, q=3, this_buffer_empty=0, this_expect=5] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-27, P3=0, P4=0, P5=-29, P6=-28, P7=29, P8=0, P9=28, q=3, this_buffer_empty=0, this_expect=5] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-27, P3=0, P4=0, P5=-29, P6=-28, P7=29, P8=0, P9=28, q=3, this_buffer_empty=0, this_expect=5] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-27, P3=0, P4=0, P5=-29, P6=-28, P7=29, P8=0, P9=28, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-27, P3=0, P4=0, P5=-29, P6=-28, P7=29, P8=0, P9=28, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-27, P3=0, P4=0, P5=-29, P6=-28, P7=29, P8=0, P9=28, q=4, this_buffer_empty=1, this_expect=5] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=30, P3=0, P4=0, P5=-31, P6=-33, P7=31, P8=0, P9=-30, q=4, this_buffer_empty=1, this_expect=5] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=30, P3=0, P4=0, P5=-31, P6=-33, P7=31, P8=0, P9=-30, q=4, this_buffer_empty=1, this_expect=5] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=30, P3=0, P4=0, P5=-31, P6=-33, P7=31, P8=0, P9=-30, q=4, this_buffer_empty=1, this_expect=5] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=30, P3=0, P4=0, P5=-31, P6=-33, P7=31, P8=0, P9=-30, q=4, this_buffer_empty=1, this_expect=5] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=30, P3=0, P4=0, P5=-31, P6=-33, P7=31, P8=0, P9=-30, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=30, P3=0, P4=0, P5=-31, P6=-33, P7=31, P8=0, P9=-30, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=30, P3=0, P4=0, P5=-31, P6=-33, P7=31, P8=0, P9=-30, q=5, this_buffer_empty=0, this_expect=6] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=32, P3=0, P4=0, P5=34, P6=-32, P7=33, P8=0, P9=-86, q=5, this_buffer_empty=0, this_expect=6] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=32, P3=0, P4=0, P5=34, P6=-32, P7=33, P8=0, P9=-86, q=5, this_buffer_empty=0, this_expect=6] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=32, P3=0, P4=0, P5=34, P6=-32, P7=33, P8=0, P9=-86, q=5, this_buffer_empty=0, this_expect=6] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=32, P3=0, P4=0, P5=34, P6=-32, P7=33, P8=0, P9=-86, q=5, this_buffer_empty=0, this_expect=6] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=32, P3=0, P4=0, P5=34, P6=-32, P7=33, P8=0, P9=-86, q=5, this_buffer_empty=0, this_expect=6] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=32, P3=0, P4=0, P5=34, P6=-32, P7=33, P8=0, P9=-86, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=32, P3=0, P4=0, P5=34, P6=-32, P7=33, P8=0, P9=-86, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=32, P3=0, P4=0, P5=34, P6=-32, P7=33, P8=0, P9=-86, q=1, this_buffer_empty=1, this_expect=6] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=-34, P3=0, P4=0, P5=-36, P6=-35, P7=36, P8=0, P9=35, q=1, this_buffer_empty=1, this_expect=6] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=-34, P3=0, P4=0, P5=-36, P6=-35, P7=36, P8=0, P9=35, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=-34, P3=0, P4=0, P5=-36, P6=-35, P7=36, P8=0, P9=35, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=-34, P3=0, P4=0, P5=-36, P6=-35, P7=36, P8=0, P9=35, q=3, this_buffer_empty=0, this_expect=7] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=37, P3=1, P4=0, P5=39, P6=38, P7=-38, P8=0, P9=-37, q=3, this_buffer_empty=0, this_expect=7] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=37, P3=1, P4=0, P5=39, P6=38, P7=-38, P8=0, P9=-37, q=3, this_buffer_empty=0, this_expect=7] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=37, P3=1, P4=0, P5=39, P6=38, P7=-38, P8=0, P9=-37, q=3, this_buffer_empty=0, this_expect=7] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=37, P3=1, P4=0, P5=39, P6=38, P7=-38, P8=0, P9=-37, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=37, P3=1, P4=0, P5=39, P6=38, P7=-38, P8=0, P9=-37, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=37, P3=1, P4=0, P5=39, P6=38, P7=-38, P8=0, P9=-37, q=4, this_buffer_empty=1, this_expect=7] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-39, P3=0, P4=0, P5=41, P6=89, P7=-40, P8=0, P9=40, q=4, this_buffer_empty=1, this_expect=7] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-39, P3=0, P4=0, P5=41, P6=89, P7=-40, P8=0, P9=40, q=4, this_buffer_empty=1, this_expect=7] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-39, P3=0, P4=0, P5=41, P6=89, P7=-40, P8=0, P9=40, q=4, this_buffer_empty=1, this_expect=7] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-39, P3=0, P4=0, P5=41, P6=89, P7=-40, P8=0, P9=40, q=4, this_buffer_empty=1, this_expect=7] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-39, P3=0, P4=0, P5=41, P6=89, P7=-40, P8=0, P9=40, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-39, P3=0, P4=0, P5=41, P6=89, P7=-40, P8=0, P9=40, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-39, P3=0, P4=0, P5=41, P6=89, P7=-40, P8=0, P9=40, q=5, this_buffer_empty=0, this_expect=8] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-41, P3=0, P4=0, P5=43, P6=42, P7=-42, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-41, P3=0, P4=0, P5=43, P6=42, P7=-42, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-41, P3=0, P4=0, P5=43, P6=42, P7=-42, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-41, P3=0, P4=0, P5=43, P6=42, P7=-42, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-41, P3=0, P4=0, P5=43, P6=42, P7=-42, P8=0, P9=1, q=5, this_buffer_empty=0, this_expect=8] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-41, P3=0, P4=0, P5=43, P6=42, P7=-42, P8=0, P9=1, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-41, P3=0, P4=0, P5=43, P6=42, P7=-42, P8=0, P9=1, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-41, P3=0, P4=0, P5=43, P6=42, P7=-42, P8=0, P9=1, q=1, this_buffer_empty=1, this_expect=8] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=0, P2=-43, P3=0, P4=0, P5=-45, P6=-44, P7=45, P8=0, P9=44, q=1, this_buffer_empty=1, this_expect=8] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=0, P2=-43, P3=0, P4=0, P5=-45, P6=-44, P7=45, P8=0, P9=44, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-43, P3=0, P4=0, P5=-45, P6=-44, P7=45, P8=0, P9=44, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-43, P3=0, P4=0, P5=-45, P6=-44, P7=45, P8=0, P9=44, q=3, this_buffer_empty=0, this_expect=9] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=46, P3=0, P4=0, P5=-48, P6=47, P7=-47, P8=0, P9=-46, q=3, this_buffer_empty=0, this_expect=9] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=46, P3=0, P4=0, P5=-48, P6=47, P7=-47, P8=0, P9=-46, q=3, this_buffer_empty=0, this_expect=9] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=46, P3=0, P4=0, P5=-48, P6=47, P7=-47, P8=0, P9=-46, q=3, this_buffer_empty=0, this_expect=9] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=46, P3=0, P4=0, P5=-48, P6=47, P7=-47, P8=0, P9=-46, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=46, P3=0, P4=0, P5=-48, P6=47, P7=-47, P8=0, P9=-46, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=46, P3=0, P4=0, P5=-48, P6=47, P7=-47, P8=0, P9=-46, q=4, this_buffer_empty=1, this_expect=9] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=49, P3=0, P4=0, P5=-50, P6=91, P7=50, P8=0, P9=-49, q=4, this_buffer_empty=1, this_expect=9] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=49, P3=0, P4=0, P5=-50, P6=91, P7=50, P8=0, P9=-49, q=4, this_buffer_empty=1, this_expect=9] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=49, P3=0, P4=0, P5=-50, P6=91, P7=50, P8=0, P9=-49, q=4, this_buffer_empty=1, this_expect=9] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=49, P3=0, P4=0, P5=-50, P6=91, P7=50, P8=0, P9=-49, q=4, this_buffer_empty=1, this_expect=9] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=49, P3=0, P4=0, P5=-50, P6=91, P7=50, P8=0, P9=-49, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=49, P3=0, P4=0, P5=-50, P6=91, P7=50, P8=0, P9=-49, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=49, P3=0, P4=0, P5=-50, P6=91, P7=50, P8=0, P9=-49, q=5, this_buffer_empty=0, this_expect=10] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=51, P3=0, P4=0, P5=-52, P6=-51, P7=52, P8=0, P9=88, q=5, this_buffer_empty=0, this_expect=10] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=51, P3=0, P4=0, P5=-52, P6=-51, P7=52, P8=0, P9=88, q=5, this_buffer_empty=0, this_expect=10] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=51, P3=0, P4=0, P5=-52, P6=-51, P7=52, P8=0, P9=88, q=5, this_buffer_empty=0, this_expect=10] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=51, P3=0, P4=0, P5=-52, P6=-51, P7=52, P8=0, P9=88, q=5, this_buffer_empty=0, this_expect=10] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=51, P3=0, P4=0, P5=-52, P6=-51, P7=52, P8=0, P9=88, q=5, this_buffer_empty=0, this_expect=10] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=51, P3=0, P4=0, P5=-52, P6=-51, P7=52, P8=0, P9=88, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=51, P3=0, P4=0, P5=-52, P6=-51, P7=52, P8=0, P9=88, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=51, P3=0, P4=0, P5=-52, P6=-51, P7=52, P8=0, P9=88, q=1, this_buffer_empty=1, this_expect=10] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=0, P2=53, P3=0, P4=0, P5=55, P6=54, P7=-54, P8=0, P9=-53, q=1, this_buffer_empty=1, this_expect=10] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=0, P2=53, P3=0, P4=0, P5=55, P6=54, P7=-54, P8=0, P9=-53, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=53, P3=0, P4=0, P5=55, P6=54, P7=-54, P8=0, P9=-53, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=53, P3=0, P4=0, P5=55, P6=54, P7=-54, P8=0, P9=-53, q=3, this_buffer_empty=0, this_expect=11] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-55, P3=0, P4=0, P5=-57, P6=-56, P7=57, P8=0, P9=56, q=3, this_buffer_empty=0, this_expect=11] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-55, P3=0, P4=0, P5=-57, P6=-56, P7=57, P8=0, P9=56, q=3, this_buffer_empty=0, this_expect=11] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-55, P3=0, P4=0, P5=-57, P6=-56, P7=57, P8=0, P9=56, q=3, this_buffer_empty=0, this_expect=11] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-55, P3=0, P4=0, P5=-57, P6=-56, P7=57, P8=0, P9=56, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-55, P3=0, P4=0, P5=-57, P6=-56, P7=57, P8=0, P9=56, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-55, P3=0, P4=0, P5=-57, P6=-56, P7=57, P8=0, P9=56, q=4, this_buffer_empty=1, this_expect=11] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=58, P3=0, P4=0, P5=-59, P6=-61, P7=59, P8=0, P9=-58, q=4, this_buffer_empty=1, this_expect=11] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=58, P3=0, P4=0, P5=-59, P6=-61, P7=59, P8=0, P9=-58, q=4, this_buffer_empty=1, this_expect=11] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=58, P3=0, P4=0, P5=-59, P6=-61, P7=59, P8=0, P9=-58, q=4, this_buffer_empty=1, this_expect=11] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=58, P3=0, P4=0, P5=-59, P6=-61, P7=59, P8=0, P9=-58, q=4, this_buffer_empty=1, this_expect=11] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=58, P3=0, P4=0, P5=-59, P6=-61, P7=59, P8=0, P9=-58, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=58, P3=0, P4=0, P5=-59, P6=-61, P7=59, P8=0, P9=-58, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=58, P3=0, P4=0, P5=-59, P6=-61, P7=59, P8=0, P9=-58, q=5, this_buffer_empty=0, this_expect=12] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=60, P3=0, P4=0, P5=62, P6=-60, P7=61, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=12] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=60, P3=0, P4=0, P5=62, P6=-60, P7=61, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=12] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=60, P3=0, P4=0, P5=62, P6=-60, P7=61, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=12] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=60, P3=0, P4=0, P5=62, P6=-60, P7=61, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=12] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=60, P3=0, P4=0, P5=62, P6=-60, P7=61, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=12] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=60, P3=0, P4=0, P5=62, P6=-60, P7=61, P8=0, P9=0, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=60, P3=0, P4=0, P5=62, P6=-60, P7=61, P8=0, P9=0, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=60, P3=0, P4=0, P5=62, P6=-60, P7=61, P8=0, P9=0, q=1, this_buffer_empty=1, this_expect=12] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=0, P2=-62, P3=0, P4=0, P5=-64, P6=-63, P7=64, P8=0, P9=63, q=1, this_buffer_empty=1, this_expect=12] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=0, P2=-62, P3=0, P4=0, P5=-64, P6=-63, P7=64, P8=0, P9=63, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-62, P3=0, P4=0, P5=-64, P6=-63, P7=64, P8=0, P9=63, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-62, P3=0, P4=0, P5=-64, P6=-63, P7=64, P8=0, P9=63, q=3, this_buffer_empty=0, this_expect=13] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=65, P3=1, P4=0, P5=67, P6=66, P7=-66, P8=0, P9=-65, q=3, this_buffer_empty=0, this_expect=13] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=65, P3=1, P4=0, P5=67, P6=66, P7=-66, P8=0, P9=-65, q=3, this_buffer_empty=0, this_expect=13] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=65, P3=1, P4=0, P5=67, P6=66, P7=-66, P8=0, P9=-65, q=3, this_buffer_empty=0, this_expect=13] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=65, P3=1, P4=0, P5=67, P6=66, P7=-66, P8=0, P9=-65, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=65, P3=1, P4=0, P5=67, P6=66, P7=-66, P8=0, P9=-65, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=65, P3=1, P4=0, P5=67, P6=66, P7=-66, P8=0, P9=-65, q=4, this_buffer_empty=1, this_expect=13] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-67, P3=0, P4=0, P5=69, P6=93, P7=-68, P8=0, P9=68, q=4, this_buffer_empty=1, this_expect=13] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-67, P3=0, P4=0, P5=69, P6=93, P7=-68, P8=0, P9=68, q=4, this_buffer_empty=1, this_expect=13] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-67, P3=0, P4=0, P5=69, P6=93, P7=-68, P8=0, P9=68, q=4, this_buffer_empty=1, this_expect=13] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-67, P3=0, P4=0, P5=69, P6=93, P7=-68, P8=0, P9=68, q=4, this_buffer_empty=1, this_expect=13] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-67, P3=0, P4=0, P5=69, P6=93, P7=-68, P8=0, P9=68, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-67, P3=0, P4=0, P5=69, P6=93, P7=-68, P8=0, P9=68, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-67, P3=0, P4=0, P5=69, P6=93, P7=-68, P8=0, P9=68, q=5, this_buffer_empty=0, this_expect=14] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-69, P3=0, P4=0, P5=71, P6=70, P7=-70, P8=0, P9=86, q=5, this_buffer_empty=0, this_expect=14] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-69, P3=0, P4=0, P5=71, P6=70, P7=-70, P8=0, P9=86, q=5, this_buffer_empty=0, this_expect=14] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-69, P3=0, P4=0, P5=71, P6=70, P7=-70, P8=0, P9=86, q=5, this_buffer_empty=0, this_expect=14] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-69, P3=0, P4=0, P5=71, P6=70, P7=-70, P8=0, P9=86, q=5, this_buffer_empty=0, this_expect=14] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-69, P3=0, P4=0, P5=71, P6=70, P7=-70, P8=0, P9=86, q=5, this_buffer_empty=0, this_expect=14] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-69, P3=0, P4=0, P5=71, P6=70, P7=-70, P8=0, P9=86, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-69, P3=0, P4=0, P5=71, P6=70, P7=-70, P8=0, P9=86, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-69, P3=0, P4=0, P5=71, P6=70, P7=-70, P8=0, P9=86, q=1, this_buffer_empty=1, this_expect=14] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=-71, P3=0, P4=0, P5=-73, P6=-72, P7=73, P8=0, P9=72, q=1, this_buffer_empty=1, this_expect=14] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=-71, P3=0, P4=0, P5=-73, P6=-72, P7=73, P8=0, P9=72, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=-71, P3=0, P4=0, P5=-73, P6=-72, P7=73, P8=0, P9=72, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=-71, P3=0, P4=0, P5=-73, P6=-72, P7=73, P8=0, P9=72, q=3, this_buffer_empty=0, this_expect=15] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=74, P3=1, P4=0, P5=76, P6=75, P7=-75, P8=0, P9=-74, q=3, this_buffer_empty=0, this_expect=15] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=74, P3=1, P4=0, P5=76, P6=75, P7=-75, P8=0, P9=-74, q=3, this_buffer_empty=0, this_expect=15] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=74, P3=1, P4=0, P5=76, P6=75, P7=-75, P8=0, P9=-74, q=3, this_buffer_empty=0, this_expect=15] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=74, P3=1, P4=0, P5=76, P6=75, P7=-75, P8=0, P9=-74, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=74, P3=1, P4=0, P5=76, P6=75, P7=-75, P8=0, P9=-74, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=74, P3=1, P4=0, P5=76, P6=75, P7=-75, P8=0, P9=-74, q=4, this_buffer_empty=1, this_expect=15] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-76, P3=0, P4=0, P5=78, P6=79, P7=-77, P8=0, P9=77, q=4, this_buffer_empty=1, this_expect=15] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-76, P3=0, P4=0, P5=78, P6=79, P7=-77, P8=0, P9=77, q=4, this_buffer_empty=1, this_expect=15] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-76, P3=0, P4=0, P5=78, P6=79, P7=-77, P8=0, P9=77, q=4, this_buffer_empty=1, this_expect=15] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-76, P3=0, P4=0, P5=78, P6=79, P7=-77, P8=0, P9=77, q=4, this_buffer_empty=1, this_expect=15] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=1, P2=-76, P3=0, P4=0, P5=78, P6=79, P7=-77, P8=0, P9=77, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-76, P3=0, P4=0, P5=78, P6=79, P7=-77, P8=0, P9=77, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-76, P3=0, P4=0, P5=78, P6=79, P7=-77, P8=0, P9=77, q=5, this_buffer_empty=0, this_expect=16] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-78, P3=0, P4=0, P5=-80, P6=-79, P7=80, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=16] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-78, P3=0, P4=0, P5=-80, P6=-79, P7=80, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=16] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-78, P3=0, P4=0, P5=-80, P6=-79, P7=80, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=16] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-78, P3=0, P4=0, P5=-80, P6=-79, P7=80, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=16] [L265] COND FALSE !(q == 3) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-78, P3=0, P4=0, P5=-80, P6=-79, P7=80, P8=0, P9=0, q=5, this_buffer_empty=0, this_expect=16] [L365] COND FALSE !(q == 4) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, P1=1, P2=-78, P3=0, P4=0, P5=-80, P6=-79, P7=80, P8=0, P9=0, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-78, P3=0, P4=0, P5=-80, P6=-79, P7=80, P8=0, P9=0, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=1, P2=-78, P3=0, P4=0, P5=-80, P6=-79, P7=80, P8=0, P9=0, q=1, this_buffer_empty=1, this_expect=16] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=81, P3=0, P4=0, P5=83, P6=82, P7=-82, P8=0, P9=-81, q=1, this_buffer_empty=1, this_expect=16] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, P1=-2, P2=81, P3=0, P4=0, P5=83, P6=82, P7=-82, P8=0, P9=-81, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=81, P3=0, P4=0, P5=83, P6=82, P7=-82, P8=0, P9=-81, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=-2, P2=81, P3=0, P4=0, P5=83, P6=82, P7=-82, P8=0, P9=-81, q=3, this_buffer_empty=0, this_expect=17] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND TRUE this_expect > 16 [L41] this_expect = -16 VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-83, P3=0, P4=0, P5=-85, P6=-84, P7=85, P8=0, P9=84, q=3, this_buffer_empty=0, this_expect=-16] [L45] COND FALSE !(q == 0) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-83, P3=0, P4=0, P5=-85, P6=-84, P7=85, P8=0, P9=84, q=3, this_buffer_empty=0, this_expect=-16] [L65] COND FALSE !(q == 1) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-83, P3=0, P4=0, P5=-85, P6=-84, P7=85, P8=0, P9=84, q=3, this_buffer_empty=0, this_expect=-16] [L165] COND FALSE !(q == 2) VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, P1=0, P2=-83, P3=0, P4=0, P5=-85, P6=-84, P7=85, P8=0, P9=84, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-83, P3=0, P4=0, P5=-85, P6=-84, P7=85, P8=0, P9=84, 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 [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-83, P3=0, P4=0, P5=-85, P6=-84, P7=85, P8=0, P9=84, q=3, this_buffer_empty=0, this_expect=-16] [L571] reach_error() VAL [m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_Protocol=1, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, P1=0, P2=-83, P3=0, P4=0, P5=-85, P6=-84, P7=85, P8=0, P9=84, q=3, this_buffer_empty=0, this_expect=-16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 325.6s, OverallIterations: 25, TraceHistogramMax: 35, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 82.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37189 SdHoareTripleChecker+Valid, 14.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37189 mSDsluCounter, 94191 SdHoareTripleChecker+Invalid, 13.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87785 mSDsCounter, 2183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11891 IncrementalHoareTripleChecker+Invalid, 14074 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2183 mSolverCounterUnsat, 6406 mSDtfsCounter, 11891 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6378 GetRequests, 5068 SyntacticMatches, 111 SemanticMatches, 1199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51409 ImplicationChecksByTransitivity, 178.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1179occurred in iteration=24, InterpolantAutomatonStates: 562, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 1175 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 6.5s SatisfiabilityAnalysisTime, 104.6s InterpolantComputationTime, 4237 NumberOfCodeBlocks, 4237 NumberOfCodeBlocksAsserted, 96 NumberOfCheckSat, 5672 ConstructedInterpolants, 0 QuantifiedInterpolants, 77902 SizeOfPredicates, 68 NumberOfNonLiveVariables, 12538 ConjunctsInSsa, 689 ConjunctsInUnsatCore, 56 InterpolantComputations, 8 PerfectInterpolantSequences, 1825/25873 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! [2022-11-26 00:56:48,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e547683-e1e1-4733-87b2-367bf8ba7c84/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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