./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh --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 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 --- 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-2329fc7 [2022-12-14 04:58:13,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 04:58:13,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 04:58:13,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 04:58:13,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 04:58:13,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 04:58:13,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 04:58:13,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 04:58:13,679 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 04:58:13,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 04:58:13,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 04:58:13,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 04:58:13,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 04:58:13,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 04:58:13,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 04:58:13,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 04:58:13,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 04:58:13,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 04:58:13,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 04:58:13,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 04:58:13,691 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 04:58:13,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 04:58:13,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 04:58:13,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 04:58:13,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 04:58:13,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 04:58:13,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 04:58:13,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 04:58:13,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 04:58:13,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 04:58:13,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 04:58:13,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 04:58:13,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 04:58:13,700 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 04:58:13,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 04:58:13,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 04:58:13,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 04:58:13,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 04:58:13,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 04:58:13,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 04:58:13,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 04:58:13,703 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 04:58:13,716 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 04:58:13,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 04:58:13,717 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 04:58:13,717 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 04:58:13,717 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 04:58:13,717 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 04:58:13,718 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 04:58:13,718 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 04:58:13,718 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 04:58:13,718 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 04:58:13,718 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 04:58:13,718 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 04:58:13,718 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 04:58:13,718 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 04:58:13,718 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 04:58:13,718 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 04:58:13,719 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 04:58:13,719 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 04:58:13,719 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 04:58:13,719 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 04:58:13,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 04:58:13,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 04:58:13,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 04:58:13,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 04:58:13,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 04:58:13,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 04:58:13,720 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 04:58:13,720 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 04:58:13,720 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 04:58:13,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 04:58:13,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 04:58:13,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 04:58:13,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:58:13,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 04:58:13,721 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 04:58:13,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 04:58:13,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 04:58:13,721 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 04:58:13,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 04:58:13,721 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 04:58:13,721 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 04:58:13,721 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_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/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_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh 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 -> 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 [2022-12-14 04:58:13,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 04:58:13,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 04:58:13,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 04:58:13,910 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 04:58:13,910 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 04:58:13,912 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2022-12-14 04:58:16,465 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 04:58:16,631 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 04:58:16,632 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2022-12-14 04:58:16,639 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/data/2d94389fe/4a67c27b40bf4a13b57ba9b24ed17845/FLAG84e334bd6 [2022-12-14 04:58:16,650 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/data/2d94389fe/4a67c27b40bf4a13b57ba9b24ed17845 [2022-12-14 04:58:16,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 04:58:16,653 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 04:58:16,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 04:58:16,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 04:58:16,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 04:58:16,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:58:16" (1/1) ... [2022-12-14 04:58:16,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@380855d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:16, skipping insertion in model container [2022-12-14 04:58:16,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:58:16" (1/1) ... [2022-12-14 04:58:16,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 04:58:16,688 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 04:58:16,788 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[911,924] [2022-12-14 04:58:16,827 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[8416,8429] [2022-12-14 04:58:16,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:58:16,859 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 04:58:16,867 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[911,924] [2022-12-14 04:58:16,884 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[8416,8429] [2022-12-14 04:58:16,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:58:16,911 INFO L208 MainTranslator]: Completed translation [2022-12-14 04:58:16,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:16 WrapperNode [2022-12-14 04:58:16,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 04:58:16,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 04:58:16,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 04:58:16,913 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 04:58:16,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:16" (1/1) ... [2022-12-14 04:58:16,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:16" (1/1) ... [2022-12-14 04:58:16,946 INFO L138 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 498 [2022-12-14 04:58:16,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 04:58:16,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 04:58:16,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 04:58:16,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 04:58:16,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:16" (1/1) ... [2022-12-14 04:58:16,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:16" (1/1) ... [2022-12-14 04:58:16,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:16" (1/1) ... [2022-12-14 04:58:16,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:16" (1/1) ... [2022-12-14 04:58:16,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:16" (1/1) ... [2022-12-14 04:58:16,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:16" (1/1) ... [2022-12-14 04:58:16,968 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:16" (1/1) ... [2022-12-14 04:58:16,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:16" (1/1) ... [2022-12-14 04:58:16,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 04:58:16,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 04:58:16,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 04:58:16,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 04:58:16,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:16" (1/1) ... [2022-12-14 04:58:16,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:58:16,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:58:16,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 04:58:16,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 04:58:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 04:58:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-14 04:58:17,030 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-14 04:58:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-12-14 04:58:17,031 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-12-14 04:58:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-12-14 04:58:17,031 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-12-14 04:58:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-12-14 04:58:17,031 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-12-14 04:58:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-12-14 04:58:17,031 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-12-14 04:58:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-12-14 04:58:17,032 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-12-14 04:58:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-12-14 04:58:17,032 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-12-14 04:58:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-12-14 04:58:17,032 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-12-14 04:58:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-12-14 04:58:17,032 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-12-14 04:58:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-12-14 04:58:17,033 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-12-14 04:58:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-12-14 04:58:17,033 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-12-14 04:58:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 04:58:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-12-14 04:58:17,033 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-12-14 04:58:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-12-14 04:58:17,034 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-12-14 04:58:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 04:58:17,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 04:58:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-12-14 04:58:17,034 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-12-14 04:58:17,114 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 04:58:17,116 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 04:58:17,468 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-12-14 04:58:17,468 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-12-14 04:58:17,497 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 04:58:17,595 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 04:58:17,595 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-12-14 04:58:17,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:58:17 BoogieIcfgContainer [2022-12-14 04:58:17,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 04:58:17,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 04:58:17,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 04:58:17,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 04:58:17,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:58:16" (1/3) ... [2022-12-14 04:58:17,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f44f852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:58:17, skipping insertion in model container [2022-12-14 04:58:17,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:58:16" (2/3) ... [2022-12-14 04:58:17,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f44f852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:58:17, skipping insertion in model container [2022-12-14 04:58:17,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:58:17" (3/3) ... [2022-12-14 04:58:17,606 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-1.c [2022-12-14 04:58:17,624 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 04:58:17,624 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-14 04:58:17,674 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 04:58:17,680 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;@38f80fc3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 04:58:17,680 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-14 04:58:17,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 157 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 114 states have internal predecessors, (161), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2022-12-14 04:58:17,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 04:58:17,692 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:17,692 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] [2022-12-14 04:58:17,693 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:17,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:17,696 INFO L85 PathProgramCache]: Analyzing trace with hash 703272536, now seen corresponding path program 1 times [2022-12-14 04:58:17,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:17,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416780333] [2022-12-14 04:58:17,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:17,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:58:18,018 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:18,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416780333] [2022-12-14 04:58:18,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416780333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:18,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:58:18,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 04:58:18,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20594499] [2022-12-14 04:58:18,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:18,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 04:58:18,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:18,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 04:58:18,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:58:18,052 INFO L87 Difference]: Start difference. First operand has 157 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 114 states have internal predecessors, (161), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 04:58:18,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:18,578 INFO L93 Difference]: Finished difference Result 571 states and 847 transitions. [2022-12-14 04:58:18,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 04:58:18,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-12-14 04:58:18,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:18,589 INFO L225 Difference]: With dead ends: 571 [2022-12-14 04:58:18,590 INFO L226 Difference]: Without dead ends: 409 [2022-12-14 04:58:18,593 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-12-14 04:58:18,595 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 556 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:18,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 574 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 04:58:18,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-12-14 04:58:18,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 398. [2022-12-14 04:58:18,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 282 states have (on average 1.3865248226950355) internal successors, (391), 289 states have internal predecessors, (391), 77 states have call successors, (77), 38 states have call predecessors, (77), 37 states have return successors, (97), 72 states have call predecessors, (97), 75 states have call successors, (97) [2022-12-14 04:58:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 565 transitions. [2022-12-14 04:58:18,654 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 565 transitions. Word has length 37 [2022-12-14 04:58:18,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:18,654 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 565 transitions. [2022-12-14 04:58:18,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 04:58:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 565 transitions. [2022-12-14 04:58:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 04:58:18,656 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:18,657 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-12-14 04:58:18,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 04:58:18,657 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:18,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:18,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1700586288, now seen corresponding path program 1 times [2022-12-14 04:58:18,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:18,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929446052] [2022-12-14 04:58:18,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:18,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:58:18,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:18,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929446052] [2022-12-14 04:58:18,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929446052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:18,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:58:18,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 04:58:18,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730222443] [2022-12-14 04:58:18,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:18,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:58:18,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:18,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:58:18,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:58:18,744 INFO L87 Difference]: Start difference. First operand 398 states and 565 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-12-14 04:58:18,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:18,949 INFO L93 Difference]: Finished difference Result 598 states and 842 transitions. [2022-12-14 04:58:18,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:58:18,950 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-12-14 04:58:18,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:18,953 INFO L225 Difference]: With dead ends: 598 [2022-12-14 04:58:18,953 INFO L226 Difference]: Without dead ends: 527 [2022-12-14 04:58:18,954 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-12-14 04:58:18,955 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 269 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:18,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 419 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:58:18,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-12-14 04:58:18,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 516. [2022-12-14 04:58:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 366 states have (on average 1.3743169398907105) internal successors, (503), 373 states have internal predecessors, (503), 97 states have call successors, (97), 52 states have call predecessors, (97), 51 states have return successors, (120), 92 states have call predecessors, (120), 95 states have call successors, (120) [2022-12-14 04:58:18,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 720 transitions. [2022-12-14 04:58:18,990 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 720 transitions. Word has length 44 [2022-12-14 04:58:18,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:18,990 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 720 transitions. [2022-12-14 04:58:18,990 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-12-14 04:58:18,990 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 720 transitions. [2022-12-14 04:58:18,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 04:58:18,991 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:18,992 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-12-14 04:58:18,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 04:58:18,992 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:18,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:18,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1274964348, now seen corresponding path program 1 times [2022-12-14 04:58:18,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:18,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49844489] [2022-12-14 04:58:18,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:18,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:58:19,059 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:19,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49844489] [2022-12-14 04:58:19,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49844489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:19,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:58:19,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 04:58:19,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941425848] [2022-12-14 04:58:19,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:19,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 04:58:19,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:19,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 04:58:19,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:58:19,061 INFO L87 Difference]: Start difference. First operand 516 states and 720 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-12-14 04:58:19,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:19,596 INFO L93 Difference]: Finished difference Result 1053 states and 1443 transitions. [2022-12-14 04:58:19,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 04:58:19,597 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-12-14 04:58:19,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:19,601 INFO L225 Difference]: With dead ends: 1053 [2022-12-14 04:58:19,601 INFO L226 Difference]: Without dead ends: 587 [2022-12-14 04:58:19,603 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-12-14 04:58:19,604 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 654 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:19,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 791 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 04:58:19,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-12-14 04:58:19,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 502. [2022-12-14 04:58:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 352 states have (on average 1.3352272727272727) internal successors, (470), 359 states have internal predecessors, (470), 97 states have call successors, (97), 52 states have call predecessors, (97), 51 states have return successors, (117), 92 states have call predecessors, (117), 95 states have call successors, (117) [2022-12-14 04:58:19,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 684 transitions. [2022-12-14 04:58:19,636 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 684 transitions. Word has length 45 [2022-12-14 04:58:19,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:19,636 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 684 transitions. [2022-12-14 04:58:19,636 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-12-14 04:58:19,637 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 684 transitions. [2022-12-14 04:58:19,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 04:58:19,637 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:19,638 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-12-14 04:58:19,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 04:58:19,638 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:19,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:19,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1351840235, now seen corresponding path program 1 times [2022-12-14 04:58:19,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:19,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828381537] [2022-12-14 04:58:19,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:19,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:19,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:58:19,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:19,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828381537] [2022-12-14 04:58:19,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828381537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:19,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:58:19,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 04:58:19,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133574198] [2022-12-14 04:58:19,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:19,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 04:58:19,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:19,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 04:58:19,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:58:19,700 INFO L87 Difference]: Start difference. First operand 502 states and 684 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 04:58:20,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:20,150 INFO L93 Difference]: Finished difference Result 968 states and 1292 transitions. [2022-12-14 04:58:20,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 04:58:20,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 46 [2022-12-14 04:58:20,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:20,155 INFO L225 Difference]: With dead ends: 968 [2022-12-14 04:58:20,155 INFO L226 Difference]: Without dead ends: 791 [2022-12-14 04:58:20,156 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-12-14 04:58:20,158 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 568 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:20,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 734 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 04:58:20,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-12-14 04:58:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 766. [2022-12-14 04:58:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 533 states have (on average 1.2926829268292683) internal successors, (689), 540 states have internal predecessors, (689), 146 states have call successors, (146), 86 states have call predecessors, (146), 85 states have return successors, (183), 141 states have call predecessors, (183), 144 states have call successors, (183) [2022-12-14 04:58:20,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1018 transitions. [2022-12-14 04:58:20,202 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1018 transitions. Word has length 46 [2022-12-14 04:58:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:20,203 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 1018 transitions. [2022-12-14 04:58:20,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 04:58:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1018 transitions. [2022-12-14 04:58:20,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-14 04:58:20,204 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:20,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:58:20,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 04:58:20,205 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:20,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:20,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1313670978, now seen corresponding path program 1 times [2022-12-14 04:58:20,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:20,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75832598] [2022-12-14 04:58:20,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:20,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:58:20,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:20,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75832598] [2022-12-14 04:58:20,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75832598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:20,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:58:20,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:58:20,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043782028] [2022-12-14 04:58:20,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:20,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:58:20,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:20,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:58:20,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:58:20,240 INFO L87 Difference]: Start difference. First operand 766 states and 1018 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 04:58:20,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:20,314 INFO L93 Difference]: Finished difference Result 767 states and 1019 transitions. [2022-12-14 04:58:20,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:58:20,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2022-12-14 04:58:20,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:20,317 INFO L225 Difference]: With dead ends: 767 [2022-12-14 04:58:20,317 INFO L226 Difference]: Without dead ends: 323 [2022-12-14 04:58:20,318 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-12-14 04:58:20,319 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 174 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:20,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 158 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:58:20,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-12-14 04:58:20,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2022-12-14 04:58:20,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 231 states have (on average 1.3722943722943723) internal successors, (317), 235 states have internal predecessors, (317), 61 states have call successors, (61), 30 states have call predecessors, (61), 30 states have return successors, (83), 58 states have call predecessors, (83), 61 states have call successors, (83) [2022-12-14 04:58:20,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 461 transitions. [2022-12-14 04:58:20,346 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 461 transitions. Word has length 50 [2022-12-14 04:58:20,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:20,347 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 461 transitions. [2022-12-14 04:58:20,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 04:58:20,347 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 461 transitions. [2022-12-14 04:58:20,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-14 04:58:20,348 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:20,348 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:58:20,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 04:58:20,349 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:20,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:20,349 INFO L85 PathProgramCache]: Analyzing trace with hash 161323625, now seen corresponding path program 1 times [2022-12-14 04:58:20,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:20,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453320142] [2022-12-14 04:58:20,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:20,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:20,561 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 04:58:20,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:20,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453320142] [2022-12-14 04:58:20,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453320142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:20,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:58:20,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 04:58:20,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172560916] [2022-12-14 04:58:20,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:20,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 04:58:20,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:20,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 04:58:20,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:58:20,563 INFO L87 Difference]: Start difference. First operand 323 states and 461 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 04:58:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:20,780 INFO L93 Difference]: Finished difference Result 846 states and 1232 transitions. [2022-12-14 04:58:20,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 04:58:20,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 66 [2022-12-14 04:58:20,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:20,783 INFO L225 Difference]: With dead ends: 846 [2022-12-14 04:58:20,783 INFO L226 Difference]: Without dead ends: 530 [2022-12-14 04:58:20,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 04:58:20,784 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 220 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:20,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 322 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:58:20,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-12-14 04:58:20,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 500. [2022-12-14 04:58:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 357 states have (on average 1.3529411764705883) internal successors, (483), 363 states have internal predecessors, (483), 94 states have call successors, (94), 48 states have call predecessors, (94), 48 states have return successors, (131), 89 states have call predecessors, (131), 94 states have call successors, (131) [2022-12-14 04:58:20,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 708 transitions. [2022-12-14 04:58:20,815 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 708 transitions. Word has length 66 [2022-12-14 04:58:20,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:20,816 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 708 transitions. [2022-12-14 04:58:20,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 04:58:20,816 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 708 transitions. [2022-12-14 04:58:20,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 04:58:20,817 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:20,817 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:58:20,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 04:58:20,818 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:20,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:20,818 INFO L85 PathProgramCache]: Analyzing trace with hash -2025049376, now seen corresponding path program 1 times [2022-12-14 04:58:20,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:20,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006363537] [2022-12-14 04:58:20,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:20,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 04:58:21,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:21,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006363537] [2022-12-14 04:58:21,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006363537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:21,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:58:21,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 04:58:21,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879743181] [2022-12-14 04:58:21,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:21,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 04:58:21,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:21,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 04:58:21,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:58:21,002 INFO L87 Difference]: Start difference. First operand 500 states and 708 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 04:58:21,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:21,289 INFO L93 Difference]: Finished difference Result 1486 states and 2164 transitions. [2022-12-14 04:58:21,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 04:58:21,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 67 [2022-12-14 04:58:21,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:21,295 INFO L225 Difference]: With dead ends: 1486 [2022-12-14 04:58:21,295 INFO L226 Difference]: Without dead ends: 993 [2022-12-14 04:58:21,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 04:58:21,298 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 214 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:21,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 268 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:58:21,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2022-12-14 04:58:21,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 943. [2022-12-14 04:58:21,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 670 states have (on average 1.328358208955224) internal successors, (890), 681 states have internal predecessors, (890), 176 states have call successors, (176), 96 states have call predecessors, (176), 96 states have return successors, (243), 166 states have call predecessors, (243), 176 states have call successors, (243) [2022-12-14 04:58:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1309 transitions. [2022-12-14 04:58:21,380 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1309 transitions. Word has length 67 [2022-12-14 04:58:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:21,381 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1309 transitions. [2022-12-14 04:58:21,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 04:58:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1309 transitions. [2022-12-14 04:58:21,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-14 04:58:21,383 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:21,383 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:58:21,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 04:58:21,383 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:21,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:21,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2005524165, now seen corresponding path program 1 times [2022-12-14 04:58:21,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:21,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270307730] [2022-12-14 04:58:21,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:21,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 04:58:21,439 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:21,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270307730] [2022-12-14 04:58:21,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270307730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:21,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:58:21,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:58:21,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344304976] [2022-12-14 04:58:21,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:21,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:58:21,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:21,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:58:21,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:58:21,441 INFO L87 Difference]: Start difference. First operand 943 states and 1309 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 04:58:21,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:21,554 INFO L93 Difference]: Finished difference Result 1958 states and 2750 transitions. [2022-12-14 04:58:21,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:58:21,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2022-12-14 04:58:21,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:21,561 INFO L225 Difference]: With dead ends: 1958 [2022-12-14 04:58:21,561 INFO L226 Difference]: Without dead ends: 1140 [2022-12-14 04:58:21,563 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-12-14 04:58:21,564 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 36 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:21,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 215 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:58:21,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2022-12-14 04:58:21,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1023. [2022-12-14 04:58:21,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 738 states have (on average 1.3414634146341464) internal successors, (990), 749 states have internal predecessors, (990), 182 states have call successors, (182), 102 states have call predecessors, (182), 102 states have return successors, (249), 172 states have call predecessors, (249), 182 states have call successors, (249) [2022-12-14 04:58:21,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1421 transitions. [2022-12-14 04:58:21,655 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1421 transitions. Word has length 68 [2022-12-14 04:58:21,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:21,655 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 1421 transitions. [2022-12-14 04:58:21,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 04:58:21,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1421 transitions. [2022-12-14 04:58:21,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-14 04:58:21,658 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:21,658 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:58:21,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 04:58:21,658 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:21,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:21,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2040638373, now seen corresponding path program 1 times [2022-12-14 04:58:21,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:21,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982280162] [2022-12-14 04:58:21,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:21,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 04:58:21,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:21,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982280162] [2022-12-14 04:58:21,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982280162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:21,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:58:21,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:58:21,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193874558] [2022-12-14 04:58:21,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:21,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:58:21,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:21,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:58:21,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:58:21,714 INFO L87 Difference]: Start difference. First operand 1023 states and 1421 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-14 04:58:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:21,859 INFO L93 Difference]: Finished difference Result 2544 states and 3583 transitions. [2022-12-14 04:58:21,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:58:21,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 87 [2022-12-14 04:58:21,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:21,864 INFO L225 Difference]: With dead ends: 2544 [2022-12-14 04:58:21,864 INFO L226 Difference]: Without dead ends: 1527 [2022-12-14 04:58:21,866 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-12-14 04:58:21,866 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 73 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:21,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 179 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:58:21,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2022-12-14 04:58:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1514. [2022-12-14 04:58:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1093 states have (on average 1.3211344922232389) internal successors, (1444), 1109 states have internal predecessors, (1444), 267 states have call successors, (267), 153 states have call predecessors, (267), 153 states have return successors, (364), 252 states have call predecessors, (364), 267 states have call successors, (364) [2022-12-14 04:58:21,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2075 transitions. [2022-12-14 04:58:21,967 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2075 transitions. Word has length 87 [2022-12-14 04:58:21,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:21,967 INFO L495 AbstractCegarLoop]: Abstraction has 1514 states and 2075 transitions. [2022-12-14 04:58:21,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-14 04:58:21,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2075 transitions. [2022-12-14 04:58:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 04:58:21,970 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:21,970 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:58:21,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 04:58:21,971 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:21,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:21,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1871456764, now seen corresponding path program 1 times [2022-12-14 04:58:21,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:21,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938865420] [2022-12-14 04:58:21,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:21,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:22,032 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 04:58:22,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:22,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938865420] [2022-12-14 04:58:22,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938865420] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:58:22,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240954619] [2022-12-14 04:58:22,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:22,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:58:22,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:58:22,034 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:58:22,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 04:58:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:22,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 04:58:22,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:58:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 04:58:22,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:58:22,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240954619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:22,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 04:58:22,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-12-14 04:58:22,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337139541] [2022-12-14 04:58:22,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:22,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:58:22,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:22,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:58:22,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:58:22,183 INFO L87 Difference]: Start difference. First operand 1514 states and 2075 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 04:58:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:22,344 INFO L93 Difference]: Finished difference Result 2970 states and 4109 transitions. [2022-12-14 04:58:22,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:58:22,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2022-12-14 04:58:22,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:22,353 INFO L225 Difference]: With dead ends: 2970 [2022-12-14 04:58:22,354 INFO L226 Difference]: Without dead ends: 1855 [2022-12-14 04:58:22,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:58:22,359 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 72 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:22,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 115 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:58:22,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2022-12-14 04:58:22,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1799. [2022-12-14 04:58:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1340 states have (on average 1.3074626865671641) internal successors, (1752), 1353 states have internal predecessors, (1752), 273 states have call successors, (273), 183 states have call predecessors, (273), 185 states have return successors, (369), 263 states have call predecessors, (369), 273 states have call successors, (369) [2022-12-14 04:58:22,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2394 transitions. [2022-12-14 04:58:22,525 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2394 transitions. Word has length 101 [2022-12-14 04:58:22,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:22,525 INFO L495 AbstractCegarLoop]: Abstraction has 1799 states and 2394 transitions. [2022-12-14 04:58:22,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 04:58:22,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2394 transitions. [2022-12-14 04:58:22,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 04:58:22,529 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:22,529 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 04:58:22,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 04:58:22,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:58:22,730 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:22,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:22,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1643529603, now seen corresponding path program 1 times [2022-12-14 04:58:22,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:22,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814734015] [2022-12-14 04:58:22,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:22,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 04:58:22,801 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:22,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814734015] [2022-12-14 04:58:22,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814734015] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:58:22,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818515254] [2022-12-14 04:58:22,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:22,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:58:22,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:58:22,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:58:22,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 04:58:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:22,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 04:58:22,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:58:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 04:58:22,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:58:22,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818515254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:22,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 04:58:22,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-12-14 04:58:22,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496195057] [2022-12-14 04:58:22,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:22,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:58:22,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:22,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:58:22,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:58:22,921 INFO L87 Difference]: Start difference. First operand 1799 states and 2394 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 04:58:23,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:23,138 INFO L93 Difference]: Finished difference Result 3439 states and 4640 transitions. [2022-12-14 04:58:23,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:58:23,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2022-12-14 04:58:23,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:23,145 INFO L225 Difference]: With dead ends: 3439 [2022-12-14 04:58:23,145 INFO L226 Difference]: Without dead ends: 2223 [2022-12-14 04:58:23,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 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-12-14 04:58:23,148 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 51 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:23,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 226 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:58:23,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2022-12-14 04:58:23,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 1928. [2022-12-14 04:58:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1928 states, 1447 states have (on average 1.318590186592951) internal successors, (1908), 1460 states have internal predecessors, (1908), 284 states have call successors, (284), 194 states have call predecessors, (284), 196 states have return successors, (380), 274 states have call predecessors, (380), 284 states have call successors, (380) [2022-12-14 04:58:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2572 transitions. [2022-12-14 04:58:23,282 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2572 transitions. Word has length 101 [2022-12-14 04:58:23,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:23,283 INFO L495 AbstractCegarLoop]: Abstraction has 1928 states and 2572 transitions. [2022-12-14 04:58:23,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 04:58:23,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2572 transitions. [2022-12-14 04:58:23,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 04:58:23,286 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:23,286 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:58:23,292 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 04:58:23,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:58:23,487 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:23,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:23,487 INFO L85 PathProgramCache]: Analyzing trace with hash -860376230, now seen corresponding path program 2 times [2022-12-14 04:58:23,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:23,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771238794] [2022-12-14 04:58:23,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:23,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 04:58:23,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:23,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771238794] [2022-12-14 04:58:23,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771238794] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:58:23,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931408241] [2022-12-14 04:58:23,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 04:58:23,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:58:23,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:58:23,620 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:58:23,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 04:58:23,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 04:58:23,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 04:58:23,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 04:58:23,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:58:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 04:58:23,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:58:23,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931408241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:23,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 04:58:23,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-12-14 04:58:23,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972895052] [2022-12-14 04:58:23,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:23,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:58:23,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:23,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:58:23,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 04:58:23,768 INFO L87 Difference]: Start difference. First operand 1928 states and 2572 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 04:58:24,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:24,057 INFO L93 Difference]: Finished difference Result 3494 states and 4658 transitions. [2022-12-14 04:58:24,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 04:58:24,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-12-14 04:58:24,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:24,063 INFO L225 Difference]: With dead ends: 3494 [2022-12-14 04:58:24,063 INFO L226 Difference]: Without dead ends: 2082 [2022-12-14 04:58:24,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-14 04:58:24,066 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 86 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:24,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 370 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:58:24,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2022-12-14 04:58:24,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 2013. [2022-12-14 04:58:24,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2013 states, 1507 states have (on average 1.3125414731254148) internal successors, (1978), 1526 states have internal predecessors, (1978), 292 states have call successors, (292), 199 states have call predecessors, (292), 213 states have return successors, (406), 288 states have call predecessors, (406), 292 states have call successors, (406) [2022-12-14 04:58:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 2676 transitions. [2022-12-14 04:58:24,209 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 2676 transitions. Word has length 101 [2022-12-14 04:58:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:24,209 INFO L495 AbstractCegarLoop]: Abstraction has 2013 states and 2676 transitions. [2022-12-14 04:58:24,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 04:58:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2676 transitions. [2022-12-14 04:58:24,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 04:58:24,213 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:24,213 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 04:58:24,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 04:58:24,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 04:58:24,418 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:24,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:24,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1733853925, now seen corresponding path program 2 times [2022-12-14 04:58:24,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:24,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722121523] [2022-12-14 04:58:24,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:24,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 04:58:24,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:24,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722121523] [2022-12-14 04:58:24,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722121523] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:58:24,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899332726] [2022-12-14 04:58:24,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 04:58:24,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:58:24,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:58:24,528 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:58:24,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 04:58:24,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 04:58:24,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 04:58:24,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 04:58:24,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:58:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 04:58:24,625 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:58:24,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899332726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:24,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 04:58:24,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-12-14 04:58:24,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260866038] [2022-12-14 04:58:24,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:24,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:58:24,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:24,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:58:24,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 04:58:24,627 INFO L87 Difference]: Start difference. First operand 2013 states and 2676 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 04:58:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:24,849 INFO L93 Difference]: Finished difference Result 3400 states and 4713 transitions. [2022-12-14 04:58:24,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:58:24,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 101 [2022-12-14 04:58:24,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:24,855 INFO L225 Difference]: With dead ends: 3400 [2022-12-14 04:58:24,855 INFO L226 Difference]: Without dead ends: 2023 [2022-12-14 04:58:24,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 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-12-14 04:58:24,859 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 82 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:24,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 222 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:58:24,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2022-12-14 04:58:25,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 2007. [2022-12-14 04:58:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2007 states, 1501 states have (on average 1.2764823451032645) internal successors, (1916), 1520 states have internal predecessors, (1916), 292 states have call successors, (292), 199 states have call predecessors, (292), 213 states have return successors, (406), 288 states have call predecessors, (406), 292 states have call successors, (406) [2022-12-14 04:58:25,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2614 transitions. [2022-12-14 04:58:25,031 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2614 transitions. Word has length 101 [2022-12-14 04:58:25,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:25,031 INFO L495 AbstractCegarLoop]: Abstraction has 2007 states and 2614 transitions. [2022-12-14 04:58:25,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 04:58:25,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2614 transitions. [2022-12-14 04:58:25,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 04:58:25,035 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:25,035 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:58:25,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 04:58:25,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 04:58:25,237 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:25,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:25,238 INFO L85 PathProgramCache]: Analyzing trace with hash -239673315, now seen corresponding path program 1 times [2022-12-14 04:58:25,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:25,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280427702] [2022-12-14 04:58:25,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:25,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:25,473 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 04:58:25,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:25,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280427702] [2022-12-14 04:58:25,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280427702] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:58:25,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146971692] [2022-12-14 04:58:25,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:25,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:58:25,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:58:25,475 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:58:25,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 04:58:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:25,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 04:58:25,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:58:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 04:58:25,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:58:25,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146971692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:25,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 04:58:25,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-12-14 04:58:25,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18065731] [2022-12-14 04:58:25,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:25,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:58:25,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:25,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:58:25,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 04:58:25,594 INFO L87 Difference]: Start difference. First operand 2007 states and 2614 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 04:58:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:25,823 INFO L93 Difference]: Finished difference Result 3862 states and 5182 transitions. [2022-12-14 04:58:25,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:58:25,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2022-12-14 04:58:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:25,831 INFO L225 Difference]: With dead ends: 3862 [2022-12-14 04:58:25,831 INFO L226 Difference]: Without dead ends: 2408 [2022-12-14 04:58:25,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 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-12-14 04:58:25,834 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 76 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:25,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 234 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:58:25,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2022-12-14 04:58:25,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2346. [2022-12-14 04:58:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 1766 states have (on average 1.2621744054360136) internal successors, (2229), 1788 states have internal predecessors, (2229), 335 states have call successors, (335), 232 states have call predecessors, (335), 244 states have return successors, (484), 326 states have call predecessors, (484), 335 states have call successors, (484) [2022-12-14 04:58:25,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 3048 transitions. [2022-12-14 04:58:25,994 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 3048 transitions. Word has length 101 [2022-12-14 04:58:25,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:25,995 INFO L495 AbstractCegarLoop]: Abstraction has 2346 states and 3048 transitions. [2022-12-14 04:58:25,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 04:58:25,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 3048 transitions. [2022-12-14 04:58:25,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-14 04:58:25,998 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:25,998 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:58:26,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 04:58:26,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:58:26,199 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:26,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:26,199 INFO L85 PathProgramCache]: Analyzing trace with hash -414051273, now seen corresponding path program 1 times [2022-12-14 04:58:26,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:26,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113337045] [2022-12-14 04:58:26,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:26,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 04:58:26,298 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:26,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113337045] [2022-12-14 04:58:26,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113337045] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:58:26,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432473982] [2022-12-14 04:58:26,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:26,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:58:26,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:58:26,300 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:58:26,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 04:58:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:26,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 04:58:26,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:58:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 04:58:26,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:58:26,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432473982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:26,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 04:58:26,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-12-14 04:58:26,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566503340] [2022-12-14 04:58:26,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:26,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:58:26,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:26,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:58:26,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 04:58:26,419 INFO L87 Difference]: Start difference. First operand 2346 states and 3048 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 04:58:26,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:26,692 INFO L93 Difference]: Finished difference Result 5495 states and 7182 transitions. [2022-12-14 04:58:26,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:58:26,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 100 [2022-12-14 04:58:26,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:26,704 INFO L225 Difference]: With dead ends: 5495 [2022-12-14 04:58:26,704 INFO L226 Difference]: Without dead ends: 3195 [2022-12-14 04:58:26,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 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-12-14 04:58:26,709 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 40 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:26,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 187 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:58:26,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2022-12-14 04:58:26,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 2586. [2022-12-14 04:58:26,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2586 states, 1964 states have (on average 1.269857433808554) internal successors, (2494), 1987 states have internal predecessors, (2494), 356 states have call successors, (356), 253 states have call predecessors, (356), 265 states have return successors, (505), 346 states have call predecessors, (505), 356 states have call successors, (505) [2022-12-14 04:58:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 3355 transitions. [2022-12-14 04:58:26,915 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 3355 transitions. Word has length 100 [2022-12-14 04:58:26,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:26,915 INFO L495 AbstractCegarLoop]: Abstraction has 2586 states and 3355 transitions. [2022-12-14 04:58:26,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 04:58:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3355 transitions. [2022-12-14 04:58:26,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 04:58:26,920 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:26,920 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:58:26,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 04:58:27,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 04:58:27,122 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:27,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:27,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1062037998, now seen corresponding path program 1 times [2022-12-14 04:58:27,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:27,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190584952] [2022-12-14 04:58:27,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:27,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:27,505 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 04:58:27,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:27,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190584952] [2022-12-14 04:58:27,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190584952] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:58:27,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839036949] [2022-12-14 04:58:27,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:27,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:58:27,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:58:27,507 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:58:27,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 04:58:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:27,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 04:58:27,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:58:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 04:58:27,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:58:27,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839036949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:27,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 04:58:27,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2022-12-14 04:58:27,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966077487] [2022-12-14 04:58:27,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:27,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 04:58:27,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:27,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 04:58:27,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-12-14 04:58:27,723 INFO L87 Difference]: Start difference. First operand 2586 states and 3355 transitions. Second operand has 6 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 04:58:28,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:28,108 INFO L93 Difference]: Finished difference Result 4458 states and 5979 transitions. [2022-12-14 04:58:28,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 04:58:28,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-12-14 04:58:28,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:28,116 INFO L225 Difference]: With dead ends: 4458 [2022-12-14 04:58:28,116 INFO L226 Difference]: Without dead ends: 2687 [2022-12-14 04:58:28,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-12-14 04:58:28,120 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 111 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:28,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 168 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:58:28,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2022-12-14 04:58:28,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2671. [2022-12-14 04:58:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2671 states, 2039 states have (on average 1.2452182442373712) internal successors, (2539), 2062 states have internal predecessors, (2539), 358 states have call successors, (358), 261 states have call predecessors, (358), 273 states have return successors, (508), 348 states have call predecessors, (508), 358 states have call successors, (508) [2022-12-14 04:58:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 3405 transitions. [2022-12-14 04:58:28,359 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 3405 transitions. Word has length 101 [2022-12-14 04:58:28,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:28,359 INFO L495 AbstractCegarLoop]: Abstraction has 2671 states and 3405 transitions. [2022-12-14 04:58:28,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 04:58:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 3405 transitions. [2022-12-14 04:58:28,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 04:58:28,362 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:28,362 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:58:28,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 04:58:28,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 04:58:28,564 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:28,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:28,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1778337172, now seen corresponding path program 1 times [2022-12-14 04:58:28,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:28,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133944715] [2022-12-14 04:58:28,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:28,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:28,729 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 04:58:28,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:28,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133944715] [2022-12-14 04:58:28,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133944715] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:58:28,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782363603] [2022-12-14 04:58:28,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:28,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:58:28,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:58:28,731 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:58:28,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 04:58:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:28,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 04:58:28,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:58:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 04:58:28,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:58:28,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782363603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:28,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 04:58:28,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-12-14 04:58:28,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283726744] [2022-12-14 04:58:28,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:28,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:58:28,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:28,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:58:28,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:58:28,837 INFO L87 Difference]: Start difference. First operand 2671 states and 3405 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 04:58:29,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:29,134 INFO L93 Difference]: Finished difference Result 4281 states and 5436 transitions. [2022-12-14 04:58:29,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:58:29,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2022-12-14 04:58:29,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:29,142 INFO L225 Difference]: With dead ends: 4281 [2022-12-14 04:58:29,142 INFO L226 Difference]: Without dead ends: 3044 [2022-12-14 04:58:29,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 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-12-14 04:58:29,146 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 42 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:29,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 217 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 04:58:29,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2022-12-14 04:58:29,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 2839. [2022-12-14 04:58:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2839 states, 2175 states have (on average 1.2501149425287357) internal successors, (2719), 2198 states have internal predecessors, (2719), 374 states have call successors, (374), 277 states have call predecessors, (374), 289 states have return successors, (524), 364 states have call predecessors, (524), 374 states have call successors, (524) [2022-12-14 04:58:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 3617 transitions. [2022-12-14 04:58:29,385 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 3617 transitions. Word has length 101 [2022-12-14 04:58:29,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:29,385 INFO L495 AbstractCegarLoop]: Abstraction has 2839 states and 3617 transitions. [2022-12-14 04:58:29,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 04:58:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 3617 transitions. [2022-12-14 04:58:29,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-14 04:58:29,388 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:29,388 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:58:29,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 04:58:29,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:58:29,590 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:29,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:29,591 INFO L85 PathProgramCache]: Analyzing trace with hash -483777546, now seen corresponding path program 1 times [2022-12-14 04:58:29,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:29,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725316960] [2022-12-14 04:58:29,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:29,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 04:58:29,684 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:29,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725316960] [2022-12-14 04:58:29,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725316960] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:58:29,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532623763] [2022-12-14 04:58:29,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:29,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:58:29,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:58:29,685 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:58:29,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 04:58:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:29,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 04:58:29,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:58:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 04:58:29,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:58:29,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532623763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:29,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 04:58:29,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-12-14 04:58:29,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688581062] [2022-12-14 04:58:29,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:29,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:58:29,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:29,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:58:29,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 04:58:29,844 INFO L87 Difference]: Start difference. First operand 2839 states and 3617 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2022-12-14 04:58:30,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:30,194 INFO L93 Difference]: Finished difference Result 6355 states and 8113 transitions. [2022-12-14 04:58:30,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:58:30,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 102 [2022-12-14 04:58:30,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:30,203 INFO L225 Difference]: With dead ends: 6355 [2022-12-14 04:58:30,203 INFO L226 Difference]: Without dead ends: 3844 [2022-12-14 04:58:30,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 04:58:30,208 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 111 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:30,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 242 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:58:30,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3844 states. [2022-12-14 04:58:30,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3844 to 3177. [2022-12-14 04:58:30,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3177 states, 2485 states have (on average 1.2225352112676056) internal successors, (3038), 2507 states have internal predecessors, (3038), 373 states have call successors, (373), 305 states have call predecessors, (373), 318 states have return successors, (548), 365 states have call predecessors, (548), 373 states have call successors, (548) [2022-12-14 04:58:30,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 3959 transitions. [2022-12-14 04:58:30,449 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 3959 transitions. Word has length 102 [2022-12-14 04:58:30,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:30,449 INFO L495 AbstractCegarLoop]: Abstraction has 3177 states and 3959 transitions. [2022-12-14 04:58:30,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2022-12-14 04:58:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 3959 transitions. [2022-12-14 04:58:30,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 04:58:30,452 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:30,452 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 04:58:30,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 04:58:30,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 04:58:30,654 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:30,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:30,655 INFO L85 PathProgramCache]: Analyzing trace with hash -887872860, now seen corresponding path program 1 times [2022-12-14 04:58:30,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:30,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663522339] [2022-12-14 04:58:30,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:30,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 04:58:30,824 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:30,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663522339] [2022-12-14 04:58:30,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663522339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:30,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:58:30,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 04:58:30,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437891817] [2022-12-14 04:58:30,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:30,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 04:58:30,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:30,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 04:58:30,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:58:30,826 INFO L87 Difference]: Start difference. First operand 3177 states and 3959 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 04:58:31,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:31,425 INFO L93 Difference]: Finished difference Result 7984 states and 9969 transitions. [2022-12-14 04:58:31,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 04:58:31,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 103 [2022-12-14 04:58:31,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:31,437 INFO L225 Difference]: With dead ends: 7984 [2022-12-14 04:58:31,437 INFO L226 Difference]: Without dead ends: 4156 [2022-12-14 04:58:31,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 04:58:31,442 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 75 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:31,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 342 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:58:31,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4156 states. [2022-12-14 04:58:31,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4156 to 4038. [2022-12-14 04:58:31,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4038 states, 3118 states have (on average 1.206863373957665) internal successors, (3763), 3143 states have internal predecessors, (3763), 503 states have call successors, (503), 407 states have call predecessors, (503), 416 states have return successors, (726), 488 states have call predecessors, (726), 503 states have call successors, (726) [2022-12-14 04:58:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4038 states to 4038 states and 4992 transitions. [2022-12-14 04:58:31,759 INFO L78 Accepts]: Start accepts. Automaton has 4038 states and 4992 transitions. Word has length 103 [2022-12-14 04:58:31,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:31,759 INFO L495 AbstractCegarLoop]: Abstraction has 4038 states and 4992 transitions. [2022-12-14 04:58:31,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 04:58:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 4038 states and 4992 transitions. [2022-12-14 04:58:31,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 04:58:31,762 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:31,762 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 04:58:31,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 04:58:31,763 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:31,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:31,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1687768684, now seen corresponding path program 1 times [2022-12-14 04:58:31,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:31,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550022365] [2022-12-14 04:58:31,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:31,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 04:58:31,871 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:31,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550022365] [2022-12-14 04:58:31,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550022365] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:58:31,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104198388] [2022-12-14 04:58:31,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:31,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:58:31,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:58:31,873 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:58:31,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 04:58:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:31,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 04:58:31,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:58:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:58:31,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:58:31,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104198388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:58:31,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 04:58:31,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2022-12-14 04:58:31,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426130962] [2022-12-14 04:58:31,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:58:31,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 04:58:31,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:58:31,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 04:58:31,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:58:31,997 INFO L87 Difference]: Start difference. First operand 4038 states and 4992 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-12-14 04:58:32,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:58:32,491 INFO L93 Difference]: Finished difference Result 6798 states and 8364 transitions. [2022-12-14 04:58:32,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 04:58:32,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 103 [2022-12-14 04:58:32,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:58:32,500 INFO L225 Difference]: With dead ends: 6798 [2022-12-14 04:58:32,500 INFO L226 Difference]: Without dead ends: 4019 [2022-12-14 04:58:32,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 04:58:32,504 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 162 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:58:32,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 355 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:58:32,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019 states. [2022-12-14 04:58:32,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4019 to 3803. [2022-12-14 04:58:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3803 states, 2933 states have (on average 1.1868394135697238) internal successors, (3481), 2961 states have internal predecessors, (3481), 471 states have call successors, (471), 384 states have call predecessors, (471), 398 states have return successors, (657), 458 states have call predecessors, (657), 471 states have call successors, (657) [2022-12-14 04:58:32,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3803 states to 3803 states and 4609 transitions. [2022-12-14 04:58:32,881 INFO L78 Accepts]: Start accepts. Automaton has 3803 states and 4609 transitions. Word has length 103 [2022-12-14 04:58:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:58:32,881 INFO L495 AbstractCegarLoop]: Abstraction has 3803 states and 4609 transitions. [2022-12-14 04:58:32,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-12-14 04:58:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 3803 states and 4609 transitions. [2022-12-14 04:58:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-14 04:58:32,883 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:58:32,884 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 04:58:32,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-14 04:58:33,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:58:33,084 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:58:33,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:58:33,084 INFO L85 PathProgramCache]: Analyzing trace with hash 747124345, now seen corresponding path program 1 times [2022-12-14 04:58:33,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:58:33,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975129452] [2022-12-14 04:58:33,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:33,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:58:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 04:58:33,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:58:33,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975129452] [2022-12-14 04:58:33,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975129452] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:58:33,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905490390] [2022-12-14 04:58:33,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:58:33,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:58:33,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:58:33,345 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:58:33,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 04:58:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:58:33,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 04:58:33,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:58:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 04:58:33,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:58:33,682 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-12-14 04:58:33,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905490390] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:58:33,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [125598778] [2022-12-14 04:58:33,700 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2022-12-14 04:58:33,701 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:58:33,704 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 04:58:33,709 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 04:58:33,709 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 04:58:43,335 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 189 for LOIs [2022-12-14 04:58:47,938 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 61 for LOIs [2022-12-14 04:58:47,944 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 195 for LOIs [2022-12-14 04:58:48,001 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 81 for LOIs [2022-12-14 04:58:48,162 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 61 for LOIs [2022-12-14 04:58:48,649 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 219 for LOIs [2022-12-14 04:58:49,283 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 04:59:09,355 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '146038#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (= ~slow_clk_edge~0 0) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (<= ~t1_pc~0 0) (<= |#NULL.offset| 0) (<= ~q_req_up~0 0) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~t~0 0) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (<= 1 ~m_i~0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (<= 0 ~q_ev~0) (= 0 ~t2_pc~0) (<= ~m_i~0 1) (= ~q_read_ev~0 0) (= ~m_st~0 1) (<= 0 ~q_req_up~0) (<= ~q_ev~0 0) (= ~a_t~0 0) (<= 0 |#NULL.offset|) (<= 0 ~fast_clk_edge~0) (<= ~fast_clk_edge~0 0) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-12-14 04:59:09,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 04:59:09,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:59:09,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 6] total 21 [2022-12-14 04:59:09,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938322004] [2022-12-14 04:59:09,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:59:09,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 04:59:09,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:59:09,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 04:59:09,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=4113, Unknown=0, NotChecked=0, Total=4556 [2022-12-14 04:59:09,359 INFO L87 Difference]: Start difference. First operand 3803 states and 4609 transitions. Second operand has 21 states, 17 states have (on average 7.764705882352941) internal successors, (132), 19 states have internal predecessors, (132), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-12-14 04:59:11,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:11,321 INFO L93 Difference]: Finished difference Result 8019 states and 9712 transitions. [2022-12-14 04:59:11,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-12-14 04:59:11,322 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 7.764705882352941) internal successors, (132), 19 states have internal predecessors, (132), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) Word has length 109 [2022-12-14 04:59:11,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:11,329 INFO L225 Difference]: With dead ends: 8019 [2022-12-14 04:59:11,329 INFO L226 Difference]: Without dead ends: 4213 [2022-12-14 04:59:11,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 302 SyntacticMatches, 17 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8677 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=1392, Invalid=18068, Unknown=0, NotChecked=0, Total=19460 [2022-12-14 04:59:11,336 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 777 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 1890 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 2209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:11,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 1914 Invalid, 2209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1890 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 04:59:11,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2022-12-14 04:59:11,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 3133. [2022-12-14 04:59:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3133 states, 2451 states have (on average 1.1623827009383925) internal successors, (2849), 2487 states have internal predecessors, (2849), 343 states have call successors, (343), 307 states have call predecessors, (343), 338 states have return successors, (449), 338 states have call predecessors, (449), 343 states have call successors, (449) [2022-12-14 04:59:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 3641 transitions. [2022-12-14 04:59:11,608 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 3641 transitions. Word has length 109 [2022-12-14 04:59:11,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:11,608 INFO L495 AbstractCegarLoop]: Abstraction has 3133 states and 3641 transitions. [2022-12-14 04:59:11,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 7.764705882352941) internal successors, (132), 19 states have internal predecessors, (132), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-12-14 04:59:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 3641 transitions. [2022-12-14 04:59:11,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-14 04:59:11,611 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:11,611 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:59:11,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 04:59:11,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:59:11,811 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:59:11,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:11,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1767262510, now seen corresponding path program 1 times [2022-12-14 04:59:11,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:59:11,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194708742] [2022-12-14 04:59:11,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:11,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:59:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:12,067 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 04:59:12,067 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:59:12,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194708742] [2022-12-14 04:59:12,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194708742] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:59:12,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620798100] [2022-12-14 04:59:12,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:12,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:59:12,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:59:12,069 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:59:12,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 04:59:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:12,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 04:59:12,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 04:59:12,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:59:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-12-14 04:59:12,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620798100] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:59:12,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [8943702] [2022-12-14 04:59:12,473 INFO L159 IcfgInterpreter]: Started Sifa with 66 locations of interest [2022-12-14 04:59:12,473 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:59:12,474 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 04:59:12,474 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 04:59:12,474 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 04:59:18,313 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 199 for LOIs [2022-12-14 04:59:23,808 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 73 for LOIs [2022-12-14 04:59:23,816 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 205 for LOIs [2022-12-14 04:59:23,890 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 82 for LOIs [2022-12-14 04:59:23,970 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 73 for LOIs [2022-12-14 04:59:24,330 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 229 for LOIs [2022-12-14 04:59:28,173 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 04:59:44,720 WARN L233 SmtUtils]: Spent 5.63s on a formula simplification. DAG size of input: 367 DAG size of output: 226 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 04:59:55,185 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '162493#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (<= ~t1_pc~0 1) (= ~p_num_write~0 0) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (= ~slow_clk_edge~0 0) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (= ~q_req_up~0 0) (= ~fast_clk_edge~0 0) (= ~q_ev~0 0) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~t~0 0) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= 0 ~t2_pc~0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-12-14 04:59:55,185 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 04:59:55,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 04:59:55,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 6] total 22 [2022-12-14 04:59:55,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233484529] [2022-12-14 04:59:55,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 04:59:55,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 04:59:55,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:59:55,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 04:59:55,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=4692, Unknown=0, NotChecked=0, Total=5112 [2022-12-14 04:59:55,188 INFO L87 Difference]: Start difference. First operand 3133 states and 3641 transitions. Second operand has 22 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-12-14 04:59:57,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:59:57,788 INFO L93 Difference]: Finished difference Result 5956 states and 6977 transitions. [2022-12-14 04:59:57,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-12-14 04:59:57,789 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) Word has length 112 [2022-12-14 04:59:57,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:59:57,795 INFO L225 Difference]: With dead ends: 5956 [2022-12-14 04:59:57,795 INFO L226 Difference]: Without dead ends: 2966 [2022-12-14 04:59:57,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 315 SyntacticMatches, 12 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13808 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=1821, Invalid=28979, Unknown=0, NotChecked=0, Total=30800 [2022-12-14 04:59:57,810 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 1080 mSDsluCounter, 1519 mSDsCounter, 0 mSdLazyCounter, 2055 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 2537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 2055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 04:59:57,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 1682 Invalid, 2537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 2055 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 04:59:57,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2966 states. [2022-12-14 04:59:58,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2966 to 2328. [2022-12-14 04:59:58,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2328 states, 1828 states have (on average 1.1564551422319476) internal successors, (2114), 1857 states have internal predecessors, (2114), 245 states have call successors, (245), 225 states have call predecessors, (245), 254 states have return successors, (331), 245 states have call predecessors, (331), 245 states have call successors, (331) [2022-12-14 04:59:58,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 2690 transitions. [2022-12-14 04:59:58,021 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 2690 transitions. Word has length 112 [2022-12-14 04:59:58,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:59:58,021 INFO L495 AbstractCegarLoop]: Abstraction has 2328 states and 2690 transitions. [2022-12-14 04:59:58,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-12-14 04:59:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 2690 transitions. [2022-12-14 04:59:58,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-12-14 04:59:58,022 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:59:58,022 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 04:59:58,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 04:59:58,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:59:58,223 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 04:59:58,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:59:58,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1116193988, now seen corresponding path program 1 times [2022-12-14 04:59:58,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:59:58,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085610560] [2022-12-14 04:59:58,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:58,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:59:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 04:59:58,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:59:58,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085610560] [2022-12-14 04:59:58,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085610560] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 04:59:58,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208747018] [2022-12-14 04:59:58,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:59:58,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 04:59:58,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:59:58,580 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 04:59:58,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 04:59:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:59:58,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-14 04:59:58,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:59:58,848 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 04:59:58,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 04:59:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-12-14 04:59:59,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208747018] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 04:59:59,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1721916799] [2022-12-14 04:59:59,238 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2022-12-14 04:59:59,238 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 04:59:59,239 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 04:59:59,239 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 04:59:59,239 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:00:12,873 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 130 for LOIs [2022-12-14 05:00:12,904 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 130 for LOIs [2022-12-14 05:00:12,931 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 151 for LOIs [2022-12-14 05:00:12,955 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 140 for LOIs [2022-12-14 05:00:13,183 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 132 for LOIs [2022-12-14 05:00:13,567 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 151 for LOIs [2022-12-14 05:00:13,603 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:00:29,807 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '174929#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (<= ~t1_pc~0 1) (= ~p_num_write~0 0) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (= ~slow_clk_edge~0 0) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (<= 0 ~t2_pc~0) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (= ~q_req_up~0 0) (= ~fast_clk_edge~0 0) (= ~q_ev~0 0) (= ~m_pc~0 1) (<= ~t2_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~t~0 0) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 ~t1_pc~0) (= |#NULL.base| 0))' at error location [2022-12-14 05:00:29,807 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 05:00:29,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:00:29,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 12] total 32 [2022-12-14 05:00:29,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241104820] [2022-12-14 05:00:29,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:00:29,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 05:00:29,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:00:29,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 05:00:29,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=557, Invalid=6249, Unknown=0, NotChecked=0, Total=6806 [2022-12-14 05:00:29,810 INFO L87 Difference]: Start difference. First operand 2328 states and 2690 transitions. Second operand has 32 states, 20 states have (on average 8.1) internal successors, (162), 25 states have internal predecessors, (162), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) [2022-12-14 05:00:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:00:33,313 INFO L93 Difference]: Finished difference Result 6737 states and 8021 transitions. [2022-12-14 05:00:33,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-12-14 05:00:33,313 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 20 states have (on average 8.1) internal successors, (162), 25 states have internal predecessors, (162), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) Word has length 115 [2022-12-14 05:00:33,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:00:33,321 INFO L225 Difference]: With dead ends: 6737 [2022-12-14 05:00:33,321 INFO L226 Difference]: Without dead ends: 5053 [2022-12-14 05:00:33,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 280 SyntacticMatches, 22 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10749 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=2630, Invalid=21550, Unknown=0, NotChecked=0, Total=24180 [2022-12-14 05:00:33,327 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 2361 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 2961 mSolverCounterSat, 1584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2370 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 4545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1584 IncrementalHoareTripleChecker+Valid, 2961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:00:33,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2370 Valid, 937 Invalid, 4545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1584 Valid, 2961 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 05:00:33,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5053 states. [2022-12-14 05:00:33,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5053 to 2015. [2022-12-14 05:00:33,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 1578 states have (on average 1.1546261089987326) internal successors, (1822), 1591 states have internal predecessors, (1822), 226 states have call successors, (226), 208 states have call predecessors, (226), 210 states have return successors, (268), 215 states have call predecessors, (268), 226 states have call successors, (268) [2022-12-14 05:00:33,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 2316 transitions. [2022-12-14 05:00:33,586 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 2316 transitions. Word has length 115 [2022-12-14 05:00:33,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:00:33,586 INFO L495 AbstractCegarLoop]: Abstraction has 2015 states and 2316 transitions. [2022-12-14 05:00:33,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 20 states have (on average 8.1) internal successors, (162), 25 states have internal predecessors, (162), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) [2022-12-14 05:00:33,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 2316 transitions. [2022-12-14 05:00:33,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-14 05:00:33,587 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:00:33,588 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-14 05:00:33,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 05:00:33,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 05:00:33,788 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:00:33,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:00:33,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1594817002, now seen corresponding path program 1 times [2022-12-14 05:00:33,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:00:33,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140681314] [2022-12-14 05:00:33,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:00:33,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:00:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:00:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-14 05:00:33,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:00:33,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140681314] [2022-12-14 05:00:33,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140681314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:00:33,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:00:33,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 05:00:33,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935330393] [2022-12-14 05:00:33,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:00:33,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 05:00:33,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:00:33,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 05:00:33,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:00:33,915 INFO L87 Difference]: Start difference. First operand 2015 states and 2316 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-12-14 05:00:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:00:34,671 INFO L93 Difference]: Finished difference Result 5661 states and 6543 transitions. [2022-12-14 05:00:34,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:00:34,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 127 [2022-12-14 05:00:34,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:00:34,677 INFO L225 Difference]: With dead ends: 5661 [2022-12-14 05:00:34,677 INFO L226 Difference]: Without dead ends: 4346 [2022-12-14 05:00:34,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:00:34,679 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 227 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 05:00:34,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 546 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 05:00:34,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2022-12-14 05:00:35,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 2978. [2022-12-14 05:00:35,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2978 states, 2319 states have (on average 1.1604139715394566) internal successors, (2691), 2337 states have internal predecessors, (2691), 341 states have call successors, (341), 307 states have call predecessors, (341), 317 states have return successors, (399), 333 states have call predecessors, (399), 341 states have call successors, (399) [2022-12-14 05:00:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2978 states to 2978 states and 3431 transitions. [2022-12-14 05:00:35,062 INFO L78 Accepts]: Start accepts. Automaton has 2978 states and 3431 transitions. Word has length 127 [2022-12-14 05:00:35,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:00:35,062 INFO L495 AbstractCegarLoop]: Abstraction has 2978 states and 3431 transitions. [2022-12-14 05:00:35,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-12-14 05:00:35,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2978 states and 3431 transitions. [2022-12-14 05:00:35,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-12-14 05:00:35,064 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:00:35,064 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:00:35,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 05:00:35,064 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:00:35,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:00:35,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1269204634, now seen corresponding path program 1 times [2022-12-14 05:00:35,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:00:35,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693849179] [2022-12-14 05:00:35,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:00:35,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:00:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:00:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 72 proven. 11 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-12-14 05:00:35,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:00:35,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693849179] [2022-12-14 05:00:35,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693849179] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:00:35,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922358373] [2022-12-14 05:00:35,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:00:35,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:00:35,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:00:35,142 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:00:35,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 05:00:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:00:35,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 05:00:35,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:00:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-12-14 05:00:35,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:00:35,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922358373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:00:35,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:00:35,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-14 05:00:35,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273794866] [2022-12-14 05:00:35,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:00:35,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:00:35,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:00:35,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:00:35,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:00:35,271 INFO L87 Difference]: Start difference. First operand 2978 states and 3431 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-14 05:00:35,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:00:35,564 INFO L93 Difference]: Finished difference Result 4337 states and 4969 transitions. [2022-12-14 05:00:35,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:00:35,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 158 [2022-12-14 05:00:35,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:00:35,569 INFO L225 Difference]: With dead ends: 4337 [2022-12-14 05:00:35,569 INFO L226 Difference]: Without dead ends: 1812 [2022-12-14 05:00:35,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 05:00:35,572 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 54 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:00:35,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 329 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:00:35,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2022-12-14 05:00:35,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1620. [2022-12-14 05:00:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1620 states, 1263 states have (on average 1.1282660332541568) internal successors, (1425), 1274 states have internal predecessors, (1425), 180 states have call successors, (180), 164 states have call predecessors, (180), 176 states have return successors, (212), 181 states have call predecessors, (212), 180 states have call successors, (212) [2022-12-14 05:00:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 1817 transitions. [2022-12-14 05:00:35,780 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 1817 transitions. Word has length 158 [2022-12-14 05:00:35,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:00:35,780 INFO L495 AbstractCegarLoop]: Abstraction has 1620 states and 1817 transitions. [2022-12-14 05:00:35,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-14 05:00:35,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 1817 transitions. [2022-12-14 05:00:35,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-14 05:00:35,782 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:00:35,782 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:00:35,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 05:00:35,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-14 05:00:35,983 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:00:35,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:00:35,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1048183371, now seen corresponding path program 1 times [2022-12-14 05:00:35,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:00:35,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703666958] [2022-12-14 05:00:35,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:00:35,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:00:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:00:36,067 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-12-14 05:00:36,067 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:00:36,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703666958] [2022-12-14 05:00:36,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703666958] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:00:36,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642736445] [2022-12-14 05:00:36,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:00:36,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:00:36,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:00:36,069 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:00:36,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 05:00:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:00:36,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 05:00:36,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:00:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-14 05:00:36,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:00:36,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642736445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:00:36,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:00:36,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-14 05:00:36,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498912783] [2022-12-14 05:00:36,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:00:36,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:00:36,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:00:36,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:00:36,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:00:36,184 INFO L87 Difference]: Start difference. First operand 1620 states and 1817 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-14 05:00:36,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:00:36,471 INFO L93 Difference]: Finished difference Result 2973 states and 3336 transitions. [2022-12-14 05:00:36,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:00:36,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 159 [2022-12-14 05:00:36,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:00:36,473 INFO L225 Difference]: With dead ends: 2973 [2022-12-14 05:00:36,473 INFO L226 Difference]: Without dead ends: 1631 [2022-12-14 05:00:36,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:00:36,476 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 68 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:00:36,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 376 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 05:00:36,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-12-14 05:00:36,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1584. [2022-12-14 05:00:36,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1231 states have (on average 1.1039805036555645) internal successors, (1359), 1243 states have internal predecessors, (1359), 178 states have call successors, (178), 160 states have call predecessors, (178), 174 states have return successors, (212), 180 states have call predecessors, (212), 178 states have call successors, (212) [2022-12-14 05:00:36,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 1749 transitions. [2022-12-14 05:00:36,686 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 1749 transitions. Word has length 159 [2022-12-14 05:00:36,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:00:36,687 INFO L495 AbstractCegarLoop]: Abstraction has 1584 states and 1749 transitions. [2022-12-14 05:00:36,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-14 05:00:36,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 1749 transitions. [2022-12-14 05:00:36,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-14 05:00:36,688 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:00:36,688 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:00:36,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 05:00:36,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:00:36,890 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 05:00:36,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:00:36,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1030181838, now seen corresponding path program 1 times [2022-12-14 05:00:36,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:00:36,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863741199] [2022-12-14 05:00:36,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:00:36,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:00:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:00:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 89 proven. 15 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-12-14 05:00:37,040 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:00:37,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863741199] [2022-12-14 05:00:37,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863741199] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:00:37,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900635657] [2022-12-14 05:00:37,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:00:37,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:00:37,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:00:37,042 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:00:37,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 05:00:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:00:37,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 05:00:37,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:00:37,162 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 05:00:37,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:00:37,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900635657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:00:37,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:00:37,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2022-12-14 05:00:37,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899865169] [2022-12-14 05:00:37,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:00:37,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 05:00:37,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:00:37,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 05:00:37,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:00:37,164 INFO L87 Difference]: Start difference. First operand 1584 states and 1749 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-12-14 05:00:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:00:37,456 INFO L93 Difference]: Finished difference Result 2048 states and 2262 transitions. [2022-12-14 05:00:37,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 05:00:37,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 160 [2022-12-14 05:00:37,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:00:37,457 INFO L225 Difference]: With dead ends: 2048 [2022-12-14 05:00:37,458 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 05:00:37,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 05:00:37,459 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 144 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:00:37,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 207 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:00:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 05:00:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 05:00:37,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:00:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 05:00:37,460 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 160 [2022-12-14 05:00:37,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:00:37,460 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 05:00:37,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-12-14 05:00:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 05:00:37,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 05:00:37,462 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-14 05:00:37,462 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-12-14 05:00:37,467 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 05:00:37,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-14 05:00:37,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 05:00:57,475 WARN L233 SmtUtils]: Spent 14.07s on a formula simplification. DAG size of input: 516 DAG size of output: 466 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-14 05:01:19,656 WARN L233 SmtUtils]: Spent 14.04s on a formula simplification. DAG size of input: 516 DAG size of output: 466 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-14 05:02:09,442 WARN L233 SmtUtils]: Spent 5.55s on a formula simplification. DAG size of input: 597 DAG size of output: 191 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 05:02:39,270 WARN L233 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 655 DAG size of output: 171 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 05:02:39,274 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 1029 1039) no Hoare annotation was computed. [2022-12-14 05:02:39,274 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 1029 1039) no Hoare annotation was computed. [2022-12-14 05:02:39,275 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 1029 1039) the Hoare annotation is: (let ((.cse39 (= 0 ~t2_st~0)) (.cse0 (+ ~local~0 1)) (.cse14 (= |old(~m_st~0)| 0)) (.cse28 (= ~m_pc~0 1)) (.cse41 (= ~t1_pc~0 1)) (.cse42 (<= 2 ~E_1~0)) (.cse16 (= ~t1_i~0 1)) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse43 (= ~t2_pc~0 1)) (.cse21 (= ~t2_i~0 1)) (.cse22 (= ~c_dr_pc~0 0)) (.cse18 (= ~m_st~0 |old(~m_st~0)|)) (.cse20 (= |old(~t2_st~0)| ~t2_st~0)) (.cse38 (= ~t1_st~0 0))) (let ((.cse27 (and .cse18 .cse20 .cse38)) (.cse3 (and .cse41 .cse42 .cse16 .cse17 .cse18 .cse19 .cse20 .cse43 .cse21 .cse22)) (.cse25 (not (= 2 |old(~t2_st~0)|))) (.cse29 (and .cse41 .cse42 .cse16 .cse17 (not .cse28) .cse18 .cse19 .cse20 .cse43 .cse21 .cse22)) (.cse9 (not .cse43)) (.cse10 (not .cse42)) (.cse12 (= ~E_M~0 1)) (.cse31 (and (not .cse14) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse32 (not (= ~E_1~0 2))) (.cse33 (not (<= .cse0 ~token~0))) (.cse8 (not (= 2 |old(~m_st~0)|))) (.cse34 (not (<= ~token~0 .cse0))) (.cse26 (not (= |old(~t1_st~0)| 0))) (.cse30 (not (= ~t1_pc~0 0))) (.cse1 (not .cse21)) (.cse13 (not (= ~E_M~0 2))) (.cse15 (not (<= ~token~0 ~local~0))) (.cse35 (not (= |old(~t2_st~0)| 0))) (.cse2 (not .cse41)) (.cse40 (not (= ~m_pc~0 0))) (.cse4 (not .cse16)) (.cse5 (not (= ~p_dw_pc~0 0))) (.cse23 (not (<= ~local~0 ~token~0))) (.cse36 (and .cse17 .cse18 .cse39)) (.cse6 (not .cse19)) (.cse24 (not (= ~E_1~0 1))) (.cse7 (not (= |old(~t1_st~0)| 2))) (.cse37 (not (= 0 ~t2_pc~0))) (.cse11 (not (<= 2 ~E_2~0)))) (and (or (not (< .cse0 ~token~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (<= ~token~0 (+ 2 ~local~0))) (not .cse12)) (or .cse1 .cse13 .cse14 .cse15 .cse2 .cse4 .cse5 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse23 .cse6 .cse24 .cse7 .cse9 .cse25 .cse11) (or .cse26 .cse1 .cse27 .cse4 .cse5 .cse28 .cse6 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse4 .cse5 .cse28 .cse6 .cse29 .cse8 .cse9 .cse10 .cse11) (or .cse26 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse13 .cse14 .cse15 .cse27 .cse4 .cse5 .cse30 .cse23 .cse6 .cse24 .cse9 .cse25 .cse11) (or .cse1 .cse31 .cse2 .cse3 .cse32 .cse4 .cse5 .cse33 .cse6 .cse8 .cse9 .cse25 .cse10 .cse34) (or .cse1 .cse35 .cse2 .cse4 .cse5 .cse28 .cse36 .cse6 .cse37 .cse8 .cse10 .cse12) (or .cse1 .cse2 .cse4 .cse5 .cse28 .cse6 .cse29 .cse8 .cse9 .cse10 .cse12) (or .cse1 .cse35 .cse31 .cse2 .cse32 .cse4 .cse5 .cse33 .cse36 .cse6 .cse37 .cse8 .cse34) (or .cse26 .cse1 .cse13 .cse14 .cse15 .cse35 (and .cse18 .cse38 .cse39) .cse40 .cse4 .cse5 .cse30 .cse23 .cse6 .cse24 .cse37 .cse11) (or .cse1 .cse13 .cse14 .cse15 .cse35 .cse2 .cse40 .cse4 .cse5 .cse23 .cse36 .cse6 .cse24 .cse7 .cse37 .cse11)))) [2022-12-14 05:02:39,275 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 262 276) no Hoare annotation was computed. [2022-12-14 05:02:39,275 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 262 276) the Hoare annotation is: true [2022-12-14 05:02:39,275 INFO L899 garLoopResultBuilder]: For program point L783(lines 783 792) no Hoare annotation was computed. [2022-12-14 05:02:39,275 INFO L899 garLoopResultBuilder]: For program point L783-2(lines 783 792) no Hoare annotation was computed. [2022-12-14 05:02:39,275 INFO L899 garLoopResultBuilder]: For program point L746(lines 746 751) no Hoare annotation was computed. [2022-12-14 05:02:39,276 INFO L895 garLoopResultBuilder]: At program point L775(lines 763 777) the Hoare annotation is: (let ((.cse37 (= ~E_M~0 1)) (.cse31 (= ~m_pc~0 1)) (.cse45 (= |old(~m_st~0)| 0))) (let ((.cse43 (not .cse45)) (.cse54 (+ ~local~0 1)) (.cse57 (= ~t1_st~0 0)) (.cse26 (<= 2 ~E_2~0)) (.cse27 (= ~t2_pc~0 1)) (.cse20 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse21 (= ~t1_pc~0 1)) (.cse22 (<= 2 ~E_1~0)) (.cse23 (not (= ~m_pc~0 ~t1_pc~0))) (.cse55 (= ~m_st~0 2)) (.cse13 (= ~t1_i~0 1)) (.cse14 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse24 (not .cse31)) (.cse16 (= ~m_st~0 |old(~m_st~0)|)) (.cse17 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse25 (= |old(~t2_st~0)| ~t2_st~0)) (.cse28 (= ~t2_i~0 1)) (.cse18 (= ~c_dr_pc~0 0)) (.cse56 (= 0 ~t2_pc~0)) (.cse19 (= 0 ~t2_st~0)) (.cse53 (not .cse37))) (let ((.cse0 (and .cse21 .cse22 .cse23 .cse55 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse25 .cse28 .cse18 .cse56 .cse19 .cse53)) (.cse41 (and .cse21 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse26 .cse27 .cse28 .cse18 .cse20)) (.cse39 (and .cse14 .cse16 .cse25 .cse57 .cse20)) (.cse42 (not (< .cse54 ~token~0))) (.cse40 (and .cse21 .cse22 .cse23 .cse55 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse25 .cse26 .cse27 .cse28 .cse18)) (.cse44 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse49 (not (= ~E_1~0 1))) (.cse32 (not (= |old(~t1_st~0)| 2))) (.cse52 (<= 1 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse29 (not (= ~E_M~0 2))) (.cse46 (not (<= ~token~0 ~local~0))) (.cse30 (not (= ~m_pc~0 0))) (.cse47 (not (= ~t1_pc~0 0))) (.cse48 (not (<= ~local~0 ~token~0))) (.cse38 (not (= |old(~t1_st~0)| 0))) (.cse50 (and .cse14 .cse16 .cse57 .cse19 .cse20)) (.cse2 (not (= |old(~t2_st~0)| 0))) (.cse10 (not .cse56)) (.cse36 (not .cse26)) (.cse1 (not .cse28)) (.cse3 (and .cse43 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse4 (not .cse21)) (.cse5 (not (= ~E_1~0 2))) (.cse6 (not .cse13)) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (<= .cse54 ~token~0))) (.cse9 (not .cse17)) (.cse51 (and .cse21 .cse22 .cse23 .cse55 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse25 .cse27 .cse28 .cse18 .cse53)) (.cse11 (not (= 2 |old(~m_st~0)|))) (.cse33 (not .cse27)) (.cse34 (not (= 2 |old(~t2_st~0)|))) (.cse35 (not .cse22)) (.cse12 (not (<= ~token~0 .cse54)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (or .cse1 (and .cse21 .cse22 .cse23 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse25 .cse26 .cse27 .cse28 .cse18 .cse20) .cse29 .cse4 .cse30 .cse6 .cse7 .cse31 .cse9 .cse32 .cse33 .cse34 .cse35 .cse36) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse31 .cse9 .cse10 .cse11 .cse35 .cse37) (or .cse21 .cse38 .cse1 .cse6 .cse7 .cse31 .cse9 .cse39 .cse11 .cse33 .cse35 .cse36) (or .cse1 .cse4 .cse6 .cse7 .cse31 .cse9 .cse40 .cse11 .cse33 .cse35 .cse36) (or .cse1 .cse41 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse32 .cse40 .cse11 .cse33 .cse34 .cse35 .cse36) (or .cse42 .cse1 .cse29 .cse41 .cse4 .cse6 .cse7 .cse9 .cse43 .cse32 .cse33 .cse34 .cse35 .cse36 .cse44) (or .cse38 .cse23 .cse1 .cse29 .cse45 .cse46 .cse6 .cse7 .cse47 .cse48 .cse9 .cse49 .cse39 .cse33 .cse34 .cse36) (or .cse38 .cse1 .cse50 .cse29 .cse45 .cse46 .cse2 .cse30 .cse6 .cse7 .cse47 .cse48 .cse9 .cse49 .cse10 .cse36) (or .cse1 .cse4 .cse6 .cse7 .cse31 .cse9 .cse51 .cse11 .cse33 .cse35 .cse37) (or .cse1 .cse29 .cse45 .cse46 .cse4 .cse6 .cse7 .cse48 .cse9 .cse49 .cse32 .cse33 .cse34 .cse36 (and .cse52 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18)) (or .cse42 .cse1 (and (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) (= ~m_st~0 0) (= 2 ~t1_st~0) .cse25 .cse20) .cse4 .cse6 .cse7 .cse9 .cse32 .cse40 .cse11 .cse33 .cse35 .cse36 .cse44 .cse53) (or .cse1 .cse29 .cse45 .cse46 .cse2 .cse4 .cse30 .cse6 .cse7 .cse48 .cse9 .cse49 .cse32 (and .cse52 .cse23 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19) .cse10 .cse36) (or .cse38 .cse1 .cse50 .cse29 .cse46 .cse2 .cse3 .cse30 .cse5 .cse6 .cse7 .cse47 .cse48 .cse9 .cse10 .cse36) (or .cse1 .cse2 .cse4 .cse6 .cse7 .cse31 (and .cse23 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19) .cse9 .cse10 .cse11 .cse35 .cse36) (or .cse21 .cse38 .cse1 .cse50 .cse2 .cse6 .cse7 .cse31 .cse9 .cse10 .cse11 .cse35 .cse36) (or .cse1 (and .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse28 .cse18 .cse20) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse51 .cse11 .cse33 .cse34 .cse35 .cse12))))) [2022-12-14 05:02:39,277 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 789) no Hoare annotation was computed. [2022-12-14 05:02:39,277 INFO L899 garLoopResultBuilder]: For program point L764(lines 764 773) no Hoare annotation was computed. [2022-12-14 05:02:39,277 INFO L899 garLoopResultBuilder]: For program point L764-2(lines 764 773) no Hoare annotation was computed. [2022-12-14 05:02:39,278 INFO L895 garLoopResultBuilder]: At program point L756(lines 744 758) the Hoare annotation is: (let ((.cse4 (= ~m_pc~0 1)) (.cse13 (= |old(~m_st~0)| 0))) (let ((.cse47 (not .cse13)) (.cse49 (<= 2 ~E_2~0)) (.cse31 (= ~t2_pc~0 1)) (.cse22 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~E_1~0)) (.cse24 (= ~t1_i~0 1)) (.cse27 (not .cse4)) (.cse29 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse30 (= |old(~t2_st~0)| ~t2_st~0)) (.cse32 (= ~t2_i~0 1)) (.cse33 (= ~c_dr_pc~0 0)) (.cse52 (= 0 ~t2_pc~0)) (.cse26 (= |old(~t1_st~0)| ~t1_st~0)) (.cse50 (+ ~local~0 1)) (.cse25 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse28 (= ~m_st~0 |old(~m_st~0)|)) (.cse51 (= ~t1_st~0 0)) (.cse43 (= 0 ~t2_st~0))) (let ((.cse16 (and .cse25 .cse28 .cse51 .cse43)) (.cse18 (not (= ~t1_pc~0 0))) (.cse38 (not (<= .cse50 ~token~0))) (.cse39 (not (<= ~token~0 .cse50))) (.cse35 (and .cse25 .cse26 .cse28 .cse43)) (.cse15 (not (= |old(~t2_st~0)| 0))) (.cse40 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse52 .cse43)) (.cse21 (not .cse52)) (.cse14 (not (<= ~token~0 ~local~0))) (.cse19 (not (<= ~local~0 ~token~0))) (.cse20 (not (= ~E_1~0 1))) (.cse11 (not (= |old(~t1_st~0)| 0))) (.cse41 (and .cse25 .cse28 .cse30 .cse51)) (.cse46 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse49 .cse31 .cse33)) (.cse36 (and .cse47 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse37 (not (= ~E_1~0 2))) (.cse45 (not (< .cse50 ~token~0))) (.cse6 (not (= 2 |old(~m_st~0)|))) (.cse9 (and .cse22 .cse23 (= ~m_st~0 2) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse49 .cse31 .cse32 .cse33)) (.cse48 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse34 (= ~E_M~0 1)) (.cse0 (not .cse32)) (.cse12 (not (= ~E_M~0 2))) (.cse1 (not .cse22)) (.cse17 (not (= ~m_pc~0 0))) (.cse2 (not .cse24)) (.cse3 (not (= ~p_dw_pc~0 0))) (.cse5 (not .cse29)) (.cse44 (not (= |old(~t1_st~0)| 2))) (.cse7 (not .cse31)) (.cse42 (not (= 2 |old(~t2_st~0)|))) (.cse8 (not .cse23)) (.cse10 (not .cse49))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse2 .cse3 .cse18 .cse19 .cse5 .cse20 .cse21 .cse10) (or .cse0 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse34) (or .cse0 .cse35 .cse15 .cse36 .cse1 .cse37 .cse2 .cse3 .cse38 .cse5 .cse21 .cse6 .cse39) (or .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse40 .cse5 .cse21 .cse6 .cse8 .cse34) (or .cse11 (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse12 .cse13 .cse14 .cse2 .cse3 .cse18 .cse19 .cse41 .cse5 .cse20 .cse7 .cse42 .cse10) (or .cse11 .cse0 .cse12 .cse14 .cse15 .cse36 .cse16 .cse17 .cse37 .cse2 .cse3 .cse18 .cse19 .cse5 .cse21 .cse10) (or .cse0 .cse36 .cse1 .cse37 .cse2 .cse3 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse33) .cse38 .cse5 .cse6 .cse7 .cse42 .cse8 .cse39) (or .cse11 .cse0 .cse15 .cse2 .cse3 .cse4 .cse5 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse43) .cse21 .cse6 .cse8 .cse10) (or .cse0 .cse35 .cse12 .cse13 .cse14 .cse15 .cse1 .cse17 .cse2 .cse3 .cse19 .cse5 .cse20 .cse44 .cse21 .cse10) (or .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse40 .cse5 .cse21 .cse6 .cse8 .cse10) (or .cse0 .cse12 .cse13 .cse14 .cse1 .cse2 .cse3 .cse19 .cse5 .cse20 .cse44 (and .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse33) .cse7 .cse42 .cse10) (or .cse45 .cse0 .cse12 .cse46 .cse1 .cse2 .cse3 .cse5 .cse47 .cse44 .cse7 .cse42 .cse8 .cse10 .cse48) (or .cse11 .cse0 .cse2 .cse3 .cse4 .cse41 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse46 .cse36 .cse1 .cse37 .cse2 .cse3 .cse5 .cse44 .cse6 .cse7 .cse42 .cse8 .cse10) (or .cse45 .cse0 .cse1 .cse2 .cse3 (and .cse22 .cse23 (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse24 .cse26 .cse28 .cse29 .cse30 .cse49 .cse31 .cse33) .cse5 .cse44 .cse6 .cse7 .cse8 .cse9 .cse10 .cse48 (not .cse34)) (or .cse0 .cse12 .cse1 .cse17 .cse2 .cse3 .cse4 .cse5 .cse44 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse49 .cse31 .cse32 .cse33) .cse7 .cse42 .cse8 .cse10))))) [2022-12-14 05:02:39,279 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 995 1028) the Hoare annotation is: (let ((.cse23 (= ~m_pc~0 1)) (.cse2 (= |old(~m_st~0)| 0))) (let ((.cse48 (= 0 ~t2_pc~0)) (.cse49 (= 0 ~t2_st~0)) (.cse50 (+ ~local~0 1)) (.cse44 (not .cse2)) (.cse35 (= ~t1_pc~0 1)) (.cse36 (<= 2 ~E_1~0)) (.cse7 (= ~t1_i~0 1)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse40 (not .cse23)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse47 (<= 2 ~E_2~0)) (.cse37 (= ~t2_pc~0 1)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse11 (= |old(~t2_st~0)| ~t2_st~0)) (.cse51 (= ~t1_st~0 0))) (let ((.cse22 (and .cse9 .cse11 .cse51)) (.cse34 (and .cse35 .cse36 .cse7 .cse8 .cse40 .cse9 .cse10 .cse11 .cse47 .cse37 .cse12 .cse13)) (.cse19 (not (= 2 |old(~t2_st~0)|))) (.cse27 (and .cse44 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse28 (not (= ~E_1~0 2))) (.cse38 (not (<= .cse50 ~token~0))) (.cse39 (not (<= ~token~0 .cse50))) (.cse31 (and .cse35 .cse36 .cse7 .cse8 .cse40 .cse9 .cse10 .cse11 .cse12 .cse13 .cse48 .cse49)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse33 (and .cse9 .cse51 .cse49)) (.cse29 (not (= ~t1_pc~0 0))) (.cse43 (not (< .cse50 ~token~0))) (.cse26 (and .cse35 .cse36 .cse7 .cse8 .cse9 .cse10 .cse11 .cse47 .cse37 .cse12 .cse13)) (.cse24 (not (= 2 |old(~m_st~0)|))) (.cse18 (not .cse37)) (.cse25 (not .cse36)) (.cse45 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse41 (= ~E_M~0 1)) (.cse0 (not .cse12)) (.cse1 (not (= ~E_M~0 2))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse30 (not (= |old(~t2_st~0)| 0))) (.cse4 (not .cse35)) (.cse42 (not (= ~m_pc~0 0))) (.cse5 (not .cse7)) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse14 (not (<= ~local~0 ~token~0))) (.cse46 (and .cse8 .cse9 .cse49)) (.cse15 (not .cse10)) (.cse16 (not (= ~E_1~0 1))) (.cse17 (not (= |old(~t1_st~0)| 2))) (.cse32 (not .cse48)) (.cse20 (not .cse47))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse0 .cse22 .cse5 .cse6 .cse23 .cse15 .cse24 .cse18 .cse25 .cse20) (or .cse0 .cse26 .cse27 .cse4 .cse28 .cse5 .cse6 .cse15 .cse17 .cse24 .cse18 .cse19 .cse25 .cse20) (or .cse21 (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse22 .cse5 .cse6 .cse29 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20) (or .cse0 .cse30 .cse4 .cse5 .cse6 .cse23 .cse31 .cse15 .cse32 .cse24 .cse25 .cse20) (or .cse21 .cse0 .cse30 .cse33 .cse5 .cse6 .cse23 .cse15 .cse32 .cse24 .cse25 .cse20) (or .cse0 .cse4 .cse5 .cse6 .cse34 .cse23 .cse15 .cse24 .cse18 .cse25 .cse20) (or .cse0 .cse27 .cse4 (and .cse35 .cse36 .cse7 .cse8 .cse9 .cse10 .cse11 .cse37 .cse12 .cse13) .cse28 .cse5 .cse6 .cse38 .cse15 .cse24 .cse18 .cse19 .cse25 .cse39) (or .cse0 .cse4 .cse5 .cse6 .cse23 .cse15 (and .cse35 .cse36 .cse7 .cse8 .cse40 .cse9 .cse10 .cse11 .cse37 .cse12 .cse13) .cse24 .cse18 .cse25 .cse41) (or .cse21 .cse0 .cse1 .cse3 .cse30 .cse27 .cse33 .cse42 .cse28 .cse5 .cse6 .cse29 .cse14 .cse15 .cse32 .cse20) (or .cse0 .cse1 .cse4 .cse42 .cse5 .cse6 .cse34 .cse23 .cse15 .cse17 .cse18 .cse19 .cse25 .cse20) (or .cse43 .cse0 .cse1 .cse26 .cse4 .cse5 .cse6 .cse15 .cse44 .cse17 .cse18 .cse19 .cse25 .cse20 .cse45) (or .cse0 .cse30 .cse27 .cse4 .cse28 .cse5 .cse6 .cse38 .cse46 .cse15 .cse32 .cse24 .cse39) (or .cse0 .cse30 .cse4 .cse5 .cse6 .cse23 .cse31 .cse15 .cse32 .cse24 .cse25 .cse41) (or .cse21 .cse0 .cse1 .cse2 .cse3 .cse30 .cse33 .cse42 .cse5 .cse6 .cse29 .cse14 .cse15 .cse16 .cse32 .cse20) (or .cse43 .cse0 .cse26 .cse4 .cse5 .cse6 .cse15 .cse17 .cse24 .cse18 .cse25 .cse20 .cse45 (not .cse41)) (or .cse0 .cse1 .cse2 .cse3 .cse30 .cse4 .cse42 .cse5 .cse6 .cse14 .cse46 .cse15 .cse16 .cse17 .cse32 .cse20))))) [2022-12-14 05:02:39,279 INFO L899 garLoopResultBuilder]: For program point L765(lines 765 770) no Hoare annotation was computed. [2022-12-14 05:02:39,279 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 995 1028) no Hoare annotation was computed. [2022-12-14 05:02:39,280 INFO L895 garLoopResultBuilder]: At program point L794(lines 782 796) the Hoare annotation is: (let ((.cse26 (= ~E_M~0 1)) (.cse23 (= ~m_pc~0 1)) (.cse36 (= |old(~m_st~0)| 0))) (let ((.cse55 (<= 2 ~E_2~0)) (.cse60 (= 0 ~t2_pc~0)) (.cse44 (not .cse36)) (.cse59 (+ ~local~0 1)) (.cse48 (= 0 ~t2_st~0)) (.cse41 (= ~t1_st~0 0)) (.cse57 (= ~t1_pc~0 1)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse58 (= ~m_st~0 2)) (.cse3 (not .cse23)) (.cse56 (= ~t2_pc~0 1)) (.cse54 (not .cse26)) (.cse0 (<= 2 ~E_1~0)) (.cse2 (= ~t1_i~0 1)) (.cse27 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse28 (= |old(~t1_st~0)| ~t1_st~0)) (.cse40 (= |activate_threads2_is_transmit2_triggered_~__retres1~6#1| 0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (= |old(~t2_st~0)| ~t2_st~0)) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~c_dr_pc~0 0)) (.cse30 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0))) (let ((.cse13 (and .cse0 .cse2 .cse27 .cse28 .cse40 .cse29 .cse4 .cse5 .cse6 .cse7 .cse30)) (.cse31 (and .cse57 .cse0 .cse1 .cse58 .cse2 .cse27 .cse3 .cse29 .cse4 .cse5 .cse56 .cse6 .cse7 .cse54)) (.cse49 (and .cse57 .cse2 .cse28 .cse3 .cse4 .cse41 .cse7)) (.cse34 (not (= |old(~t1_st~0)| 0))) (.cse50 (not (= ~m_pc~0 0))) (.cse38 (not (= ~t1_pc~0 0))) (.cse52 (and .cse27 .cse40 .cse29 .cse41 .cse48 .cse30)) (.cse43 (not (< .cse59 ~token~0))) (.cse45 (= ~m_st~0 0)) (.cse46 (= 2 ~t1_st~0)) (.cse47 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse22 (not (= |old(~t2_st~0)| 0))) (.cse9 (and .cse44 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse11 (not (= ~E_1~0 2))) (.cse32 (not (<= .cse59 ~token~0))) (.cse24 (and .cse57 .cse0 .cse1 .cse58 .cse2 .cse27 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse60 .cse48 .cse54)) (.cse25 (not .cse60)) (.cse33 (not (<= ~token~0 .cse59))) (.cse53 (and .cse57 .cse0 .cse1 .cse58 .cse2 .cse27 .cse3 .cse29 .cse4 .cse5 .cse55 .cse56 .cse6 .cse7)) (.cse17 (not (= 2 |old(~m_st~0)|))) (.cse20 (not .cse0)) (.cse8 (not .cse6)) (.cse51 (<= 1 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse35 (not (= ~E_M~0 2))) (.cse37 (not (<= ~token~0 ~local~0))) (.cse10 (not .cse57)) (.cse12 (not .cse2)) (.cse14 (not (= ~p_dw_pc~0 0))) (.cse39 (not (<= ~local~0 ~token~0))) (.cse15 (not .cse4)) (.cse42 (not (= ~E_1~0 1))) (.cse16 (not (= |old(~t1_st~0)| 2))) (.cse18 (not .cse56)) (.cse19 (not (= 2 |old(~t2_st~0)|))) (.cse21 (not .cse55))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse8 .cse22 .cse10 .cse12 .cse14 .cse23 .cse15 .cse24 .cse25 .cse17 .cse20 .cse26) (or (and .cse0 .cse2 .cse27 .cse28 .cse29 .cse4 .cse5 .cse6 .cse7 (<= 1 |activate_threads2_is_transmit2_triggered_~__retres1~6#1|) .cse30) .cse8 .cse31 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse32 .cse15 .cse17 .cse18 .cse19 .cse20 .cse33) (or .cse34 .cse1 .cse8 .cse35 .cse36 .cse37 .cse12 .cse14 .cse38 .cse39 (and .cse27 .cse40 .cse29 .cse5 .cse41 .cse30) .cse15 .cse42 .cse18 .cse19 .cse21) (or .cse43 .cse8 .cse35 .cse10 .cse12 .cse14 .cse15 .cse44 .cse16 .cse18 .cse19 .cse20 (and .cse0 .cse2 .cse27 .cse40 .cse45 .cse46 .cse4 .cse5 .cse6 .cse7 .cse30) .cse21 .cse47) (or .cse34 .cse8 (and .cse27 .cse29 .cse41 .cse48 .cse30) .cse49 .cse22 .cse12 .cse14 .cse23 .cse15 .cse25 .cse17 .cse20 .cse21) (or .cse8 .cse35 .cse10 .cse50 .cse12 .cse14 .cse23 .cse15 .cse16 (and .cse0 .cse1 .cse2 .cse27 .cse28 .cse40 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse30) .cse18 .cse19 .cse20 .cse21) (or .cse8 .cse31 .cse10 .cse12 .cse14 .cse23 .cse15 .cse17 .cse18 .cse20 .cse26) (or .cse8 .cse35 .cse36 .cse37 .cse22 .cse10 .cse50 .cse12 .cse14 .cse39 .cse15 .cse42 .cse16 (and .cse51 .cse27 .cse40 .cse29 .cse41 .cse48) .cse25 .cse21) (or .cse34 .cse8 .cse35 .cse37 .cse22 .cse9 .cse50 .cse11 .cse12 .cse14 .cse38 .cse39 .cse15 .cse25 .cse52 .cse21) (or .cse34 .cse8 .cse49 .cse12 .cse14 .cse23 .cse15 .cse17 .cse18 (and .cse27 .cse28 .cse29 .cse5 .cse30) .cse20 .cse21) (or .cse8 .cse22 (and .cse1 .cse2 .cse27 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse48) .cse10 .cse12 .cse14 .cse23 .cse15 .cse25 .cse17 .cse20 .cse21) (or .cse34 .cse8 .cse35 .cse36 .cse37 .cse22 .cse50 .cse12 .cse14 .cse38 .cse39 .cse15 .cse42 .cse25 .cse52 .cse21) (or .cse43 (and (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse40 .cse45 .cse46 .cse5 .cse30) .cse8 .cse53 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse47 .cse54) (or .cse8 .cse22 .cse9 .cse10 .cse11 .cse12 .cse14 .cse32 .cse15 .cse24 .cse25 .cse17 .cse33 (and .cse27 .cse28 .cse40 .cse29 .cse48 .cse30)) (or .cse8 .cse53 .cse10 .cse12 .cse14 .cse23 .cse15 .cse17 .cse18 .cse20 .cse21) (or .cse8 (and .cse51 .cse27 .cse40 .cse29 .cse5 .cse41) .cse35 .cse36 .cse37 .cse10 .cse12 .cse14 .cse39 .cse15 .cse42 .cse16 .cse18 .cse19 .cse21))))) [2022-12-14 05:02:39,280 INFO L899 garLoopResultBuilder]: For program point L745(lines 745 754) no Hoare annotation was computed. [2022-12-14 05:02:39,280 INFO L899 garLoopResultBuilder]: For program point L745-2(lines 745 754) no Hoare annotation was computed. [2022-12-14 05:02:39,280 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 387 411) no Hoare annotation was computed. [2022-12-14 05:02:39,280 INFO L899 garLoopResultBuilder]: For program point L401(line 401) no Hoare annotation was computed. [2022-12-14 05:02:39,280 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 387 411) the Hoare annotation is: true [2022-12-14 05:02:39,281 INFO L902 garLoopResultBuilder]: At program point L393(line 393) the Hoare annotation is: true [2022-12-14 05:02:39,281 INFO L902 garLoopResultBuilder]: At program point L395-2(lines 395 399) the Hoare annotation is: true [2022-12-14 05:02:39,281 INFO L899 garLoopResultBuilder]: For program point L393-1(line 393) no Hoare annotation was computed. [2022-12-14 05:02:39,281 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 798 805) no Hoare annotation was computed. [2022-12-14 05:02:39,281 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 798 805) the Hoare annotation is: true [2022-12-14 05:02:39,281 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 919 956) the Hoare annotation is: (let ((.cse24 (= ~t2_pc~0 1)) (.cse22 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse21 (= ~t1_i~0 1)) (.cse19 (= ~t1_pc~0 1)) (.cse6 (= ~m_pc~0 1)) (.cse33 (= ~t2_i~0 1)) (.cse18 (not (= ~m_st~0 0))) (.cse20 (<= 2 ~E_1~0)) (.cse25 (<= |old(~E_2~0)| ~E_2~0)) (.cse34 (not (= ~E_M~0 1)))) (let ((.cse9 (and .cse20 .cse25 .cse34)) (.cse10 (not (= 0 ~t2_st~0))) (.cse12 (not (= 0 ~t2_pc~0))) (.cse13 (not (= ~t1_st~0 0))) (.cse29 (not (= 2 |old(~E_1~0)|))) (.cse8 (not (= ~m_st~0 2))) (.cse31 (= ~E_1~0 2)) (.cse30 (and (not (= ~m_st~0 |old(~E_M~0)|)) .cse18)) (.cse0 (not (<= 2 |old(~E_2~0)|))) (.cse1 (not .cse33)) (.cse32 (not .cse6)) (.cse23 (<= 2 ~E_2~0)) (.cse26 (= ~c_dr_pc~0 0)) (.cse27 (= ~E_1~0 |old(~E_1~0)|)) (.cse28 (= ~E_M~0 2)) (.cse2 (not .cse19)) (.cse15 (not (= 2 ~t2_st~0))) (.cse16 (not (= 2 |old(~E_M~0)|))) (.cse3 (not .cse21)) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse17 (not (= 2 ~t1_st~0))) (.cse5 (not (<= 2 |old(~E_1~0)|))) (.cse7 (= |old(~E_M~0)| 1)) (.cse11 (not .cse22)) (.cse14 (not .cse24))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 (not (< (+ ~local~0 1) ~token~0)) .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse7 .cse11 .cse18 (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) .cse14 (not (<= ~token~0 (+ 2 ~local~0)))) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 (not (<= ~token~0 ~local~0)) .cse29 .cse16 .cse3 .cse4 (not (= ~t1_pc~0 0)) (not (<= ~local~0 ~token~0)) .cse10 .cse11 .cse12 .cse30 .cse13 (and .cse25 .cse28 .cse31)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 (and .cse19 .cse20 .cse21 .cse32 .cse22 .cse23 .cse24 .cse25 .cse33 .cse26 .cse34) .cse14) (or .cse0 .cse1 .cse2 .cse29 .cse15 .cse3 .cse4 .cse17 .cse5 .cse7 .cse8 (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse31) .cse11 .cse30 .cse14) (or .cse0 .cse1 (and .cse19 .cse20 .cse21 .cse32 .cse22 .cse23 .cse24 .cse25 .cse33 .cse26 .cse27 .cse28 .cse34) .cse2 (not (= ~m_pc~0 0)) .cse15 .cse16 .cse3 .cse4 .cse17 .cse5 .cse6 .cse7 .cse11 .cse14)))) [2022-12-14 05:02:39,281 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 919 956) no Hoare annotation was computed. [2022-12-14 05:02:39,282 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 315 332) the Hoare annotation is: true [2022-12-14 05:02:39,282 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 315 332) no Hoare annotation was computed. [2022-12-14 05:02:39,282 INFO L902 garLoopResultBuilder]: At program point L124(lines 102 126) the Hoare annotation is: true [2022-12-14 05:02:39,282 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2022-12-14 05:02:39,282 INFO L899 garLoopResultBuilder]: For program point L113-1(lines 113 122) no Hoare annotation was computed. [2022-12-14 05:02:39,282 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 99 127) the Hoare annotation is: true [2022-12-14 05:02:39,282 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 109) no Hoare annotation was computed. [2022-12-14 05:02:39,282 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 99 127) no Hoare annotation was computed. [2022-12-14 05:02:39,282 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 112) no Hoare annotation was computed. [2022-12-14 05:02:39,282 INFO L899 garLoopResultBuilder]: For program point L103-2(lines 102 126) no Hoare annotation was computed. [2022-12-14 05:02:39,283 INFO L895 garLoopResultBuilder]: At program point L861(line 861) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 ~E_M~0)) (.cse22 (= ~m_st~0 0)) (.cse30 (+ ~local~0 1))) (let ((.cse0 (= ~t1_pc~0 0)) (.cse28 (not (= ~E_M~0 1))) (.cse14 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse24 (= ~m_st~0 2)) (.cse25 (<= ~token~0 .cse30)) (.cse26 (<= .cse30 ~token~0)) (.cse29 (= ~m_pc~0 ~t1_pc~0)) (.cse21 (or .cse2 .cse22)) (.cse4 (= ~t1_st~0 0)) (.cse20 (= ~m_pc~0 0)) (.cse8 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ~E_1~0 2)) (.cse15 (= ~t1_pc~0 1)) (.cse16 (<= 2 ~E_1~0)) (.cse1 (= ~t1_i~0 1)) (.cse17 (= 2 ~t2_st~0)) (.cse27 (not (= ~m_pc~0 1))) (.cse18 (= 2 ~t1_st~0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (<= 2 ~E_2~0)) (.cse19 (= ~t2_pc~0 1)) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse23 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse1 .cse17 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 .cse20 .cse9) (and .cse15 .cse1 .cse17 .cse3 .cse21 .cse4 .cse5 .cse19 (not .cse22) .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse23) (and .cse15 .cse24 .cse1 .cse25 .cse18 .cse3 .cse5 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14) (and .cse15 .cse16 .cse24 .cse1 .cse27 .cse3 .cse5 .cse19 .cse6 .cse7 .cse28) (and .cse24 .cse0 .cse1 .cse17 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse16 .cse24 .cse1 .cse27 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse28) (and .cse16 .cse24 .cse1 .cse27 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse28) (and .cse15 .cse16 .cse24 .cse1 .cse27 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse28) (and .cse15 .cse24 .cse1 .cse18 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse29 .cse17 .cse22 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse20 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse17 .cse22 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 (< .cse30 ~token~0) .cse9) (and .cse15 .cse1 .cse2 .cse17 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 .cse9 .cse13) (and .cse15 .cse1 .cse22 .cse18 .cse3 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse24 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse24 .cse1 .cse25 .cse18 .cse3 .cse5 .cse19 .cse26 .cse6 .cse7 .cse9 .cse10 .cse13 .cse23) (and .cse1 .cse29 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse16 .cse1 .cse17 .cse22 .cse27 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 .cse9 .cse23)))) [2022-12-14 05:02:39,283 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2022-12-14 05:02:39,283 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 439) no Hoare annotation was computed. [2022-12-14 05:02:39,283 INFO L895 garLoopResultBuilder]: At program point L730(line 730) the Hoare annotation is: (let ((.cse3 (not (= ~m_pc~0 1))) (.cse9 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (<= 2 ~E_2~0)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~t1_st~0 0) .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) (= 2 ~t1_st~0) .cse4 .cse5 .cse6 .cse7 .cse8 (< (+ ~local~0 1) ~token~0) (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0))) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (= ~E_M~0 1)))) [2022-12-14 05:02:39,283 INFO L899 garLoopResultBuilder]: For program point L730-1(line 730) no Hoare annotation was computed. [2022-12-14 05:02:39,283 INFO L895 garLoopResultBuilder]: At program point do_write_p_returnLabel#1(lines 153 201) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-12-14 05:02:39,283 INFO L895 garLoopResultBuilder]: At program point L499-1(lines 499 536) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-12-14 05:02:39,284 INFO L895 garLoopResultBuilder]: At program point L1127(line 1127) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-12-14 05:02:39,284 INFO L895 garLoopResultBuilder]: At program point L1127-1(line 1127) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-12-14 05:02:39,284 INFO L899 garLoopResultBuilder]: For program point L863(line 863) no Hoare annotation was computed. [2022-12-14 05:02:39,284 INFO L899 garLoopResultBuilder]: For program point L632(lines 632 636) no Hoare annotation was computed. [2022-12-14 05:02:39,284 INFO L895 garLoopResultBuilder]: At program point L599(line 599) the Hoare annotation is: false [2022-12-14 05:02:39,284 INFO L895 garLoopResultBuilder]: At program point L1128(line 1128) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-12-14 05:02:39,285 INFO L895 garLoopResultBuilder]: At program point L898(lines 860 912) the Hoare annotation is: (let ((.cse2 (= ~m_st~0 ~E_M~0)) (.cse22 (= ~m_st~0 0)) (.cse30 (+ ~local~0 1))) (let ((.cse0 (= ~t1_pc~0 0)) (.cse28 (not (= ~E_M~0 1))) (.cse14 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse24 (= ~m_st~0 2)) (.cse25 (<= ~token~0 .cse30)) (.cse26 (<= .cse30 ~token~0)) (.cse29 (= ~m_pc~0 ~t1_pc~0)) (.cse21 (or .cse2 .cse22)) (.cse4 (= ~t1_st~0 0)) (.cse20 (= ~m_pc~0 0)) (.cse8 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ~E_1~0 2)) (.cse15 (= ~t1_pc~0 1)) (.cse16 (<= 2 ~E_1~0)) (.cse1 (= ~t1_i~0 1)) (.cse17 (= 2 ~t2_st~0)) (.cse27 (not (= ~m_pc~0 1))) (.cse18 (= 2 ~t1_st~0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (<= 2 ~E_2~0)) (.cse19 (= ~t2_pc~0 1)) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~c_dr_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse23 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse1 .cse17 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 .cse20 .cse9) (and .cse15 .cse1 .cse17 .cse3 .cse21 .cse4 .cse5 .cse19 (not .cse22) .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse23) (and .cse15 .cse24 .cse1 .cse25 .cse18 .cse3 .cse5 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14) (and .cse15 .cse16 .cse24 .cse1 .cse27 .cse3 .cse5 .cse19 .cse6 .cse7 .cse28) (and .cse24 .cse0 .cse1 .cse17 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse16 .cse24 .cse1 .cse27 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse28) (and .cse16 .cse24 .cse1 .cse27 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse28) (and .cse15 .cse16 .cse24 .cse1 .cse27 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse28) (and .cse15 .cse24 .cse1 .cse18 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse29 .cse17 .cse22 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse20 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse17 .cse22 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 (< .cse30 ~token~0) .cse9) (and .cse15 .cse1 .cse2 .cse17 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 .cse9 .cse13) (and .cse15 .cse1 .cse22 .cse18 .cse3 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse24 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse24 .cse1 .cse25 .cse18 .cse3 .cse5 .cse19 .cse26 .cse6 .cse7 .cse9 .cse10 .cse13 .cse23) (and .cse1 .cse29 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse16 .cse1 .cse17 .cse22 .cse27 .cse18 .cse3 .cse5 .cse19 .cse6 .cse7 .cse9 .cse23)))) [2022-12-14 05:02:39,285 INFO L899 garLoopResultBuilder]: For program point L865(lines 865 869) no Hoare annotation was computed. [2022-12-14 05:02:39,285 INFO L899 garLoopResultBuilder]: For program point L865-1(lines 860 912) no Hoare annotation was computed. [2022-12-14 05:02:39,285 INFO L895 garLoopResultBuilder]: At program point L172-1(lines 172 195) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-12-14 05:02:39,285 INFO L902 garLoopResultBuilder]: At program point start_simulation2_returnLabel#1(lines 1117 1175) the Hoare annotation is: true [2022-12-14 05:02:39,285 INFO L899 garLoopResultBuilder]: For program point L1164(lines 1164 1168) no Hoare annotation was computed. [2022-12-14 05:02:39,285 INFO L895 garLoopResultBuilder]: At program point master_returnLabel#1(lines 625 668) the Hoare annotation is: (let ((.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (= ~t1_pc~0 0)) (.cse3 (= ~m_st~0 ~E_M~0)) (.cse4 (= 2 ~t2_st~0)) (.cse8 (= ~t2_pc~0 1)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (= ~t1_st~0 0)) (.cse7 (<= 2 ~E_2~0)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse16 (= 0 ~t2_pc~0)) (.cse11 (= ~E_M~0 2)) (.cse17 (= 0 ~t2_st~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (= ~E_1~0 2)) (.cse15 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse16 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse19 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (and .cse18 .cse19 .cse2 .cse5 .cse6 .cse7 .cse9 .cse10 .cse16 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15))) [2022-12-14 05:02:39,285 INFO L895 garLoopResultBuilder]: At program point L471(line 471) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-12-14 05:02:39,285 INFO L895 garLoopResultBuilder]: At program point L471-1(line 471) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-12-14 05:02:39,285 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2022-12-14 05:02:39,286 INFO L895 garLoopResultBuilder]: At program point L1132-1(lines 1132 1169) the Hoare annotation is: (let ((.cse7 (= ~m_pc~0 0)) (.cse3 (= ~t1_st~0 0)) (.cse17 (= ~m_st~0 2)) (.cse18 (not (= ~m_pc~0 1))) (.cse8 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse19 (not (= ~E_M~0 1))) (.cse13 (<= 2 ~E_1~0)) (.cse1 (= ~m_st~0 0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (= ~t1_i~0 1)) (.cse14 (= 2 ~t2_st~0)) (.cse15 (= 2 ~t1_st~0)) (.cse2 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse4 (<= 2 ~E_2~0)) (.cse16 (= ~t2_pc~0 1)) (.cse5 (= ~t2_i~0 1)) (.cse6 (= ~c_dr_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2))) (or (and .cse0 (= ~m_pc~0 ~t1_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11) (and .cse12 .cse13 .cse0 .cse14 .cse15 .cse2 .cse4 .cse16 .cse5 .cse6 .cse7 .cse9) (and .cse12 .cse13 .cse17 .cse0 .cse18 .cse2 .cse4 .cse16 .cse5 .cse6 .cse19) (and .cse13 .cse17 .cse0 .cse18 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse19) (and .cse13 .cse17 .cse0 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse19) (and .cse12 .cse13 .cse17 .cse0 .cse18 .cse2 .cse4 .cse5 .cse6 .cse8 .cse10 .cse19) (and .cse12 .cse13 .cse0 (<= ~token~0 (+ 2 ~local~0)) .cse14 .cse1 .cse15 .cse2 .cse4 .cse16 .cse5 .cse6 (< (+ ~local~0 1) ~token~0) .cse9) (and .cse12 .cse0 (= ~m_st~0 ~E_M~0) .cse14 .cse15 .cse2 .cse4 .cse16 .cse5 .cse6 .cse9 .cse11))) [2022-12-14 05:02:39,286 INFO L899 garLoopResultBuilder]: For program point L901(lines 901 908) no Hoare annotation was computed. [2022-12-14 05:02:39,286 INFO L895 garLoopResultBuilder]: At program point start_simulation1_returnLabel#1(lines 484 542) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1))) [2022-12-14 05:02:39,286 INFO L899 garLoopResultBuilder]: For program point L242(lines 242 254) no Hoare annotation was computed. [2022-12-14 05:02:39,286 INFO L899 garLoopResultBuilder]: For program point L870(lines 860 912) no Hoare annotation was computed. [2022-12-14 05:02:39,286 INFO L895 garLoopResultBuilder]: At program point eval2_returnLabel#1(lines 854 918) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse2 (= ~m_st~0 2)) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse12 (not (= ~m_pc~0 1))) (.cse5 (= 2 ~t1_st~0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (<= 2 ~E_2~0)) (.cse8 (= ~t2_pc~0 1)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse13 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse12 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse12 .cse6 .cse14 .cse7 .cse9 .cse10 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse9 .cse10 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 (= ~m_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< (+ ~local~0 1) ~token~0) .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 .cse13))) [2022-12-14 05:02:39,286 INFO L895 garLoopResultBuilder]: At program point L507(line 507) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-12-14 05:02:39,286 INFO L899 garLoopResultBuilder]: For program point L507-1(line 507) no Hoare annotation was computed. [2022-12-14 05:02:39,286 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2022-12-14 05:02:39,286 INFO L895 garLoopResultBuilder]: At program point L210(lines 210 214) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 ~p_dw_pc~0) (not (= 2 ~p_dw_pc~0))))) [2022-12-14 05:02:39,286 INFO L899 garLoopResultBuilder]: For program point L673(lines 673 681) no Hoare annotation was computed. [2022-12-14 05:02:39,286 INFO L895 garLoopResultBuilder]: At program point L443(lines 418 458) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-12-14 05:02:39,286 INFO L895 garLoopResultBuilder]: At program point L179(lines 179 187) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-12-14 05:02:39,287 INFO L895 garLoopResultBuilder]: At program point L1104(line 1104) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse11 (= ~m_st~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse13 (not (= ~E_M~0 1))) (.cse1 (<= 2 ~E_1~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse10) (and .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)))) [2022-12-14 05:02:39,287 INFO L895 garLoopResultBuilder]: At program point L1104-1(line 1104) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse11 (= ~m_st~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse13 (not (= ~E_M~0 1))) (.cse1 (<= 2 ~E_1~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse10) (and .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)))) [2022-12-14 05:02:39,287 INFO L899 garLoopResultBuilder]: For program point L873(lines 873 880) no Hoare annotation was computed. [2022-12-14 05:02:39,287 INFO L895 garLoopResultBuilder]: At program point eval1_returnLabel#1(lines 412 464) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-12-14 05:02:39,287 INFO L899 garLoopResultBuilder]: For program point L709(lines 709 717) no Hoare annotation was computed. [2022-12-14 05:02:39,287 INFO L895 garLoopResultBuilder]: At program point L676(lines 676 680) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_M~0 1))) (.cse8 (= 0 ~t2_pc~0)) (.cse9 (= 0 ~t2_st~0)) (.cse12 (= ~t1_pc~0 1)) (.cse1 (= ~m_st~0 2)) (.cse13 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse2 (= ~t1_i~0 1)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (<= 2 ~E_2~0)) (.cse11 (= ~t2_pc~0 1)) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~c_dr_pc~0 0)) (.cse14 (= ~E_M~0 2)) (.cse15 (<= ~token~0 ~local~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse17 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse10) (and .cse12 .cse1 .cse13 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse15 .cse16 .cse17 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (and .cse12 .cse1 .cse13 .cse2 (= 2 ~t2_st~0) .cse4 .cse5 .cse11 .cse6 .cse7 .cse14 .cse15 .cse16 .cse17 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))))) [2022-12-14 05:02:39,287 INFO L895 garLoopResultBuilder]: At program point L511(line 511) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-12-14 05:02:39,287 INFO L895 garLoopResultBuilder]: At program point L511-1(line 511) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-12-14 05:02:39,287 INFO L895 garLoopResultBuilder]: At program point L247(line 247) the Hoare annotation is: false [2022-12-14 05:02:39,287 INFO L895 garLoopResultBuilder]: At program point L512(line 512) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-12-14 05:02:39,288 INFO L895 garLoopResultBuilder]: At program point L1140(line 1140) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse2 (= ~m_st~0 2)) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse12 (not (= ~m_pc~0 1))) (.cse5 (= 2 ~t1_st~0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (<= 2 ~E_2~0)) (.cse8 (= ~t2_pc~0 1)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse13 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse12 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse12 .cse6 .cse14 .cse7 .cse9 .cse10 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse9 .cse10 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 (= ~m_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< (+ ~local~0 1) ~token~0) .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 .cse13))) [2022-12-14 05:02:39,288 INFO L899 garLoopResultBuilder]: For program point L1140-1(line 1140) no Hoare annotation was computed. [2022-12-14 05:02:39,288 INFO L895 garLoopResultBuilder]: At program point L513(line 513) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-12-14 05:02:39,288 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 454) no Hoare annotation was computed. [2022-12-14 05:02:39,288 INFO L895 garLoopResultBuilder]: At program point L712(lines 712 716) the Hoare annotation is: (let ((.cse1 (<= 2 ~E_1~0)) (.cse4 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_M~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~m_st~0 2)) (.cse3 (= ~t1_i~0 1)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ~t1_st~0 0) .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~local~0 1))) (and .cse0 .cse2 .cse3 (<= ~token~0 .cse11) (= 2 ~t1_st~0) .cse5 .cse6 .cse7 (<= .cse11 ~token~0) .cse8 .cse9 (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0))) (= ~E_M~0 2) (= ~E_1~0 2) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))))) [2022-12-14 05:02:39,288 INFO L895 garLoopResultBuilder]: At program point L646(line 646) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse4 (= 2 ~t1_st~0)) (.cse2 (= 2 ~t2_st~0)) (.cse7 (= ~t2_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~E_1~0 1)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse19 (= ~t1_st~0 0)) (.cse6 (<= 2 ~E_2~0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= 0 ~t2_pc~0)) (.cse11 (= ~E_M~0 2)) (.cse16 (= 0 ~t2_st~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse17 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse14 .cse15 .cse11 .cse16 .cse12 .cse13 .cse17) (and .cse1 .cse18 .cse2 .cse3 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11 .cse12 .cse13 .cse17) (and .cse1 .cse18 .cse3 .cse5 .cse19 .cse6 .cse8 .cse9 .cse10 .cse14 .cse15 .cse11 .cse16 .cse12 .cse13 .cse17))) [2022-12-14 05:02:39,288 INFO L899 garLoopResultBuilder]: For program point L646-1(line 646) no Hoare annotation was computed. [2022-12-14 05:02:39,288 INFO L899 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2022-12-14 05:02:39,288 INFO L895 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: false [2022-12-14 05:02:39,288 INFO L895 garLoopResultBuilder]: At program point L252-1(lines 218 255) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1))) [2022-12-14 05:02:39,288 INFO L895 garLoopResultBuilder]: At program point L1144(line 1144) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse2 (= ~m_st~0 2)) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= 2 ~t2_st~0)) (.cse12 (not (= ~m_pc~0 1))) (.cse5 (= 2 ~t1_st~0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (<= 2 ~E_2~0)) (.cse8 (= ~t2_pc~0 1)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse13 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse12 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse13) (and .cse1 .cse2 .cse3 .cse12 .cse6 .cse14 .cse7 .cse9 .cse10 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse6 .cse7 .cse9 .cse10 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse4 (= ~m_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< (+ ~local~0 1) ~token~0) .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 .cse13))) [2022-12-14 05:02:39,289 INFO L895 garLoopResultBuilder]: At program point L1144-1(line 1144) the Hoare annotation is: (let ((.cse9 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse12 (= 2 ~t2_st~0)) (.cse13 (= 2 ~t1_st~0)) (.cse15 (= ~E_M~0 2)) (.cse5 (= ~t1_st~0 0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse14 (= ~t2_pc~0 1)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 .cse15 (= ~E_1~0 2)) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse12 (= ~m_st~0 0) .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 (< (+ ~local~0 1) ~token~0) .cse15) (and .cse11 .cse0 .cse2 .cse12 .cse3 .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 (= ~m_pc~0 0) .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8))) [2022-12-14 05:02:39,289 INFO L895 garLoopResultBuilder]: At program point L1145(line 1145) the Hoare annotation is: (let ((.cse9 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse12 (= 2 ~t2_st~0)) (.cse13 (= 2 ~t1_st~0)) (.cse15 (= ~E_M~0 2)) (.cse5 (= ~t1_st~0 0)) (.cse11 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse14 (= ~t2_pc~0 1)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse2 .cse12 .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 (= ~m_pc~0 0) .cse15) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse12 (= ~m_st~0 0) .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 (< (+ ~local~0 1) ~token~0) .cse15) (and .cse11 .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse12 .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 .cse15 (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8))) [2022-12-14 05:02:39,289 INFO L895 garLoopResultBuilder]: At program point L518(lines 518 527) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-12-14 05:02:39,289 INFO L899 garLoopResultBuilder]: For program point L518-2(lines 518 527) no Hoare annotation was computed. [2022-12-14 05:02:39,289 INFO L895 garLoopResultBuilder]: At program point L419(line 419) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-12-14 05:02:39,289 INFO L895 garLoopResultBuilder]: At program point L1146(line 1146) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse11 (= ~m_st~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse13 (not (= ~E_M~0 1))) (.cse1 (<= 2 ~E_1~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse10) (and .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)))) [2022-12-14 05:02:39,289 INFO L895 garLoopResultBuilder]: At program point L684-1(lines 684 697) the Hoare annotation is: (let ((.cse24 (+ ~local~0 1))) (let ((.cse3 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_M~0 1))) (.cse12 (<= ~token~0 .cse24)) (.cse14 (<= .cse24 ~token~0)) (.cse8 (= 0 ~t2_pc~0)) (.cse9 (= 0 ~t2_st~0)) (.cse20 (<= ~token~0 ~local~0)) (.cse21 (<= ~local~0 ~token~0)) (.cse22 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse0 (<= 2 ~E_1~0)) (.cse18 (= ~m_st~0 0)) (.cse19 (= ~m_pc~0 0)) (.cse1 (= ~m_st~0 2)) (.cse11 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse2 (= ~t1_i~0 1)) (.cse23 (= 2 ~t2_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (<= 2 ~E_2~0)) (.cse13 (= ~t2_pc~0 1)) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~c_dr_pc~0 0)) (.cse15 (= ~E_M~0 2)) (.cse16 (= ~E_1~0 2)) (.cse17 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse11 .cse2 .cse12 .cse4 .cse5 .cse13 .cse14 .cse6 .cse7 .cse15 .cse9 .cse16 .cse17) (and .cse0 .cse11 (= ~t1_pc~0 0) .cse2 .cse18 .cse3 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse15 .cse9 .cse20 .cse21 .cse16 .cse22 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7 .cse10) (and .cse1 .cse11 .cse2 .cse12 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse15 .cse9 .cse16 .cse22) (and .cse1 .cse11 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse20 .cse21 .cse16 .cse22) (and .cse0 .cse11 .cse2 .cse23 .cse18 .cse4 .cse5 .cse13 .cse6 .cse7 .cse19 .cse15 .cse17) (and .cse1 .cse11 .cse2 .cse23 .cse4 .cse5 .cse13 .cse6 .cse7 .cse15 .cse16 .cse17)))) [2022-12-14 05:02:39,289 INFO L899 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2022-12-14 05:02:39,289 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 05:02:39,289 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 169) no Hoare annotation was computed. [2022-12-14 05:02:39,289 INFO L899 garLoopResultBuilder]: For program point L884(lines 860 912) no Hoare annotation was computed. [2022-12-14 05:02:39,289 INFO L899 garLoopResultBuilder]: For program point L1149(line 1149) no Hoare annotation was computed. [2022-12-14 05:02:39,290 INFO L895 garLoopResultBuilder]: At program point L720-1(lines 720 733) the Hoare annotation is: (let ((.cse10 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse20 (+ ~local~0 1)) (.cse11 (= ~m_st~0 0)) (.cse12 (= ~m_pc~0 0)) (.cse0 (<= 2 ~E_1~0)) (.cse23 (not .cse10)) (.cse3 (not (= ~m_pc~0 1))) (.cse9 (not (= ~E_M~0 1))) (.cse22 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (.cse5 (= ~t1_st~0 0)) (.cse19 (= ~t1_pc~0 1)) (.cse1 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse21 (= 2 ~t1_st~0)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0)) (.cse13 (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0)))) (.cse14 (= ~E_M~0 2)) (.cse15 (<= ~token~0 ~local~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse17 (= ~E_1~0 2)) (.cse18 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse2 .cse10 .cse11 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse1 .cse2 (<= ~token~0 .cse20) .cse21 .cse4 .cse6 (<= .cse20 ~token~0) .cse7 .cse8 .cse13 .cse14 .cse17 .cse18) (and .cse19 .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse11 .cse21 .cse4 .cse6 .cse7 .cse8 (< .cse20 ~token~0) .cse13 .cse14 .cse22) (and .cse19 .cse0 .cse23 .cse2 .cse11 .cse3 .cse21 .cse4 .cse6 .cse7 .cse8 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse19 .cse2 (= ~m_st~0 ~E_M~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse14 .cse15 .cse16 .cse17 .cse22) (and .cse1 (= ~t1_pc~0 0) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse19 .cse1 .cse2 .cse21 .cse4 .cse6 .cse7 .cse8 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)))) [2022-12-14 05:02:39,290 INFO L895 garLoopResultBuilder]: At program point L654-1(lines 640 661) the Hoare annotation is: (let ((.cse14 (= 0 ~t2_pc~0)) (.cse15 (= 0 ~t2_st~0)) (.cse20 (= ~m_pc~0 ~t1_pc~0)) (.cse21 (= ~t1_st~0 0)) (.cse13 (= ~m_pc~0 0)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (= ~E_1~0 2)) (.cse19 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse12 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~m_pc~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse14 .cse11 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse2 .cse20 .cse5 .cse21 .cse6 .cse8 .cse9 .cse10 .cse13 .cse14 .cse11 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse2 .cse20 .cse3 .cse5 .cse21 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse11 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< (+ ~local~0 1) ~token~0) .cse11 .cse12))) [2022-12-14 05:02:39,290 INFO L895 garLoopResultBuilder]: At program point L522(line 522) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-12-14 05:02:39,290 INFO L895 garLoopResultBuilder]: At program point L522-1(line 522) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2022-12-14 05:02:39,290 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-12-14 05:02:39,290 INFO L899 garLoopResultBuilder]: For program point L423-1(lines 418 458) no Hoare annotation was computed. [2022-12-14 05:02:39,290 INFO L895 garLoopResultBuilder]: At program point $Ultimate##38(lines 179 187) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1))) (.cse2 (= ~p_dw_pc~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0)) (and .cse0 .cse1 (= ~c_dr_pc~0 1) .cse2))) [2022-12-14 05:02:39,290 INFO L899 garLoopResultBuilder]: For program point L160(lines 160 168) no Hoare annotation was computed. [2022-12-14 05:02:39,290 INFO L895 garLoopResultBuilder]: At program point L1151(lines 1151 1160) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse11 (= ~m_st~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse13 (not (= ~E_M~0 1))) (.cse1 (<= 2 ~E_1~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse10) (and .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)))) [2022-12-14 05:02:39,290 INFO L899 garLoopResultBuilder]: For program point L1151-2(lines 1151 1160) no Hoare annotation was computed. [2022-12-14 05:02:39,290 INFO L899 garLoopResultBuilder]: For program point L887(lines 887 894) no Hoare annotation was computed. [2022-12-14 05:02:39,290 INFO L895 garLoopResultBuilder]: At program point L492(line 492) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~c_dr_pc~0 0)) [2022-12-14 05:02:39,290 INFO L895 garLoopResultBuilder]: At program point L492-1(line 492) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~c_dr_pc~0 0)) [2022-12-14 05:02:39,291 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 05:02:39,291 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2022-12-14 05:02:39,291 INFO L895 garLoopResultBuilder]: At program point L494(line 494) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~c_dr_pc~0 0)) [2022-12-14 05:02:39,291 INFO L895 garLoopResultBuilder]: At program point L494-1(line 494) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~c_dr_pc~0 0)) [2022-12-14 05:02:39,291 INFO L899 garLoopResultBuilder]: For program point L428(lines 418 458) no Hoare annotation was computed. [2022-12-14 05:02:39,291 INFO L899 garLoopResultBuilder]: For program point L1188(lines 1188 1194) no Hoare annotation was computed. [2022-12-14 05:02:39,291 INFO L895 garLoopResultBuilder]: At program point L1155(line 1155) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse11 (= ~m_st~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse13 (not (= ~E_M~0 1))) (.cse1 (<= 2 ~E_1~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse10) (and .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)))) [2022-12-14 05:02:39,291 INFO L895 garLoopResultBuilder]: At program point L1155-1(line 1155) the Hoare annotation is: (let ((.cse14 (= ~t1_st~0 0)) (.cse11 (= ~m_st~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse15 (= 0 ~t2_pc~0)) (.cse16 (= 0 ~t2_st~0)) (.cse13 (not (= ~E_M~0 1))) (.cse1 (<= 2 ~E_1~0)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (<= 2 ~E_2~0)) (.cse7 (= ~t2_pc~0 1)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse7 .cse8 .cse9 .cse13) (and .cse1 .cse11 .cse2 .cse12 .cse5 .cse14 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse8 .cse9 .cse15 .cse16 .cse13) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) .cse10) (and .cse0 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_1~0 2)))) [2022-12-14 05:02:39,291 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2022-12-14 05:02:39,291 INFO L895 garLoopResultBuilder]: At program point L495(line 495) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~c_dr_pc~0 0)) [2022-12-14 05:02:39,291 INFO L895 garLoopResultBuilder]: At program point L694(line 694) the Hoare annotation is: (let ((.cse17 (+ ~local~0 1))) (let ((.cse6 (= ~t2_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse4 (not (= ~m_pc~0 1))) (.cse9 (not (= ~E_M~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~m_st~0 2)) (.cse10 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse3 (= ~t1_i~0 1)) (.cse11 (<= ~token~0 .cse17)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (<= .cse17 ~token~0)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0)) (.cse15 (= 0 ~t2_pc~0)) (.cse13 (= ~E_M~0 2)) (.cse16 (= 0 ~t2_st~0)) (.cse14 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse10 .cse3 (= 2 ~t2_st~0) .cse11 .cse5 .cse6 .cse12 .cse7 .cse8 .cse13 .cse14 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse15 .cse16 .cse9) (and .cse0 .cse2 .cse10 .cse3 .cse11 .cse5 .cse12 .cse7 .cse8 .cse15 .cse13 .cse16 .cse14 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))))) [2022-12-14 05:02:39,291 INFO L899 garLoopResultBuilder]: For program point L694-1(line 694) no Hoare annotation was computed. [2022-12-14 05:02:39,291 INFO L895 garLoopResultBuilder]: At program point L1190(lines 1190 1193) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-12-14 05:02:39,292 INFO L895 garLoopResultBuilder]: At program point $Ultimate##118(lines 654 660) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (= ~t1_i~0 1) (<= ~token~0 (+ 2 ~local~0)) (= 2 ~t2_st~0) (= 2 ~t1_st~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= 2 ~E_2~0) (= ~t2_pc~0 1) (not (= ~m_st~0 0)) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (< (+ ~local~0 1) ~token~0) (= ~E_M~0 2) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) [2022-12-14 05:02:39,292 INFO L899 garLoopResultBuilder]: For program point L629(lines 629 637) no Hoare annotation was computed. [2022-12-14 05:02:39,292 INFO L895 garLoopResultBuilder]: At program point L1125(line 1125) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-12-14 05:02:39,292 INFO L895 garLoopResultBuilder]: At program point L1125-1(line 1125) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~t1_st~0 0) (<= 2 ~E_2~0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-12-14 05:02:39,292 INFO L902 garLoopResultBuilder]: At program point L95(lines 73 97) the Hoare annotation is: true [2022-12-14 05:02:39,292 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2022-12-14 05:02:39,292 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 84 93) no Hoare annotation was computed. [2022-12-14 05:02:39,292 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 70 98) no Hoare annotation was computed. [2022-12-14 05:02:39,292 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 80) no Hoare annotation was computed. [2022-12-14 05:02:39,292 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2022-12-14 05:02:39,292 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 70 98) the Hoare annotation is: true [2022-12-14 05:02:39,292 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 73 97) no Hoare annotation was computed. [2022-12-14 05:02:39,292 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 295 314) the Hoare annotation is: true [2022-12-14 05:02:39,292 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 295 314) no Hoare annotation was computed. [2022-12-14 05:02:39,292 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 23 30) the Hoare annotation is: true [2022-12-14 05:02:39,293 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2022-12-14 05:02:39,293 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2022-12-14 05:02:39,293 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 829 853) the Hoare annotation is: true [2022-12-14 05:02:39,293 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 829 853) no Hoare annotation was computed. [2022-12-14 05:02:39,293 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 333 350) the Hoare annotation is: true [2022-12-14 05:02:39,293 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 333 350) no Hoare annotation was computed. [2022-12-14 05:02:39,293 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 957 994) the Hoare annotation is: (let ((.cse29 (= ~t2_pc~0 1)) (.cse27 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse26 (= ~t1_i~0 1)) (.cse24 (= ~t1_pc~0 1)) (.cse25 (<= 2 ~E_1~0)) (.cse18 (<= |old(~E_2~0)| ~E_2~0)) (.cse31 (not (= ~m_st~0 0)))) (let ((.cse14 (not (= ~m_pc~0 0))) (.cse13 (not (= 2 |old(~E_1~0)|))) (.cse20 (= ~E_1~0 2)) (.cse16 (and (not (= ~m_st~0 |old(~E_M~0)|)) .cse31)) (.cse1 (and .cse25 .cse18)) (.cse7 (= ~m_pc~0 1)) (.cse8 (not (= ~m_st~0 2))) (.cse11 (not (= 0 ~t2_st~0))) (.cse12 (not (= 0 ~t2_pc~0))) (.cse17 (not (= ~t1_st~0 0))) (.cse0 (not (<= 2 |old(~E_2~0)|))) (.cse2 (not (= ~t2_i~0 1))) (.cse3 (not .cse24)) (.cse21 (not (= 2 ~t2_st~0))) (.cse15 (not (= 2 |old(~E_M~0)|))) (.cse4 (not .cse26)) (.cse5 (not (= ~p_dw_pc~0 0))) (.cse22 (not (= 2 ~t1_st~0))) (.cse6 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not .cse27)) (.cse28 (<= 2 ~E_2~0)) (.cse30 (= ~c_dr_pc~0 0)) (.cse23 (= ~E_1~0 |old(~E_1~0)|)) (.cse19 (= ~E_M~0 2)) (.cse10 (not .cse29))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9 .cse12) (or .cse0 .cse2 (not (<= ~token~0 ~local~0)) .cse13 .cse14 .cse15 .cse4 .cse5 (not (= ~t1_pc~0 0)) (not (<= ~local~0 ~token~0)) .cse11 .cse9 .cse12 .cse16 .cse17 (and .cse18 .cse19 .cse20)) (or .cse0 .cse2 .cse3 .cse14 .cse21 .cse15 .cse4 .cse5 .cse22 .cse6 .cse9 (and .cse18 .cse23 .cse19) .cse10) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10) (or .cse0 .cse2 .cse3 .cse13 .cse21 .cse4 .cse5 .cse22 .cse6 .cse8 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse18 .cse30 .cse19 .cse20) .cse9 .cse16 .cse10) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9 .cse12 .cse17) (or .cse0 (not (< (+ ~local~0 1) ~token~0)) .cse2 .cse3 .cse21 .cse15 .cse4 .cse5 .cse22 .cse6 .cse9 .cse31 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse18 .cse30 .cse23 .cse19) .cse10 (not (<= ~token~0 (+ 2 ~local~0))))))) [2022-12-14 05:02:39,293 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 957 994) no Hoare annotation was computed. [2022-12-14 05:02:39,295 INFO L445 BasicCegarLoop]: Path program histogram: [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] [2022-12-14 05:02:39,297 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 05:02:39,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 05:02:39 BoogieIcfgContainer [2022-12-14 05:02:39,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 05:02:39,369 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 05:02:39,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 05:02:39,369 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 05:02:39,369 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:58:17" (3/4) ... [2022-12-14 05:02:39,372 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 05:02:39,375 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-12-14 05:02:39,375 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2022-12-14 05:02:39,375 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2022-12-14 05:02:39,375 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2022-12-14 05:02:39,376 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2022-12-14 05:02:39,376 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2022-12-14 05:02:39,376 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2022-12-14 05:02:39,376 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-12-14 05:02:39,376 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-12-14 05:02:39,376 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2022-12-14 05:02:39,376 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2022-12-14 05:02:39,376 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2022-12-14 05:02:39,376 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2022-12-14 05:02:39,376 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2022-12-14 05:02:39,387 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 93 nodes and edges [2022-12-14 05:02:39,388 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-12-14 05:02:39,389 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-14 05:02:39,390 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 05:02:39,412 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((!(t2_i == 1) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 <= E_2)) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || (((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((!(t2_i == 1) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && (((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || (((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && c_dr_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || (((((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((((!(t2_i == 1) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || ((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(E_M == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && ((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && c_dr_pc == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || ((((((((((t1_pc == 1 && 2 <= E_1) && 1 <= __retres1) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && c_dr_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 <= E_2)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) [2022-12-14 05:02:39,414 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || (((((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && token <= local + 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && 0 == t2_st) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((((((2 <= E_1 && (\result == 1 || !(t1_st == 0))) && t1_pc == 0) && t1_i == 1) && m_st == 0) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) && !(E_M == 1))) || (((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && token <= local + 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && E_1 == 2) && tmp == 1)) || (((((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((2 <= E_1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && !(tmp == 0))) || (((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) && !(tmp == 0)) [2022-12-14 05:02:39,415 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || (((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) [2022-12-14 05:02:39,415 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1)) || (((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st) && __retres1 == 0)) && (((((((((((((!(t2_i == 1) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && (((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(t2_i == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(E_M == 2)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2)) || (((((((1 <= __retres1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || ((((1 <= __retres1 && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || (((((((((1 <= __retres1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((!(m_pc == t1_pc) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || (((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1)) [2022-12-14 05:02:39,415 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1)) || ((((((((((((((t1_i == 1 && m_pc == t1_pc) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && !(tmp == 0))) || (((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && t1_i == 1) && m_st == 0) && !(m_pc == 1)) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || (((((((((((((m_st == 2 && t1_pc == 0) && t1_i == 1) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) [2022-12-14 05:02:39,415 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1)) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && E_1 == 2) && !(tmp == 0)) [2022-12-14 05:02:39,416 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) || !(t2_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || ((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && (((((((((((((((((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 1 <= __retres1) && __retres1 == 0) || !(t2_i == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || ((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(E_M == 2)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || ((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && __retres1 == 0) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(2 <= E_2)) || !(token <= 2 + local))) && ((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || ((((((t1_pc == 1 && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && (((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || (((((1 <= __retres1 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(2 <= E_2))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((((t1_pc == 1 && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && c_dr_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || ((((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || (((((((((!(m_pc == t1_pc) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_st)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || (((((1 <= __retres1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t2_i == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && 0 == t2_st) && __retres1 == 0))) && ((((((((((!(t2_i == 1) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || (((((1 <= __retres1 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2)) [2022-12-14 05:02:39,464 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 05:02:39,464 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 05:02:39,464 INFO L158 Benchmark]: Toolchain (without parser) took 262811.71ms. Allocated memory was 130.0MB in the beginning and 1.0GB in the end (delta: 910.2MB). Free memory was 93.5MB in the beginning and 382.6MB in the end (delta: -289.1MB). Peak memory consumption was 623.0MB. Max. memory is 16.1GB. [2022-12-14 05:02:39,465 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory was 93.8MB in the beginning and 93.8MB in the end (delta: 24.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 05:02:39,465 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.98ms. Allocated memory is still 130.0MB. Free memory was 93.4MB in the beginning and 75.0MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-14 05:02:39,465 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.47ms. Allocated memory is still 130.0MB. Free memory was 75.0MB in the beginning and 71.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 05:02:39,465 INFO L158 Benchmark]: Boogie Preprocessor took 25.04ms. Allocated memory is still 130.0MB. Free memory was 71.9MB in the beginning and 69.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 05:02:39,465 INFO L158 Benchmark]: RCFGBuilder took 625.10ms. Allocated memory is still 130.0MB. Free memory was 69.3MB in the beginning and 59.5MB in the end (delta: 9.9MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2022-12-14 05:02:39,466 INFO L158 Benchmark]: TraceAbstraction took 261768.38ms. Allocated memory was 130.0MB in the beginning and 1.0GB in the end (delta: 910.2MB). Free memory was 58.7MB in the beginning and 394.1MB in the end (delta: -335.4MB). Peak memory consumption was 649.9MB. Max. memory is 16.1GB. [2022-12-14 05:02:39,466 INFO L158 Benchmark]: Witness Printer took 95.13ms. Allocated memory is still 1.0GB. Free memory was 394.1MB in the beginning and 382.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 05:02:39,467 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.17ms. Allocated memory is still 130.0MB. Free memory was 93.8MB in the beginning and 93.8MB in the end (delta: 24.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.98ms. Allocated memory is still 130.0MB. Free memory was 93.4MB in the beginning and 75.0MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.47ms. Allocated memory is still 130.0MB. Free memory was 75.0MB in the beginning and 71.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.04ms. Allocated memory is still 130.0MB. Free memory was 71.9MB in the beginning and 69.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 625.10ms. Allocated memory is still 130.0MB. Free memory was 69.3MB in the beginning and 59.5MB in the end (delta: 9.9MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. * TraceAbstraction took 261768.38ms. Allocated memory was 130.0MB in the beginning and 1.0GB in the end (delta: 910.2MB). Free memory was 58.7MB in the beginning and 394.1MB in the end (delta: -335.4MB). Peak memory consumption was 649.9MB. Max. memory is 16.1GB. * Witness Printer took 95.13ms. Allocated memory is still 1.0GB. Free memory was 394.1MB in the beginning and 382.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 599]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 27]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 157 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 261.6s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 121.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8494 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8383 mSDsluCounter, 12329 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8176 mSDsCounter, 3493 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10962 IncrementalHoareTripleChecker+Invalid, 14455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3493 mSolverCounterUnsat, 4153 mSDtfsCounter, 10962 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3110 GetRequests, 2462 SyntacticMatches, 52 SemanticMatches, 596 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33335 ImplicationChecksByTransitivity, 67.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4038occurred in iteration=19, InterpolantAutomatonStates: 400, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 9034 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 81 LocationsWithAnnotation, 9656 PreInvPairs, 10916 NumberOfFragments, 15759 HoareAnnotationTreeSize, 9656 FomulaSimplifications, 772411 FormulaSimplificationTreeSizeReduction, 76.8s HoareSimplificationTime, 81 FomulaSimplificationsInter, 1968175 FormulaSimplificationTreeSizeReductionInter, 44.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 4390 NumberOfCodeBlocks, 4306 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 4680 ConstructedInterpolants, 0 QuantifiedInterpolants, 8873 SizeOfPredicates, 33 NumberOfNonLiveVariables, 8389 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 46 InterpolantComputations, 24 PerfectInterpolantSequences, 3084/3358 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 1190]: Loop Invariant Derived loop invariant: (((((((((((m_pc == t1_pc && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 471]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 518]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 640]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && !(m_pc == 1)) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && !(tmp == 0)) || (((((((((((((((t1_pc == 1 && t1_i == 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((((t1_i == 1 && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((((t1_i == 1 && m_pc == t1_pc) && 2 == t2_st) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2) && !(tmp == 0)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || (((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && !(2 == p_dw_pc)) - InvariantResult [Line: 1104]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || (((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 1117]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0 - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 720]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1)) || ((((((((((((((t1_i == 1 && m_pc == t1_pc) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && !(tmp == 0))) || (((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && t1_i == 1) && m_st == 0) && !(m_pc == 1)) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || (((((((((((((m_st == 2 && t1_pc == 0) && t1_i == 1) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) - InvariantResult [Line: 1132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_i == 1 && m_pc == t1_pc) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) || (((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || (((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 484]: Loop Invariant Derived loop invariant: m_pc == t1_pc && !(m_pc == 1) - InvariantResult [Line: 625]: Loop Invariant Derived loop invariant: (((((((((((((((((!(m_pc == t1_pc) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && 2 == t2_st) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) || (((((((((((((((!(m_pc == t1_pc) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) - InvariantResult [Line: 654]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2) && !(tmp == 0) - InvariantResult [Line: 522]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((m_pc == t1_pc && !(m_pc == 1)) && p_dw_pc == 1) && c_dr_pc == 0) || (((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) && p_dw_pc == 1) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((t1_pc == 0 && t1_i == 1) && m_st == E_M) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) || (((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2)) || (((((((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && E_1 == 2) && tmp == 1)) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((m_st == 2 && t1_pc == 0) && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((((t1_i == 1 && m_pc == t1_pc) && 2 == t2_st) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || (((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((((((t1_pc == 1 && t1_i == 1) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && 0 == t2_st) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((t1_i == 1 && m_pc == t1_pc) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && m_st == 0) && !(m_pc == 1)) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && !(tmp == 0)) - InvariantResult [Line: 782]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) || !(t2_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || ((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && (((((((((((((((((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 1 <= __retres1) && __retres1 == 0) || !(t2_i == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || ((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(E_M == 2)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || ((((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && __retres1 == 0) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(2 <= E_2)) || !(token <= 2 + local))) && ((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || ((((((t1_pc == 1 && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && (((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || (((((1 <= __retres1 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(2 <= E_2))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((((t1_pc == 1 && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && c_dr_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || ((((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || (((((((((!(m_pc == t1_pc) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_st)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || (((((1 <= __retres1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t2_i == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && 0 == t2_st) && __retres1 == 0))) && ((((((((((!(t2_i == 1) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || (((((1 <= __retres1 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 763]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1)) || (((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st) && __retres1 == 0)) && (((((((((((((!(t2_i == 1) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && (((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(t2_i == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(E_M == 2)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && (((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2)) || (((((((1 <= __retres1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || ((((1 <= __retres1 && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || (((((((((1 <= __retres1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((!(m_pc == t1_pc) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || (((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1)) - InvariantResult [Line: 854]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && !(m_pc == 1)) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && !(E_M == 1)) - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1155]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || (((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 829]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 712]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1)) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && E_1 == 2) && !(tmp == 0)) - InvariantResult [Line: 744]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(t2_i == 1) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 <= E_2)) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || !(2 <= E_2))) && ((((((((((!(t2_i == 1) || (((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((!(t2_i == 1) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && (((((((((((((((!(\old(t1_st) == 0) || !(m_pc == t1_pc)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && (((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || (((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && c_dr_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || (((((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((((!(t2_i == 1) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(0 == t2_pc)) || !(2 <= E_2))) && (((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || ((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(E_M == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) || !(token <= 2 + local))) && ((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(2 <= E_2))) && (((((((((((((!(t2_i == 1) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && c_dr_pc == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2))) && ((((((((((((((!(local + 1 < token) || !(t2_i == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || ((((((((((t1_pc == 1 && 2 <= E_1) && 1 <= __retres1) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && c_dr_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(2 <= E_2)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(2 <= E_2)) - InvariantResult [Line: 676]: Loop Invariant Derived loop invariant: ((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || (((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) - InvariantResult [Line: 1125]: Loop Invariant Derived loop invariant: (((((((((((((t1_i == 1 && m_pc == t1_pc) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 1151]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || (((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: m_pc == t1_pc && !(m_pc == 1) - InvariantResult [Line: 684]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || (((((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && token <= local + 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && 0 == t2_st) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((((((2 <= E_1 && (\result == 1 || !(t1_st == 0))) && t1_pc == 0) && t1_i == 1) && m_st == 0) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) && !(E_M == 1))) || (((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && token <= local + 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && local + 1 <= token) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && E_1 == 2) && tmp == 1)) || (((((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((2 <= E_1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && m_st == 0) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && !(tmp == 0))) || (((((((((((m_st == 2 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && 2 <= E_2) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2) && !(tmp == 0)) RESULT: Ultimate proved your program to be correct! [2022-12-14 05:02:39,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34384dad-9668-4458-8922-fa1fb2f36784/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE