./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta --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 41c8a8bc6e14c971558b90999312edb800c79ff966f34c4894803ada36cfe43c --- 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-dbf71c6-m [2022-10-17 17:37:46,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 17:37:46,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 17:37:46,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 17:37:46,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 17:37:46,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 17:37:46,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 17:37:46,572 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 17:37:46,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 17:37:46,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 17:37:46,587 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 17:37:46,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 17:37:46,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 17:37:46,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 17:37:46,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 17:37:46,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 17:37:46,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 17:37:46,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 17:37:46,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 17:37:46,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 17:37:46,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 17:37:46,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 17:37:46,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 17:37:46,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 17:37:46,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 17:37:46,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 17:37:46,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 17:37:46,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 17:37:46,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 17:37:46,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 17:37:46,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 17:37:46,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 17:37:46,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 17:37:46,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 17:37:46,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 17:37:46,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 17:37:46,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 17:37:46,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 17:37:46,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 17:37:46,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 17:37:46,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 17:37:46,651 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-10-17 17:37:46,711 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 17:37:46,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 17:37:46,712 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 17:37:46,712 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 17:37:46,713 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 17:37:46,713 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 17:37:46,714 INFO L138 SettingsManager]: * User list type=DISABLED [2022-10-17 17:37:46,714 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-10-17 17:37:46,714 INFO L138 SettingsManager]: * Explicit value domain=true [2022-10-17 17:37:46,714 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-10-17 17:37:46,715 INFO L138 SettingsManager]: * Octagon Domain=false [2022-10-17 17:37:46,716 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-10-17 17:37:46,716 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-10-17 17:37:46,716 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-10-17 17:37:46,716 INFO L138 SettingsManager]: * Interval Domain=false [2022-10-17 17:37:46,717 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-10-17 17:37:46,717 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-10-17 17:37:46,717 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-10-17 17:37:46,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 17:37:46,718 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 17:37:46,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 17:37:46,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 17:37:46,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 17:37:46,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 17:37:46,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 17:37:46,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 17:37:46,728 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 17:37:46,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 17:37:46,728 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 17:37:46,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 17:37:46,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 17:37:46,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 17:37:46,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 17:37:46,729 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 17:37:46,730 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-10-17 17:37:46,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 17:37:46,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 17:37:46,730 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-10-17 17:37:46,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 17:37:46,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 17:37:46,731 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-10-17 17:37:46,732 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_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/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_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta 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 -> 41c8a8bc6e14c971558b90999312edb800c79ff966f34c4894803ada36cfe43c [2022-10-17 17:37:47,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 17:37:47,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 17:37:47,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 17:37:47,073 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 17:37:47,074 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 17:37:47,076 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c [2022-10-17 17:37:47,145 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/data/b6db25916/d7b064e6641941b18a900ed2d65a1a1a/FLAGf16b0e19d [2022-10-17 17:37:47,680 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 17:37:47,689 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c [2022-10-17 17:37:47,734 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/data/b6db25916/d7b064e6641941b18a900ed2d65a1a1a/FLAGf16b0e19d [2022-10-17 17:37:47,973 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/data/b6db25916/d7b064e6641941b18a900ed2d65a1a1a [2022-10-17 17:37:47,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 17:37:47,977 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 17:37:47,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 17:37:47,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 17:37:47,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 17:37:47,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 05:37:47" (1/1) ... [2022-10-17 17:37:47,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f3e4e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:37:47, skipping insertion in model container [2022-10-17 17:37:47,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 05:37:47" (1/1) ... [2022-10-17 17:37:48,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 17:37:48,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 17:37:48,259 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_a85db64f-b494-49c4-b113-3e268f5d5e03/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[911,924] [2022-10-17 17:37:48,330 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_a85db64f-b494-49c4-b113-3e268f5d5e03/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[8416,8429] [2022-10-17 17:37:48,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 17:37:48,390 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 17:37:48,418 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_a85db64f-b494-49c4-b113-3e268f5d5e03/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[911,924] [2022-10-17 17:37:48,483 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_a85db64f-b494-49c4-b113-3e268f5d5e03/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[8416,8429] [2022-10-17 17:37:48,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 17:37:48,527 INFO L208 MainTranslator]: Completed translation [2022-10-17 17:37:48,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:37:48 WrapperNode [2022-10-17 17:37:48,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 17:37:48,530 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 17:37:48,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 17:37:48,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 17:37:48,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:37:48" (1/1) ... [2022-10-17 17:37:48,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:37:48" (1/1) ... [2022-10-17 17:37:48,593 INFO L138 Inliner]: procedures = 57, calls = 65, calls flagged for inlining = 25, calls inlined = 25, statements flattened = 445 [2022-10-17 17:37:48,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 17:37:48,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 17:37:48,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 17:37:48,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 17:37:48,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:37:48" (1/1) ... [2022-10-17 17:37:48,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:37:48" (1/1) ... [2022-10-17 17:37:48,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:37:48" (1/1) ... [2022-10-17 17:37:48,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:37:48" (1/1) ... [2022-10-17 17:37:48,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:37:48" (1/1) ... [2022-10-17 17:37:48,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:37:48" (1/1) ... [2022-10-17 17:37:48,631 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:37:48" (1/1) ... [2022-10-17 17:37:48,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:37:48" (1/1) ... [2022-10-17 17:37:48,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 17:37:48,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 17:37:48,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 17:37:48,640 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 17:37:48,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:37:48" (1/1) ... [2022-10-17 17:37:48,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 17:37:48,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 [2022-10-17 17:37:48,676 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 17:37:48,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 17:37:48,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 17:37:48,727 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-10-17 17:37:48,727 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-10-17 17:37:48,728 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-10-17 17:37:48,728 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-10-17 17:37:48,728 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-10-17 17:37:48,728 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-10-17 17:37:48,728 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-10-17 17:37:48,728 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-10-17 17:37:48,728 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-10-17 17:37:48,729 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-10-17 17:37:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-10-17 17:37:48,729 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-10-17 17:37:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-10-17 17:37:48,729 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-10-17 17:37:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-10-17 17:37:48,730 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-10-17 17:37:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-10-17 17:37:48,730 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-10-17 17:37:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-10-17 17:37:48,730 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-10-17 17:37:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-10-17 17:37:48,730 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-10-17 17:37:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 17:37:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-10-17 17:37:48,731 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-10-17 17:37:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-10-17 17:37:48,731 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-10-17 17:37:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 17:37:48,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 17:37:48,732 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-10-17 17:37:48,732 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-10-17 17:37:48,732 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-10-17 17:37:48,732 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-10-17 17:37:48,856 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 17:37:48,859 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 17:37:49,559 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-10-17 17:37:49,559 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-10-17 17:37:49,694 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 17:37:49,969 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 17:37:49,970 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-10-17 17:37:49,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 05:37:49 BoogieIcfgContainer [2022-10-17 17:37:49,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 17:37:49,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 17:37:49,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 17:37:49,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 17:37:49,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 05:37:47" (1/3) ... [2022-10-17 17:37:49,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b87e092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 05:37:49, skipping insertion in model container [2022-10-17 17:37:49,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:37:48" (2/3) ... [2022-10-17 17:37:49,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b87e092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 05:37:49, skipping insertion in model container [2022-10-17 17:37:49,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 05:37:49" (3/3) ... [2022-10-17 17:37:49,987 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-2.c [2022-10-17 17:37:50,005 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 17:37:50,005 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-17 17:37:50,069 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 17:37:50,077 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;@160cbbc3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 17:37:50,087 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-10-17 17:37:50,094 INFO L276 IsEmpty]: Start isEmpty. Operand has 152 states, 101 states have (on average 1.495049504950495) internal successors, (151), 109 states have internal predecessors, (151), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2022-10-17 17:37:50,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-17 17:37:50,108 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:37:50,109 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] [2022-10-17 17:37:50,110 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 17:37:50,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:37:50,121 INFO L85 PathProgramCache]: Analyzing trace with hash -2014309726, now seen corresponding path program 1 times [2022-10-17 17:37:50,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:37:50,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762223673] [2022-10-17 17:37:50,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:37:50,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:37:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:37:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:37:50,710 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:37:50,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762223673] [2022-10-17 17:37:50,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762223673] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:37:50,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:37:50,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 17:37:50,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116676245] [2022-10-17 17:37:50,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:37:50,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 17:37:50,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:37:50,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 17:37:50,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:37:50,770 INFO L87 Difference]: Start difference. First operand has 152 states, 101 states have (on average 1.495049504950495) internal successors, (151), 109 states have internal predecessors, (151), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-10-17 17:37:51,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:37:51,713 INFO L93 Difference]: Finished difference Result 521 states and 762 transitions. [2022-10-17 17:37:51,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-17 17:37:51,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 35 [2022-10-17 17:37:51,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:37:51,750 INFO L225 Difference]: With dead ends: 521 [2022-10-17 17:37:51,752 INFO L226 Difference]: Without dead ends: 364 [2022-10-17 17:37:51,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-10-17 17:37:51,770 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 461 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-17 17:37:51,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 532 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-17 17:37:51,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-10-17 17:37:51,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 351. [2022-10-17 17:37:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 238 states have (on average 1.3571428571428572) internal successors, (323), 246 states have internal predecessors, (323), 74 states have call successors, (74), 39 states have call predecessors, (74), 37 states have return successors, (88), 67 states have call predecessors, (88), 70 states have call successors, (88) [2022-10-17 17:37:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 485 transitions. [2022-10-17 17:37:51,890 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 485 transitions. Word has length 35 [2022-10-17 17:37:51,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:37:51,891 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 485 transitions. [2022-10-17 17:37:51,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-10-17 17:37:51,891 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 485 transitions. [2022-10-17 17:37:51,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-17 17:37:51,895 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:37:51,896 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-10-17 17:37:51,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 17:37:51,896 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 17:37:51,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:37:51,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1790289199, now seen corresponding path program 1 times [2022-10-17 17:37:51,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:37:51,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551432747] [2022-10-17 17:37:51,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:37:51,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:37:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:37:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:37:52,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:37:52,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551432747] [2022-10-17 17:37:52,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551432747] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:37:52,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:37:52,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 17:37:52,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510719063] [2022-10-17 17:37:52,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:37:52,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 17:37:52,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:37:52,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 17:37:52,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:37:52,015 INFO L87 Difference]: Start difference. First operand 351 states and 485 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-10-17 17:37:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:37:52,358 INFO L93 Difference]: Finished difference Result 551 states and 762 transitions. [2022-10-17 17:37:52,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-17 17:37:52,359 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-10-17 17:37:52,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:37:52,370 INFO L225 Difference]: With dead ends: 551 [2022-10-17 17:37:52,371 INFO L226 Difference]: Without dead ends: 480 [2022-10-17 17:37:52,375 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-10-17 17:37:52,378 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 259 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-17 17:37:52,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 403 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-17 17:37:52,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-10-17 17:37:52,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 469. [2022-10-17 17:37:52,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 322 states have (on average 1.3509316770186335) internal successors, (435), 330 states have internal predecessors, (435), 94 states have call successors, (94), 53 states have call predecessors, (94), 51 states have return successors, (111), 87 states have call predecessors, (111), 90 states have call successors, (111) [2022-10-17 17:37:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 640 transitions. [2022-10-17 17:37:52,494 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 640 transitions. Word has length 44 [2022-10-17 17:37:52,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:37:52,495 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 640 transitions. [2022-10-17 17:37:52,495 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-10-17 17:37:52,495 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 640 transitions. [2022-10-17 17:37:52,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-17 17:37:52,505 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:37:52,505 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-10-17 17:37:52,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 17:37:52,506 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 17:37:52,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:37:52,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1100246104, now seen corresponding path program 1 times [2022-10-17 17:37:52,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:37:52,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338819704] [2022-10-17 17:37:52,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:37:52,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:37:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:37:52,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:37:52,715 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:37:52,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338819704] [2022-10-17 17:37:52,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338819704] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:37:52,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:37:52,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 17:37:52,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36466149] [2022-10-17 17:37:52,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:37:52,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 17:37:52,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:37:52,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 17:37:52,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 17:37:52,723 INFO L87 Difference]: Start difference. First operand 469 states and 640 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-10-17 17:37:53,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:37:53,628 INFO L93 Difference]: Finished difference Result 1006 states and 1363 transitions. [2022-10-17 17:37:53,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-17 17:37:53,629 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-10-17 17:37:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:37:53,638 INFO L225 Difference]: With dead ends: 1006 [2022-10-17 17:37:53,638 INFO L226 Difference]: Without dead ends: 540 [2022-10-17 17:37:53,645 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-10-17 17:37:53,649 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 634 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-17 17:37:53,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 768 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-10-17 17:37:53,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-10-17 17:37:53,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 455. [2022-10-17 17:37:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 308 states have (on average 1.3051948051948052) internal successors, (402), 316 states have internal predecessors, (402), 94 states have call successors, (94), 53 states have call predecessors, (94), 51 states have return successors, (108), 87 states have call predecessors, (108), 90 states have call successors, (108) [2022-10-17 17:37:53,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 604 transitions. [2022-10-17 17:37:53,752 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 604 transitions. Word has length 45 [2022-10-17 17:37:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:37:53,752 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 604 transitions. [2022-10-17 17:37:53,753 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-10-17 17:37:53,753 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 604 transitions. [2022-10-17 17:37:53,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-10-17 17:37:53,758 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:37:53,759 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-10-17 17:37:53,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 17:37:53,759 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 17:37:53,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:37:53,760 INFO L85 PathProgramCache]: Analyzing trace with hash 968386315, now seen corresponding path program 1 times [2022-10-17 17:37:53,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:37:53,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879344866] [2022-10-17 17:37:53,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:37:53,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:37:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:37:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:37:54,126 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:37:54,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879344866] [2022-10-17 17:37:54,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879344866] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:37:54,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:37:54,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 17:37:54,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991636727] [2022-10-17 17:37:54,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:37:54,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-17 17:37:54,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:37:54,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-17 17:37:54,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-17 17:37:54,129 INFO L87 Difference]: Start difference. First operand 455 states and 604 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-17 17:37:54,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:37:54,833 INFO L93 Difference]: Finished difference Result 757 states and 972 transitions. [2022-10-17 17:37:54,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-17 17:37:54,834 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-10-17 17:37:54,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:37:54,840 INFO L225 Difference]: With dead ends: 757 [2022-10-17 17:37:54,840 INFO L226 Difference]: Without dead ends: 583 [2022-10-17 17:37:54,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-10-17 17:37:54,843 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 305 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-17 17:37:54,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 546 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-17 17:37:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-10-17 17:37:54,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 557. [2022-10-17 17:37:54,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 376 states have (on average 1.2872340425531914) internal successors, (484), 384 states have internal predecessors, (484), 114 states have call successors, (114), 67 states have call predecessors, (114), 65 states have return successors, (128), 107 states have call predecessors, (128), 110 states have call successors, (128) [2022-10-17 17:37:54,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 726 transitions. [2022-10-17 17:37:54,935 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 726 transitions. Word has length 46 [2022-10-17 17:37:54,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:37:54,938 INFO L495 AbstractCegarLoop]: Abstraction has 557 states and 726 transitions. [2022-10-17 17:37:54,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-17 17:37:54,939 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 726 transitions. [2022-10-17 17:37:54,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-17 17:37:54,943 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:37:54,944 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] [2022-10-17 17:37:54,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 17:37:54,945 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 17:37:54,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:37:54,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1788183395, now seen corresponding path program 1 times [2022-10-17 17:37:54,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:37:54,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788415212] [2022-10-17 17:37:54,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:37:54,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:37:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:37:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:37:55,022 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:37:55,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788415212] [2022-10-17 17:37:55,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788415212] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:37:55,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:37:55,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 17:37:55,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925080964] [2022-10-17 17:37:55,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:37:55,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:37:55,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:37:55,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:37:55,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:37:55,027 INFO L87 Difference]: Start difference. First operand 557 states and 726 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-10-17 17:37:55,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:37:55,170 INFO L93 Difference]: Finished difference Result 822 states and 1062 transitions. [2022-10-17 17:37:55,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:37:55,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 47 [2022-10-17 17:37:55,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:37:55,174 INFO L225 Difference]: With dead ends: 822 [2022-10-17 17:37:55,174 INFO L226 Difference]: Without dead ends: 276 [2022-10-17 17:37:55,176 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-10-17 17:37:55,178 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 167 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:37:55,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 150 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:37:55,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-10-17 17:37:55,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2022-10-17 17:37:55,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 187 states have (on average 1.3315508021390374) internal successors, (249), 192 states have internal predecessors, (249), 58 states have call successors, (58), 31 states have call predecessors, (58), 30 states have return successors, (74), 53 states have call predecessors, (74), 56 states have call successors, (74) [2022-10-17 17:37:55,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 381 transitions. [2022-10-17 17:37:55,224 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 381 transitions. Word has length 47 [2022-10-17 17:37:55,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:37:55,225 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 381 transitions. [2022-10-17 17:37:55,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-10-17 17:37:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 381 transitions. [2022-10-17 17:37:55,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-10-17 17:37:55,227 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:37:55,227 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-17 17:37:55,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 17:37:55,228 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 17:37:55,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:37:55,229 INFO L85 PathProgramCache]: Analyzing trace with hash -401707375, now seen corresponding path program 1 times [2022-10-17 17:37:55,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:37:55,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430861686] [2022-10-17 17:37:55,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:37:55,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:37:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:37:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-17 17:37:55,529 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:37:55,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430861686] [2022-10-17 17:37:55,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430861686] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:37:55,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:37:55,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 17:37:55,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639175909] [2022-10-17 17:37:55,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:37:55,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 17:37:55,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:37:55,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 17:37:55,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-17 17:37:55,533 INFO L87 Difference]: Start difference. First operand 276 states and 381 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-10-17 17:37:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:37:55,857 INFO L93 Difference]: Finished difference Result 708 states and 995 transitions. [2022-10-17 17:37:55,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 17:37:55,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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 60 [2022-10-17 17:37:55,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:37:55,862 INFO L225 Difference]: With dead ends: 708 [2022-10-17 17:37:55,862 INFO L226 Difference]: Without dead ends: 439 [2022-10-17 17:37:55,864 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-10-17 17:37:55,865 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 171 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:37:55,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 224 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:37:55,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-10-17 17:37:55,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 423. [2022-10-17 17:37:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 286 states have (on average 1.3041958041958042) internal successors, (373), 293 states have internal predecessors, (373), 88 states have call successors, (88), 49 states have call predecessors, (88), 48 states have return successors, (116), 81 states have call predecessors, (116), 86 states have call successors, (116) [2022-10-17 17:37:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 577 transitions. [2022-10-17 17:37:55,935 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 577 transitions. Word has length 60 [2022-10-17 17:37:55,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:37:55,936 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 577 transitions. [2022-10-17 17:37:55,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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-10-17 17:37:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 577 transitions. [2022-10-17 17:37:55,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-17 17:37:55,938 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:37:55,938 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-17 17:37:55,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 17:37:55,939 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 17:37:55,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:37:55,939 INFO L85 PathProgramCache]: Analyzing trace with hash -604482207, now seen corresponding path program 1 times [2022-10-17 17:37:55,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:37:55,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131864681] [2022-10-17 17:37:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:37:55,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:37:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:37:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-17 17:37:56,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:37:56,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131864681] [2022-10-17 17:37:56,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131864681] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:37:56,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:37:56,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 17:37:56,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113701760] [2022-10-17 17:37:56,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:37:56,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:37:56,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:37:56,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:37:56,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:37:56,017 INFO L87 Difference]: Start difference. First operand 423 states and 577 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10-17 17:37:56,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:37:56,146 INFO L93 Difference]: Finished difference Result 875 states and 1203 transitions. [2022-10-17 17:37:56,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:37:56,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 61 [2022-10-17 17:37:56,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:37:56,152 INFO L225 Difference]: With dead ends: 875 [2022-10-17 17:37:56,153 INFO L226 Difference]: Without dead ends: 510 [2022-10-17 17:37:56,154 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-10-17 17:37:56,155 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 28 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-17 17:37:56,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 189 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-17 17:37:56,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-10-17 17:37:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 454. [2022-10-17 17:37:56,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 311 states have (on average 1.3118971061093248) internal successors, (408), 318 states have internal predecessors, (408), 91 states have call successors, (91), 52 states have call predecessors, (91), 51 states have return successors, (119), 84 states have call predecessors, (119), 89 states have call successors, (119) [2022-10-17 17:37:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 618 transitions. [2022-10-17 17:37:56,236 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 618 transitions. Word has length 61 [2022-10-17 17:37:56,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:37:56,237 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 618 transitions. [2022-10-17 17:37:56,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10-17 17:37:56,237 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 618 transitions. [2022-10-17 17:37:56,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-10-17 17:37:56,240 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:37:56,240 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-17 17:37:56,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-17 17:37:56,241 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 17:37:56,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:37:56,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2006295484, now seen corresponding path program 1 times [2022-10-17 17:37:56,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:37:56,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776160406] [2022-10-17 17:37:56,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:37:56,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:37:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:37:56,455 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-17 17:37:56,455 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:37:56,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776160406] [2022-10-17 17:37:56,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776160406] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 17:37:56,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834790690] [2022-10-17 17:37:56,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:37:56,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 17:37:56,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 [2022-10-17 17:37:56,459 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 17:37:56,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-17 17:37:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:37:56,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-17 17:37:56,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 17:37:56,681 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-17 17:37:56,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-17 17:37:56,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834790690] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:37:56,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-17 17:37:56,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-10-17 17:37:56,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489092201] [2022-10-17 17:37:56,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:37:56,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:37:56,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:37:56,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:37:56,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-17 17:37:56,685 INFO L87 Difference]: Start difference. First operand 454 states and 618 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-10-17 17:37:56,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:37:56,809 INFO L93 Difference]: Finished difference Result 864 states and 1183 transitions. [2022-10-17 17:37:56,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:37:56,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 88 [2022-10-17 17:37:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:37:56,815 INFO L225 Difference]: With dead ends: 864 [2022-10-17 17:37:56,815 INFO L226 Difference]: Without dead ends: 533 [2022-10-17 17:37:56,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 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-10-17 17:37:56,818 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 76 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-17 17:37:56,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 99 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-17 17:37:56,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2022-10-17 17:37:56,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 518. [2022-10-17 17:37:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 366 states have (on average 1.2950819672131149) internal successors, (474), 372 states have internal predecessors, (474), 91 states have call successors, (91), 60 states have call predecessors, (91), 60 states have return successors, (117), 86 states have call predecessors, (117), 89 states have call successors, (117) [2022-10-17 17:37:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 682 transitions. [2022-10-17 17:37:56,950 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 682 transitions. Word has length 88 [2022-10-17 17:37:56,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:37:56,951 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 682 transitions. [2022-10-17 17:37:56,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-10-17 17:37:56,951 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 682 transitions. [2022-10-17 17:37:56,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-10-17 17:37:56,956 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:37:56,956 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-17 17:37:57,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-17 17:37:57,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 17:37:57,182 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 17:37:57,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:37:57,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1032806525, now seen corresponding path program 2 times [2022-10-17 17:37:57,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:37:57,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189632791] [2022-10-17 17:37:57,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:37:57,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:37:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:37:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-10-17 17:37:57,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:37:57,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189632791] [2022-10-17 17:37:57,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189632791] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 17:37:57,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137521208] [2022-10-17 17:37:57,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-17 17:37:57,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 17:37:57,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 [2022-10-17 17:37:57,464 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 17:37:57,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-17 17:37:57,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-10-17 17:37:57,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-17 17:37:57,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-17 17:37:57,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 17:37:57,604 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-17 17:37:57,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-17 17:37:57,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137521208] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:37:57,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-17 17:37:57,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-10-17 17:37:57,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817174820] [2022-10-17 17:37:57,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:37:57,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:37:57,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:37:57,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:37:57,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-17 17:37:57,607 INFO L87 Difference]: Start difference. First operand 518 states and 682 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-10-17 17:37:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:37:57,735 INFO L93 Difference]: Finished difference Result 1008 states and 1369 transitions. [2022-10-17 17:37:57,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:37:57,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 88 [2022-10-17 17:37:57,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:37:57,740 INFO L225 Difference]: With dead ends: 1008 [2022-10-17 17:37:57,741 INFO L226 Difference]: Without dead ends: 630 [2022-10-17 17:37:57,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 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-10-17 17:37:57,743 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 66 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-17 17:37:57,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 197 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-17 17:37:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-10-17 17:37:57,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 608. [2022-10-17 17:37:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 434 states have (on average 1.2788018433179724) internal successors, (555), 441 states have internal predecessors, (555), 104 states have call successors, (104), 70 states have call predecessors, (104), 69 states have return successors, (140), 97 states have call predecessors, (140), 102 states have call successors, (140) [2022-10-17 17:37:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 799 transitions. [2022-10-17 17:37:57,830 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 799 transitions. Word has length 88 [2022-10-17 17:37:57,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:37:57,831 INFO L495 AbstractCegarLoop]: Abstraction has 608 states and 799 transitions. [2022-10-17 17:37:57,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-10-17 17:37:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 799 transitions. [2022-10-17 17:37:57,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-10-17 17:37:57,833 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:37:57,834 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-17 17:37:57,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-17 17:37:58,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 17:37:58,054 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 17:37:58,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:37:58,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1654117409, now seen corresponding path program 1 times [2022-10-17 17:37:58,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:37:58,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191153832] [2022-10-17 17:37:58,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:37:58,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:37:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:37:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-17 17:37:58,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:37:58,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191153832] [2022-10-17 17:37:58,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191153832] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 17:37:58,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188548476] [2022-10-17 17:37:58,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:37:58,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 17:37:58,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 [2022-10-17 17:37:58,274 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 17:37:58,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-17 17:37:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:37:58,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-17 17:37:58,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 17:37:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-17 17:37:58,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-17 17:37:58,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188548476] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:37:58,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-17 17:37:58,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-10-17 17:37:58,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246163630] [2022-10-17 17:37:58,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:37:58,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:37:58,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:37:58,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:37:58,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-17 17:37:58,448 INFO L87 Difference]: Start difference. First operand 608 states and 799 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-10-17 17:37:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:37:58,596 INFO L93 Difference]: Finished difference Result 1427 states and 1871 transitions. [2022-10-17 17:37:58,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:37:58,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 89 [2022-10-17 17:37:58,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:37:58,605 INFO L225 Difference]: With dead ends: 1427 [2022-10-17 17:37:58,605 INFO L226 Difference]: Without dead ends: 826 [2022-10-17 17:37:58,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 91 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-10-17 17:37:58,611 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 41 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-17 17:37:58,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 162 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-17 17:37:58,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2022-10-17 17:37:58,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 665. [2022-10-17 17:37:58,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 477 states have (on average 1.280922431865828) internal successors, (611), 485 states have internal predecessors, (611), 111 states have call successors, (111), 77 states have call predecessors, (111), 76 states have return successors, (147), 103 states have call predecessors, (147), 109 states have call successors, (147) [2022-10-17 17:37:58,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 869 transitions. [2022-10-17 17:37:58,761 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 869 transitions. Word has length 89 [2022-10-17 17:37:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:37:58,762 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 869 transitions. [2022-10-17 17:37:58,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-10-17 17:37:58,763 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 869 transitions. [2022-10-17 17:37:58,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-10-17 17:37:58,765 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:37:58,766 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-10-17 17:37:58,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-17 17:37:58,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-10-17 17:37:58,990 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 17:37:58,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:37:58,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1390749180, now seen corresponding path program 1 times [2022-10-17 17:37:58,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:37:58,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978955703] [2022-10-17 17:37:58,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:37:58,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:37:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:37:59,075 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-10-17 17:37:59,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:37:59,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978955703] [2022-10-17 17:37:59,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978955703] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 17:37:59,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582446022] [2022-10-17 17:37:59,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:37:59,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 17:37:59,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 [2022-10-17 17:37:59,077 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 17:37:59,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-17 17:37:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:37:59,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-17 17:37:59,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 17:37:59,209 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-17 17:37:59,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-17 17:37:59,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582446022] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:37:59,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-17 17:37:59,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-10-17 17:37:59,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954680002] [2022-10-17 17:37:59,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:37:59,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:37:59,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:37:59,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:37:59,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-17 17:37:59,212 INFO L87 Difference]: Start difference. First operand 665 states and 869 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-10-17 17:37:59,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:37:59,348 INFO L93 Difference]: Finished difference Result 1065 states and 1379 transitions. [2022-10-17 17:37:59,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:37:59,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 89 [2022-10-17 17:37:59,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:37:59,354 INFO L225 Difference]: With dead ends: 1065 [2022-10-17 17:37:59,354 INFO L226 Difference]: Without dead ends: 769 [2022-10-17 17:37:59,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 89 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-10-17 17:37:59,357 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 43 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-17 17:37:59,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 194 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-17 17:37:59,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2022-10-17 17:37:59,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 699. [2022-10-17 17:37:59,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 503 states have (on average 1.2823061630218688) internal successors, (645), 511 states have internal predecessors, (645), 115 states have call successors, (115), 81 states have call predecessors, (115), 80 states have return successors, (151), 107 states have call predecessors, (151), 113 states have call successors, (151) [2022-10-17 17:37:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 911 transitions. [2022-10-17 17:37:59,473 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 911 transitions. Word has length 89 [2022-10-17 17:37:59,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:37:59,474 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 911 transitions. [2022-10-17 17:37:59,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-10-17 17:37:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 911 transitions. [2022-10-17 17:37:59,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-10-17 17:37:59,477 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:37:59,477 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-10-17 17:37:59,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-17 17:37:59,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-10-17 17:37:59,690 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 17:37:59,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:37:59,690 INFO L85 PathProgramCache]: Analyzing trace with hash 62758433, now seen corresponding path program 1 times [2022-10-17 17:37:59,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:37:59,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272398687] [2022-10-17 17:37:59,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:37:59,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:37:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:37:59,887 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-10-17 17:37:59,887 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:37:59,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272398687] [2022-10-17 17:37:59,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272398687] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:37:59,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:37:59,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 17:37:59,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606562514] [2022-10-17 17:37:59,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:37:59,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 17:37:59,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:37:59,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 17:37:59,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:37:59,892 INFO L87 Difference]: Start difference. First operand 699 states and 911 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 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-10-17 17:38:00,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:38:00,266 INFO L93 Difference]: Finished difference Result 1681 states and 2154 transitions. [2022-10-17 17:38:00,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-17 17:38:00,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 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 90 [2022-10-17 17:38:00,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:38:00,274 INFO L225 Difference]: With dead ends: 1681 [2022-10-17 17:38:00,275 INFO L226 Difference]: Without dead ends: 1180 [2022-10-17 17:38:00,276 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-10-17 17:38:00,278 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 140 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:38:00,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 249 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:38:00,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2022-10-17 17:38:00,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1139. [2022-10-17 17:38:00,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 813 states have (on average 1.2607626076260763) internal successors, (1025), 818 states have internal predecessors, (1025), 193 states have call successors, (193), 133 states have call predecessors, (193), 132 states have return successors, (227), 188 states have call predecessors, (227), 191 states have call successors, (227) [2022-10-17 17:38:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1445 transitions. [2022-10-17 17:38:00,478 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1445 transitions. Word has length 90 [2022-10-17 17:38:00,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:38:00,479 INFO L495 AbstractCegarLoop]: Abstraction has 1139 states and 1445 transitions. [2022-10-17 17:38:00,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 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-10-17 17:38:00,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1445 transitions. [2022-10-17 17:38:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-10-17 17:38:00,482 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:38:00,482 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-10-17 17:38:00,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-17 17:38:00,483 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 17:38:00,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:38:00,484 INFO L85 PathProgramCache]: Analyzing trace with hash -840012887, now seen corresponding path program 1 times [2022-10-17 17:38:00,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:38:00,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862030266] [2022-10-17 17:38:00,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:38:00,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:38:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 17:38:00,508 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 17:38:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 17:38:00,600 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-10-17 17:38:00,601 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-17 17:38:00,602 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-10-17 17:38:00,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-10-17 17:38:00,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-17 17:38:00,608 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:38:00,612 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-17 17:38:00,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.10 05:38:00 BoogieIcfgContainer [2022-10-17 17:38:00,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-17 17:38:00,773 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 17:38:00,773 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 17:38:00,773 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 17:38:00,778 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 05:37:49" (3/4) ... [2022-10-17 17:38:00,780 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-10-17 17:38:00,918 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/witness.graphml [2022-10-17 17:38:00,918 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 17:38:00,919 INFO L158 Benchmark]: Toolchain (without parser) took 12941.89ms. Allocated memory was 100.7MB in the beginning and 243.3MB in the end (delta: 142.6MB). Free memory was 78.7MB in the beginning and 204.0MB in the end (delta: -125.3MB). Peak memory consumption was 148.2MB. Max. memory is 16.1GB. [2022-10-17 17:38:00,920 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 100.7MB. Free memory was 72.8MB in the beginning and 72.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 17:38:00,921 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.91ms. Allocated memory is still 100.7MB. Free memory was 78.4MB in the beginning and 67.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-10-17 17:38:00,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.20ms. Allocated memory is still 100.7MB. Free memory was 67.9MB in the beginning and 65.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 17:38:00,922 INFO L158 Benchmark]: Boogie Preprocessor took 44.57ms. Allocated memory is still 100.7MB. Free memory was 65.4MB in the beginning and 62.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-10-17 17:38:00,923 INFO L158 Benchmark]: RCFGBuilder took 1333.36ms. Allocated memory was 100.7MB in the beginning and 132.1MB in the end (delta: 31.5MB). Free memory was 62.6MB in the beginning and 80.0MB in the end (delta: -17.4MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2022-10-17 17:38:00,923 INFO L158 Benchmark]: TraceAbstraction took 10794.44ms. Allocated memory was 132.1MB in the beginning and 243.3MB in the end (delta: 111.1MB). Free memory was 79.3MB in the beginning and 74.6MB in the end (delta: 4.7MB). Peak memory consumption was 117.1MB. Max. memory is 16.1GB. [2022-10-17 17:38:00,925 INFO L158 Benchmark]: Witness Printer took 145.61ms. Allocated memory is still 243.3MB. Free memory was 74.6MB in the beginning and 204.0MB in the end (delta: -129.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 17:38:00,927 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.33ms. Allocated memory is still 100.7MB. Free memory was 72.8MB in the beginning and 72.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 549.91ms. Allocated memory is still 100.7MB. Free memory was 78.4MB in the beginning and 67.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.20ms. Allocated memory is still 100.7MB. Free memory was 67.9MB in the beginning and 65.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.57ms. Allocated memory is still 100.7MB. Free memory was 65.4MB in the beginning and 62.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1333.36ms. Allocated memory was 100.7MB in the beginning and 132.1MB in the end (delta: 31.5MB). Free memory was 62.6MB in the beginning and 80.0MB in the end (delta: -17.4MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10794.44ms. Allocated memory was 132.1MB in the beginning and 243.3MB in the end (delta: 111.1MB). Free memory was 79.3MB in the beginning and 74.6MB in the end (delta: 4.7MB). Peak memory consumption was 117.1MB. Max. memory is 16.1GB. * Witness Printer took 145.61ms. Allocated memory is still 243.3MB. Free memory was 74.6MB in the beginning and 204.0MB in the end (delta: -129.4MB). Peak memory consumption was 2.1MB. 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 m_st ; [L606] int t1_st ; [L607] int m_i ; [L608] int t1_i ; [L609] int M_E = 2; [L610] int T1_E = 2; [L611] int E_M = 2; [L612] int E_1 = 2; [L616] int token ; [L618] int local ; [L1077] COND FALSE !(__VERIFIER_nondet_int()) [L1080] CALL main2() [L1064] int __retres1 ; [L1068] CALL init_model2() [L979] m_i = 1 [L980] t1_i = 1 [L1068] RET init_model2() [L1069] CALL start_simulation2() [L1005] int kernel_st ; [L1006] int tmp ; [L1007] int tmp___0 ; [L1011] 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_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, token=0] [L1012] 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_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, token=0] [L1013] CALL init_threads2() [L761] COND TRUE m_i == 1 [L762] m_st = 0 [L766] COND TRUE t1_i == 1 [L767] t1_st = 0 [L1013] RET init_threads2() [L1014] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L850] COND FALSE !(M_E == 0) [L855] COND FALSE !(T1_E == 0) [L860] COND FALSE !(E_M == 0) [L865] COND FALSE !(E_1 == 0) [L1014] 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_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, token=0] [L1015] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L715] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L725] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L727] return (__retres1); [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND FALSE !(\read(tmp)) [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L734] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L744] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_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_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, token=0] [L746] return (__retres1); [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND FALSE !(\read(tmp___0)) [L1015] 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_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, token=0] [L1016] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_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_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, token=0] [L878] COND FALSE !(M_E == 1) [L883] COND FALSE !(T1_E == 1) [L888] COND FALSE !(E_M == 1) [L893] COND FALSE !(E_1 == 1) [L1016] 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_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, token=0] [L1019] COND TRUE 1 [L1022] kernel_st = 1 [L1023] CALL eval2() [L797] 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_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, token=0] [L801] 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_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, token=0] [L804] 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_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, token=0] [L776] int __retres1 ; [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 [L792] return (__retres1); [L804] 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_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, token=0] [L804] tmp = exists_runnable_thread2() [L806] 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_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, tmp=1, token=0] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] 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_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, tmp=1, tmp_ndt_1=0, token=0] [L825] COND TRUE t1_st == 0 [L826] int tmp_ndt_2; [L827] tmp_ndt_2 = __VERIFIER_nondet_int() [L828] COND TRUE \read(tmp_ndt_2) [L830] t1_st = 1 [L831] CALL transmit1() [L679] 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_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, token=0] [L690] COND TRUE 1 [L692] t1_pc = 1 [L693] t1_st = 2 [L831] RET transmit1() [L801] 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_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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L804] 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_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, token=0] [L776] int __retres1 ; [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 [L792] return (__retres1); [L804] 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_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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L804] tmp = exists_runnable_thread2() [L806] 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_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, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, token=0] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND TRUE \read(tmp_ndt_1) [L816] m_st = 1 [L817] CALL master() [L621] int tmp_var = __VERIFIER_nondet_int(); [L623] 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_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, tmp_var=0, token=0] [L634] COND TRUE 1 [L637] token = __VERIFIER_nondet_int() [L638] local = token [L639] 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_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, tmp_var=0, token=0] [L640] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L932] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L715] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L725] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L727] return (__retres1); [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND FALSE !(\read(tmp)) [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L734] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L735] COND TRUE E_1 == 1 [L736] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L746] return (__retres1); [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND TRUE \read(tmp___0) [L919] t1_st = 0 [L932] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_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_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, token=0] [L640] 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_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, tmp_var=0, token=0] [L641] E_1 = 2 [L642] m_pc = 1 [L643] 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_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, tmp_var=0, token=0] [L817] RET master() [L825] COND TRUE t1_st == 0 [L826] int tmp_ndt_2; [L827] tmp_ndt_2 = __VERIFIER_nondet_int() [L828] COND TRUE \read(tmp_ndt_2) [L830] t1_st = 1 [L831] CALL transmit1() [L679] 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_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, token=0] [L682] COND TRUE t1_pc == 1 [L698] token += 1 [L699] 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_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=1, token=1] [L700] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L932] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L715] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L716] COND TRUE E_M == 1 [L717] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L727] return (__retres1); [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND TRUE \read(tmp) [L911] m_st = 0 [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L734] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L735] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L744] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L746] return (__retres1); [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND FALSE !(\read(tmp___0)) [L932] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_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_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=1, token=1] [L700] 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_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=1, token=1] [L701] 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_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=1, token=1] [L690] COND TRUE 1 [L692] t1_pc = 1 [L693] t1_st = 2 [L831] RET transmit1() [L801] 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_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, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, token=1] [L804] 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_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, token=1] [L776] int __retres1 ; [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 [L792] return (__retres1); [L804] 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_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, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, token=1] [L804] tmp = exists_runnable_thread2() [L806] 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_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, tmp=1, tmp_ndt_1=-2, tmp_ndt_2=-3, token=1] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND TRUE \read(tmp_ndt_1) [L816] m_st = 1 [L817] CALL master() [L621] int tmp_var = __VERIFIER_nondet_int(); [L623] 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_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, tmp_var=5, token=1] [L626] 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_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, tmp_var=5, token=1] [L648] COND FALSE !(token != local + 1) [L653] COND TRUE tmp_var <= 5 [L654] 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_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, tmp_var=5, token=1] [L659] 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_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, tmp_var=5, token=1] [L660] 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_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, tmp_var=5, token=1] [L661] 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_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, tmp_var=5, token=1] [L662] 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_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, token=1] [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_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, token=1] - 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, 152 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2433 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2391 mSDsluCounter, 3713 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2248 mSDsCounter, 670 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2269 IncrementalHoareTripleChecker+Invalid, 2939 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 670 mSolverCounterUnsat, 1895 mSDtfsCounter, 2269 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 457 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1139occurred in iteration=12, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 516 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1229 NumberOfCodeBlocks, 1194 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1120 ConstructedInterpolants, 0 QuantifiedInterpolants, 1776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1475 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 451/493 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-10-17 17:38:00,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85db64f-b494-49c4-b113-3e268f5d5e03/bin/utaipan-G1rejxKTta/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