./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 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/psyco/psyco_abp_1-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39adc6d5c92d5d4be7746cac0afbcc96f3b450588f18f3eb2d03a3ab1e20a3ef --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 12:57:27,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 12:57:27,516 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 12:57:27,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 12:57:27,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 12:57:27,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 12:57:27,548 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 12:57:27,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 12:57:27,550 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 12:57:27,550 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 12:57:27,551 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 12:57:27,551 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 12:57:27,552 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 12:57:27,552 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 12:57:27,553 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 12:57:27,553 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 12:57:27,554 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 12:57:27,554 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 12:57:27,555 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 12:57:27,555 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 12:57:27,556 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 12:57:27,557 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 12:57:27,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 12:57:27,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 12:57:27,559 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 12:57:27,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 12:57:27,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 12:57:27,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 12:57:27,560 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 12:57:27,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 12:57:27,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 12:57:27,562 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 12:57:27,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 12:57:27,562 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 12:57:27,563 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 12:57:27,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 12:57:27,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 12:57:27,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:57:27,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 12:57:27,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 12:57:27,564 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 12:57:27,565 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 12:57:27,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 12:57:27,565 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 12:57:27,565 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 12:57:27,565 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 12:57:27,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 12:57:27,566 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/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_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 [2023-12-02 12:57:27,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 12:57:27,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 12:57:27,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 12:57:27,846 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 12:57:27,847 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 12:57:27,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/psyco/psyco_abp_1-1.c [2023-12-02 12:57:30,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 12:57:30,895 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 12:57:30,896 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/sv-benchmarks/c/psyco/psyco_abp_1-1.c [2023-12-02 12:57:30,907 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/data/e791fdac1/b1755b9aa7854683abf3f3115d165d08/FLAGab7b9b72f [2023-12-02 12:57:30,920 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/data/e791fdac1/b1755b9aa7854683abf3f3115d165d08 [2023-12-02 12:57:30,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 12:57:30,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 12:57:30,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 12:57:30,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 12:57:30,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 12:57:30,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:57:30" (1/1) ... [2023-12-02 12:57:30,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c66e90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:57:30, skipping insertion in model container [2023-12-02 12:57:30,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:57:30" (1/1) ... [2023-12-02 12:57:30,980 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 12:57:31,201 WARN L240 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_6c198358-c0b6-4226-9cde-61a3882f06b7/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831] [2023-12-02 12:57:31,210 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:57:31,219 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 12:57:31,281 WARN L240 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_6c198358-c0b6-4226-9cde-61a3882f06b7/sv-benchmarks/c/psyco/psyco_abp_1-1.c[24818,24831] [2023-12-02 12:57:31,284 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:57:31,299 INFO L206 MainTranslator]: Completed translation [2023-12-02 12:57:31,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:57:31 WrapperNode [2023-12-02 12:57:31,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 12:57:31,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 12:57:31,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 12:57:31,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 12:57:31,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:57:31" (1/1) ... [2023-12-02 12:57:31,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:57:31" (1/1) ... [2023-12-02 12:57:31,359 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 457 [2023-12-02 12:57:31,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 12:57:31,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 12:57:31,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 12:57:31,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 12:57:31,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:57:31" (1/1) ... [2023-12-02 12:57:31,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:57:31" (1/1) ... [2023-12-02 12:57:31,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:57:31" (1/1) ... [2023-12-02 12:57:31,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:57:31" (1/1) ... [2023-12-02 12:57:31,392 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:57:31" (1/1) ... [2023-12-02 12:57:31,400 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:57:31" (1/1) ... [2023-12-02 12:57:31,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:57:31" (1/1) ... [2023-12-02 12:57:31,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:57:31" (1/1) ... [2023-12-02 12:57:31,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 12:57:31,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 12:57:31,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 12:57:31,451 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 12:57:31,452 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:57:31" (1/1) ... [2023-12-02 12:57:31,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:57:31,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:57:31,486 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 12:57:31,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 12:57:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 12:57:31,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 12:57:31,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 12:57:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 12:57:31,609 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 12:57:31,611 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 12:57:32,259 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 12:57:32,295 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 12:57:32,295 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 12:57:32,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:57:32 BoogieIcfgContainer [2023-12-02 12:57:32,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 12:57:32,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 12:57:32,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 12:57:32,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 12:57:32,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:57:30" (1/3) ... [2023-12-02 12:57:32,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1a11e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:57:32, skipping insertion in model container [2023-12-02 12:57:32,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:57:31" (2/3) ... [2023-12-02 12:57:32,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e1a11e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:57:32, skipping insertion in model container [2023-12-02 12:57:32,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:57:32" (3/3) ... [2023-12-02 12:57:32,308 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-1.c [2023-12-02 12:57:32,328 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 12:57:32,329 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 12:57:32,380 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 12:57:32,386 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@74ac7738, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 12:57:32,386 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 12:57:32,390 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) [2023-12-02 12:57:32,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 12:57:32,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:57:32,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:57:32,398 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:57:32,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:57:32,402 INFO L85 PathProgramCache]: Analyzing trace with hash 87658216, now seen corresponding path program 1 times [2023-12-02 12:57:32,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:57:32,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077007165] [2023-12-02 12:57:32,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:57:32,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:57:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:57:32,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:57:32,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:57:32,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077007165] [2023-12-02 12:57:32,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077007165] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:57:32,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:57:32,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:57:32,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328759740] [2023-12-02 12:57:32,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:57:32,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-02 12:57:32,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:57:32,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-02 12:57:32,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-02 12:57:32,622 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) [2023-12-02 12:57:32,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:57:32,664 INFO L93 Difference]: Finished difference Result 213 states and 413 transitions. [2023-12-02 12:57:32,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 12:57:32,667 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 [2023-12-02 12:57:32,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:57:32,678 INFO L225 Difference]: With dead ends: 213 [2023-12-02 12:57:32,678 INFO L226 Difference]: Without dead ends: 104 [2023-12-02 12:57:32,682 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 [2023-12-02 12:57:32,686 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 [2023-12-02 12:57:32,687 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] [2023-12-02 12:57:32,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-02 12:57:32,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-12-02 12:57:32,723 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) [2023-12-02 12:57:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 174 transitions. [2023-12-02 12:57:32,727 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 174 transitions. Word has length 8 [2023-12-02 12:57:32,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:57:32,727 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 174 transitions. [2023-12-02 12:57:32,727 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) [2023-12-02 12:57:32,727 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 174 transitions. [2023-12-02 12:57:32,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 12:57:32,728 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:57:32,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:57:32,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 12:57:32,729 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:57:32,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:57:32,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1045075108, now seen corresponding path program 1 times [2023-12-02 12:57:32,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:57:32,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465160073] [2023-12-02 12:57:32,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:57:32,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:57:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:57:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:57:32,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:57:32,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465160073] [2023-12-02 12:57:32,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465160073] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:57:32,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:57:32,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:57:32,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964495955] [2023-12-02 12:57:32,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:57:32,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:57:32,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:57:32,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:57:32,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:57:32,821 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) [2023-12-02 12:57:32,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:57:32,872 INFO L93 Difference]: Finished difference Result 210 states and 351 transitions. [2023-12-02 12:57:32,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:57:32,873 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 [2023-12-02 12:57:32,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:57:32,874 INFO L225 Difference]: With dead ends: 210 [2023-12-02 12:57:32,875 INFO L226 Difference]: Without dead ends: 107 [2023-12-02 12:57:32,876 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 [2023-12-02 12:57:32,877 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 4 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:57:32,878 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.0s Time] [2023-12-02 12:57:32,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-02 12:57:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-12-02 12:57:32,888 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) [2023-12-02 12:57:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 177 transitions. [2023-12-02 12:57:32,891 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 177 transitions. Word has length 9 [2023-12-02 12:57:32,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:57:32,891 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 177 transitions. [2023-12-02 12:57:32,891 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) [2023-12-02 12:57:32,891 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 177 transitions. [2023-12-02 12:57:32,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 12:57:32,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:57:32,893 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:57:32,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 12:57:32,893 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:57:32,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:57:32,894 INFO L85 PathProgramCache]: Analyzing trace with hash -702572339, now seen corresponding path program 1 times [2023-12-02 12:57:32,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:57:32,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204123722] [2023-12-02 12:57:32,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:57:32,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:57:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:57:33,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:57:33,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:57:33,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204123722] [2023-12-02 12:57:33,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204123722] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:57:33,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:57:33,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:57:33,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387924810] [2023-12-02 12:57:33,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:57:33,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:57:33,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:57:33,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:57:33,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:57:33,494 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) [2023-12-02 12:57:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:57:33,799 INFO L93 Difference]: Finished difference Result 218 states and 355 transitions. [2023-12-02 12:57:33,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 12:57:33,800 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 [2023-12-02 12:57:33,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:57:33,802 INFO L225 Difference]: With dead ends: 218 [2023-12-02 12:57:33,802 INFO L226 Difference]: Without dead ends: 194 [2023-12-02 12:57:33,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:57:33,805 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 153 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 12:57:33,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 518 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 12:57:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-12-02 12:57:33,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2023-12-02 12:57:33,820 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) [2023-12-02 12:57:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 290 transitions. [2023-12-02 12:57:33,822 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 290 transitions. Word has length 14 [2023-12-02 12:57:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:57:33,823 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 290 transitions. [2023-12-02 12:57:33,823 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) [2023-12-02 12:57:33,823 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 290 transitions. [2023-12-02 12:57:33,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 12:57:33,824 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:57:33,825 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:57:33,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 12:57:33,825 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:57:33,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:57:33,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1848626057, now seen corresponding path program 1 times [2023-12-02 12:57:33,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:57:33,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756616682] [2023-12-02 12:57:33,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:57:33,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:57:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:57:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:57:33,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:57:33,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756616682] [2023-12-02 12:57:33,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756616682] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:57:33,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:57:33,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:57:33,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871007272] [2023-12-02 12:57:33,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:57:33,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:57:33,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:57:33,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:57:33,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:57:33,865 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) [2023-12-02 12:57:33,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:57:33,906 INFO L93 Difference]: Finished difference Result 302 states and 496 transitions. [2023-12-02 12:57:33,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:57:33,907 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 [2023-12-02 12:57:33,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:57:33,908 INFO L225 Difference]: With dead ends: 302 [2023-12-02 12:57:33,908 INFO L226 Difference]: Without dead ends: 128 [2023-12-02 12:57:33,909 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 [2023-12-02 12:57:33,911 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 [2023-12-02 12:57:33,912 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] [2023-12-02 12:57:33,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-02 12:57:33,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2023-12-02 12:57:33,920 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) [2023-12-02 12:57:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 203 transitions. [2023-12-02 12:57:33,921 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 203 transitions. Word has length 15 [2023-12-02 12:57:33,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:57:33,921 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 203 transitions. [2023-12-02 12:57:33,922 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) [2023-12-02 12:57:33,922 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 203 transitions. [2023-12-02 12:57:33,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 12:57:33,923 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:57:33,923 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:57:33,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 12:57:33,924 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:57:33,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:57:33,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1284367090, now seen corresponding path program 1 times [2023-12-02 12:57:33,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:57:33,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350895959] [2023-12-02 12:57:33,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:57:33,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:57:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:57:33,981 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 12:57:33,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:57:33,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350895959] [2023-12-02 12:57:33,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350895959] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:57:33,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:57:33,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:57:33,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440015490] [2023-12-02 12:57:33,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:57:33,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:57:33,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:57:33,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:57:33,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:57:33,984 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) [2023-12-02 12:57:34,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:57:34,024 INFO L93 Difference]: Finished difference Result 257 states and 414 transitions. [2023-12-02 12:57:34,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:57:34,025 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 [2023-12-02 12:57:34,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:57:34,026 INFO L225 Difference]: With dead ends: 257 [2023-12-02 12:57:34,026 INFO L226 Difference]: Without dead ends: 133 [2023-12-02 12:57:34,027 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 [2023-12-02 12:57:34,028 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 [2023-12-02 12:57:34,029 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] [2023-12-02 12:57:34,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-02 12:57:34,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2023-12-02 12:57:34,035 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) [2023-12-02 12:57:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 208 transitions. [2023-12-02 12:57:34,036 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 208 transitions. Word has length 20 [2023-12-02 12:57:34,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:57:34,037 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 208 transitions. [2023-12-02 12:57:34,037 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) [2023-12-02 12:57:34,037 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 208 transitions. [2023-12-02 12:57:34,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 12:57:34,038 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:57:34,038 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:57:34,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 12:57:34,039 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:57:34,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:57:34,039 INFO L85 PathProgramCache]: Analyzing trace with hash -562821581, now seen corresponding path program 1 times [2023-12-02 12:57:34,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:57:34,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989845472] [2023-12-02 12:57:34,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:57:34,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:57:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:57:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:57:34,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:57:34,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989845472] [2023-12-02 12:57:34,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989845472] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:57:34,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115038914] [2023-12-02 12:57:34,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:57:34,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:57:34,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:57:34,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:57:34,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 12:57:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:57:34,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 12:57:34,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:57:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:57:34,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:57:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:57:34,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115038914] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:57:34,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [232751104] [2023-12-02 12:57:34,304 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 12:57:34,304 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:57:34,307 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:57:34,312 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:57:34,313 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:57:36,362 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:57:39,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [232751104] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:57:39,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:57:39,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [4, 4, 4] total 18 [2023-12-02 12:57:39,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946544535] [2023-12-02 12:57:39,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:57:39,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 12:57:39,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:57:39,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 12:57:39,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2023-12-02 12:57:39,869 INFO L87 Difference]: Start difference. First operand 131 states and 208 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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) [2023-12-02 12:57:40,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:57:40,995 INFO L93 Difference]: Finished difference Result 183 states and 278 transitions. [2023-12-02 12:57:40,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 12:57:40,996 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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 22 [2023-12-02 12:57:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:57:40,997 INFO L225 Difference]: With dead ends: 183 [2023-12-02 12:57:40,997 INFO L226 Difference]: Without dead ends: 178 [2023-12-02 12:57:40,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2023-12-02 12:57:40,999 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 83 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:57:40,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 548 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 12:57:41,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-12-02 12:57:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 169. [2023-12-02 12:57:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.5654761904761905) internal successors, (263), 168 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:57:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 263 transitions. [2023-12-02 12:57:41,007 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 263 transitions. Word has length 22 [2023-12-02 12:57:41,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:57:41,008 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 263 transitions. [2023-12-02 12:57:41,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 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) [2023-12-02 12:57:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 263 transitions. [2023-12-02 12:57:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 12:57:41,009 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:57:41,009 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] [2023-12-02 12:57:41,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 12:57:41,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-02 12:57:41,213 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:57:41,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:57:41,213 INFO L85 PathProgramCache]: Analyzing trace with hash -256156305, now seen corresponding path program 1 times [2023-12-02 12:57:41,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:57:41,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876563544] [2023-12-02 12:57:41,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:57:41,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:57:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:57:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:57:41,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:57:41,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876563544] [2023-12-02 12:57:41,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876563544] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:57:41,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914519750] [2023-12-02 12:57:41,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:57:41,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:57:41,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:57:41,432 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:57:41,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 12:57:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:57:41,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 12:57:41,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:57:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:57:41,581 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:57:41,771 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:57:41,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914519750] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:57:41,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [981789895] [2023-12-02 12:57:41,774 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-12-02 12:57:41,774 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:57:41,775 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:57:41,775 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:57:41,775 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:57:43,162 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:57:45,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [981789895] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:57:45,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:57:45,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [5, 4, 6] total 24 [2023-12-02 12:57:45,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588166785] [2023-12-02 12:57:45,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:57:45,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 12:57:45,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:57:45,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 12:57:45,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2023-12-02 12:57:45,926 INFO L87 Difference]: Start difference. First operand 169 states and 263 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:57:46,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:57:46,902 INFO L93 Difference]: Finished difference Result 177 states and 270 transitions. [2023-12-02 12:57:46,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 12:57:46,903 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 12:57:46,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:57:46,904 INFO L225 Difference]: With dead ends: 177 [2023-12-02 12:57:46,905 INFO L226 Difference]: Without dead ends: 175 [2023-12-02 12:57:46,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2023-12-02 12:57:46,906 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 110 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:57:46,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 526 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 12:57:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-12-02 12:57:46,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2023-12-02 12:57:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.5621301775147929) internal successors, (264), 169 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:57:46,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 264 transitions. [2023-12-02 12:57:46,912 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 264 transitions. Word has length 23 [2023-12-02 12:57:46,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:57:46,912 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 264 transitions. [2023-12-02 12:57:46,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:57:46,912 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 264 transitions. [2023-12-02 12:57:46,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 12:57:46,913 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:57:46,913 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, 1, 1] [2023-12-02 12:57:46,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 12:57:47,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-02 12:57:47,114 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:57:47,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:57:47,114 INFO L85 PathProgramCache]: Analyzing trace with hash -957281729, now seen corresponding path program 1 times [2023-12-02 12:57:47,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:57:47,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844242020] [2023-12-02 12:57:47,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:57:47,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:57:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:57:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:57:47,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:57:47,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844242020] [2023-12-02 12:57:47,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844242020] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:57:47,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137427402] [2023-12-02 12:57:47,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:57:47,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:57:47,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:57:47,167 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:57:47,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 12:57:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:57:47,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 12:57:47,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:57:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:57:47,274 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:57:47,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:57:47,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137427402] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:57:47,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [721980419] [2023-12-02 12:57:47,306 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-12-02 12:57:47,306 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:57:47,306 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:57:47,307 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:57:47,307 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:57:48,317 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:57:51,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [721980419] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:57:51,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:57:51,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [4, 4, 4] total 21 [2023-12-02 12:57:51,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403839704] [2023-12-02 12:57:51,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:57:51,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 12:57:51,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:57:51,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 12:57:51,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2023-12-02 12:57:51,464 INFO L87 Difference]: Start difference. First operand 170 states and 264 transitions. Second operand has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:57:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:57:52,925 INFO L93 Difference]: Finished difference Result 177 states and 269 transitions. [2023-12-02 12:57:52,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 12:57:52,926 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-02 12:57:52,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:57:52,927 INFO L225 Difference]: With dead ends: 177 [2023-12-02 12:57:52,927 INFO L226 Difference]: Without dead ends: 174 [2023-12-02 12:57:52,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2023-12-02 12:57:52,928 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 68 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 12:57:52,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 546 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 12:57:52,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-12-02 12:57:52,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2023-12-02 12:57:52,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.5562130177514792) internal successors, (263), 169 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:57:52,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 263 transitions. [2023-12-02 12:57:52,934 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 263 transitions. Word has length 25 [2023-12-02 12:57:52,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:57:52,935 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 263 transitions. [2023-12-02 12:57:52,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:57:52,935 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 263 transitions. [2023-12-02 12:57:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 12:57:52,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:57:52,936 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, 1, 1, 1] [2023-12-02 12:57:52,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-02 12:57:53,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:57:53,142 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:57:53,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:57:53,142 INFO L85 PathProgramCache]: Analyzing trace with hash 400482421, now seen corresponding path program 1 times [2023-12-02 12:57:53,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:57:53,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012715739] [2023-12-02 12:57:53,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:57:53,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:57:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:57:53,276 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:57:53,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:57:53,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012715739] [2023-12-02 12:57:53,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012715739] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:57:53,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382730095] [2023-12-02 12:57:53,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:57:53,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:57:53,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:57:53,278 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:57:53,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 12:57:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:57:53,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 12:57:53,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:57:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:57:53,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:57:53,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:57:53,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382730095] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:57:53,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [124060795] [2023-12-02 12:57:53,584 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 12:57:53,584 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:57:53,584 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:57:53,585 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:57:53,585 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:57:54,688 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:57:58,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [124060795] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:57:58,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:57:58,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [5, 4, 6] total 26 [2023-12-02 12:57:58,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263153559] [2023-12-02 12:57:58,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:57:58,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 12:57:58,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:57:58,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 12:57:58,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2023-12-02 12:57:58,257 INFO L87 Difference]: Start difference. First operand 170 states and 263 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:57:59,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:57:59,169 INFO L93 Difference]: Finished difference Result 174 states and 266 transitions. [2023-12-02 12:57:59,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 12:57:59,169 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 12:57:59,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:57:59,171 INFO L225 Difference]: With dead ends: 174 [2023-12-02 12:57:59,171 INFO L226 Difference]: Without dead ends: 171 [2023-12-02 12:57:59,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2023-12-02 12:57:59,172 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 97 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 12:57:59,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 510 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 12:57:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-02 12:57:59,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2023-12-02 12:57:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.5502958579881656) internal successors, (262), 169 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:57:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 262 transitions. [2023-12-02 12:57:59,179 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 262 transitions. Word has length 26 [2023-12-02 12:57:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:57:59,179 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 262 transitions. [2023-12-02 12:57:59,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:57:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 262 transitions. [2023-12-02 12:57:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 12:57:59,181 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:57:59,181 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] [2023-12-02 12:57:59,186 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 12:57:59,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:57:59,381 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:57:59,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:57:59,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2047334892, now seen corresponding path program 1 times [2023-12-02 12:57:59,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:57:59,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413809791] [2023-12-02 12:57:59,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:57:59,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:57:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:57:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 12:57:59,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:57:59,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413809791] [2023-12-02 12:57:59,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413809791] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:57:59,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:57:59,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:57:59,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083718086] [2023-12-02 12:57:59,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:57:59,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:57:59,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:57:59,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:57:59,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:57:59,427 INFO L87 Difference]: Start difference. First operand 170 states and 262 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) [2023-12-02 12:57:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:57:59,457 INFO L93 Difference]: Finished difference Result 262 states and 410 transitions. [2023-12-02 12:57:59,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:57:59,458 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 [2023-12-02 12:57:59,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:57:59,459 INFO L225 Difference]: With dead ends: 262 [2023-12-02 12:57:59,459 INFO L226 Difference]: Without dead ends: 133 [2023-12-02 12:57:59,459 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 [2023-12-02 12:57:59,460 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 [2023-12-02 12:57:59,460 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] [2023-12-02 12:57:59,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-02 12:57:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2023-12-02 12:57:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.5307692307692307) internal successors, (199), 130 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:57:59,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 199 transitions. [2023-12-02 12:57:59,465 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 199 transitions. Word has length 29 [2023-12-02 12:57:59,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:57:59,465 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 199 transitions. [2023-12-02 12:57:59,465 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) [2023-12-02 12:57:59,465 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 199 transitions. [2023-12-02 12:57:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 12:57:59,466 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:57:59,466 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] [2023-12-02 12:57:59,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 12:57:59,467 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:57:59,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:57:59,467 INFO L85 PathProgramCache]: Analyzing trace with hash 149150864, now seen corresponding path program 1 times [2023-12-02 12:57:59,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:57:59,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393346240] [2023-12-02 12:57:59,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:57:59,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:57:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:57:59,698 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 12:57:59,699 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:57:59,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393346240] [2023-12-02 12:57:59,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393346240] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:57:59,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49124406] [2023-12-02 12:57:59,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:57:59,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:57:59,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:57:59,700 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:57:59,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 12:57:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:57:59,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 12:57:59,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:57:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 12:57:59,830 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:58:00,064 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 12:58:00,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49124406] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:58:00,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1417018957] [2023-12-02 12:58:00,066 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-12-02 12:58:00,066 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:58:00,067 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:58:00,067 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:58:00,067 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:58:01,436 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:58:03,329 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4648#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0) (exists ((|v_ULTIMATE.start_main_#t~nondet32#1_13| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet32#1_13| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet32#1_13| 2147483647) (not (= |v_ULTIMATE.start_main_#t~nondet32#1_13| 0)))) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (<= 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) (= |ULTIMATE.start_main_~q~0#1| 4) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (= 2 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 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))' at error location [2023-12-02 12:58:03,329 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:58:03,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:58:03,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2023-12-02 12:58:03,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800992296] [2023-12-02 12:58:03,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:58:03,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 12:58:03,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:58:03,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 12:58:03,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=942, Unknown=0, NotChecked=0, Total=1122 [2023-12-02 12:58:03,331 INFO L87 Difference]: Start difference. First operand 131 states and 199 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:58:03,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:03,859 INFO L93 Difference]: Finished difference Result 468 states and 716 transitions. [2023-12-02 12:58:03,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 12:58:03,859 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 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 [2023-12-02 12:58:03,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:03,861 INFO L225 Difference]: With dead ends: 468 [2023-12-02 12:58:03,861 INFO L226 Difference]: Without dead ends: 346 [2023-12-02 12:58:03,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=220, Invalid=1262, Unknown=0, NotChecked=0, Total=1482 [2023-12-02 12:58:03,862 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 572 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 12:58:03,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1027 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 12:58:03,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2023-12-02 12:58:03,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 281. [2023-12-02 12:58:03,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.5714285714285714) internal successors, (440), 280 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:58:03,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 440 transitions. [2023-12-02 12:58:03,869 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 440 transitions. Word has length 32 [2023-12-02 12:58:03,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:03,870 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 440 transitions. [2023-12-02 12:58:03,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:58:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 440 transitions. [2023-12-02 12:58:03,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 12:58:03,870 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:03,871 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] [2023-12-02 12:58:03,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 12:58:04,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:58:04,071 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:04,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:04,072 INFO L85 PathProgramCache]: Analyzing trace with hash 340155986, now seen corresponding path program 1 times [2023-12-02 12:58:04,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:58:04,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990782506] [2023-12-02 12:58:04,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:04,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:58:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 12:58:04,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:58:04,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990782506] [2023-12-02 12:58:04,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990782506] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:58:04,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662644478] [2023-12-02 12:58:04,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:04,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:58:04,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:58:04,161 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:58:04,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 12:58:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:04,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 12:58:04,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:58:04,259 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 12:58:04,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:58:04,280 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 12:58:04,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662644478] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:58:04,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1369166360] [2023-12-02 12:58:04,282 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-12-02 12:58:04,282 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:58:04,282 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:58:04,282 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:58:04,282 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:58:05,721 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:58:07,832 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5635#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)) (<= |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) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (exists ((|v_ULTIMATE.start_main_#t~nondet33#1_13| Int)) (and (<= |v_ULTIMATE.start_main_#t~nondet33#1_13| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet33#1_13| 2147483648)) (not (= |v_ULTIMATE.start_main_#t~nondet33#1_13| 0)))) (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) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647))' at error location [2023-12-02 12:58:07,832 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:58:07,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:58:07,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-12-02 12:58:07,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027361987] [2023-12-02 12:58:07,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:58:07,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:58:07,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:58:07,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:58:07,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2023-12-02 12:58:07,834 INFO L87 Difference]: Start difference. First operand 281 states and 440 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) [2023-12-02 12:58:07,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:07,927 INFO L93 Difference]: Finished difference Result 373 states and 584 transitions. [2023-12-02 12:58:07,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:58:07,927 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 [2023-12-02 12:58:07,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:07,929 INFO L225 Difference]: With dead ends: 373 [2023-12-02 12:58:07,929 INFO L226 Difference]: Without dead ends: 351 [2023-12-02 12:58:07,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2023-12-02 12:58:07,930 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 230 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:58:07,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 441 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:58:07,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-12-02 12:58:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2023-12-02 12:58:07,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.528735632183908) internal successors, (532), 348 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:58:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 532 transitions. [2023-12-02 12:58:07,938 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 532 transitions. Word has length 33 [2023-12-02 12:58:07,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:07,939 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 532 transitions. [2023-12-02 12:58:07,939 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) [2023-12-02 12:58:07,939 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 532 transitions. [2023-12-02 12:58:07,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 12:58:07,940 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:07,940 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] [2023-12-02 12:58:07,946 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 12:58:08,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 12:58:08,142 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:08,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:08,142 INFO L85 PathProgramCache]: Analyzing trace with hash 838691331, now seen corresponding path program 1 times [2023-12-02 12:58:08,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:58:08,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146933015] [2023-12-02 12:58:08,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:08,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:58:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:08,458 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:08,458 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:58:08,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146933015] [2023-12-02 12:58:08,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146933015] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:58:08,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045529795] [2023-12-02 12:58:08,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:08,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:58:08,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:58:08,460 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:58:08,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 12:58:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:08,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 12:58:08,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:58:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:08,616 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:58:08,880 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:08,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045529795] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:58:08,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1647316172] [2023-12-02 12:58:08,882 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2023-12-02 12:58:08,882 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:58:08,882 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:58:08,883 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:58:08,883 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:58:10,186 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:58:12,578 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6604#(and (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 1) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (or (and (<= 0 |ULTIMATE.start_main_~P6~0#1|) (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 1) (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))) (and (<= 0 |ULTIMATE.start_main_~P6~0#1|) (or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 1)) (< |ULTIMATE.start_main_~this_expect~0#1| 0)) (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 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) (exists ((|v_ULTIMATE.start_main_#t~nondet35#1_13| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet35#1_13| 2147483648)) (not (= |v_ULTIMATE.start_main_#t~nondet35#1_13| 0)) (<= |v_ULTIMATE.start_main_#t~nondet35#1_13| 2147483647))) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= 0 |ULTIMATE.start_main_~P1~0#1|) (= 5 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 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))' at error location [2023-12-02 12:58:12,578 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:58:12,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:58:12,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 9 [2023-12-02 12:58:12,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275603926] [2023-12-02 12:58:12,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:58:12,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 12:58:12,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:58:12,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 12:58:12,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2023-12-02 12:58:12,581 INFO L87 Difference]: Start difference. First operand 349 states and 532 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:58:12,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:12,730 INFO L93 Difference]: Finished difference Result 376 states and 564 transitions. [2023-12-02 12:58:12,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:58:12,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 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 [2023-12-02 12:58:12,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:12,732 INFO L225 Difference]: With dead ends: 376 [2023-12-02 12:58:12,733 INFO L226 Difference]: Without dead ends: 374 [2023-12-02 12:58:12,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2023-12-02 12:58:12,734 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 140 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:58:12,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 888 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:58:12,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-12-02 12:58:12,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 349. [2023-12-02 12:58:12,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.5258620689655173) internal successors, (531), 348 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:58:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 531 transitions. [2023-12-02 12:58:12,741 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 531 transitions. Word has length 35 [2023-12-02 12:58:12,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:12,742 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 531 transitions. [2023-12-02 12:58:12,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:58:12,742 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 531 transitions. [2023-12-02 12:58:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 12:58:12,743 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:12,743 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] [2023-12-02 12:58:12,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 12:58:12,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 12:58:12,944 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:12,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:12,944 INFO L85 PathProgramCache]: Analyzing trace with hash 354865214, now seen corresponding path program 1 times [2023-12-02 12:58:12,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:58:12,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121560163] [2023-12-02 12:58:12,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:12,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:58:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 12:58:12,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:58:12,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121560163] [2023-12-02 12:58:12,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121560163] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:58:12,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:58:12,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:58:12,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964361157] [2023-12-02 12:58:12,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:58:12,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:58:12,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:58:12,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:58:12,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:58:12,981 INFO L87 Difference]: Start difference. First operand 349 states and 531 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) [2023-12-02 12:58:13,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:13,016 INFO L93 Difference]: Finished difference Result 669 states and 1012 transitions. [2023-12-02 12:58:13,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:58:13,016 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 [2023-12-02 12:58:13,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:13,019 INFO L225 Difference]: With dead ends: 669 [2023-12-02 12:58:13,019 INFO L226 Difference]: Without dead ends: 361 [2023-12-02 12:58:13,020 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 [2023-12-02 12:58:13,020 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 [2023-12-02 12:58:13,021 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] [2023-12-02 12:58:13,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-12-02 12:58:13,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 359. [2023-12-02 12:58:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.4832402234636872) internal successors, (531), 358 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:58:13,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 531 transitions. [2023-12-02 12:58:13,032 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 531 transitions. Word has length 36 [2023-12-02 12:58:13,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:13,032 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 531 transitions. [2023-12-02 12:58:13,033 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) [2023-12-02 12:58:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 531 transitions. [2023-12-02 12:58:13,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 12:58:13,034 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:13,034 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] [2023-12-02 12:58:13,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 12:58:13,034 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:13,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:13,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1471334249, now seen corresponding path program 1 times [2023-12-02 12:58:13,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:58:13,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534190361] [2023-12-02 12:58:13,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:13,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:58:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 12:58:13,089 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:58:13,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534190361] [2023-12-02 12:58:13,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534190361] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:58:13,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:58:13,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:58:13,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739210773] [2023-12-02 12:58:13,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:58:13,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:58:13,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:58:13,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:58:13,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:58:13,091 INFO L87 Difference]: Start difference. First operand 359 states and 531 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) [2023-12-02 12:58:13,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:13,120 INFO L93 Difference]: Finished difference Result 463 states and 682 transitions. [2023-12-02 12:58:13,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:58:13,121 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 [2023-12-02 12:58:13,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:13,122 INFO L225 Difference]: With dead ends: 463 [2023-12-02 12:58:13,122 INFO L226 Difference]: Without dead ends: 219 [2023-12-02 12:58:13,123 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 [2023-12-02 12:58:13,124 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 [2023-12-02 12:58:13,124 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] [2023-12-02 12:58:13,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-12-02 12:58:13,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2023-12-02 12:58:13,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.4444444444444444) internal successors, (312), 216 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:58:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 312 transitions. [2023-12-02 12:58:13,132 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 312 transitions. Word has length 47 [2023-12-02 12:58:13,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:13,132 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 312 transitions. [2023-12-02 12:58:13,132 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) [2023-12-02 12:58:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 312 transitions. [2023-12-02 12:58:13,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 12:58:13,133 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:13,133 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] [2023-12-02 12:58:13,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 12:58:13,133 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:13,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:13,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1309119733, now seen corresponding path program 1 times [2023-12-02 12:58:13,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:58:13,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333969573] [2023-12-02 12:58:13,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:13,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:58:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:13,433 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 12:58:13,433 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:58:13,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333969573] [2023-12-02 12:58:13,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333969573] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:58:13,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809648118] [2023-12-02 12:58:13,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:13,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:58:13,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:58:13,435 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:58:13,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 12:58:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:13,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 12:58:13,530 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:58:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 12:58:13,580 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:58:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 12:58:13,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809648118] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:58:13,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [835777131] [2023-12-02 12:58:13,907 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2023-12-02 12:58:13,907 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:58:13,908 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:58:13,908 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:58:13,908 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:58:15,445 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:58:18,492 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9403#(and (exists ((|v_ULTIMATE.start_main_#t~nondet42#1_13| Int)) (and (<= |v_ULTIMATE.start_main_#t~nondet42#1_13| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet42#1_13| 2147483648)) (not (= |v_ULTIMATE.start_main_#t~nondet42#1_13| 0)))) (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (not (= |ULTIMATE.start_main_~P1~0#1| 0)) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (not (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2))) (= (+ |ULTIMATE.start_main_~P8~0#1| 2) (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)) (<= 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)) (<= |ULTIMATE.start_main_~this_expect~0#1| 0) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= |ULTIMATE.start_main_~P1~0#1| 2147483647) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (= 6 |ULTIMATE.start_main_~method_id~0#1|))' at error location [2023-12-02 12:58:18,492 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:58:18,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:58:18,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 8] total 12 [2023-12-02 12:58:18,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689659799] [2023-12-02 12:58:18,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:58:18,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 12:58:18,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:58:18,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 12:58:18,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1606, Unknown=0, NotChecked=0, Total=1892 [2023-12-02 12:58:18,495 INFO L87 Difference]: Start difference. First operand 217 states and 312 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) [2023-12-02 12:58:18,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:18,745 INFO L93 Difference]: Finished difference Result 324 states and 450 transitions. [2023-12-02 12:58:18,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 12:58:18,745 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 [2023-12-02 12:58:18,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:18,747 INFO L225 Difference]: With dead ends: 324 [2023-12-02 12:58:18,747 INFO L226 Difference]: Without dead ends: 317 [2023-12-02 12:58:18,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=349, Invalid=2201, Unknown=0, NotChecked=0, Total=2550 [2023-12-02 12:58:18,748 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 666 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:58:18,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 1086 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:58:18,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-12-02 12:58:18,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 291. [2023-12-02 12:58:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.4551724137931035) internal successors, (422), 290 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:58:18,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 422 transitions. [2023-12-02 12:58:18,755 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 422 transitions. Word has length 49 [2023-12-02 12:58:18,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:18,755 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 422 transitions. [2023-12-02 12:58:18,755 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) [2023-12-02 12:58:18,755 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 422 transitions. [2023-12-02 12:58:18,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 12:58:18,756 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:18,756 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] [2023-12-02 12:58:18,761 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-02 12:58:18,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-02 12:58:18,957 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:18,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:18,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1916554725, now seen corresponding path program 1 times [2023-12-02 12:58:18,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:58:18,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397509116] [2023-12-02 12:58:18,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:18,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:58:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:19,352 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:19,352 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:58:19,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397509116] [2023-12-02 12:58:19,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397509116] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:58:19,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883624837] [2023-12-02 12:58:19,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:19,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:58:19,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:58:19,354 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:58:19,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 12:58:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:19,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 12:58:19,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:58:19,610 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:19,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:58:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:19,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883624837] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:58:20,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1004906308] [2023-12-02 12:58:20,002 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2023-12-02 12:58:20,002 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:58:20,002 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:58:20,002 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:58:20,002 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:58:21,528 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:58:24,827 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10381#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (or (and (= |ULTIMATE.start_main_~P9~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)) (and (or (< |ULTIMATE.start_main_~this_expect~0#1| 1) (not (= 1 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (= |ULTIMATE.start_main_~P9~0#1| 1))) (= 7 |ULTIMATE.start_main_~method_id~0#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)) (exists ((|v_ULTIMATE.start_main_#t~nondet43#1_13| Int)) (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet43#1_13| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet43#1_13| 2147483647) (not (= |v_ULTIMATE.start_main_#t~nondet43#1_13| 0)))) (= |ULTIMATE.start_main_~P1~0#1| 1) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647))' at error location [2023-12-02 12:58:24,827 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:58:24,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:58:24,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2023-12-02 12:58:24,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535820783] [2023-12-02 12:58:24,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:58:24,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 12:58:24,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:58:24,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 12:58:24,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1721, Unknown=0, NotChecked=0, Total=1980 [2023-12-02 12:58:24,829 INFO L87 Difference]: Start difference. First operand 291 states and 422 transitions. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:58:24,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:24,956 INFO L93 Difference]: Finished difference Result 300 states and 427 transitions. [2023-12-02 12:58:24,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 12:58:24,957 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 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 [2023-12-02 12:58:24,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:24,959 INFO L225 Difference]: With dead ends: 300 [2023-12-02 12:58:24,959 INFO L226 Difference]: Without dead ends: 297 [2023-12-02 12:58:24,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=259, Invalid=1721, Unknown=0, NotChecked=0, Total=1980 [2023-12-02 12:58:24,960 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 217 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:58:24,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 739 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:58:24,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-12-02 12:58:24,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 291. [2023-12-02 12:58:24,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.4413793103448276) internal successors, (418), 290 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:58:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 418 transitions. [2023-12-02 12:58:24,969 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 418 transitions. Word has length 50 [2023-12-02 12:58:24,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:24,969 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 418 transitions. [2023-12-02 12:58:24,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:58:24,969 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 418 transitions. [2023-12-02 12:58:24,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-02 12:58:24,970 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:24,970 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] [2023-12-02 12:58:24,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 12:58:25,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 12:58:25,175 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:25,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:25,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1394690496, now seen corresponding path program 1 times [2023-12-02 12:58:25,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:58:25,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503510825] [2023-12-02 12:58:25,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:25,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:58:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:25,749 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:25,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:58:25,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503510825] [2023-12-02 12:58:25,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503510825] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:58:25,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703734437] [2023-12-02 12:58:25,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:25,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:58:25,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:58:25,751 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:58:25,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 12:58:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:25,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 12:58:25,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:58:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:25,936 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:58:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:26,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703734437] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:58:26,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1325284592] [2023-12-02 12:58:26,359 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2023-12-02 12:58:26,359 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:58:26,360 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:58:26,360 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:58:26,360 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:58:27,944 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:58:31,448 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11359#(and (or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))) (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (exists ((|v_ULTIMATE.start_main_#t~nondet14#1_58| Int)) (and (<= 0 (+ 2147483648 |v_ULTIMATE.start_main_#t~nondet14#1_58|)) (<= |v_ULTIMATE.start_main_#t~nondet14#1_58| 2147483647) (not (= |v_ULTIMATE.start_main_#t~nondet14#1_58| 0)))) (<= 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)) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (= 2 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 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))' at error location [2023-12-02 12:58:31,448 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:58:31,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:58:31,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 10] total 16 [2023-12-02 12:58:31,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894818349] [2023-12-02 12:58:31,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:58:31,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 12:58:31,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:58:31,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 12:58:31,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=2076, Unknown=0, NotChecked=0, Total=2352 [2023-12-02 12:58:31,451 INFO L87 Difference]: Start difference. First operand 291 states and 418 transitions. Second operand has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:58:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:31,634 INFO L93 Difference]: Finished difference Result 301 states and 424 transitions. [2023-12-02 12:58:31,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 12:58:31,635 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 0 states have call successors, (0), 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 [2023-12-02 12:58:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:31,636 INFO L225 Difference]: With dead ends: 301 [2023-12-02 12:58:31,636 INFO L226 Difference]: Without dead ends: 298 [2023-12-02 12:58:31,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 130 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=292, Invalid=2258, Unknown=0, NotChecked=0, Total=2550 [2023-12-02 12:58:31,638 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 323 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:58:31,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 987 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:58:31,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-12-02 12:58:31,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 291. [2023-12-02 12:58:31,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.4310344827586208) internal successors, (415), 290 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:58:31,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 415 transitions. [2023-12-02 12:58:31,645 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 415 transitions. Word has length 56 [2023-12-02 12:58:31,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:31,645 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 415 transitions. [2023-12-02 12:58:31,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.75) internal successors, (108), 16 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:58:31,646 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 415 transitions. [2023-12-02 12:58:31,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-02 12:58:31,646 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:31,646 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] [2023-12-02 12:58:31,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 12:58:31,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 12:58:31,847 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:31,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:31,847 INFO L85 PathProgramCache]: Analyzing trace with hash 819584752, now seen corresponding path program 1 times [2023-12-02 12:58:31,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:58:31,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695613227] [2023-12-02 12:58:31,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:31,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:58:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 91 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 12:58:32,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:58:32,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695613227] [2023-12-02 12:58:32,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695613227] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:58:32,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490825941] [2023-12-02 12:58:32,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:32,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:58:32,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:58:32,523 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:58:32,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 12:58:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:32,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-02 12:58:32,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:58:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:32,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:58:33,506 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:33,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490825941] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:58:33,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1016233866] [2023-12-02 12:58:33,508 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2023-12-02 12:58:33,508 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:58:33,508 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:58:33,508 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:58:33,509 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:58:35,127 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:58:38,964 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12474#(and (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 1) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (exists ((|v_ULTIMATE.start_main_#t~nondet35#1_26| Int)) (and (<= |v_ULTIMATE.start_main_#t~nondet35#1_26| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet35#1_26| 2147483648)) (not (= |v_ULTIMATE.start_main_#t~nondet35#1_26| 0)))) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (or (and (<= 0 |ULTIMATE.start_main_~P6~0#1|) (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 1) (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))) (and (<= 0 |ULTIMATE.start_main_~P6~0#1|) (or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 1)) (< |ULTIMATE.start_main_~this_expect~0#1| 0)) (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 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)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= 0 |ULTIMATE.start_main_~P1~0#1|) (= 5 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 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))' at error location [2023-12-02 12:58:38,964 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:58:38,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:58:38,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2023-12-02 12:58:38,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67240315] [2023-12-02 12:58:38,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:58:38,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 12:58:38,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:58:38,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 12:58:38,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2665, Unknown=0, NotChecked=0, Total=2970 [2023-12-02 12:58:38,967 INFO L87 Difference]: Start difference. First operand 291 states and 415 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) [2023-12-02 12:58:39,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:39,208 INFO L93 Difference]: Finished difference Result 298 states and 421 transitions. [2023-12-02 12:58:39,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 12:58:39,209 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 [2023-12-02 12:58:39,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:39,210 INFO L225 Difference]: With dead ends: 298 [2023-12-02 12:58:39,210 INFO L226 Difference]: Without dead ends: 294 [2023-12-02 12:58:39,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 191 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=320, Invalid=2872, Unknown=0, NotChecked=0, Total=3192 [2023-12-02 12:58:39,211 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 398 mSDsluCounter, 1841 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 2032 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:58:39,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 2032 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:58:39,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-12-02 12:58:39,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2023-12-02 12:58:39,219 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) [2023-12-02 12:58:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 412 transitions. [2023-12-02 12:58:39,220 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 412 transitions. Word has length 77 [2023-12-02 12:58:39,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:39,220 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 412 transitions. [2023-12-02 12:58:39,220 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) [2023-12-02 12:58:39,220 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 412 transitions. [2023-12-02 12:58:39,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-02 12:58:39,221 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:39,222 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] [2023-12-02 12:58:39,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 12:58:39,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:58:39,422 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:39,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:39,423 INFO L85 PathProgramCache]: Analyzing trace with hash -182510497, now seen corresponding path program 1 times [2023-12-02 12:58:39,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:58:39,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528766506] [2023-12-02 12:58:39,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:39,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:58:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 318 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-02 12:58:40,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:58:40,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528766506] [2023-12-02 12:58:40,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528766506] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:58:40,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435100833] [2023-12-02 12:58:40,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:40,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:58:40,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:58:40,419 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:58:40,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 12:58:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:40,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-02 12:58:40,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:58:40,759 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 318 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-02 12:58:40,759 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:58:41,930 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 28 proven. 330 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 12:58:41,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435100833] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:58:41,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [797340372] [2023-12-02 12:58:41,932 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2023-12-02 12:58:41,933 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:58:41,933 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:58:41,933 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:58:41,933 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:58:43,610 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:58:47,289 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '13907#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= 0 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)) (<= |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) (<= |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|) (exists ((|v_ULTIMATE.start_main_#t~nondet39#1_26| Int)) (and (<= |v_ULTIMATE.start_main_#t~nondet39#1_26| 2147483647) (not (= |v_ULTIMATE.start_main_#t~nondet39#1_26| 0)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet39#1_26| 2147483648)))) (<= 0 (+ |ULTIMATE.start_main_~P7~0#1| 2147483648)) (= |ULTIMATE.start_main_~P3~0#1| 0) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647))' at error location [2023-12-02 12:58:47,289 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:58:47,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:58:47,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 16] total 23 [2023-12-02 12:58:47,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654949824] [2023-12-02 12:58:47,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:58:47,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 12:58:47,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:58:47,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 12:58:47,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=2711, Unknown=0, NotChecked=0, Total=3080 [2023-12-02 12:58:47,292 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) [2023-12-02 12:58:47,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:58:47,905 INFO L93 Difference]: Finished difference Result 605 states and 858 transitions. [2023-12-02 12:58:47,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 12:58:47,906 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 [2023-12-02 12:58:47,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:58:47,909 INFO L225 Difference]: With dead ends: 605 [2023-12-02 12:58:47,909 INFO L226 Difference]: Without dead ends: 587 [2023-12-02 12:58:47,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 362 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=484, Invalid=3548, Unknown=0, NotChecked=0, Total=4032 [2023-12-02 12:58:47,911 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 1454 mSDsluCounter, 3433 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1454 SdHoareTripleChecker+Valid, 3748 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 12:58:47,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1454 Valid, 3748 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 12:58:47,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2023-12-02 12:58:47,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 550. [2023-12-02 12:58:47,919 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) [2023-12-02 12:58:47,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 797 transitions. [2023-12-02 12:58:47,920 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 797 transitions. Word has length 130 [2023-12-02 12:58:47,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:58:47,920 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 797 transitions. [2023-12-02 12:58:47,921 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) [2023-12-02 12:58:47,921 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 797 transitions. [2023-12-02 12:58:47,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-02 12:58:47,922 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:58:47,922 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] [2023-12-02 12:58:47,928 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 12:58:48,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:58:48,123 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:58:48,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:58:48,123 INFO L85 PathProgramCache]: Analyzing trace with hash -292054719, now seen corresponding path program 1 times [2023-12-02 12:58:48,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:58:48,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049037939] [2023-12-02 12:58:48,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:48,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:58:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 24 proven. 335 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 12:58:49,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:58:49,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049037939] [2023-12-02 12:58:49,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049037939] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:58:49,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666135041] [2023-12-02 12:58:49,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:58:49,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:58:49,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:58:49,322 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:58:49,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 12:58:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:58:49,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 12:58:49,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:58:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 24 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:49,906 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:58:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 24 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:58:53,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666135041] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:58:53,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1102531139] [2023-12-02 12:58:53,287 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2023-12-02 12:58:53,287 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:58:53,288 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:58:53,288 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:58:53,288 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:58:54,920 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:58:59,050 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '15969#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (or (and (= |ULTIMATE.start_main_~P9~0#1| 1) (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1)) (and (or (< |ULTIMATE.start_main_~this_expect~0#1| 1) (not (= 1 (mod (+ |ULTIMATE.start_main_~this_expect~0#1| 1) 2)))) (= |ULTIMATE.start_main_~P9~0#1| 1))) (= 7 |ULTIMATE.start_main_~method_id~0#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) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (exists ((|v_ULTIMATE.start_main_#t~nondet43#1_28| Int)) (and (not (= |v_ULTIMATE.start_main_#t~nondet43#1_28| 0)) (<= |v_ULTIMATE.start_main_#t~nondet43#1_28| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet43#1_28| 2147483648)))) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647))' at error location [2023-12-02 12:58:59,050 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:58:59,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:58:59,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 21] total 40 [2023-12-02 12:58:59,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157755031] [2023-12-02 12:58:59,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:58:59,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-02 12:58:59,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:58:59,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-02 12:58:59,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=4672, Unknown=0, NotChecked=0, Total=5112 [2023-12-02 12:58:59,054 INFO L87 Difference]: Start difference. First operand 550 states and 797 transitions. Second operand has 40 states, 40 states have (on average 8.5) internal successors, (340), 40 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) [2023-12-02 12:59:01,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:01,152 INFO L93 Difference]: Finished difference Result 577 states and 818 transitions. [2023-12-02 12:59:01,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-02 12:59:01,153 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 8.5) internal successors, (340), 40 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 [2023-12-02 12:59:01,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:01,155 INFO L225 Difference]: With dead ends: 577 [2023-12-02 12:59:01,155 INFO L226 Difference]: Without dead ends: 563 [2023-12-02 12:59:01,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 368 SyntacticMatches, 4 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3171 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=764, Invalid=8166, Unknown=0, NotChecked=0, Total=8930 [2023-12-02 12:59:01,158 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 1865 mSDsluCounter, 6223 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1865 SdHoareTripleChecker+Valid, 6535 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:01,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1865 Valid, 6535 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 12:59:01,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2023-12-02 12:59:01,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 550. [2023-12-02 12:59:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.4116575591985427) internal successors, (775), 549 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:59:01,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 775 transitions. [2023-12-02 12:59:01,167 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 775 transitions. Word has length 134 [2023-12-02 12:59:01,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:01,168 INFO L495 AbstractCegarLoop]: Abstraction has 550 states and 775 transitions. [2023-12-02 12:59:01,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 8.5) internal successors, (340), 40 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) [2023-12-02 12:59:01,168 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 775 transitions. [2023-12-02 12:59:01,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-02 12:59:01,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:01,169 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] [2023-12-02 12:59:01,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-02 12:59:01,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:59:01,370 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:59:01,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:01,370 INFO L85 PathProgramCache]: Analyzing trace with hash 593017958, now seen corresponding path program 2 times [2023-12-02 12:59:01,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:59:01,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141925612] [2023-12-02 12:59:01,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:01,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:59:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 26 proven. 380 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 12:59:03,060 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:59:03,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141925612] [2023-12-02 12:59:03,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141925612] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:59:03,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360159316] [2023-12-02 12:59:03,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 12:59:03,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:59:03,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:59:03,063 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:59:03,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 12:59:03,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-12-02 12:59:03,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:59:03,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 65 conjunts are in the unsatisfiable core [2023-12-02 12:59:03,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:59:03,593 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 26 proven. 388 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 12:59:03,593 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:59:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 108 proven. 306 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 12:59:04,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360159316] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:59:04,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [274046206] [2023-12-02 12:59:04,274 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2023-12-02 12:59:04,274 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:59:04,274 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:59:04,274 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:59:04,275 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:59:05,998 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:59:09,677 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '18073#(and (or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))) (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (<= 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)) (exists ((|v_ULTIMATE.start_main_#t~nondet14#1_86| Int)) (and (<= 0 (+ 2147483648 |v_ULTIMATE.start_main_#t~nondet14#1_86|)) (<= |v_ULTIMATE.start_main_#t~nondet14#1_86| 2147483647) (not (= |v_ULTIMATE.start_main_#t~nondet14#1_86| 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 (+ |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))' at error location [2023-12-02 12:59:09,677 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:59:09,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:59:09,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 17] total 34 [2023-12-02 12:59:09,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875120735] [2023-12-02 12:59:09,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:59:09,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 12:59:09,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:59:09,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 12:59:09,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=521, Invalid=3769, Unknown=0, NotChecked=0, Total=4290 [2023-12-02 12:59:09,680 INFO L87 Difference]: Start difference. First operand 550 states and 775 transitions. Second operand has 34 states, 34 states have (on average 8.882352941176471) internal successors, (302), 34 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:59:12,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:12,681 INFO L93 Difference]: Finished difference Result 832 states and 1133 transitions. [2023-12-02 12:59:12,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-12-02 12:59:12,682 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 8.882352941176471) internal successors, (302), 34 states have internal predecessors, (302), 0 states have call successors, (0), 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 [2023-12-02 12:59:12,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:12,686 INFO L225 Difference]: With dead ends: 832 [2023-12-02 12:59:12,686 INFO L226 Difference]: Without dead ends: 830 [2023-12-02 12:59:12,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 406 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7001 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2752, Invalid=15070, Unknown=0, NotChecked=0, Total=17822 [2023-12-02 12:59:12,691 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 2277 mSDsluCounter, 4992 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2277 SdHoareTripleChecker+Valid, 5316 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:12,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2277 Valid, 5316 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 12:59:12,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2023-12-02 12:59:12,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 551. [2023-12-02 12:59:12,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.4054545454545455) internal successors, (773), 550 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:59:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 773 transitions. [2023-12-02 12:59:12,703 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 773 transitions. Word has length 140 [2023-12-02 12:59:12,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:12,703 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 773 transitions. [2023-12-02 12:59:12,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 8.882352941176471) internal successors, (302), 34 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:59:12,704 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 773 transitions. [2023-12-02 12:59:12,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2023-12-02 12:59:12,708 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:12,708 INFO L195 NwaCegarLoop]: trace histogram [27, 26, 19, 19, 12, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:59:12,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-02 12:59:12,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-02 12:59:12,916 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:59:12,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:12,916 INFO L85 PathProgramCache]: Analyzing trace with hash -193981379, now seen corresponding path program 1 times [2023-12-02 12:59:12,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:59:12,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843658147] [2023-12-02 12:59:12,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:12,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:59:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 52 proven. 1707 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-02 12:59:16,669 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:59:16,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843658147] [2023-12-02 12:59:16,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843658147] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:59:16,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507053685] [2023-12-02 12:59:16,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:16,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:59:16,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:59:16,670 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:59:16,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 12:59:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:16,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 105 conjunts are in the unsatisfiable core [2023-12-02 12:59:16,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:59:18,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 52 proven. 1755 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:59:18,023 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:59:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 52 proven. 1755 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:59:24,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507053685] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:59:24,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [914221091] [2023-12-02 12:59:24,642 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2023-12-02 12:59:24,643 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:59:24,643 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:59:24,643 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:59:24,643 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:59:26,374 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:59:32,117 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '21392#(and (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (<= |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) (or (and (not (= 0 (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))) (= 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)) (exists ((|v_ULTIMATE.start_main_#t~nondet27#1_74| Int)) (and (not (= |v_ULTIMATE.start_main_#t~nondet27#1_74| 0)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet27#1_74| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet27#1_74| 2147483647))) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P8~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P6~0#1| 2147483647) (<= |ULTIMATE.start_main_~P8~0#1| 2147483647))' at error location [2023-12-02 12:59:32,117 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:59:32,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:59:32,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 28, 42] total 83 [2023-12-02 12:59:32,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642965533] [2023-12-02 12:59:32,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:59:32,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2023-12-02 12:59:32,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:59:32,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2023-12-02 12:59:32,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=700, Invalid=12410, Unknown=0, NotChecked=0, Total=13110 [2023-12-02 12:59:32,121 INFO L87 Difference]: Start difference. First operand 551 states and 773 transitions. Second operand has 83 states, 83 states have (on average 9.337349397590362) internal successors, (775), 83 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:59:37,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:37,533 INFO L93 Difference]: Finished difference Result 1257 states and 1766 transitions. [2023-12-02 12:59:37,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-12-02 12:59:37,534 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 9.337349397590362) internal successors, (775), 83 states have internal predecessors, (775), 0 states have call successors, (0), 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 275 [2023-12-02 12:59:37,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:37,541 INFO L225 Difference]: With dead ends: 1257 [2023-12-02 12:59:37,541 INFO L226 Difference]: Without dead ends: 1231 [2023-12-02 12:59:37,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 941 GetRequests, 783 SyntacticMatches, 9 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8364 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=1267, Invalid=21383, Unknown=0, NotChecked=0, Total=22650 [2023-12-02 12:59:37,543 INFO L413 NwaCegarLoop]: 879 mSDtfsCounter, 6170 mSDsluCounter, 40435 mSDsCounter, 0 mSdLazyCounter, 4451 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6170 SdHoareTripleChecker+Valid, 41314 SdHoareTripleChecker+Invalid, 4695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 4451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:37,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6170 Valid, 41314 Invalid, 4695 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [244 Valid, 4451 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-02 12:59:37,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2023-12-02 12:59:37,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1126. [2023-12-02 12:59:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 1125 states have (on average 1.456) internal successors, (1638), 1125 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:59:37,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1638 transitions. [2023-12-02 12:59:37,563 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1638 transitions. Word has length 275 [2023-12-02 12:59:37,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:37,563 INFO L495 AbstractCegarLoop]: Abstraction has 1126 states and 1638 transitions. [2023-12-02 12:59:37,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 9.337349397590362) internal successors, (775), 83 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:59:37,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1638 transitions. [2023-12-02 12:59:37,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2023-12-02 12:59:37,566 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:37,566 INFO L195 NwaCegarLoop]: trace histogram [28, 27, 20, 20, 13, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:59:37,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-02 12:59:37,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-12-02 12:59:37,767 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 12:59:37,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:37,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1539333073, now seen corresponding path program 2 times [2023-12-02 12:59:37,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:59:37,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699746613] [2023-12-02 12:59:37,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:37,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:59:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:42,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1973 backedges. 54 proven. 1871 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-02 12:59:42,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:59:42,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699746613] [2023-12-02 12:59:42,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699746613] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 12:59:42,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41749987] [2023-12-02 12:59:42,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 12:59:42,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 12:59:42,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:59:42,141 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 12:59:42,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 12:59:42,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2023-12-02 12:59:42,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:59:42,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 1358 conjuncts, 90 conjunts are in the unsatisfiable core [2023-12-02 12:59:42,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:59:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1973 backedges. 54 proven. 1871 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-02 12:59:42,904 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 12:59:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1973 backedges. 90 proven. 1871 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 12:59:48,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41749987] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 12:59:48,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [500153928] [2023-12-02 12:59:48,754 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2023-12-02 12:59:48,755 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 12:59:48,755 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 12:59:48,755 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 12:59:48,755 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 12:59:50,473 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 12:59:54,803 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '25702#(and (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 1) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (<= |ULTIMATE.start_main_~P9~0#1| 2147483647) (or (and (<= 0 |ULTIMATE.start_main_~P6~0#1|) (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 1) (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))) (and (<= 0 |ULTIMATE.start_main_~P6~0#1|) (or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 1)) (< |ULTIMATE.start_main_~this_expect~0#1| 0)) (= (mod |ULTIMATE.start_main_~P6~0#1| 2) 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)) (<= 0 (+ |ULTIMATE.start_main_~P3~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (exists ((|v_ULTIMATE.start_main_#t~nondet35#1_58| Int)) (and (<= |v_ULTIMATE.start_main_#t~nondet35#1_58| 2147483647) (not (= |v_ULTIMATE.start_main_#t~nondet35#1_58| 0)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet35#1_58| 2147483648)))) (<= 0 |ULTIMATE.start_main_~P1~0#1|) (= 5 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 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))' at error location [2023-12-02 12:59:54,803 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 12:59:54,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 12:59:54,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 32] total 48 [2023-12-02 12:59:54,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904291189] [2023-12-02 12:59:54,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 12:59:54,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-02 12:59:54,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:59:54,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-02 12:59:54,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=772, Invalid=5548, Unknown=0, NotChecked=0, Total=6320 [2023-12-02 12:59:54,806 INFO L87 Difference]: Start difference. First operand 1126 states and 1638 transitions. Second operand has 48 states, 48 states have (on average 11.0625) internal successors, (531), 48 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:00,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:00,436 INFO L93 Difference]: Finished difference Result 1250 states and 1732 transitions. [2023-12-02 13:00:00,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2023-12-02 13:00:00,436 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 11.0625) internal successors, (531), 48 states have internal predecessors, (531), 0 states have call successors, (0), 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 287 [2023-12-02 13:00:00,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:00,441 INFO L225 Difference]: With dead ends: 1250 [2023-12-02 13:00:00,441 INFO L226 Difference]: Without dead ends: 1232 [2023-12-02 13:00:00,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1025 GetRequests, 867 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8252 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=3291, Invalid=21831, Unknown=0, NotChecked=0, Total=25122 [2023-12-02 13:00:00,443 INFO L413 NwaCegarLoop]: 666 mSDtfsCounter, 8328 mSDsluCounter, 11112 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8328 SdHoareTripleChecker+Valid, 11778 SdHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:00,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8328 Valid, 11778 Invalid, 1874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 13:00:00,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2023-12-02 13:00:00,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1126. [2023-12-02 13:00:00,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 1125 states have (on average 1.431111111111111) internal successors, (1610), 1125 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1610 transitions. [2023-12-02 13:00:00,463 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1610 transitions. Word has length 287 [2023-12-02 13:00:00,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:00,463 INFO L495 AbstractCegarLoop]: Abstraction has 1126 states and 1610 transitions. [2023-12-02 13:00:00,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 11.0625) internal successors, (531), 48 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1610 transitions. [2023-12-02 13:00:00,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2023-12-02 13:00:00,467 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:00,467 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] [2023-12-02 13:00:00,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 13:00:00,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-02 13:00:00,668 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:00:00,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:00,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1525359794, now seen corresponding path program 3 times [2023-12-02 13:00:00,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:00:00,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845116495] [2023-12-02 13:00:00,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:00,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:00:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2270 backedges. 58 proven. 2164 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-02 13:00:06,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:00:06,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845116495] [2023-12-02 13:00:06,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845116495] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:00:06,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134463496] [2023-12-02 13:00:06,290 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 13:00:06,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:00:06,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:00:06,291 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:00:06,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 13:00:06,560 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 13:00:06,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:00:06,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 1456 conjuncts, 124 conjunts are in the unsatisfiable core [2023-12-02 13:00:06,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2270 backedges. 58 proven. 2212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:07,818 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:00:15,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2270 backedges. 64 proven. 2206 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:15,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134463496] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:00:15,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [250342154] [2023-12-02 13:00:15,925 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2023-12-02 13:00:15,925 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:00:15,925 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:00:15,925 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:00:15,925 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:00:17,655 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:00:23,595 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '30264#(and (or (not (= (mod |ULTIMATE.start_main_~this_expect~0#1| 2) 0)) (not (= |ULTIMATE.start_main_~this_buffer_empty~0#1| 1))) (<= 0 (+ |ULTIMATE.start_main_~P6~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~P5~0#1| 2147483648)) (= (mod |ULTIMATE.start_main_~P1~0#1| 2) 0) (<= |ULTIMATE.start_main_~P3~0#1| 2147483647) (<= |ULTIMATE.start_main_~P2~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~P9~0#1| 2147483648)) (exists ((|v_ULTIMATE.start_main_#t~nondet14#1_120| Int)) (and (<= |v_ULTIMATE.start_main_#t~nondet14#1_120| 2147483647) (not (= |v_ULTIMATE.start_main_#t~nondet14#1_120| 0)) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet14#1_120| 2147483648)))) (<= 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)) (<= 0 (+ |ULTIMATE.start_main_~P4~0#1| 2147483648)) (= 2 |ULTIMATE.start_main_~method_id~0#1|) (<= |ULTIMATE.start_main_~P7~0#1| 2147483647) (<= 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))' at error location [2023-12-02 13:00:23,595 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:00:23,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:00:23,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 32, 47] total 92 [2023-12-02 13:00:23,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552257089] [2023-12-02 13:00:23,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:00:23,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2023-12-02 13:00:23,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:00:23,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2023-12-02 13:00:23,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1457, Invalid=13795, Unknown=0, NotChecked=0, Total=15252 [2023-12-02 13:00:23,599 INFO L87 Difference]: Start difference. First operand 1126 states and 1610 transitions. Second operand has 92 states, 92 states have (on average 9.076086956521738) internal successors, (835), 92 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) [2023-12-02 13:00:34,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:34,025 INFO L93 Difference]: Finished difference Result 1413 states and 1941 transitions. [2023-12-02 13:00:34,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2023-12-02 13:00:34,026 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 9.076086956521738) internal successors, (835), 92 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 [2023-12-02 13:00:34,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:34,031 INFO L225 Difference]: With dead ends: 1413 [2023-12-02 13:00:34,031 INFO L226 Difference]: Without dead ends: 1405 [2023-12-02 13:00:34,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1144 GetRequests, 910 SyntacticMatches, 8 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18538 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=4313, Invalid=47443, Unknown=0, NotChecked=0, Total=51756 [2023-12-02 13:00:34,034 INFO L413 NwaCegarLoop]: 844 mSDtfsCounter, 12253 mSDsluCounter, 21338 mSDsCounter, 0 mSdLazyCounter, 2610 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12253 SdHoareTripleChecker+Valid, 22182 SdHoareTripleChecker+Invalid, 3254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 2610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:34,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12253 Valid, 22182 Invalid, 3254 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [644 Valid, 2610 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-02 13:00:34,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2023-12-02 13:00:34,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1253. [2023-12-02 13:00:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1252 states have (on average 1.4369009584664536) internal successors, (1799), 1252 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1799 transitions. [2023-12-02 13:00:34,055 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1799 transitions. Word has length 308 [2023-12-02 13:00:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:34,055 INFO L495 AbstractCegarLoop]: Abstraction has 1253 states and 1799 transitions. [2023-12-02 13:00:34,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 9.076086956521738) internal successors, (835), 92 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) [2023-12-02 13:00:34,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1799 transitions. [2023-12-02 13:00:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2023-12-02 13:00:34,058 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:34,058 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] [2023-12-02 13:00:34,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 13:00:34,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-02 13:00:34,259 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:00:34,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:34,260 INFO L85 PathProgramCache]: Analyzing trace with hash -398542377, now seen corresponding path program 2 times [2023-12-02 13:00:34,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:00:34,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428111894] [2023-12-02 13:00:34,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:34,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:00:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 13:00:34,611 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 13:00:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 13:00:35,136 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 13:00:35,137 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 13:00:35,138 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 13:00:35,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-02 13:00:35,143 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:35,147 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 13:00:35,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:00:35 BoogieIcfgContainer [2023-12-02 13:00:35,313 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 13:00:35,314 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 13:00:35,314 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 13:00:35,315 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 13:00:35,315 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:57:32" (3/4) ... [2023-12-02 13:00:35,316 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 13:00:35,499 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 13:00:35,499 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 13:00:35,500 INFO L158 Benchmark]: Toolchain (without parser) took 184575.91ms. Allocated memory was 146.8MB in the beginning and 1.1GB in the end (delta: 935.3MB). Free memory was 100.6MB in the beginning and 541.2MB in the end (delta: -440.7MB). Peak memory consumption was 497.8MB. Max. memory is 16.1GB. [2023-12-02 13:00:35,500 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 146.8MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 13:00:35,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.29ms. Allocated memory is still 146.8MB. Free memory was 100.3MB in the beginning and 81.0MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-12-02 13:00:35,501 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.56ms. Allocated memory is still 146.8MB. Free memory was 81.0MB in the beginning and 76.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 13:00:35,501 INFO L158 Benchmark]: Boogie Preprocessor took 89.40ms. Allocated memory was 146.8MB in the beginning and 205.5MB in the end (delta: 58.7MB). Free memory was 76.2MB in the beginning and 173.3MB in the end (delta: -97.1MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2023-12-02 13:00:35,502 INFO L158 Benchmark]: RCFGBuilder took 846.94ms. Allocated memory is still 205.5MB. Free memory was 173.2MB in the beginning and 128.9MB in the end (delta: 44.3MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2023-12-02 13:00:35,502 INFO L158 Benchmark]: TraceAbstraction took 183013.20ms. Allocated memory was 205.5MB in the beginning and 1.1GB in the end (delta: 876.6MB). Free memory was 128.9MB in the beginning and 572.7MB in the end (delta: -443.8MB). Peak memory consumption was 433.5MB. Max. memory is 16.1GB. [2023-12-02 13:00:35,503 INFO L158 Benchmark]: Witness Printer took 185.16ms. Allocated memory is still 1.1GB. Free memory was 572.7MB in the beginning and 541.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-12-02 13:00:35,505 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 146.8MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.29ms. Allocated memory is still 146.8MB. Free memory was 100.3MB in the beginning and 81.0MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.56ms. Allocated memory is still 146.8MB. Free memory was 81.0MB in the beginning and 76.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.40ms. Allocated memory was 146.8MB in the beginning and 205.5MB in the end (delta: 58.7MB). Free memory was 76.2MB in the beginning and 173.3MB in the end (delta: -97.1MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * RCFGBuilder took 846.94ms. Allocated memory is still 205.5MB. Free memory was 173.2MB in the beginning and 128.9MB in the end (delta: 44.3MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. * TraceAbstraction took 183013.20ms. Allocated memory was 205.5MB in the beginning and 1.1GB in the end (delta: 876.6MB). Free memory was 128.9MB in the beginning and 572.7MB in the end (delta: -443.8MB). Peak memory consumption was 433.5MB. Max. memory is 16.1GB. * Witness Printer took 185.16ms. Allocated memory is still 1.1GB. Free memory was 572.7MB in the beginning and 541.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. 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_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=0, this_buffer_empty=0, this_expect=0] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=0, this_buffer_empty=0, this_expect=0] [L45] COND TRUE q == 0 [L46] COND TRUE __VERIFIER_nondet_int() [L50] method_id = 1 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, q=0, this_buffer_empty=0, this_expect=0] [L52] COND FALSE !(0) [L56] q = 1 [L58] this_expect=0 [L58] this_buffer_empty=1 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, q=1, this_buffer_empty=1, this_expect=0] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, q=1, this_buffer_empty=1, this_expect=0] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=1, q=1, this_buffer_empty=1, this_expect=0] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=0] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=1] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=1] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=1] [L65] COND FALSE !(q == 1) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=1] [L165] COND FALSE !(q == 2) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=1] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=1] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=1] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=1] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=1] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=1] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=1] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=1] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=1] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L365] COND FALSE !(q == 4) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=2] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=2] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=2] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=2] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=2] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=2] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=3] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=3] [L65] COND FALSE !(q == 1) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=3] [L165] COND FALSE !(q == 2) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=3] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=3] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=3] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=3] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=3] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=3] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=3] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=3] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=3] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L365] COND FALSE !(q == 4) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=4] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=4] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=4] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=4] [L45] COND FALSE !(q == 0) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=4] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=4] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=5] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=5] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=5] [L65] COND FALSE !(q == 1) VAL [P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=5] [L165] COND FALSE !(q == 2) VAL [P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=5] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=5] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=-1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=5] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=5] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=5] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=5] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=5] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=5] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=5] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L365] COND FALSE !(q == 4) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=6] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=6] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=6] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=6] [L45] COND FALSE !(q == 0) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=6] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=6] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=7] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=7] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=7] [L65] COND FALSE !(q == 1) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=7] [L165] COND FALSE !(q == 2) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=7] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=7] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=7] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=7] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=7] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=7] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=7] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=7] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=7] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L365] COND FALSE !(q == 4) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=8] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=8] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=8] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=8] [L45] COND FALSE !(q == 0) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=8] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=8] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=9] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=9] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=9] [L65] COND FALSE !(q == 1) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=9] [L165] COND FALSE !(q == 2) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=9] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=9] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=9] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=9] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=9] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=9] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=9] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=9] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=9] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L365] COND FALSE !(q == 4) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=10] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=10] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=10] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=10] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=10] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=10] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=11] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=11] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=11] [L65] COND FALSE !(q == 1) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=11] [L165] COND FALSE !(q == 2) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=11] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=11] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=11] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=11] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=11] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=11] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=11] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=11] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=11] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L365] COND FALSE !(q == 4) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=12] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=12] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=12] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=12] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=12] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=12] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=13] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=13] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=13] [L65] COND FALSE !(q == 1) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=13] [L165] COND FALSE !(q == 2) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=13] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=13] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=13] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=13] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=13] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=13] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=13] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=13] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=13] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=-2, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L365] COND FALSE !(q == 4) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=14] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=14] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=14] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=14] [L45] COND FALSE !(q == 0) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=14] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=14] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=15] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=15] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=15] [L65] COND FALSE !(q == 1) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=15] [L165] COND FALSE !(q == 2) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=15] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=15] [L288] COND FALSE !((((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2))))) [L292] q = 4 [L294] this_expect=this_expect [L294] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=0, P2=0, P3=1, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=15] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=15] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=15] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=15] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=15] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=4, this_buffer_empty=1, this_expect=15] [L365] COND TRUE q == 4 [L366] COND FALSE !(__VERIFIER_nondet_int()) [L382] COND FALSE !(__VERIFIER_nondet_int()) [L398] COND FALSE !(__VERIFIER_nondet_int()) [L414] COND TRUE __VERIFIER_nondet_int() [L416] COND TRUE (((P1 % 2) != (0 % 2)) && !(((P1 % 2) != ((0 + 1) % 2)) && ((P1 % 2) != (0 % 2)))) [L418] method_id = 5 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=4, this_buffer_empty=1, this_expect=15] [L420] COND FALSE !(((((((P6 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))) || (((this_buffer_empty != 1) && ((P6 % 2) != (0 % 2))) && (((P6 % 2) != (0 % 2)) && !(((P6 % 2) != ((0 + 1) % 2)) && ((P6 % 2) != (0 % 2))))))) [L424] q = 5 [L426] this_expect=(this_expect + 1) [L426] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=1, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L45] COND FALSE !(q == 0) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L65] COND FALSE !(q == 1) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L165] COND FALSE !(q == 2) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L265] COND FALSE !(q == 3) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L365] COND FALSE !(q == 4) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=5, q=5, this_buffer_empty=0, this_expect=16] [L465] COND TRUE q == 5 [L466] COND FALSE !(__VERIFIER_nondet_int()) [L482] COND FALSE !(__VERIFIER_nondet_int()) [L498] COND FALSE !(__VERIFIER_nondet_int()) [L514] COND FALSE !(__VERIFIER_nondet_int()) [L530] COND FALSE !(__VERIFIER_nondet_int()) [L546] COND TRUE __VERIFIER_nondet_int() [L548] COND TRUE ((P1 != (((0 + 1) - 1) % 2)) && !((P1 != ((((0 + 1) + 1) - 1) % 2)) && (P1 != (((0 + 1) - 1) % 2)))) [L550] method_id = 7 VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=5, this_buffer_empty=0, this_expect=16] [L552] COND FALSE !(((((this_buffer_empty == 1) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))) || ((((P9 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && (P9 != (((0 + 1) - 1) % 2))) && ((P9 != (((0 + 1) - 1) % 2)) && !((P9 != ((((0 + 1) + 1) - 1) % 2)) && (P9 != (((0 + 1) - 1) % 2))))))) [L556] q = 1 [L558] this_expect=this_expect [L558] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=1, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=1, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=16] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND FALSE !(this_expect > 16) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=16] [L45] COND FALSE !(q == 0) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=7, q=1, this_buffer_empty=1, this_expect=16] [L65] COND TRUE q == 1 [L66] COND TRUE __VERIFIER_nondet_int() [L68] COND TRUE !((P1 % 2) != (0 % 2)) [L70] method_id = 2 VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=1, this_buffer_empty=1, this_expect=16] [L72] COND FALSE !((((((P1 % 2) != (this_expect % 2)) && (this_buffer_empty == 1)) && !((P1 % 2) != (0 % 2))) || ((this_buffer_empty != 1) && !((P1 % 2) != (0 % 2))))) [L76] q = 3 [L78] this_expect=(this_expect + 1) [L78] this_buffer_empty=(1 - this_buffer_empty) VAL [P1=-2, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=17] [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L40] COND TRUE this_expect > 16 [L41] this_expect = -16 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=-16] [L45] COND FALSE !(q == 0) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=-16] [L65] COND FALSE !(q == 1) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=-16] [L165] COND FALSE !(q == 2) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=2, q=3, this_buffer_empty=0, this_expect=-16] [L265] COND TRUE q == 3 [L266] COND FALSE !(__VERIFIER_nondet_int()) [L282] COND TRUE __VERIFIER_nondet_int() [L284] COND TRUE !(P1 != (((0 + 1) - 1) % 2)) [L286] method_id = 3 VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=-16] [L288] COND TRUE (((this_buffer_empty == 1) && !(P3 != (((0 + 1) - 1) % 2))) || (((P3 != ((this_expect - 1) % 2)) && (this_buffer_empty != 1)) && !(P3 != (((0 + 1) - 1) % 2)))) VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, q=3, this_buffer_empty=0, this_expect=-16] [L571] reach_error() VAL [P1=0, P2=0, P3=0, P4=0, P5=0, P6=0, P7=0, P8=0, P9=0, m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, method_id=3, 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: 182.8s, OverallIterations: 26, TraceHistogramMax: 35, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 34.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35604 SdHoareTripleChecker+Valid, 14.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35604 mSDsluCounter, 102460 SdHoareTripleChecker+Invalid, 12.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96098 mSDsCounter, 1914 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15129 IncrementalHoareTripleChecker+Invalid, 17043 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1914 mSolverCounterUnsat, 6362 mSDtfsCounter, 15129 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5941 GetRequests, 4700 SyntacticMatches, 41 SemanticMatches, 1200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52065 ImplicationChecksByTransitivity, 89.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1253occurred in iteration=25, InterpolantAutomatonStates: 600, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 872 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 53.5s InterpolantComputationTime, 3941 NumberOfCodeBlocks, 3941 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 5225 ConstructedInterpolants, 0 QuantifiedInterpolants, 52255 SizeOfPredicates, 29 NumberOfNonLiveVariables, 8510 ConjunctsInSsa, 643 ConjunctsInUnsatCore, 59 InterpolantComputations, 8 PerfectInterpolantSequences, 1490/22642 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: OVERALL_TIME: 5.6s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 4, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 104, DAG_INTERPRETER_EARLY_EXITS: 8, TOOLS_POST_APPLICATIONS: 256, TOOLS_POST_TIME: 4.2s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 180, TOOLS_QUANTIFIERELIM_TIME: 4.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 388, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 32, DOMAIN_JOIN_TIME: 0.9s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 4, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 20, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 104, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 16, LOOP_SUMMARIZER_CACHE_MISSES: 16, LOOP_SUMMARIZER_OVERALL_TIME: 2.1s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 2.1s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 20, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 2233, DAG_COMPRESSION_RETAINED_NODES: 300, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-02 13:00:35,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c198358-c0b6-4226-9cde-61a3882f06b7/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE