./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bad4bd14ff0d6303c86b61698001b4d4d1f47b3200dad5c7d05f11b8899f8627 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:29:07,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:29:07,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:29:07,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:29:07,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:29:07,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:29:07,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:29:07,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:29:07,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:29:07,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:29:07,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:29:07,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:29:07,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:29:07,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:29:07,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:29:07,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:29:07,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:29:07,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:29:07,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:29:07,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:29:07,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:29:07,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:29:07,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:29:07,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:29:07,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:29:07,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:29:07,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:29:07,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:29:07,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:29:07,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:29:07,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:29:07,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:29:07,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:29:07,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:29:07,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:29:07,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:29:07,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:29:07,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:29:07,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:29:07,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:29:07,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:29:07,425 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:29:07,452 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:29:07,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:29:07,453 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:29:07,453 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:29:07,454 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:29:07,454 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:29:07,455 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:29:07,455 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:29:07,455 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:29:07,455 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:29:07,455 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:29:07,456 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:29:07,456 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:29:07,456 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:29:07,456 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:29:07,457 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:29:07,457 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:29:07,457 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:29:07,458 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:29:07,458 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:29:07,458 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:29:07,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:29:07,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:29:07,459 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:29:07,459 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:29:07,459 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:29:07,460 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:29:07,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:29:07,460 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:29:07,460 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:29:07,461 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:29:07,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:29:07,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:29:07,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:29:07,461 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:29:07,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:29:07,462 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:29:07,462 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:29:07,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:29:07,463 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:29:07,463 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:29:07,463 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/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_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bad4bd14ff0d6303c86b61698001b4d4d1f47b3200dad5c7d05f11b8899f8627 [2022-11-03 02:29:07,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:29:07,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:29:07,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:29:07,849 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:29:07,850 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:29:07,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c [2022-11-03 02:29:07,943 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/data/b1eea5d37/608b5e8a6e454e80ac3e05825ca05a0a/FLAG2ad12581d [2022-11-03 02:29:08,528 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:29:08,529 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c [2022-11-03 02:29:08,562 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/data/b1eea5d37/608b5e8a6e454e80ac3e05825ca05a0a/FLAG2ad12581d [2022-11-03 02:29:08,825 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/data/b1eea5d37/608b5e8a6e454e80ac3e05825ca05a0a [2022-11-03 02:29:08,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:29:08,834 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:29:08,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:29:08,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:29:08,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:29:08,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:29:08" (1/1) ... [2022-11-03 02:29:08,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14c6e460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:08, skipping insertion in model container [2022-11-03 02:29:08,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:29:08" (1/1) ... [2022-11-03 02:29:08,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:29:08,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:29:09,134 WARN L230 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_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c[911,924] [2022-11-03 02:29:09,213 WARN L230 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_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c[8416,8429] [2022-11-03 02:29:09,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:29:09,316 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:29:09,328 WARN L230 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_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c[911,924] [2022-11-03 02:29:09,364 WARN L230 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_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c[8416,8429] [2022-11-03 02:29:09,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:29:09,439 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:29:09,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:09 WrapperNode [2022-11-03 02:29:09,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:29:09,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:29:09,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:29:09,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:29:09,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:09" (1/1) ... [2022-11-03 02:29:09,476 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:09" (1/1) ... [2022-11-03 02:29:09,536 INFO L138 Inliner]: procedures = 61, calls = 71, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 561 [2022-11-03 02:29:09,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:29:09,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:29:09,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:29:09,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:29:09,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:09" (1/1) ... [2022-11-03 02:29:09,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:09" (1/1) ... [2022-11-03 02:29:09,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:09" (1/1) ... [2022-11-03 02:29:09,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:09" (1/1) ... [2022-11-03 02:29:09,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:09" (1/1) ... [2022-11-03 02:29:09,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:09" (1/1) ... [2022-11-03 02:29:09,581 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:09" (1/1) ... [2022-11-03 02:29:09,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:09" (1/1) ... [2022-11-03 02:29:09,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:29:09,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:29:09,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:29:09,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:29:09,591 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:09" (1/1) ... [2022-11-03 02:29:09,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:29:09,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:29:09,679 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:29:09,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:29:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:29:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-03 02:29:09,731 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-03 02:29:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-03 02:29:09,731 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-03 02:29:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-03 02:29:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-03 02:29:09,732 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-03 02:29:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-03 02:29:09,732 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-03 02:29:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-03 02:29:09,732 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-03 02:29:09,733 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-03 02:29:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-03 02:29:09,733 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-03 02:29:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-03 02:29:09,733 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-03 02:29:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-03 02:29:09,734 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-03 02:29:09,734 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-03 02:29:09,734 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-03 02:29:09,734 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-03 02:29:09,734 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-03 02:29:09,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:29:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-03 02:29:09,735 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-03 02:29:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-03 02:29:09,735 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-03 02:29:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:29:09,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:29:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-03 02:29:09,736 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-03 02:29:09,736 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-11-03 02:29:09,736 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-11-03 02:29:09,852 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:29:09,854 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:29:10,618 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-11-03 02:29:10,619 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-11-03 02:29:10,673 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:29:10,921 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:29:10,922 INFO L300 CfgBuilder]: Removed 10 assume(true) statements. [2022-11-03 02:29:10,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:29:10 BoogieIcfgContainer [2022-11-03 02:29:10,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:29:10,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:29:10,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:29:10,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:29:10,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:29:08" (1/3) ... [2022-11-03 02:29:10,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a96706d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:29:10, skipping insertion in model container [2022-11-03 02:29:10,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:09" (2/3) ... [2022-11-03 02:29:10,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a96706d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:29:10, skipping insertion in model container [2022-11-03 02:29:10,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:29:10" (3/3) ... [2022-11-03 02:29:10,941 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.03.cil-1.c [2022-11-03 02:29:10,962 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:29:10,963 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-03 02:29:11,034 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:29:11,042 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@50e71bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:29:11,043 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-03 02:29:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 121 states have (on average 1.512396694214876) internal successors, (183), 129 states have internal predecessors, (183), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2022-11-03 02:29:11,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-03 02:29:11,062 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:11,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:11,064 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:11,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:11,070 INFO L85 PathProgramCache]: Analyzing trace with hash -268619431, now seen corresponding path program 1 times [2022-11-03 02:29:11,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:11,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429517727] [2022-11-03 02:29:11,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:11,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:11,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:29:11,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:11,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429517727] [2022-11-03 02:29:11,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429517727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:11,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:29:11,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:29:11,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931654650] [2022-11-03 02:29:11,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:11,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:29:11,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:11,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:29:11,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:29:11,712 INFO L87 Difference]: Start difference. First operand has 174 states, 121 states have (on average 1.512396694214876) internal successors, (183), 129 states have internal predecessors, (183), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 02:29:12,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:12,921 INFO L93 Difference]: Finished difference Result 653 states and 992 transitions. [2022-11-03 02:29:12,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:29:12,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-11-03 02:29:12,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:12,943 INFO L225 Difference]: With dead ends: 653 [2022-11-03 02:29:12,943 INFO L226 Difference]: Without dead ends: 474 [2022-11-03 02:29:12,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:29:12,955 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 659 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:12,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 709 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 02:29:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-11-03 02:29:13,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 461. [2022-11-03 02:29:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 338 states have (on average 1.4289940828402368) internal successors, (483), 346 states have internal predecessors, (483), 84 states have call successors, (84), 39 states have call predecessors, (84), 37 states have return successors, (106), 77 states have call predecessors, (106), 80 states have call successors, (106) [2022-11-03 02:29:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 673 transitions. [2022-11-03 02:29:13,094 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 673 transitions. Word has length 41 [2022-11-03 02:29:13,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:13,095 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 673 transitions. [2022-11-03 02:29:13,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 02:29:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 673 transitions. [2022-11-03 02:29:13,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-03 02:29:13,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:13,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:13,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:29:13,100 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:13,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:13,102 INFO L85 PathProgramCache]: Analyzing trace with hash -844282810, now seen corresponding path program 1 times [2022-11-03 02:29:13,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:13,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831875225] [2022-11-03 02:29:13,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:13,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:13,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:29:13,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:13,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831875225] [2022-11-03 02:29:13,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831875225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:13,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:29:13,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:29:13,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725182707] [2022-11-03 02:29:13,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:13,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:29:13,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:13,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:29:13,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:29:13,219 INFO L87 Difference]: Start difference. First operand 461 states and 673 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-03 02:29:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:13,549 INFO L93 Difference]: Finished difference Result 661 states and 950 transitions. [2022-11-03 02:29:13,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:29:13,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 44 [2022-11-03 02:29:13,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:13,557 INFO L225 Difference]: With dead ends: 661 [2022-11-03 02:29:13,557 INFO L226 Difference]: Without dead ends: 590 [2022-11-03 02:29:13,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:29:13,561 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 295 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:13,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 459 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:29:13,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-11-03 02:29:13,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 579. [2022-11-03 02:29:13,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 422 states have (on average 1.4099526066350712) internal successors, (595), 430 states have internal predecessors, (595), 104 states have call successors, (104), 53 states have call predecessors, (104), 51 states have return successors, (129), 97 states have call predecessors, (129), 100 states have call successors, (129) [2022-11-03 02:29:13,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 828 transitions. [2022-11-03 02:29:13,659 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 828 transitions. Word has length 44 [2022-11-03 02:29:13,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:13,661 INFO L495 AbstractCegarLoop]: Abstraction has 579 states and 828 transitions. [2022-11-03 02:29:13,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-03 02:29:13,662 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 828 transitions. [2022-11-03 02:29:13,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-03 02:29:13,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:13,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:13,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:29:13,669 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:13,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:13,670 INFO L85 PathProgramCache]: Analyzing trace with hash 242054075, now seen corresponding path program 1 times [2022-11-03 02:29:13,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:13,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086585] [2022-11-03 02:29:13,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:13,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:13,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:29:13,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:13,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086585] [2022-11-03 02:29:13,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086585] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:13,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:29:13,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:29:13,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050628375] [2022-11-03 02:29:13,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:13,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:29:13,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:13,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:29:13,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:29:13,845 INFO L87 Difference]: Start difference. First operand 579 states and 828 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-03 02:29:14,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:14,808 INFO L93 Difference]: Finished difference Result 1116 states and 1551 transitions. [2022-11-03 02:29:14,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:29:14,808 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 45 [2022-11-03 02:29:14,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:14,822 INFO L225 Difference]: With dead ends: 1116 [2022-11-03 02:29:14,823 INFO L226 Difference]: Without dead ends: 650 [2022-11-03 02:29:14,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:29:14,826 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 698 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:14,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 849 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:29:14,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-11-03 02:29:14,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 565. [2022-11-03 02:29:14,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 408 states have (on average 1.3774509803921569) internal successors, (562), 416 states have internal predecessors, (562), 104 states have call successors, (104), 53 states have call predecessors, (104), 51 states have return successors, (126), 97 states have call predecessors, (126), 100 states have call successors, (126) [2022-11-03 02:29:14,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 792 transitions. [2022-11-03 02:29:14,927 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 792 transitions. Word has length 45 [2022-11-03 02:29:14,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:14,928 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 792 transitions. [2022-11-03 02:29:14,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-03 02:29:14,929 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 792 transitions. [2022-11-03 02:29:14,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 02:29:14,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:14,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:14,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:29:14,931 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:14,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:14,932 INFO L85 PathProgramCache]: Analyzing trace with hash -803173789, now seen corresponding path program 1 times [2022-11-03 02:29:14,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:14,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45835110] [2022-11-03 02:29:14,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:14,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:15,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:29:15,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:15,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45835110] [2022-11-03 02:29:15,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45835110] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:15,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:29:15,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:29:15,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856191745] [2022-11-03 02:29:15,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:15,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:29:15,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:15,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:29:15,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:29:15,053 INFO L87 Difference]: Start difference. First operand 565 states and 792 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-03 02:29:15,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:15,955 INFO L93 Difference]: Finished difference Result 1031 states and 1400 transitions. [2022-11-03 02:29:15,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:29:15,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 46 [2022-11-03 02:29:15,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:15,962 INFO L225 Difference]: With dead ends: 1031 [2022-11-03 02:29:15,963 INFO L226 Difference]: Without dead ends: 854 [2022-11-03 02:29:15,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:29:15,976 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 606 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:15,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 803 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:29:15,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2022-11-03 02:29:16,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 829. [2022-11-03 02:29:16,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 589 states have (on average 1.3259762308998302) internal successors, (781), 597 states have internal predecessors, (781), 153 states have call successors, (153), 87 states have call predecessors, (153), 85 states have return successors, (192), 146 states have call predecessors, (192), 149 states have call successors, (192) [2022-11-03 02:29:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1126 transitions. [2022-11-03 02:29:16,086 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1126 transitions. Word has length 46 [2022-11-03 02:29:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:16,087 INFO L495 AbstractCegarLoop]: Abstraction has 829 states and 1126 transitions. [2022-11-03 02:29:16,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-03 02:29:16,088 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1126 transitions. [2022-11-03 02:29:16,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-03 02:29:16,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:16,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:16,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:29:16,097 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:16,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:16,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1489204401, now seen corresponding path program 1 times [2022-11-03 02:29:16,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:16,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48023018] [2022-11-03 02:29:16,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:16,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:29:16,204 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:16,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48023018] [2022-11-03 02:29:16,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48023018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:16,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:29:16,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:29:16,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746493934] [2022-11-03 02:29:16,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:16,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:29:16,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:16,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:29:16,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:29:16,207 INFO L87 Difference]: Start difference. First operand 829 states and 1126 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 02:29:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:16,335 INFO L93 Difference]: Finished difference Result 830 states and 1127 transitions. [2022-11-03 02:29:16,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:29:16,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2022-11-03 02:29:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:16,339 INFO L225 Difference]: With dead ends: 830 [2022-11-03 02:29:16,340 INFO L226 Difference]: Without dead ends: 386 [2022-11-03 02:29:16,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:29:16,342 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 200 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:16,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 180 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:29:16,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-11-03 02:29:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2022-11-03 02:29:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 287 states have (on average 1.4250871080139373) internal successors, (409), 292 states have internal predecessors, (409), 68 states have call successors, (68), 31 states have call predecessors, (68), 30 states have return successors, (92), 63 states have call predecessors, (92), 66 states have call successors, (92) [2022-11-03 02:29:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 569 transitions. [2022-11-03 02:29:16,418 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 569 transitions. Word has length 50 [2022-11-03 02:29:16,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:16,419 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 569 transitions. [2022-11-03 02:29:16,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 02:29:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 569 transitions. [2022-11-03 02:29:16,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-03 02:29:16,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:16,421 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:16,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:29:16,422 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:16,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:16,422 INFO L85 PathProgramCache]: Analyzing trace with hash 333451882, now seen corresponding path program 1 times [2022-11-03 02:29:16,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:16,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686078947] [2022-11-03 02:29:16,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:16,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 02:29:16,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:16,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686078947] [2022-11-03 02:29:16,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686078947] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:29:16,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298897068] [2022-11-03 02:29:16,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:16,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:16,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:29:16,552 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:29:16,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:29:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:16,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:29:16,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:16,801 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 02:29:16,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:29:16,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298897068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:16,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:29:16,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-03 02:29:16,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673657191] [2022-11-03 02:29:16,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:16,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:29:16,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:16,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:29:16,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:29:16,804 INFO L87 Difference]: Start difference. First operand 386 states and 569 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 02:29:16,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:16,953 INFO L93 Difference]: Finished difference Result 1130 states and 1708 transitions. [2022-11-03 02:29:16,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:29:16,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2022-11-03 02:29:16,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:16,960 INFO L225 Difference]: With dead ends: 1130 [2022-11-03 02:29:16,960 INFO L226 Difference]: Without dead ends: 750 [2022-11-03 02:29:16,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:29:16,963 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 105 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:16,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 220 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:29:16,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-11-03 02:29:17,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 741. [2022-11-03 02:29:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 555 states have (on average 1.4126126126126126) internal successors, (784), 563 states have internal predecessors, (784), 125 states have call successors, (125), 61 states have call predecessors, (125), 60 states have return successors, (171), 117 states have call predecessors, (171), 123 states have call successors, (171) [2022-11-03 02:29:17,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1080 transitions. [2022-11-03 02:29:17,086 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1080 transitions. Word has length 74 [2022-11-03 02:29:17,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:17,087 INFO L495 AbstractCegarLoop]: Abstraction has 741 states and 1080 transitions. [2022-11-03 02:29:17,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 02:29:17,087 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1080 transitions. [2022-11-03 02:29:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-03 02:29:17,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:17,090 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:17,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:29:17,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:17,291 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:17,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:17,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1154141848, now seen corresponding path program 1 times [2022-11-03 02:29:17,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:17,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960627877] [2022-11-03 02:29:17,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:17,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:29:17,804 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:17,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960627877] [2022-11-03 02:29:17,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960627877] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:17,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:29:17,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:29:17,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852943199] [2022-11-03 02:29:17,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:17,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:29:17,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:17,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:29:17,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:29:17,808 INFO L87 Difference]: Start difference. First operand 741 states and 1080 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 02:29:18,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:18,322 INFO L93 Difference]: Finished difference Result 1977 states and 2931 transitions. [2022-11-03 02:29:18,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:29:18,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 74 [2022-11-03 02:29:18,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:18,333 INFO L225 Difference]: With dead ends: 1977 [2022-11-03 02:29:18,333 INFO L226 Difference]: Without dead ends: 1243 [2022-11-03 02:29:18,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:29:18,340 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 305 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:18,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 428 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:29:18,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2022-11-03 02:29:18,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1155. [2022-11-03 02:29:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 864 states have (on average 1.3958333333333333) internal successors, (1206), 876 states have internal predecessors, (1206), 194 states have call successors, (194), 97 states have call predecessors, (194), 96 states have return successors, (273), 182 states have call predecessors, (273), 192 states have call successors, (273) [2022-11-03 02:29:18,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1673 transitions. [2022-11-03 02:29:18,547 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1673 transitions. Word has length 74 [2022-11-03 02:29:18,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:18,548 INFO L495 AbstractCegarLoop]: Abstraction has 1155 states and 1673 transitions. [2022-11-03 02:29:18,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 02:29:18,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1673 transitions. [2022-11-03 02:29:18,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-03 02:29:18,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:18,553 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:18,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:29:18,553 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:18,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:18,554 INFO L85 PathProgramCache]: Analyzing trace with hash -409863646, now seen corresponding path program 1 times [2022-11-03 02:29:18,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:18,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545035554] [2022-11-03 02:29:18,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:18,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:29:18,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:18,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545035554] [2022-11-03 02:29:18,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545035554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:18,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:29:18,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:29:18,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321652592] [2022-11-03 02:29:18,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:18,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:29:18,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:18,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:29:18,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:29:18,662 INFO L87 Difference]: Start difference. First operand 1155 states and 1673 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 02:29:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:18,884 INFO L93 Difference]: Finished difference Result 2405 states and 3540 transitions. [2022-11-03 02:29:18,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:29:18,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2022-11-03 02:29:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:18,897 INFO L225 Difference]: With dead ends: 2405 [2022-11-03 02:29:18,898 INFO L226 Difference]: Without dead ends: 1399 [2022-11-03 02:29:18,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:29:18,933 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 46 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:18,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 269 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:29:18,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2022-11-03 02:29:19,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1274. [2022-11-03 02:29:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 971 states have (on average 1.419155509783728) internal successors, (1378), 983 states have internal predecessors, (1378), 200 states have call successors, (200), 103 states have call predecessors, (200), 102 states have return successors, (279), 188 states have call predecessors, (279), 198 states have call successors, (279) [2022-11-03 02:29:19,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1857 transitions. [2022-11-03 02:29:19,077 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1857 transitions. Word has length 75 [2022-11-03 02:29:19,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:19,077 INFO L495 AbstractCegarLoop]: Abstraction has 1274 states and 1857 transitions. [2022-11-03 02:29:19,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 02:29:19,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1857 transitions. [2022-11-03 02:29:19,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-03 02:29:19,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:19,091 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:19,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:29:19,091 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:19,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:19,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1453692988, now seen corresponding path program 1 times [2022-11-03 02:29:19,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:19,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949290070] [2022-11-03 02:29:19,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:19,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:19,169 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-03 02:29:19,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:19,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949290070] [2022-11-03 02:29:19,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949290070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:19,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:29:19,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:29:19,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944982012] [2022-11-03 02:29:19,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:19,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:29:19,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:19,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:29:19,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:29:19,174 INFO L87 Difference]: Start difference. First operand 1274 states and 1857 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 02:29:19,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:19,534 INFO L93 Difference]: Finished difference Result 3739 states and 5557 transitions. [2022-11-03 02:29:19,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:29:19,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 98 [2022-11-03 02:29:19,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:19,554 INFO L225 Difference]: With dead ends: 3739 [2022-11-03 02:29:19,555 INFO L226 Difference]: Without dead ends: 2471 [2022-11-03 02:29:19,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:29:19,564 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 100 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:19,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 219 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:29:19,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2022-11-03 02:29:19,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2445. [2022-11-03 02:29:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2445 states, 1862 states have (on average 1.3963480128893662) internal successors, (2600), 1884 states have internal predecessors, (2600), 378 states have call successors, (378), 205 states have call predecessors, (378), 204 states have return successors, (524), 356 states have call predecessors, (524), 376 states have call successors, (524) [2022-11-03 02:29:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3502 transitions. [2022-11-03 02:29:19,866 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3502 transitions. Word has length 98 [2022-11-03 02:29:19,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:19,866 INFO L495 AbstractCegarLoop]: Abstraction has 2445 states and 3502 transitions. [2022-11-03 02:29:19,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 02:29:19,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3502 transitions. [2022-11-03 02:29:19,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-03 02:29:19,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:19,876 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:19,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:29:19,877 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:19,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:19,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1990817789, now seen corresponding path program 1 times [2022-11-03 02:29:19,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:19,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415665908] [2022-11-03 02:29:19,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:19,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-03 02:29:20,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:20,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415665908] [2022-11-03 02:29:20,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415665908] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:29:20,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763127054] [2022-11-03 02:29:20,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:20,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:20,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:29:20,235 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:29:20,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:29:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:20,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:29:20,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:20,454 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 02:29:20,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:29:20,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763127054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:20,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:29:20,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 02:29:20,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248044931] [2022-11-03 02:29:20,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:20,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:29:20,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:20,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:29:20,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:29:20,457 INFO L87 Difference]: Start difference. First operand 2445 states and 3502 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 02:29:20,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:20,836 INFO L93 Difference]: Finished difference Result 4833 states and 6953 transitions. [2022-11-03 02:29:20,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:29:20,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 110 [2022-11-03 02:29:20,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:20,857 INFO L225 Difference]: With dead ends: 4833 [2022-11-03 02:29:20,857 INFO L226 Difference]: Without dead ends: 3033 [2022-11-03 02:29:20,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:29:20,865 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 112 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:20,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 145 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:29:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3033 states. [2022-11-03 02:29:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3033 to 2945. [2022-11-03 02:29:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2945 states, 2293 states have (on average 1.3654600959441778) internal successors, (3131), 2311 states have internal predecessors, (3131), 396 states have call successors, (396), 255 states have call predecessors, (396), 255 states have return successors, (549), 379 states have call predecessors, (549), 394 states have call successors, (549) [2022-11-03 02:29:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 4076 transitions. [2022-11-03 02:29:21,267 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 4076 transitions. Word has length 110 [2022-11-03 02:29:21,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:21,268 INFO L495 AbstractCegarLoop]: Abstraction has 2945 states and 4076 transitions. [2022-11-03 02:29:21,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 02:29:21,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 4076 transitions. [2022-11-03 02:29:21,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-03 02:29:21,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:21,278 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:21,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:29:21,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 02:29:21,495 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:21,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:21,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1332474820, now seen corresponding path program 2 times [2022-11-03 02:29:21,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:21,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860713597] [2022-11-03 02:29:21,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:21,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-03 02:29:21,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:21,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860713597] [2022-11-03 02:29:21,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860713597] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:29:21,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530370965] [2022-11-03 02:29:21,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:29:21,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:21,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:29:21,842 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:29:21,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:29:21,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:29:21,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:29:22,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:29:22,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-03 02:29:22,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:29:22,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530370965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:22,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:29:22,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 02:29:22,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228598042] [2022-11-03 02:29:22,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:22,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:29:22,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:22,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:29:22,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:29:22,060 INFO L87 Difference]: Start difference. First operand 2945 states and 4076 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 02:29:22,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:22,614 INFO L93 Difference]: Finished difference Result 5714 states and 8125 transitions. [2022-11-03 02:29:22,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:29:22,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 110 [2022-11-03 02:29:22,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:22,638 INFO L225 Difference]: With dead ends: 5714 [2022-11-03 02:29:22,639 INFO L226 Difference]: Without dead ends: 3556 [2022-11-03 02:29:22,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:29:22,649 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 117 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:22,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 291 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:29:22,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3556 states. [2022-11-03 02:29:23,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3556 to 3480. [2022-11-03 02:29:23,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3480 states, 2727 states have (on average 1.3542354235423542) internal successors, (3693), 2749 states have internal predecessors, (3693), 455 states have call successors, (455), 298 states have call predecessors, (455), 297 states have return successors, (665), 433 states have call predecessors, (665), 453 states have call successors, (665) [2022-11-03 02:29:23,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3480 states to 3480 states and 4813 transitions. [2022-11-03 02:29:23,140 INFO L78 Accepts]: Start accepts. Automaton has 3480 states and 4813 transitions. Word has length 110 [2022-11-03 02:29:23,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:23,140 INFO L495 AbstractCegarLoop]: Abstraction has 3480 states and 4813 transitions. [2022-11-03 02:29:23,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 02:29:23,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 4813 transitions. [2022-11-03 02:29:23,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-03 02:29:23,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:23,149 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:23,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:29:23,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 02:29:23,370 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:23,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:23,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1984586106, now seen corresponding path program 1 times [2022-11-03 02:29:23,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:23,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171613213] [2022-11-03 02:29:23,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:23,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-03 02:29:23,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:23,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171613213] [2022-11-03 02:29:23,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171613213] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:29:23,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409663575] [2022-11-03 02:29:23,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:23,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:23,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:29:23,670 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:29:23,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:29:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:23,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:29:23,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 02:29:23,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:29:23,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409663575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:23,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:29:23,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 02:29:23,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049369371] [2022-11-03 02:29:23,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:23,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:29:23,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:23,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:29:23,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:29:23,913 INFO L87 Difference]: Start difference. First operand 3480 states and 4813 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 02:29:24,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:24,484 INFO L93 Difference]: Finished difference Result 8188 states and 11465 transitions. [2022-11-03 02:29:24,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:29:24,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 111 [2022-11-03 02:29:24,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:24,514 INFO L225 Difference]: With dead ends: 8188 [2022-11-03 02:29:24,515 INFO L226 Difference]: Without dead ends: 4715 [2022-11-03 02:29:24,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:29:24,529 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 59 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:24,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 226 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:29:24,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4715 states. [2022-11-03 02:29:25,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4715 to 3854. [2022-11-03 02:29:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3854 states, 3057 states have (on average 1.3755315668956494) internal successors, (4205), 3080 states have internal predecessors, (4205), 477 states have call successors, (477), 320 states have call predecessors, (477), 319 states have return successors, (687), 454 states have call predecessors, (687), 475 states have call successors, (687) [2022-11-03 02:29:25,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3854 states to 3854 states and 5369 transitions. [2022-11-03 02:29:25,040 INFO L78 Accepts]: Start accepts. Automaton has 3854 states and 5369 transitions. Word has length 111 [2022-11-03 02:29:25,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:25,041 INFO L495 AbstractCegarLoop]: Abstraction has 3854 states and 5369 transitions. [2022-11-03 02:29:25,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 02:29:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 3854 states and 5369 transitions. [2022-11-03 02:29:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-03 02:29:25,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:25,053 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:25,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:29:25,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 02:29:25,278 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:25,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:25,279 INFO L85 PathProgramCache]: Analyzing trace with hash 714608099, now seen corresponding path program 1 times [2022-11-03 02:29:25,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:25,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838844011] [2022-11-03 02:29:25,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:25,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-03 02:29:25,420 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:25,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838844011] [2022-11-03 02:29:25,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838844011] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:29:25,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190715744] [2022-11-03 02:29:25,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:25,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:25,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:29:25,423 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:29:25,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:29:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:25,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:29:25,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 02:29:25,691 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:29:25,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190715744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:25,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:29:25,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 02:29:25,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701605703] [2022-11-03 02:29:25,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:25,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:29:25,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:25,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:29:25,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:29:25,694 INFO L87 Difference]: Start difference. First operand 3854 states and 5369 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:29:26,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:26,416 INFO L93 Difference]: Finished difference Result 6126 states and 8511 transitions. [2022-11-03 02:29:26,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:29:26,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 111 [2022-11-03 02:29:26,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:26,446 INFO L225 Difference]: With dead ends: 6126 [2022-11-03 02:29:26,447 INFO L226 Difference]: Without dead ends: 4408 [2022-11-03 02:29:26,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:29:26,457 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 61 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:26,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 274 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:29:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2022-11-03 02:29:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 4126. [2022-11-03 02:29:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4126 states, 3297 states have (on average 1.389444949954504) internal successors, (4581), 3320 states have internal predecessors, (4581), 493 states have call successors, (493), 336 states have call predecessors, (493), 335 states have return successors, (703), 470 states have call predecessors, (703), 491 states have call successors, (703) [2022-11-03 02:29:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4126 states to 4126 states and 5777 transitions. [2022-11-03 02:29:27,039 INFO L78 Accepts]: Start accepts. Automaton has 4126 states and 5777 transitions. Word has length 111 [2022-11-03 02:29:27,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:27,040 INFO L495 AbstractCegarLoop]: Abstraction has 4126 states and 5777 transitions. [2022-11-03 02:29:27,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:29:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand 4126 states and 5777 transitions. [2022-11-03 02:29:27,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-03 02:29:27,050 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:27,051 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:27,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:29:27,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 02:29:27,279 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:27,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:27,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1554116249, now seen corresponding path program 1 times [2022-11-03 02:29:27,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:27,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483430582] [2022-11-03 02:29:27,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:27,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-03 02:29:27,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:27,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483430582] [2022-11-03 02:29:27,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483430582] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:29:27,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195725498] [2022-11-03 02:29:27,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:27,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:27,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:29:27,428 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:29:27,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:29:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:27,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:29:27,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 02:29:27,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:29:27,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195725498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:27,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:29:27,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 02:29:27,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155019709] [2022-11-03 02:29:27,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:27,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:29:27,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:27,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:29:27,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:29:27,645 INFO L87 Difference]: Start difference. First operand 4126 states and 5777 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:29:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:28,284 INFO L93 Difference]: Finished difference Result 7706 states and 10970 transitions. [2022-11-03 02:29:28,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:29:28,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 112 [2022-11-03 02:29:28,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:28,342 INFO L225 Difference]: With dead ends: 7706 [2022-11-03 02:29:28,342 INFO L226 Difference]: Without dead ends: 5558 [2022-11-03 02:29:28,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:29:28,352 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 67 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:28,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 292 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:29:28,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5558 states. [2022-11-03 02:29:28,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5558 to 4810. [2022-11-03 02:29:28,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 3893 states have (on average 1.4084253788851786) internal successors, (5483), 3916 states have internal predecessors, (5483), 537 states have call successors, (537), 380 states have call predecessors, (537), 379 states have return successors, (747), 514 states have call predecessors, (747), 535 states have call successors, (747) [2022-11-03 02:29:28,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 6767 transitions. [2022-11-03 02:29:28,927 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 6767 transitions. Word has length 112 [2022-11-03 02:29:28,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:28,928 INFO L495 AbstractCegarLoop]: Abstraction has 4810 states and 6767 transitions. [2022-11-03 02:29:28,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:29:28,928 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 6767 transitions. [2022-11-03 02:29:28,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-03 02:29:28,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:28,940 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:28,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:29:29,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:29,162 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:29,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:29,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1908276119, now seen corresponding path program 1 times [2022-11-03 02:29:29,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:29,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897275695] [2022-11-03 02:29:29,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:29,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-03 02:29:29,356 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:29,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897275695] [2022-11-03 02:29:29,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897275695] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:29:29,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401552544] [2022-11-03 02:29:29,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:29,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:29,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:29:29,359 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:29:29,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:29:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:29,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:29:29,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 02:29:29,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:29:29,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401552544] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:29,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:29:29,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 02:29:29,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173938321] [2022-11-03 02:29:29,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:29,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:29:29,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:29,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:29:29,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:29:29,589 INFO L87 Difference]: Start difference. First operand 4810 states and 6767 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:29:30,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:30,304 INFO L93 Difference]: Finished difference Result 9090 states and 12914 transitions. [2022-11-03 02:29:30,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:29:30,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 112 [2022-11-03 02:29:30,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:30,339 INFO L225 Difference]: With dead ends: 9090 [2022-11-03 02:29:30,339 INFO L226 Difference]: Without dead ends: 6611 [2022-11-03 02:29:30,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:29:30,352 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 73 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:30,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 297 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:29:30,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6611 states. [2022-11-03 02:29:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6611 to 5737. [2022-11-03 02:29:31,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5737 states, 4688 states have (on average 1.4159556313993173) internal successors, (6638), 4711 states have internal predecessors, (6638), 603 states have call successors, (603), 446 states have call predecessors, (603), 445 states have return successors, (813), 580 states have call predecessors, (813), 601 states have call successors, (813) [2022-11-03 02:29:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5737 states to 5737 states and 8054 transitions. [2022-11-03 02:29:31,334 INFO L78 Accepts]: Start accepts. Automaton has 5737 states and 8054 transitions. Word has length 112 [2022-11-03 02:29:31,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:31,335 INFO L495 AbstractCegarLoop]: Abstraction has 5737 states and 8054 transitions. [2022-11-03 02:29:31,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:29:31,336 INFO L276 IsEmpty]: Start isEmpty. Operand 5737 states and 8054 transitions. [2022-11-03 02:29:31,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-03 02:29:31,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:31,352 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:31,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:29:31,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:31,570 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:31,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:31,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1301544040, now seen corresponding path program 1 times [2022-11-03 02:29:31,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:31,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104984200] [2022-11-03 02:29:31,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:31,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:31,878 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 26 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-03 02:29:31,878 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:31,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104984200] [2022-11-03 02:29:31,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104984200] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:29:31,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464138157] [2022-11-03 02:29:31,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:31,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:31,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:29:31,883 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:29:31,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:29:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:32,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 02:29:32,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 02:29:32,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:29:32,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464138157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:32,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:29:32,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-11-03 02:29:32,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136129032] [2022-11-03 02:29:32,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:32,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:29:32,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:32,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:29:32,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:29:32,225 INFO L87 Difference]: Start difference. First operand 5737 states and 8054 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 02:29:33,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:33,537 INFO L93 Difference]: Finished difference Result 13647 states and 19124 transitions. [2022-11-03 02:29:33,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:29:33,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 112 [2022-11-03 02:29:33,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:33,572 INFO L225 Difference]: With dead ends: 13647 [2022-11-03 02:29:33,572 INFO L226 Difference]: Without dead ends: 7917 [2022-11-03 02:29:33,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:29:33,590 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 352 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:33,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 276 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:29:33,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7917 states. [2022-11-03 02:29:34,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7917 to 7913. [2022-11-03 02:29:34,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7913 states, 6427 states have (on average 1.3899175353975417) internal successors, (8933), 6460 states have internal predecessors, (8933), 855 states have call successors, (855), 631 states have call predecessors, (855), 630 states have return successors, (1158), 822 states have call predecessors, (1158), 853 states have call successors, (1158) [2022-11-03 02:29:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7913 states to 7913 states and 10946 transitions. [2022-11-03 02:29:34,525 INFO L78 Accepts]: Start accepts. Automaton has 7913 states and 10946 transitions. Word has length 112 [2022-11-03 02:29:34,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:34,525 INFO L495 AbstractCegarLoop]: Abstraction has 7913 states and 10946 transitions. [2022-11-03 02:29:34,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 02:29:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 7913 states and 10946 transitions. [2022-11-03 02:29:34,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-03 02:29:34,540 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:34,540 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:34,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:29:34,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 02:29:34,752 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:34,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:34,753 INFO L85 PathProgramCache]: Analyzing trace with hash -507811667, now seen corresponding path program 1 times [2022-11-03 02:29:34,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:34,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809599910] [2022-11-03 02:29:34,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:34,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:35,051 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 19 proven. 27 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-03 02:29:35,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:35,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809599910] [2022-11-03 02:29:35,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809599910] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:29:35,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183194530] [2022-11-03 02:29:35,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:35,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:35,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:29:35,054 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:29:35,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 02:29:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:35,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:29:35,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:29:35,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:29:35,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183194530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:35,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:29:35,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 02:29:35,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588620496] [2022-11-03 02:29:35,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:35,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:29:35,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:35,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:29:35,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:29:35,275 INFO L87 Difference]: Start difference. First operand 7913 states and 10946 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:29:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:36,230 INFO L93 Difference]: Finished difference Result 13561 states and 19275 transitions. [2022-11-03 02:29:36,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:29:36,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 113 [2022-11-03 02:29:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:36,259 INFO L225 Difference]: With dead ends: 13561 [2022-11-03 02:29:36,259 INFO L226 Difference]: Without dead ends: 7935 [2022-11-03 02:29:36,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:29:36,276 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 98 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:36,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 281 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:29:36,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7935 states. [2022-11-03 02:29:37,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7935 to 7817. [2022-11-03 02:29:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7817 states, 6331 states have (on average 1.3636076449218133) internal successors, (8633), 6364 states have internal predecessors, (8633), 855 states have call successors, (855), 631 states have call predecessors, (855), 630 states have return successors, (1158), 822 states have call predecessors, (1158), 853 states have call successors, (1158) [2022-11-03 02:29:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7817 states to 7817 states and 10646 transitions. [2022-11-03 02:29:37,267 INFO L78 Accepts]: Start accepts. Automaton has 7817 states and 10646 transitions. Word has length 113 [2022-11-03 02:29:37,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:37,268 INFO L495 AbstractCegarLoop]: Abstraction has 7817 states and 10646 transitions. [2022-11-03 02:29:37,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:29:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand 7817 states and 10646 transitions. [2022-11-03 02:29:37,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-03 02:29:37,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:37,288 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:37,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:29:37,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 02:29:37,514 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:37,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:37,515 INFO L85 PathProgramCache]: Analyzing trace with hash -644333717, now seen corresponding path program 1 times [2022-11-03 02:29:37,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:37,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338315891] [2022-11-03 02:29:37,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:37,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 19 proven. 25 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-03 02:29:37,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:37,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338315891] [2022-11-03 02:29:37,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338315891] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:29:37,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709976955] [2022-11-03 02:29:37,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:37,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:37,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:29:37,804 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:29:37,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 02:29:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:37,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 02:29:37,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:38,080 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-03 02:29:38,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:29:38,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709976955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:38,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:29:38,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-11-03 02:29:38,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564078776] [2022-11-03 02:29:38,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:38,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:29:38,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:38,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:29:38,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:29:38,085 INFO L87 Difference]: Start difference. First operand 7817 states and 10646 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 02:29:39,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:39,801 INFO L93 Difference]: Finished difference Result 18627 states and 25307 transitions. [2022-11-03 02:29:39,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:29:39,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 113 [2022-11-03 02:29:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:39,846 INFO L225 Difference]: With dead ends: 18627 [2022-11-03 02:29:39,847 INFO L226 Difference]: Without dead ends: 10817 [2022-11-03 02:29:39,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:29:39,864 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 355 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:39,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 256 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:29:39,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10817 states. [2022-11-03 02:29:40,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10817 to 10813. [2022-11-03 02:29:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10813 states, 8705 states have (on average 1.3361286616886847) internal successors, (11631), 8753 states have internal predecessors, (11631), 1214 states have call successors, (1214), 894 states have call predecessors, (1214), 893 states have return successors, (1648), 1166 states have call predecessors, (1648), 1212 states have call successors, (1648) [2022-11-03 02:29:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10813 states to 10813 states and 14493 transitions. [2022-11-03 02:29:41,047 INFO L78 Accepts]: Start accepts. Automaton has 10813 states and 14493 transitions. Word has length 113 [2022-11-03 02:29:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:41,048 INFO L495 AbstractCegarLoop]: Abstraction has 10813 states and 14493 transitions. [2022-11-03 02:29:41,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-03 02:29:41,048 INFO L276 IsEmpty]: Start isEmpty. Operand 10813 states and 14493 transitions. [2022-11-03 02:29:41,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-03 02:29:41,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:41,065 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:41,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:29:41,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 02:29:41,290 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:41,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:41,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1687392045, now seen corresponding path program 1 times [2022-11-03 02:29:41,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:41,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68403536] [2022-11-03 02:29:41,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:41,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-03 02:29:41,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:41,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68403536] [2022-11-03 02:29:41,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68403536] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:29:41,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792566200] [2022-11-03 02:29:41,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:41,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:41,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:29:41,527 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:29:41,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 02:29:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:41,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:29:41,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:41,752 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 02:29:41,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:29:41,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792566200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:41,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:29:41,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-11-03 02:29:41,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771185923] [2022-11-03 02:29:41,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:41,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:29:41,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:41,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:29:41,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:29:41,759 INFO L87 Difference]: Start difference. First operand 10813 states and 14493 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 02:29:43,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:43,478 INFO L93 Difference]: Finished difference Result 16508 states and 21962 transitions. [2022-11-03 02:29:43,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:29:43,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 117 [2022-11-03 02:29:43,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:43,516 INFO L225 Difference]: With dead ends: 16508 [2022-11-03 02:29:43,517 INFO L226 Difference]: Without dead ends: 11286 [2022-11-03 02:29:43,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:29:43,527 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 114 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:43,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 452 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:29:43,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11286 states. [2022-11-03 02:29:44,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11286 to 11055. [2022-11-03 02:29:44,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11055 states, 8900 states have (on average 1.3330337078651686) internal successors, (11864), 8966 states have internal predecessors, (11864), 1221 states have call successors, (1221), 898 states have call predecessors, (1221), 933 states have return successors, (1709), 1191 states have call predecessors, (1709), 1219 states have call successors, (1709) [2022-11-03 02:29:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11055 states to 11055 states and 14794 transitions. [2022-11-03 02:29:44,607 INFO L78 Accepts]: Start accepts. Automaton has 11055 states and 14794 transitions. Word has length 117 [2022-11-03 02:29:44,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:44,607 INFO L495 AbstractCegarLoop]: Abstraction has 11055 states and 14794 transitions. [2022-11-03 02:29:44,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 02:29:44,608 INFO L276 IsEmpty]: Start isEmpty. Operand 11055 states and 14794 transitions. [2022-11-03 02:29:44,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-03 02:29:44,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:44,628 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:44,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:29:44,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:44,850 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:44,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:44,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1393052042, now seen corresponding path program 1 times [2022-11-03 02:29:44,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:44,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933228391] [2022-11-03 02:29:44,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:44,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:44,912 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 28 proven. 11 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-03 02:29:44,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:44,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933228391] [2022-11-03 02:29:44,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933228391] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:29:44,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026267145] [2022-11-03 02:29:44,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:44,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:44,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:29:44,915 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:29:44,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 02:29:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:45,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:29:45,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:45,107 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-03 02:29:45,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:29:45,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026267145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:45,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:29:45,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-11-03 02:29:45,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059767640] [2022-11-03 02:29:45,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:45,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:29:45,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:45,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:29:45,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:29:45,111 INFO L87 Difference]: Start difference. First operand 11055 states and 14794 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 02:29:47,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:47,071 INFO L93 Difference]: Finished difference Result 16223 states and 21774 transitions. [2022-11-03 02:29:47,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:29:47,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 118 [2022-11-03 02:29:47,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:47,124 INFO L225 Difference]: With dead ends: 16223 [2022-11-03 02:29:47,125 INFO L226 Difference]: Without dead ends: 10797 [2022-11-03 02:29:47,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:29:47,147 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 22 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:47,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 227 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:29:47,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10797 states. [2022-11-03 02:29:48,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10797 to 10797. [2022-11-03 02:29:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10797 states, 8678 states have (on average 1.333256510716755) internal successors, (11570), 8735 states have internal predecessors, (11570), 1221 states have call successors, (1221), 898 states have call predecessors, (1221), 897 states have return successors, (1655), 1164 states have call predecessors, (1655), 1219 states have call successors, (1655) [2022-11-03 02:29:48,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10797 states to 10797 states and 14446 transitions. [2022-11-03 02:29:48,367 INFO L78 Accepts]: Start accepts. Automaton has 10797 states and 14446 transitions. Word has length 118 [2022-11-03 02:29:48,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:48,368 INFO L495 AbstractCegarLoop]: Abstraction has 10797 states and 14446 transitions. [2022-11-03 02:29:48,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 02:29:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 10797 states and 14446 transitions. [2022-11-03 02:29:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-03 02:29:48,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:48,388 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:48,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 02:29:48,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:48,614 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:48,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:48,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2024875128, now seen corresponding path program 1 times [2022-11-03 02:29:48,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:48,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760167372] [2022-11-03 02:29:48,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:48,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:48,800 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 31 proven. 11 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-03 02:29:48,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:48,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760167372] [2022-11-03 02:29:48,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760167372] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:29:48,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374071958] [2022-11-03 02:29:48,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:48,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:48,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:29:48,803 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:29:48,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 02:29:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:49,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:29:49,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 02:29:49,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:29:49,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374071958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:49,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:29:49,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-11-03 02:29:49,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092020028] [2022-11-03 02:29:49,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:49,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:29:49,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:49,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:29:49,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:29:49,087 INFO L87 Difference]: Start difference. First operand 10797 states and 14446 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 02:29:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:50,595 INFO L93 Difference]: Finished difference Result 19860 states and 27039 transitions. [2022-11-03 02:29:50,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:29:50,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 118 [2022-11-03 02:29:50,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:50,651 INFO L225 Difference]: With dead ends: 19860 [2022-11-03 02:29:50,651 INFO L226 Difference]: Without dead ends: 12304 [2022-11-03 02:29:50,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:29:50,674 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 86 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:50,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 160 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:29:50,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12304 states. [2022-11-03 02:29:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12304 to 12164. [2022-11-03 02:29:52,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12164 states, 9937 states have (on average 1.3073362181744994) internal successors, (12991), 9994 states have internal predecessors, (12991), 1234 states have call successors, (1234), 993 states have call predecessors, (1234), 992 states have return successors, (1844), 1177 states have call predecessors, (1844), 1232 states have call successors, (1844) [2022-11-03 02:29:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12164 states to 12164 states and 16069 transitions. [2022-11-03 02:29:52,068 INFO L78 Accepts]: Start accepts. Automaton has 12164 states and 16069 transitions. Word has length 118 [2022-11-03 02:29:52,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:52,069 INFO L495 AbstractCegarLoop]: Abstraction has 12164 states and 16069 transitions. [2022-11-03 02:29:52,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 02:29:52,069 INFO L276 IsEmpty]: Start isEmpty. Operand 12164 states and 16069 transitions. [2022-11-03 02:29:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-03 02:29:52,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:52,088 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:52,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 02:29:52,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-03 02:29:52,302 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:52,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:52,303 INFO L85 PathProgramCache]: Analyzing trace with hash 349817944, now seen corresponding path program 1 times [2022-11-03 02:29:52,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:52,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907499982] [2022-11-03 02:29:52,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:52,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 30 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-03 02:29:52,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:52,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907499982] [2022-11-03 02:29:52,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907499982] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:29:52,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116038317] [2022-11-03 02:29:52,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:52,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:52,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:29:52,390 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:29:52,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 02:29:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:52,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:29:52,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:29:52,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:29:52,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116038317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:29:52,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:29:52,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-11-03 02:29:52,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292537782] [2022-11-03 02:29:52,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:52,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:29:52,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:52,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:29:52,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:29:52,604 INFO L87 Difference]: Start difference. First operand 12164 states and 16069 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:29:53,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:53,990 INFO L93 Difference]: Finished difference Result 20624 states and 28041 transitions. [2022-11-03 02:29:53,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:29:53,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 118 [2022-11-03 02:29:53,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:54,043 INFO L225 Difference]: With dead ends: 20624 [2022-11-03 02:29:54,044 INFO L226 Difference]: Without dead ends: 12141 [2022-11-03 02:29:54,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:29:54,070 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 95 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:54,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 288 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:29:54,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12141 states. [2022-11-03 02:29:55,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12141 to 11988. [2022-11-03 02:29:55,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11988 states, 9761 states have (on average 1.2782501792849092) internal successors, (12477), 9818 states have internal predecessors, (12477), 1234 states have call successors, (1234), 993 states have call predecessors, (1234), 992 states have return successors, (1844), 1177 states have call predecessors, (1844), 1232 states have call successors, (1844) [2022-11-03 02:29:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11988 states to 11988 states and 15555 transitions. [2022-11-03 02:29:55,857 INFO L78 Accepts]: Start accepts. Automaton has 11988 states and 15555 transitions. Word has length 118 [2022-11-03 02:29:55,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:29:55,857 INFO L495 AbstractCegarLoop]: Abstraction has 11988 states and 15555 transitions. [2022-11-03 02:29:55,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:29:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 11988 states and 15555 transitions. [2022-11-03 02:29:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-03 02:29:55,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:29:55,877 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:29:55,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 02:29:56,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:56,090 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:29:56,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:29:56,091 INFO L85 PathProgramCache]: Analyzing trace with hash 870951077, now seen corresponding path program 1 times [2022-11-03 02:29:56,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:29:56,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936486965] [2022-11-03 02:29:56,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:56,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:29:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-03 02:29:56,442 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:29:56,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936486965] [2022-11-03 02:29:56,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936486965] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:29:56,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293381152] [2022-11-03 02:29:56,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:29:56,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:29:56,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:29:56,444 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:29:56,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 02:29:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:29:56,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-03 02:29:56,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:29:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 43 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:29:57,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:29:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-03 02:29:57,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293381152] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 02:29:57,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:29:57,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 8] total 17 [2022-11-03 02:29:57,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230794528] [2022-11-03 02:29:57,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:29:57,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:29:57,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:29:57,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:29:57,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:29:57,380 INFO L87 Difference]: Start difference. First operand 11988 states and 15555 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 02:29:59,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:29:59,043 INFO L93 Difference]: Finished difference Result 24250 states and 31599 transitions. [2022-11-03 02:29:59,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:29:59,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 115 [2022-11-03 02:29:59,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:29:59,090 INFO L225 Difference]: With dead ends: 24250 [2022-11-03 02:29:59,090 INFO L226 Difference]: Without dead ends: 13562 [2022-11-03 02:29:59,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-11-03 02:29:59,119 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 111 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:29:59,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 285 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:29:59,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13562 states. [2022-11-03 02:30:00,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13562 to 13193. [2022-11-03 02:30:00,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13193 states, 10891 states have (on average 1.2575521072445137) internal successors, (13696), 10957 states have internal predecessors, (13696), 1240 states have call successors, (1240), 1053 states have call predecessors, (1240), 1061 states have return successors, (1811), 1183 states have call predecessors, (1811), 1238 states have call successors, (1811) [2022-11-03 02:30:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13193 states to 13193 states and 16747 transitions. [2022-11-03 02:30:00,450 INFO L78 Accepts]: Start accepts. Automaton has 13193 states and 16747 transitions. Word has length 115 [2022-11-03 02:30:00,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:30:00,450 INFO L495 AbstractCegarLoop]: Abstraction has 13193 states and 16747 transitions. [2022-11-03 02:30:00,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 02:30:00,451 INFO L276 IsEmpty]: Start isEmpty. Operand 13193 states and 16747 transitions. [2022-11-03 02:30:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-03 02:30:00,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:30:00,464 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:30:00,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 02:30:00,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-03 02:30:00,670 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:30:00,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:30:00,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2084862853, now seen corresponding path program 1 times [2022-11-03 02:30:00,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:30:00,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187562043] [2022-11-03 02:30:00,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:30:00,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:30:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:30:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-03 02:30:00,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:30:00,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187562043] [2022-11-03 02:30:00,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187562043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:30:00,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:30:00,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:30:00,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326687644] [2022-11-03 02:30:00,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:30:00,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:30:00,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:30:00,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:30:00,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:30:00,920 INFO L87 Difference]: Start difference. First operand 13193 states and 16747 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 02:30:03,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:30:03,495 INFO L93 Difference]: Finished difference Result 33531 states and 42547 transitions. [2022-11-03 02:30:03,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:30:03,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 116 [2022-11-03 02:30:03,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:30:03,539 INFO L225 Difference]: With dead ends: 33531 [2022-11-03 02:30:03,539 INFO L226 Difference]: Without dead ends: 17376 [2022-11-03 02:30:03,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:30:03,570 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 97 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:30:03,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 439 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:30:03,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17376 states. [2022-11-03 02:30:05,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17376 to 16878. [2022-11-03 02:30:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16878 states, 13789 states have (on average 1.240046413808108) internal successors, (17099), 13912 states have internal predecessors, (17099), 1674 states have call successors, (1674), 1406 states have call predecessors, (1674), 1414 states have return successors, (2437), 1560 states have call predecessors, (2437), 1672 states have call successors, (2437) [2022-11-03 02:30:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16878 states to 16878 states and 21210 transitions. [2022-11-03 02:30:05,397 INFO L78 Accepts]: Start accepts. Automaton has 16878 states and 21210 transitions. Word has length 116 [2022-11-03 02:30:05,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:30:05,401 INFO L495 AbstractCegarLoop]: Abstraction has 16878 states and 21210 transitions. [2022-11-03 02:30:05,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 02:30:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 16878 states and 21210 transitions. [2022-11-03 02:30:05,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-03 02:30:05,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:30:05,417 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:30:05,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-03 02:30:05,418 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:30:05,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:30:05,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1080464123, now seen corresponding path program 1 times [2022-11-03 02:30:05,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:30:05,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436296159] [2022-11-03 02:30:05,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:30:05,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:30:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:30:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 13 proven. 43 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 02:30:06,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:30:06,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436296159] [2022-11-03 02:30:06,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436296159] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:30:06,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391254317] [2022-11-03 02:30:06,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:30:06,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:30:06,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:30:06,059 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:30:06,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 02:30:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:30:06,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 02:30:06,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:30:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:30:06,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:30:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-03 02:30:06,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391254317] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:30:06,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [490881781] [2022-11-03 02:30:06,926 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2022-11-03 02:30:06,933 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:30:06,937 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:30:06,947 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:30:06,950 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:30:26,694 INFO L197 IcfgInterpreter]: Interpreting procedure error2 with input of size 81 for LOIs [2022-11-03 02:30:26,703 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 216 for LOIs [2022-11-03 02:30:37,771 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 161 for LOIs [2022-11-03 02:30:37,810 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 140 for LOIs [2022-11-03 02:30:37,835 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 88 for LOIs [2022-11-03 02:30:38,247 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 138 for LOIs [2022-11-03 02:30:39,295 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 165 for LOIs [2022-11-03 02:30:39,351 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:31:02,223 WARN L234 SmtUtils]: Spent 9.53s on a formula simplification. DAG size of input: 414 DAG size of output: 249 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:31:20,644 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '517277#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~slow_clk_edge~0 0) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (= 0 ~t3_pc~0) (= ~q_req_up~0 0) (= ~fast_clk_edge~0 0) (= ~q_ev~0 0) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= ~t~0 0) (not (= ~token~0 (+ 3 ~local~0))) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= 0 ~t2_pc~0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (= ~t3_i~0 1) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:31:20,644 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:31:20,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:31:20,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 6] total 21 [2022-11-03 02:31:20,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267955911] [2022-11-03 02:31:20,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:31:20,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 02:31:20,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:20,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 02:31:20,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=4681, Unknown=0, NotChecked=0, Total=5112 [2022-11-03 02:31:20,647 INFO L87 Difference]: Start difference. First operand 16878 states and 21210 transitions. Second operand has 21 states, 17 states have (on average 9.0) internal successors, (153), 19 states have internal predecessors, (153), 9 states have call successors, (34), 5 states have call predecessors, (34), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-11-03 02:31:25,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:25,652 INFO L93 Difference]: Finished difference Result 33036 states and 41599 transitions. [2022-11-03 02:31:25,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-03 02:31:25,653 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 9.0) internal successors, (153), 19 states have internal predecessors, (153), 9 states have call successors, (34), 5 states have call predecessors, (34), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) Word has length 121 [2022-11-03 02:31:25,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:25,687 INFO L225 Difference]: With dead ends: 33036 [2022-11-03 02:31:25,688 INFO L226 Difference]: Without dead ends: 16117 [2022-11-03 02:31:25,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 339 SyntacticMatches, 16 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10487 ImplicationChecksByTransitivity, 42.8s TimeCoverageRelationStatistics Valid=1496, Invalid=21760, Unknown=0, NotChecked=0, Total=23256 [2022-11-03 02:31:25,720 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 1505 mSDsluCounter, 3026 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 2762 SdHoareTripleChecker+Invalid, 2998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:25,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 2762 Invalid, 2998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-03 02:31:25,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16117 states. [2022-11-03 02:31:27,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16117 to 10988. [2022-11-03 02:31:27,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10988 states, 9010 states have (on average 1.2194228634850166) internal successors, (10987), 9049 states have internal predecessors, (10987), 1049 states have call successors, (1049), 940 states have call predecessors, (1049), 928 states have return successors, (1205), 998 states have call predecessors, (1205), 1047 states have call successors, (1205) [2022-11-03 02:31:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10988 states to 10988 states and 13241 transitions. [2022-11-03 02:31:27,164 INFO L78 Accepts]: Start accepts. Automaton has 10988 states and 13241 transitions. Word has length 121 [2022-11-03 02:31:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:27,164 INFO L495 AbstractCegarLoop]: Abstraction has 10988 states and 13241 transitions. [2022-11-03 02:31:27,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 9.0) internal successors, (153), 19 states have internal predecessors, (153), 9 states have call successors, (34), 5 states have call predecessors, (34), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-11-03 02:31:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 10988 states and 13241 transitions. [2022-11-03 02:31:27,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-03 02:31:27,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:27,171 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:27,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 02:31:27,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:27,398 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:31:27,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:27,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2077791116, now seen corresponding path program 1 times [2022-11-03 02:31:27,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:27,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930970058] [2022-11-03 02:31:27,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:27,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 41 proven. 17 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-03 02:31:27,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:27,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930970058] [2022-11-03 02:31:27,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930970058] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:31:27,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857108353] [2022-11-03 02:31:27,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:27,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:27,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:31:27,581 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:31:27,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 02:31:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:27,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 02:31:27,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:31:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:31:27,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:31:27,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857108353] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:31:27,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:31:27,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2022-11-03 02:31:27,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495817245] [2022-11-03 02:31:27,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:31:27,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:31:27,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:27,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:31:27,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:31:27,822 INFO L87 Difference]: Start difference. First operand 10988 states and 13241 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-03 02:31:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:29,392 INFO L93 Difference]: Finished difference Result 21082 states and 25490 transitions. [2022-11-03 02:31:29,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:31:29,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 117 [2022-11-03 02:31:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:29,420 INFO L225 Difference]: With dead ends: 21082 [2022-11-03 02:31:29,420 INFO L226 Difference]: Without dead ends: 13613 [2022-11-03 02:31:29,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:31:29,432 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 217 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:29,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 370 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:31:29,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13613 states. [2022-11-03 02:31:30,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13613 to 12337. [2022-11-03 02:31:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12337 states, 10060 states have (on average 1.207355864811133) internal successors, (12146), 10124 states have internal predecessors, (12146), 1209 states have call successors, (1209), 1064 states have call predecessors, (1209), 1067 states have return successors, (1481), 1148 states have call predecessors, (1481), 1207 states have call successors, (1481) [2022-11-03 02:31:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12337 states to 12337 states and 14836 transitions. [2022-11-03 02:31:30,561 INFO L78 Accepts]: Start accepts. Automaton has 12337 states and 14836 transitions. Word has length 117 [2022-11-03 02:31:30,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:30,561 INFO L495 AbstractCegarLoop]: Abstraction has 12337 states and 14836 transitions. [2022-11-03 02:31:30,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-03 02:31:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 12337 states and 14836 transitions. [2022-11-03 02:31:30,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-03 02:31:30,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:30,632 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:30,670 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-03 02:31:30,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:30,833 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:31:30,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:30,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1079712645, now seen corresponding path program 1 times [2022-11-03 02:31:30,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:30,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967333756] [2022-11-03 02:31:30,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:30,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:31,060 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 17 proven. 26 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-03 02:31:31,060 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:31,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967333756] [2022-11-03 02:31:31,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967333756] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:31:31,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139805158] [2022-11-03 02:31:31,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:31,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:31,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:31:31,062 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:31:31,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-03 02:31:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:31,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 02:31:31,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:31:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:31:31,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:31:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-03 02:31:31,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139805158] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:31:31,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1569392206] [2022-11-03 02:31:31,730 INFO L159 IcfgInterpreter]: Started Sifa with 72 locations of interest [2022-11-03 02:31:31,730 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:31:31,730 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:31:31,731 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:31:31,731 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:31:44,184 INFO L197 IcfgInterpreter]: Interpreting procedure error2 with input of size 82 for LOIs [2022-11-03 02:31:44,189 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 140 for LOIs [2022-11-03 02:31:44,236 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 140 for LOIs [2022-11-03 02:31:44,270 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 225 for LOIs [2022-11-03 02:31:44,354 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 149 for LOIs [2022-11-03 02:31:44,644 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 137 for LOIs [2022-11-03 02:31:45,049 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 257 for LOIs [2022-11-03 02:31:46,824 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:32:21,554 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '623893#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (<= ~t1_pc~0 1) (= ~p_num_write~0 0) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (= ~slow_clk_edge~0 0) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (= 0 ~t3_pc~0) (= ~q_req_up~0 0) (= ~fast_clk_edge~0 0) (= ~q_ev~0 0) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= ~t~0 0) (not (= ~token~0 (+ 3 ~local~0))) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= 0 ~t2_pc~0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (= ~t3_i~0 1) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 ~t1_pc~0) (= |#NULL.base| 0))' at error location [2022-11-03 02:32:21,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:32:21,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:32:21,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 17 [2022-11-03 02:32:21,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413806604] [2022-11-03 02:32:21,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:32:21,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 02:32:21,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:32:21,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 02:32:21,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=4549, Unknown=0, NotChecked=0, Total=4970 [2022-11-03 02:32:21,560 INFO L87 Difference]: Start difference. First operand 12337 states and 14836 transitions. Second operand has 17 states, 14 states have (on average 9.642857142857142) internal successors, (135), 15 states have internal predecessors, (135), 7 states have call successors, (31), 4 states have call predecessors, (31), 7 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) [2022-11-03 02:32:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:32:27,880 INFO L93 Difference]: Finished difference Result 22713 states and 27690 transitions. [2022-11-03 02:32:27,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2022-11-03 02:32:27,881 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.642857142857142) internal successors, (135), 15 states have internal predecessors, (135), 7 states have call successors, (31), 4 states have call predecessors, (31), 7 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) Word has length 124 [2022-11-03 02:32:27,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:32:27,908 INFO L225 Difference]: With dead ends: 22713 [2022-11-03 02:32:27,909 INFO L226 Difference]: Without dead ends: 11626 [2022-11-03 02:32:27,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 372 SyntacticMatches, 17 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19345 ImplicationChecksByTransitivity, 37.5s TimeCoverageRelationStatistics Valid=2695, Invalid=39947, Unknown=0, NotChecked=0, Total=42642 [2022-11-03 02:32:27,929 INFO L413 NwaCegarLoop]: 465 mSDtfsCounter, 2093 mSDsluCounter, 3410 mSDsCounter, 0 mSdLazyCounter, 2414 mSolverCounterSat, 759 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2103 SdHoareTripleChecker+Valid, 3362 SdHoareTripleChecker+Invalid, 3173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 759 IncrementalHoareTripleChecker+Valid, 2414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:32:27,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2103 Valid, 3362 Invalid, 3173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [759 Valid, 2414 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-03 02:32:27,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11626 states. [2022-11-03 02:32:28,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11626 to 8622. [2022-11-03 02:32:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8622 states, 7107 states have (on average 1.2082453918671732) internal successors, (8587), 7141 states have internal predecessors, (8587), 782 states have call successors, (782), 733 states have call predecessors, (782), 732 states have return successors, (968), 747 states have call predecessors, (968), 780 states have call successors, (968) [2022-11-03 02:32:29,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8622 states to 8622 states and 10337 transitions. [2022-11-03 02:32:29,005 INFO L78 Accepts]: Start accepts. Automaton has 8622 states and 10337 transitions. Word has length 124 [2022-11-03 02:32:29,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:32:29,006 INFO L495 AbstractCegarLoop]: Abstraction has 8622 states and 10337 transitions. [2022-11-03 02:32:29,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.642857142857142) internal successors, (135), 15 states have internal predecessors, (135), 7 states have call successors, (31), 4 states have call predecessors, (31), 7 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) [2022-11-03 02:32:29,006 INFO L276 IsEmpty]: Start isEmpty. Operand 8622 states and 10337 transitions. [2022-11-03 02:32:29,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-11-03 02:32:29,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:32:29,010 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:32:29,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-03 02:32:29,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-03 02:32:29,211 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:32:29,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:32:29,211 INFO L85 PathProgramCache]: Analyzing trace with hash -2127622252, now seen corresponding path program 1 times [2022-11-03 02:32:29,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:32:29,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953228954] [2022-11-03 02:32:29,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:29,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:32:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 17 proven. 25 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-03 02:32:29,475 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:32:29,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953228954] [2022-11-03 02:32:29,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953228954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:32:29,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389041624] [2022-11-03 02:32:29,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:32:29,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:32:29,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:32:29,477 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:32:29,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-03 02:32:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:32:29,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-03 02:32:29,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:32:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 60 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:32:29,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:32:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-03 02:32:30,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389041624] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:32:30,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1482335571] [2022-11-03 02:32:30,175 INFO L159 IcfgInterpreter]: Started Sifa with 75 locations of interest [2022-11-03 02:32:30,175 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:32:30,176 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:32:30,176 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:32:30,176 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:32:41,373 INFO L197 IcfgInterpreter]: Interpreting procedure error2 with input of size 83 for LOIs [2022-11-03 02:32:41,381 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 218 for LOIs [2022-11-03 02:33:07,530 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 78 for LOIs [2022-11-03 02:33:07,540 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 226 for LOIs [2022-11-03 02:33:07,624 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 149 for LOIs [2022-11-03 02:33:08,034 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 78 for LOIs [2022-11-03 02:33:08,589 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 258 for LOIs [2022-11-03 02:33:44,799 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:34:56,977 WARN L234 SmtUtils]: Spent 1.15m on a formula simplification. DAG size of input: 870 DAG size of output: 715 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:35:14,466 WARN L234 SmtUtils]: Spent 10.59s on a formula simplification. DAG size of input: 590 DAG size of output: 394 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:35:41,348 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '667587#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (<= ~t1_pc~0 1) (= ~p_num_write~0 0) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (= ~slow_clk_edge~0 0) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 ~t2_pc~0) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (= 0 ~t3_pc~0) (= ~q_req_up~0 0) (= ~fast_clk_edge~0 0) (= ~q_ev~0 0) (= ~m_pc~0 1) (<= ~t2_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= ~t~0 0) (not (= ~token~0 (+ 3 ~local~0))) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (= ~t3_i~0 1) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 ~t1_pc~0) (= |#NULL.base| 0))' at error location [2022-11-03 02:35:41,348 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:35:41,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:35:41,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 18 [2022-11-03 02:35:41,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864612496] [2022-11-03 02:35:41,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:35:41,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 02:35:41,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:35:41,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 02:35:41,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=5088, Unknown=0, NotChecked=0, Total=5550 [2022-11-03 02:35:41,351 INFO L87 Difference]: Start difference. First operand 8622 states and 10337 transitions. Second operand has 18 states, 15 states have (on average 9.266666666666667) internal successors, (139), 16 states have internal predecessors, (139), 7 states have call successors, (31), 4 states have call predecessors, (31), 7 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) [2022-11-03 02:35:47,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:35:47,810 INFO L93 Difference]: Finished difference Result 15552 states and 18760 transitions. [2022-11-03 02:35:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2022-11-03 02:35:47,810 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.266666666666667) internal successors, (139), 16 states have internal predecessors, (139), 7 states have call successors, (31), 4 states have call predecessors, (31), 7 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) Word has length 126 [2022-11-03 02:35:47,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:35:47,822 INFO L225 Difference]: With dead ends: 15552 [2022-11-03 02:35:47,822 INFO L226 Difference]: Without dead ends: 8721 [2022-11-03 02:35:47,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 388 SyntacticMatches, 6 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22743 ImplicationChecksByTransitivity, 119.8s TimeCoverageRelationStatistics Valid=3039, Invalid=48263, Unknown=0, NotChecked=0, Total=51302 [2022-11-03 02:35:47,833 INFO L413 NwaCegarLoop]: 376 mSDtfsCounter, 1627 mSDsluCounter, 3687 mSDsCounter, 0 mSdLazyCounter, 2563 mSolverCounterSat, 554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1638 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 3117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 554 IncrementalHoareTripleChecker+Valid, 2563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:35:47,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1638 Valid, 3574 Invalid, 3117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [554 Valid, 2563 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-03 02:35:47,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8721 states. [2022-11-03 02:35:48,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8721 to 6939. [2022-11-03 02:35:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6939 states, 5724 states have (on average 1.1937456324248776) internal successors, (6833), 5754 states have internal predecessors, (6833), 619 states have call successors, (619), 594 states have call predecessors, (619), 595 states have return successors, (781), 590 states have call predecessors, (781), 617 states have call successors, (781) [2022-11-03 02:35:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6939 states to 6939 states and 8233 transitions. [2022-11-03 02:35:48,522 INFO L78 Accepts]: Start accepts. Automaton has 6939 states and 8233 transitions. Word has length 126 [2022-11-03 02:35:48,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:35:48,523 INFO L495 AbstractCegarLoop]: Abstraction has 6939 states and 8233 transitions. [2022-11-03 02:35:48,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.266666666666667) internal successors, (139), 16 states have internal predecessors, (139), 7 states have call successors, (31), 4 states have call predecessors, (31), 7 states have return successors, (30), 6 states have call predecessors, (30), 7 states have call successors, (30) [2022-11-03 02:35:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand 6939 states and 8233 transitions. [2022-11-03 02:35:48,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-11-03 02:35:48,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:35:48,528 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:35:48,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-03 02:35:48,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-03 02:35:48,742 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:35:48,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:35:48,743 INFO L85 PathProgramCache]: Analyzing trace with hash 2099089131, now seen corresponding path program 1 times [2022-11-03 02:35:48,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:35:48,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192190096] [2022-11-03 02:35:48,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:48,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:35:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 23 proven. 31 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-03 02:35:49,441 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:35:49,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192190096] [2022-11-03 02:35:49,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192190096] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:35:49,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401227708] [2022-11-03 02:35:49,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:35:49,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:35:49,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:35:49,443 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:35:49,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-03 02:35:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:35:49,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 02:35:49,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:35:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 02:35:49,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:35:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-03 02:35:50,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401227708] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:35:50,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [220742830] [2022-11-03 02:35:50,745 INFO L159 IcfgInterpreter]: Started Sifa with 78 locations of interest [2022-11-03 02:35:50,745 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:35:50,746 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:35:50,746 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:35:50,746 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:36:11,490 INFO L197 IcfgInterpreter]: Interpreting procedure error2 with input of size 84 for LOIs [2022-11-03 02:36:11,495 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 219 for LOIs [2022-11-03 02:36:59,031 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 79 for LOIs [2022-11-03 02:36:59,044 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 227 for LOIs [2022-11-03 02:36:59,128 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 149 for LOIs [2022-11-03 02:36:59,518 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 135 for LOIs [2022-11-03 02:37:00,080 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 259 for LOIs [2022-11-03 02:37:08,526 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:37:29,775 WARN L234 SmtUtils]: Spent 17.79s on a formula simplification. DAG size of input: 360 DAG size of output: 308 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:37:57,733 WARN L234 SmtUtils]: Spent 18.14s on a formula simplification. DAG size of input: 827 DAG size of output: 550 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:38:26,840 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '699059#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (<= ~t1_pc~0 1) (= ~p_num_write~0 0) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (= ~slow_clk_edge~0 0) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 ~t2_pc~0) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (= ~q_req_up~0 0) (= ~fast_clk_edge~0 0) (= ~q_ev~0 0) (= ~m_pc~0 1) (<= ~t2_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= ~t~0 0) (not (= ~token~0 (+ 3 ~local~0))) (<= ~t3_pc~0 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (<= 0 ~t3_pc~0) (= ~t3_i~0 1) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 ~t1_pc~0) (= |#NULL.base| 0))' at error location [2022-11-03 02:38:26,840 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:38:26,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:38:26,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 12] total 36 [2022-11-03 02:38:26,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664089572] [2022-11-03 02:38:26,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:38:26,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 02:38:26,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:38:26,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 02:38:26,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=659, Invalid=8461, Unknown=0, NotChecked=0, Total=9120 [2022-11-03 02:38:26,844 INFO L87 Difference]: Start difference. First operand 6939 states and 8233 transitions. Second operand has 36 states, 24 states have (on average 8.416666666666666) internal successors, (202), 27 states have internal predecessors, (202), 14 states have call successors, (41), 11 states have call predecessors, (41), 18 states have return successors, (40), 14 states have call predecessors, (40), 14 states have call successors, (40) [2022-11-03 02:38:35,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:38:35,227 INFO L93 Difference]: Finished difference Result 17024 states and 20541 transitions. [2022-11-03 02:38:35,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-03 02:38:35,227 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 24 states have (on average 8.416666666666666) internal successors, (202), 27 states have internal predecessors, (202), 14 states have call successors, (41), 11 states have call predecessors, (41), 18 states have return successors, (40), 14 states have call predecessors, (40), 14 states have call successors, (40) Word has length 128 [2022-11-03 02:38:35,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:38:35,251 INFO L225 Difference]: With dead ends: 17024 [2022-11-03 02:38:35,251 INFO L226 Difference]: Without dead ends: 10966 [2022-11-03 02:38:35,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 316 SyntacticMatches, 13 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10021 ImplicationChecksByTransitivity, 82.0s TimeCoverageRelationStatistics Valid=2431, Invalid=22691, Unknown=0, NotChecked=0, Total=25122 [2022-11-03 02:38:35,262 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 5287 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 4411 mSolverCounterSat, 2427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5287 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 6838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2427 IncrementalHoareTripleChecker+Valid, 4411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:38:35,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5287 Valid, 1347 Invalid, 6838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2427 Valid, 4411 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-03 02:38:35,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10966 states. [2022-11-03 02:38:36,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10966 to 6285. [2022-11-03 02:38:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6285 states, 5184 states have (on average 1.1919367283950617) internal successors, (6179), 5208 states have internal predecessors, (6179), 570 states have call successors, (570), 543 states have call predecessors, (570), 530 states have return successors, (632), 533 states have call predecessors, (632), 568 states have call successors, (632) [2022-11-03 02:38:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6285 states to 6285 states and 7381 transitions. [2022-11-03 02:38:36,057 INFO L78 Accepts]: Start accepts. Automaton has 6285 states and 7381 transitions. Word has length 128 [2022-11-03 02:38:36,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:38:36,057 INFO L495 AbstractCegarLoop]: Abstraction has 6285 states and 7381 transitions. [2022-11-03 02:38:36,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 24 states have (on average 8.416666666666666) internal successors, (202), 27 states have internal predecessors, (202), 14 states have call successors, (41), 11 states have call predecessors, (41), 18 states have return successors, (40), 14 states have call predecessors, (40), 14 states have call successors, (40) [2022-11-03 02:38:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand 6285 states and 7381 transitions. [2022-11-03 02:38:36,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-11-03 02:38:36,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:38:36,060 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:38:36,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-03 02:38:36,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-03 02:38:36,261 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:38:36,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:38:36,261 INFO L85 PathProgramCache]: Analyzing trace with hash -319885820, now seen corresponding path program 1 times [2022-11-03 02:38:36,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:38:36,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705345148] [2022-11-03 02:38:36,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:38:36,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:38:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:38:36,418 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 31 proven. 19 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-11-03 02:38:36,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:38:36,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705345148] [2022-11-03 02:38:36,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705345148] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:38:36,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060529651] [2022-11-03 02:38:36,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:38:36,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:38:36,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:38:36,421 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:38:36,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-03 02:38:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:38:36,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:38:36,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:38:36,640 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-03 02:38:36,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:38:36,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060529651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:38:36,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:38:36,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-11-03 02:38:36,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751609411] [2022-11-03 02:38:36,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:38:36,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:38:36,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:38:36,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:38:36,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:38:36,643 INFO L87 Difference]: Start difference. First operand 6285 states and 7381 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:38:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:38:37,556 INFO L93 Difference]: Finished difference Result 12338 states and 14720 transitions. [2022-11-03 02:38:37,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:38:37,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 142 [2022-11-03 02:38:37,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:38:37,569 INFO L225 Difference]: With dead ends: 12338 [2022-11-03 02:38:37,569 INFO L226 Difference]: Without dead ends: 6641 [2022-11-03 02:38:37,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:38:37,575 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 86 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:38:37,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 156 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:38:37,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6641 states. [2022-11-03 02:38:38,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6641 to 6417. [2022-11-03 02:38:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6417 states, 5308 states have (on average 1.1723813112283346) internal successors, (6223), 5332 states have internal predecessors, (6223), 570 states have call successors, (570), 551 states have call predecessors, (570), 538 states have return successors, (646), 533 states have call predecessors, (646), 568 states have call successors, (646) [2022-11-03 02:38:38,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6417 states to 6417 states and 7439 transitions. [2022-11-03 02:38:38,390 INFO L78 Accepts]: Start accepts. Automaton has 6417 states and 7439 transitions. Word has length 142 [2022-11-03 02:38:38,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:38:38,390 INFO L495 AbstractCegarLoop]: Abstraction has 6417 states and 7439 transitions. [2022-11-03 02:38:38,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:38:38,391 INFO L276 IsEmpty]: Start isEmpty. Operand 6417 states and 7439 transitions. [2022-11-03 02:38:38,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-03 02:38:38,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:38:38,395 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:38:38,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-03 02:38:38,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:38:38,608 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:38:38,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:38:38,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2008279782, now seen corresponding path program 1 times [2022-11-03 02:38:38,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:38:38,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406268351] [2022-11-03 02:38:38,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:38:38,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:38:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:38:38,819 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 43 proven. 36 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-03 02:38:38,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:38:38,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406268351] [2022-11-03 02:38:38,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406268351] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:38:38,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668705913] [2022-11-03 02:38:38,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:38:38,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:38:38,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:38:38,823 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:38:38,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-03 02:38:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:38:39,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 02:38:39,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:38:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-03 02:38:39,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:38:39,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668705913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:38:39,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:38:39,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2022-11-03 02:38:39,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926114933] [2022-11-03 02:38:39,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:38:39,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:38:39,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:38:39,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:38:39,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:38:39,088 INFO L87 Difference]: Start difference. First operand 6417 states and 7439 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-11-03 02:38:40,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:38:40,390 INFO L93 Difference]: Finished difference Result 13343 states and 15573 transitions. [2022-11-03 02:38:40,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:38:40,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 145 [2022-11-03 02:38:40,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:38:40,406 INFO L225 Difference]: With dead ends: 13343 [2022-11-03 02:38:40,406 INFO L226 Difference]: Without dead ends: 7563 [2022-11-03 02:38:40,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:38:40,415 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 234 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:38:40,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 349 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:38:40,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7563 states. [2022-11-03 02:38:41,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7563 to 6997. [2022-11-03 02:38:41,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6997 states, 5730 states have (on average 1.1582897033158814) internal successors, (6637), 5758 states have internal predecessors, (6637), 653 states have call successors, (653), 616 states have call predecessors, (653), 613 states have return successors, (807), 622 states have call predecessors, (807), 651 states have call successors, (807) [2022-11-03 02:38:41,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6997 states to 6997 states and 8097 transitions. [2022-11-03 02:38:41,377 INFO L78 Accepts]: Start accepts. Automaton has 6997 states and 8097 transitions. Word has length 145 [2022-11-03 02:38:41,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:38:41,377 INFO L495 AbstractCegarLoop]: Abstraction has 6997 states and 8097 transitions. [2022-11-03 02:38:41,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-11-03 02:38:41,377 INFO L276 IsEmpty]: Start isEmpty. Operand 6997 states and 8097 transitions. [2022-11-03 02:38:41,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-11-03 02:38:41,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:38:41,381 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:38:41,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-03 02:38:41,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:38:41,582 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:38:41,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:38:41,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1626811436, now seen corresponding path program 1 times [2022-11-03 02:38:41,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:38:41,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485651716] [2022-11-03 02:38:41,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:38:41,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:38:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:38:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-11-03 02:38:41,885 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:38:41,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485651716] [2022-11-03 02:38:41,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485651716] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:38:41,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:38:41,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:38:41,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905481259] [2022-11-03 02:38:41,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:38:41,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:38:41,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:38:41,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:38:41,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:38:41,887 INFO L87 Difference]: Start difference. First operand 6997 states and 8097 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-03 02:38:45,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:38:45,279 INFO L93 Difference]: Finished difference Result 23092 states and 26812 transitions. [2022-11-03 02:38:45,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:38:45,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 174 [2022-11-03 02:38:45,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:38:45,325 INFO L225 Difference]: With dead ends: 23092 [2022-11-03 02:38:45,325 INFO L226 Difference]: Without dead ends: 18454 [2022-11-03 02:38:45,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:38:45,339 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 377 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:38:45,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1148 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:38:45,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18454 states. [2022-11-03 02:38:47,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18454 to 12057. [2022-11-03 02:38:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12057 states, 9816 states have (on average 1.1582110839445803) internal successors, (11369), 9856 states have internal predecessors, (11369), 1159 states have call successors, (1159), 1068 states have call predecessors, (1159), 1081 states have return successors, (1435), 1132 states have call predecessors, (1435), 1157 states have call successors, (1435) [2022-11-03 02:38:47,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12057 states to 12057 states and 13963 transitions. [2022-11-03 02:38:47,345 INFO L78 Accepts]: Start accepts. Automaton has 12057 states and 13963 transitions. Word has length 174 [2022-11-03 02:38:47,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:38:47,345 INFO L495 AbstractCegarLoop]: Abstraction has 12057 states and 13963 transitions. [2022-11-03 02:38:47,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-03 02:38:47,345 INFO L276 IsEmpty]: Start isEmpty. Operand 12057 states and 13963 transitions. [2022-11-03 02:38:47,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-11-03 02:38:47,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:38:47,350 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:38:47,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-03 02:38:47,351 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:38:47,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:38:47,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2086782288, now seen corresponding path program 1 times [2022-11-03 02:38:47,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:38:47,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765213746] [2022-11-03 02:38:47,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:38:47,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:38:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:38:47,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:38:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:38:47,517 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:38:47,517 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:38:47,518 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-03 02:38:47,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-03 02:38:47,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-03 02:38:47,524 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:38:47,530 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:38:47,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:38:47 BoogieIcfgContainer [2022-11-03 02:38:47,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:38:47,752 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:38:47,752 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:38:47,752 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:38:47,753 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:29:10" (3/4) ... [2022-11-03 02:38:47,755 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 02:38:47,975 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 02:38:47,975 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:38:47,982 INFO L158 Benchmark]: Toolchain (without parser) took 579146.39ms. Allocated memory was 109.1MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 71.0MB in the beginning and 2.6GB in the end (delta: -2.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-11-03 02:38:47,984 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 109.1MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:38:47,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 597.67ms. Allocated memory is still 109.1MB. Free memory was 70.8MB in the beginning and 78.5MB in the end (delta: -7.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 02:38:47,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.04ms. Allocated memory is still 109.1MB. Free memory was 78.5MB in the beginning and 75.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:38:47,985 INFO L158 Benchmark]: Boogie Preprocessor took 51.47ms. Allocated memory is still 109.1MB. Free memory was 75.0MB in the beginning and 72.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:38:47,987 INFO L158 Benchmark]: RCFGBuilder took 1335.80ms. Allocated memory is still 109.1MB. Free memory was 72.1MB in the beginning and 75.3MB in the end (delta: -3.2MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2022-11-03 02:38:47,989 INFO L158 Benchmark]: TraceAbstraction took 576821.31ms. Allocated memory was 109.1MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 74.7MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-11-03 02:38:47,990 INFO L158 Benchmark]: Witness Printer took 223.30ms. Allocated memory is still 3.8GB. Free memory was 2.7GB in the beginning and 2.6GB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-03 02:38:47,991 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 109.1MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 597.67ms. Allocated memory is still 109.1MB. Free memory was 70.8MB in the beginning and 78.5MB in the end (delta: -7.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.04ms. Allocated memory is still 109.1MB. Free memory was 78.5MB in the beginning and 75.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.47ms. Allocated memory is still 109.1MB. Free memory was 75.0MB in the beginning and 72.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1335.80ms. Allocated memory is still 109.1MB. Free memory was 72.1MB in the beginning and 75.3MB in the end (delta: -3.2MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. * TraceAbstraction took 576821.31ms. Allocated memory was 109.1MB in the beginning and 3.8GB in the end (delta: 3.7GB). Free memory was 74.7MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 223.30ms. Allocated memory is still 3.8GB. Free memory was 2.7GB in the beginning and 2.6GB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. 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: 599]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int fast_clk_edge ; [L33] int slow_clk_edge ; [L34] int q_buf_0 ; [L35] int q_free ; [L36] int q_read_ev ; [L37] int q_write_ev ; [L38] int q_req_up ; [L39] int q_ev ; [L60] int p_num_write ; [L61] int p_last_write ; [L62] int p_dw_st ; [L63] int p_dw_pc ; [L64] int p_dw_i ; [L65] int c_num_read ; [L66] int c_last_read ; [L67] int c_dr_st ; [L68] int c_dr_pc ; [L69] int c_dr_i ; [L202] static int a_t ; [L352] static int t = 0; [L603] int m_pc = 0; [L604] int t1_pc = 0; [L605] int t2_pc = 0; [L606] int t3_pc = 0; [L607] int m_st ; [L608] int t1_st ; [L609] int t2_st ; [L610] int t3_st ; [L611] int m_i ; [L612] int t1_i ; [L613] int t2_i ; [L614] int t3_i ; [L615] int M_E = 2; [L616] int T1_E = 2; [L617] int T2_E = 2; [L618] int T3_E = 2; [L619] int E_M = 2; [L620] int E_1 = 2; [L621] int E_2 = 2; [L622] int E_3 = 2; [L628] int token ; [L630] int local ; [L1327] COND FALSE !(__VERIFIER_nondet_int()) [L1330] CALL main2() [L1314] int __retres1 ; [L1318] CALL init_model2() [L1227] m_i = 1 [L1228] t1_i = 1 [L1229] t2_i = 1 [L1230] t3_i = 1 [L1318] RET init_model2() [L1319] CALL start_simulation2() [L1255] int kernel_st ; [L1256] int tmp ; [L1257] int tmp___0 ; [L1261] kernel_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1262] FCALL update_channels2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1263] CALL init_threads2() [L883] COND TRUE m_i == 1 [L884] m_st = 0 [L888] COND TRUE t1_i == 1 [L889] t1_st = 0 [L893] COND TRUE t2_i == 1 [L894] t2_st = 0 [L898] COND TRUE t3_i == 1 [L899] t3_st = 0 [L1263] RET init_threads2() [L1264] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1020] COND FALSE !(M_E == 0) [L1025] COND FALSE !(T1_E == 0) [L1030] COND FALSE !(T2_E == 0) [L1035] COND FALSE !(T3_E == 0) [L1040] COND FALSE !(E_M == 0) [L1045] COND FALSE !(E_1 == 0) [L1050] COND FALSE !(E_2 == 0) [L1055] COND FALSE !(E_3 == 0) [L1264] RET fire_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1265] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1113] int tmp ; [L1114] int tmp___0 ; [L1115] int tmp___1 ; [L1116] int tmp___2 ; [L1120] CALL, EXPR is_master_triggered() [L796] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L799] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L809] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L811] return (__retres1); [L1120] RET, EXPR is_master_triggered() [L1120] tmp = is_master_triggered() [L1122] COND FALSE !(\read(tmp)) [L1128] CALL, EXPR is_transmit1_triggered() [L815] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L818] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L828] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L830] return (__retres1); [L1128] RET, EXPR is_transmit1_triggered() [L1128] tmp___0 = is_transmit1_triggered() [L1130] COND FALSE !(\read(tmp___0)) [L1136] CALL, EXPR is_transmit2_triggered() [L834] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L837] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L847] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L849] return (__retres1); [L1136] RET, EXPR is_transmit2_triggered() [L1136] tmp___1 = is_transmit2_triggered() [L1138] COND FALSE !(\read(tmp___1)) [L1144] CALL, EXPR is_transmit3_triggered() [L853] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L856] COND FALSE !(t3_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L866] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \old(t3_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L868] return (__retres1); [L1144] RET, EXPR is_transmit3_triggered() [L1144] tmp___2 = is_transmit3_triggered() [L1146] COND FALSE !(\read(tmp___2)) [L1265] RET activate_threads2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1266] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_3)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, \old(T3_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1068] COND FALSE !(M_E == 1) [L1073] COND FALSE !(T1_E == 1) [L1078] COND FALSE !(T2_E == 1) [L1083] COND FALSE !(T3_E == 1) [L1088] COND FALSE !(E_M == 1) [L1093] COND FALSE !(E_1 == 1) [L1098] COND FALSE !(E_2 == 1) [L1103] COND FALSE !(E_3 == 1) [L1266] RET reset_delta_events2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L1269] COND TRUE 1 [L1272] kernel_st = 1 [L1273] CALL eval2() [L939] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L943] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L946] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L908] int __retres1 ; [L911] COND TRUE m_st == 0 [L912] __retres1 = 1 [L934] return (__retres1); [L946] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L946] tmp = exists_runnable_thread2() [L948] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, token=0] [L953] COND TRUE m_st == 0 [L954] int tmp_ndt_1; [L955] tmp_ndt_1 = __VERIFIER_nondet_int() [L956] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, tmp=1, tmp_ndt_1=0, token=0] [L967] COND TRUE t1_st == 0 [L968] int tmp_ndt_2; [L969] tmp_ndt_2 = __VERIFIER_nondet_int() [L970] COND TRUE \read(tmp_ndt_2) [L972] t1_st = 1 [L973] CALL transmit1() [L691] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L702] COND TRUE 1 [L704] t1_pc = 1 [L705] t1_st = 2 [L973] RET transmit1() [L981] COND TRUE t2_st == 0 [L982] int tmp_ndt_3; [L983] tmp_ndt_3 = __VERIFIER_nondet_int() [L984] COND TRUE \read(tmp_ndt_3) [L986] t2_st = 1 [L987] CALL transmit2() [L727] COND TRUE t2_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L738] COND TRUE 1 [L740] t2_pc = 1 [L741] t2_st = 2 [L987] RET transmit2() [L995] COND TRUE t3_st == 0 [L996] int tmp_ndt_4; [L997] tmp_ndt_4 = __VERIFIER_nondet_int() [L998] COND TRUE \read(tmp_ndt_4) [L1000] t3_st = 1 [L1001] CALL transmit3() [L763] COND TRUE t3_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L774] COND TRUE 1 [L776] t3_pc = 1 [L777] t3_st = 2 [L1001] RET transmit3() [L943] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=-2, tmp_ndt_4=1, token=0] [L946] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L908] int __retres1 ; [L911] COND TRUE m_st == 0 [L912] __retres1 = 1 [L934] return (__retres1); [L946] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=-2, tmp_ndt_4=1, token=0] [L946] tmp = exists_runnable_thread2() [L948] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=-2, tmp_ndt_4=1, token=0] [L953] COND TRUE m_st == 0 [L954] int tmp_ndt_1; [L955] tmp_ndt_1 = __VERIFIER_nondet_int() [L956] COND TRUE \read(tmp_ndt_1) [L958] m_st = 1 [L959] CALL master() [L633] int tmp_var = __VERIFIER_nondet_int(); [L635] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L646] COND TRUE 1 [L649] token = __VERIFIER_nondet_int() [L650] local = token [L651] E_1 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L652] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1160] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L1113] int tmp ; [L1114] int tmp___0 ; [L1115] int tmp___1 ; [L1116] int tmp___2 ; [L1120] CALL, EXPR is_master_triggered() [L796] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L799] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L809] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L811] return (__retres1); [L1120] RET, EXPR is_master_triggered() [L1120] tmp = is_master_triggered() [L1122] COND FALSE !(\read(tmp)) [L1128] CALL, EXPR is_transmit1_triggered() [L815] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L818] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L819] COND TRUE E_1 == 1 [L820] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L830] return (__retres1); [L1128] RET, EXPR is_transmit1_triggered() [L1128] tmp___0 = is_transmit1_triggered() [L1130] COND TRUE \read(tmp___0) [L1131] t1_st = 0 [L1136] CALL, EXPR is_transmit2_triggered() [L834] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L837] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L838] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L847] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L849] return (__retres1); [L1136] RET, EXPR is_transmit2_triggered() [L1136] tmp___1 = is_transmit2_triggered() [L1138] COND FALSE !(\read(tmp___1)) [L1144] CALL, EXPR is_transmit3_triggered() [L853] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L856] COND TRUE t3_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L857] COND FALSE !(E_3 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L866] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L868] return (__retres1); [L1144] RET, EXPR is_transmit3_triggered() [L1144] tmp___2 = is_transmit3_triggered() [L1146] COND FALSE !(\read(tmp___2)) [L1160] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L652] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L653] E_1 = 2 [L654] m_pc = 1 [L655] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=0, token=0] [L959] RET master() [L967] COND TRUE t1_st == 0 [L968] int tmp_ndt_2; [L969] tmp_ndt_2 = __VERIFIER_nondet_int() [L970] COND TRUE \read(tmp_ndt_2) [L972] t1_st = 1 [L973] CALL transmit1() [L691] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L694] COND TRUE t1_pc == 1 [L710] token += 1 [L711] E_2 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L712] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L1160] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L1113] int tmp ; [L1114] int tmp___0 ; [L1115] int tmp___1 ; [L1116] int tmp___2 ; [L1120] CALL, EXPR is_master_triggered() [L796] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L799] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L800] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L809] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L811] return (__retres1); [L1120] RET, EXPR is_master_triggered() [L1120] tmp = is_master_triggered() [L1122] COND FALSE !(\read(tmp)) [L1128] CALL, EXPR is_transmit1_triggered() [L815] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L818] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L819] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L828] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L830] return (__retres1); [L1128] RET, EXPR is_transmit1_triggered() [L1128] tmp___0 = is_transmit1_triggered() [L1130] COND FALSE !(\read(tmp___0)) [L1136] CALL, EXPR is_transmit2_triggered() [L834] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L837] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L838] COND TRUE E_2 == 1 [L839] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L849] return (__retres1); [L1136] RET, EXPR is_transmit2_triggered() [L1136] tmp___1 = is_transmit2_triggered() [L1138] COND TRUE \read(tmp___1) [L1139] t2_st = 0 [L1144] CALL, EXPR is_transmit3_triggered() [L853] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L856] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L857] COND FALSE !(E_3 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L866] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L868] return (__retres1); [L1144] RET, EXPR is_transmit3_triggered() [L1144] tmp___2 = is_transmit3_triggered() [L1146] COND FALSE !(\read(tmp___2)) [L1160] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L712] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L713] E_2 = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L702] COND TRUE 1 [L704] t1_pc = 1 [L705] t1_st = 2 [L973] RET transmit1() [L981] COND TRUE t2_st == 0 [L982] int tmp_ndt_3; [L983] tmp_ndt_3 = __VERIFIER_nondet_int() [L984] COND TRUE \read(tmp_ndt_3) [L986] t2_st = 1 [L987] CALL transmit2() [L727] COND FALSE !(t2_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L730] COND TRUE t2_pc == 1 [L746] token += 1 [L747] E_3 = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L748] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L1160] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L1113] int tmp ; [L1114] int tmp___0 ; [L1115] int tmp___1 ; [L1116] int tmp___2 ; [L1120] CALL, EXPR is_master_triggered() [L796] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L799] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L800] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L809] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L811] return (__retres1); [L1120] RET, EXPR is_master_triggered() [L1120] tmp = is_master_triggered() [L1122] COND FALSE !(\read(tmp)) [L1128] CALL, EXPR is_transmit1_triggered() [L815] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L818] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L819] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L828] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L830] return (__retres1); [L1128] RET, EXPR is_transmit1_triggered() [L1128] tmp___0 = is_transmit1_triggered() [L1130] COND FALSE !(\read(tmp___0)) [L1136] CALL, EXPR is_transmit2_triggered() [L834] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L837] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L838] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L847] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L849] return (__retres1); [L1136] RET, EXPR is_transmit2_triggered() [L1136] tmp___1 = is_transmit2_triggered() [L1138] COND FALSE !(\read(tmp___1)) [L1144] CALL, EXPR is_transmit3_triggered() [L853] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L856] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L857] COND TRUE E_3 == 1 [L858] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L868] return (__retres1); [L1144] RET, EXPR is_transmit3_triggered() [L1144] tmp___2 = is_transmit3_triggered() [L1146] COND TRUE \read(tmp___2) [L1147] t3_st = 0 [L1160] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \old(t3_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L748] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L749] E_3 = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L738] COND TRUE 1 [L740] t2_pc = 1 [L741] t2_st = 2 [L987] RET transmit2() [L995] COND TRUE t3_st == 0 [L996] int tmp_ndt_4; [L997] tmp_ndt_4 = __VERIFIER_nondet_int() [L998] COND TRUE \read(tmp_ndt_4) [L1000] t3_st = 1 [L1001] CALL transmit3() [L763] COND FALSE !(t3_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L766] COND TRUE t3_pc == 1 [L782] token += 1 [L783] E_M = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L784] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L1160] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L1113] int tmp ; [L1114] int tmp___0 ; [L1115] int tmp___1 ; [L1116] int tmp___2 ; [L1120] CALL, EXPR is_master_triggered() [L796] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L799] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L800] COND TRUE E_M == 1 [L801] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L811] return (__retres1); [L1120] RET, EXPR is_master_triggered() [L1120] tmp = is_master_triggered() [L1122] COND TRUE \read(tmp) [L1123] m_st = 0 [L1128] CALL, EXPR is_transmit1_triggered() [L815] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L818] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L819] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L828] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L830] return (__retres1); [L1128] RET, EXPR is_transmit1_triggered() [L1128] tmp___0 = is_transmit1_triggered() [L1130] COND FALSE !(\read(tmp___0)) [L1136] CALL, EXPR is_transmit2_triggered() [L834] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L837] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L838] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L847] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L849] return (__retres1); [L1136] RET, EXPR is_transmit2_triggered() [L1136] tmp___1 = is_transmit2_triggered() [L1138] COND FALSE !(\read(tmp___1)) [L1144] CALL, EXPR is_transmit3_triggered() [L853] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L856] COND TRUE t3_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L857] COND FALSE !(E_3 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L866] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L868] return (__retres1); [L1144] RET, EXPR is_transmit3_triggered() [L1144] tmp___2 = is_transmit3_triggered() [L1146] COND FALSE !(\read(tmp___2)) [L1160] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=2, \old(t3_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L784] RET immediate_notify() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L785] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L774] COND TRUE 1 [L776] t3_pc = 1 [L777] t3_st = 2 [L1001] RET transmit3() [L943] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-3, tmp_ndt_3=4, tmp_ndt_4=1, token=3] [L946] CALL, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L908] int __retres1 ; [L911] COND TRUE m_st == 0 [L912] __retres1 = 1 [L934] return (__retres1); [L946] RET, EXPR exists_runnable_thread2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, exists_runnable_thread2()=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-3, tmp_ndt_3=4, tmp_ndt_4=1, token=3] [L946] tmp = exists_runnable_thread2() [L948] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=-3, tmp_ndt_3=4, tmp_ndt_4=1, token=3] [L953] COND TRUE m_st == 0 [L954] int tmp_ndt_1; [L955] tmp_ndt_1 = __VERIFIER_nondet_int() [L956] COND TRUE \read(tmp_ndt_1) [L958] m_st = 1 [L959] CALL master() [L633] int tmp_var = __VERIFIER_nondet_int(); [L635] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L638] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L660] COND FALSE !(token != local + 3) [L665] COND TRUE tmp_var <= 5 [L666] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L671] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L672] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L673] COND TRUE tmp_var == 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, tmp_var=5, token=3] [L674] CALL error2() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L599] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 174 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 576.5s, OverallIterations: 33, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.4s, AutomataDifference: 58.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16382 SdHoareTripleChecker+Valid, 14.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16259 mSDsluCounter, 21393 SdHoareTripleChecker+Invalid, 11.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17966 mSDsCounter, 5553 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16546 IncrementalHoareTripleChecker+Invalid, 22099 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5553 mSolverCounterUnsat, 6408 mSDtfsCounter, 16546 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4609 GetRequests, 3672 SyntacticMatches, 52 SemanticMatches, 885 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62691 ImplicationChecksByTransitivity, 282.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16878occurred in iteration=24, InterpolantAutomatonStates: 605, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 25.4s AutomataMinimizationTime, 32 MinimizatonAttempts, 27887 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 6074 NumberOfCodeBlocks, 6031 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 6452 ConstructedInterpolants, 0 QuantifiedInterpolants, 12134 SizeOfPredicates, 41 NumberOfNonLiveVariables, 13265 ConjunctsInSsa, 211 ConjunctsInUnsatCore, 59 InterpolantComputations, 28 PerfectInterpolantSequences, 3643/4154 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-03 02:38:48,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8f6d5c9-49b2-48df-8da9-90d97be9ad81/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE