./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 04:00:13,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 04:00:13,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 04:00:13,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 04:00:13,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 04:00:13,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 04:00:13,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 04:00:13,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 04:00:13,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 04:00:13,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 04:00:13,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 04:00:13,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 04:00:13,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 04:00:13,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 04:00:13,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 04:00:13,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 04:00:13,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 04:00:13,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 04:00:13,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 04:00:13,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 04:00:13,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 04:00:13,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 04:00:13,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 04:00:13,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 04:00:13,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 04:00:13,642 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 04:00:13,642 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 04:00:13,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 04:00:13,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 04:00:13,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 04:00:13,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 04:00:13,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 04:00:13,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 04:00:13,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 04:00:13,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 04:00:13,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 04:00:13,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 04:00:13,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 04:00:13,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 04:00:13,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 04:00:13,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 04:00:13,665 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 04:00:13,709 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 04:00:13,713 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 04:00:13,715 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 04:00:13,715 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 04:00:13,716 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 04:00:13,716 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 04:00:13,716 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 04:00:13,717 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 04:00:13,717 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 04:00:13,717 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 04:00:13,718 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 04:00:13,719 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 04:00:13,719 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 04:00:13,719 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 04:00:13,719 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 04:00:13,721 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 04:00:13,721 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 04:00:13,721 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 04:00:13,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 04:00:13,722 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 04:00:13,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 04:00:13,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 04:00:13,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 04:00:13,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 04:00:13,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 04:00:13,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 04:00:13,724 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 04:00:13,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 04:00:13,724 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 04:00:13,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 04:00:13,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 04:00:13,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 04:00:13,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:00:13,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 04:00:13,726 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 04:00:13,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 04:00:13,727 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 04:00:13,727 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 04:00:13,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 04:00:13,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 04:00:13,728 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 04:00:13,728 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_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44ef362a593e25f5681bc4a034b065cd86559bd3dd750386bca2a1f270891ccd [2022-11-03 04:00:13,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 04:00:13,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 04:00:13,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 04:00:13,988 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 04:00:13,989 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 04:00:13,991 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2022-11-03 04:00:14,066 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/data/d3017fdb6/516313f879344cda868fd609513b1112/FLAGaf17dc5f7 [2022-11-03 04:00:14,502 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 04:00:14,503 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2022-11-03 04:00:14,529 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/data/d3017fdb6/516313f879344cda868fd609513b1112/FLAGaf17dc5f7 [2022-11-03 04:00:15,048 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/data/d3017fdb6/516313f879344cda868fd609513b1112 [2022-11-03 04:00:15,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 04:00:15,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 04:00:15,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 04:00:15,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 04:00:15,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 04:00:15,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:00:15" (1/1) ... [2022-11-03 04:00:15,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fb2e95c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:15, skipping insertion in model container [2022-11-03 04:00:15,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:00:15" (1/1) ... [2022-11-03 04:00:15,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 04:00:15,123 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 04:00:15,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[671,684] [2022-11-03 04:00:15,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:00:15,402 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 04:00:15,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[671,684] [2022-11-03 04:00:15,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:00:15,473 INFO L208 MainTranslator]: Completed translation [2022-11-03 04:00:15,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:15 WrapperNode [2022-11-03 04:00:15,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 04:00:15,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 04:00:15,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 04:00:15,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 04:00:15,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:15" (1/1) ... [2022-11-03 04:00:15,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:15" (1/1) ... [2022-11-03 04:00:15,513 INFO L138 Inliner]: procedures = 32, calls = 37, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 273 [2022-11-03 04:00:15,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 04:00:15,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 04:00:15,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 04:00:15,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 04:00:15,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:15" (1/1) ... [2022-11-03 04:00:15,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:15" (1/1) ... [2022-11-03 04:00:15,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:15" (1/1) ... [2022-11-03 04:00:15,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:15" (1/1) ... [2022-11-03 04:00:15,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:15" (1/1) ... [2022-11-03 04:00:15,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:15" (1/1) ... [2022-11-03 04:00:15,543 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:15" (1/1) ... [2022-11-03 04:00:15,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:15" (1/1) ... [2022-11-03 04:00:15,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 04:00:15,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 04:00:15,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 04:00:15,548 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 04:00:15,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:15" (1/1) ... [2022-11-03 04:00:15,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:00:15,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:15,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 04:00:15,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 04:00:15,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 04:00:15,647 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-03 04:00:15,647 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-03 04:00:15,647 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-03 04:00:15,647 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-03 04:00:15,647 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-03 04:00:15,648 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-03 04:00:15,648 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-03 04:00:15,648 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-03 04:00:15,648 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-03 04:00:15,648 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-03 04:00:15,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 04:00:15,648 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-03 04:00:15,648 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-03 04:00:15,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 04:00:15,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 04:00:15,753 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 04:00:15,755 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 04:00:16,242 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 04:00:16,429 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 04:00:16,430 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-03 04:00:16,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:00:16 BoogieIcfgContainer [2022-11-03 04:00:16,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 04:00:16,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 04:00:16,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 04:00:16,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 04:00:16,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:00:15" (1/3) ... [2022-11-03 04:00:16,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392a0841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:00:16, skipping insertion in model container [2022-11-03 04:00:16,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:00:15" (2/3) ... [2022-11-03 04:00:16,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392a0841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:00:16, skipping insertion in model container [2022-11-03 04:00:16,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:00:16" (3/3) ... [2022-11-03 04:00:16,443 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2022-11-03 04:00:16,463 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 04:00:16,463 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 04:00:16,515 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 04:00:16,522 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;@45aee52a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 04:00:16,523 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-03 04:00:16,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 56 states have internal predecessors, (80), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-03 04:00:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-03 04:00:16,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:16,538 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] [2022-11-03 04:00:16,538 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:16,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:16,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1952637331, now seen corresponding path program 1 times [2022-11-03 04:00:16,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:16,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066765131] [2022-11-03 04:00:16,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:16,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:16,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:16,941 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:16,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066765131] [2022-11-03 04:00:16,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066765131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:16,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:16,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:00:16,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534197199] [2022-11-03 04:00:16,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:16,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:00:16,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:16,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:00:16,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:00:16,979 INFO L87 Difference]: Start difference. First operand has 78 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 56 states have internal predecessors, (80), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-11-03 04:00:17,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:17,239 INFO L93 Difference]: Finished difference Result 218 states and 318 transitions. [2022-11-03 04:00:17,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:00:17,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 36 [2022-11-03 04:00:17,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:17,251 INFO L225 Difference]: With dead ends: 218 [2022-11-03 04:00:17,251 INFO L226 Difference]: Without dead ends: 141 [2022-11-03 04:00:17,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:00:17,258 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 182 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:17,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 250 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:00:17,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-03 04:00:17,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2022-11-03 04:00:17,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 101 states have internal predecessors, (136), 28 states have call successors, (28), 12 states have call predecessors, (28), 12 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2022-11-03 04:00:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2022-11-03 04:00:17,371 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 36 [2022-11-03 04:00:17,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:17,371 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2022-11-03 04:00:17,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-11-03 04:00:17,372 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2022-11-03 04:00:17,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-03 04:00:17,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:17,375 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] [2022-11-03 04:00:17,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 04:00:17,376 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:17,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:17,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1406268527, now seen corresponding path program 1 times [2022-11-03 04:00:17,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:17,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986198460] [2022-11-03 04:00:17,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:17,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-03 04:00:17,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:17,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986198460] [2022-11-03 04:00:17,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986198460] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:17,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256165547] [2022-11-03 04:00:17,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:17,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:17,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:17,589 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:17,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 04:00:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:17,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 04:00:17,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 04:00:17,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:17,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256165547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:17,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:00:17,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-03 04:00:17,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120268085] [2022-11-03 04:00:17,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:17,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:00:17,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:17,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:00:17,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:00:17,834 INFO L87 Difference]: Start difference. First operand 140 states and 192 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 04:00:17,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:17,940 INFO L93 Difference]: Finished difference Result 403 states and 559 transitions. [2022-11-03 04:00:17,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:00:17,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-11-03 04:00:17,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:17,947 INFO L225 Difference]: With dead ends: 403 [2022-11-03 04:00:17,947 INFO L226 Difference]: Without dead ends: 268 [2022-11-03 04:00:17,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:00:17,949 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 82 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:17,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 194 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:00:17,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-11-03 04:00:17,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 264. [2022-11-03 04:00:17,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 189 states have (on average 1.3597883597883598) internal successors, (257), 192 states have internal predecessors, (257), 50 states have call successors, (50), 24 states have call predecessors, (50), 24 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2022-11-03 04:00:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 357 transitions. [2022-11-03 04:00:18,002 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 357 transitions. Word has length 65 [2022-11-03 04:00:18,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:18,003 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 357 transitions. [2022-11-03 04:00:18,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 04:00:18,003 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 357 transitions. [2022-11-03 04:00:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-03 04:00:18,006 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:18,006 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] [2022-11-03 04:00:18,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:18,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-03 04:00:18,235 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:18,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:18,236 INFO L85 PathProgramCache]: Analyzing trace with hash -51451855, now seen corresponding path program 1 times [2022-11-03 04:00:18,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:18,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210654757] [2022-11-03 04:00:18,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:18,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 04:00:18,584 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:18,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210654757] [2022-11-03 04:00:18,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210654757] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:18,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:18,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 04:00:18,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822864334] [2022-11-03 04:00:18,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:18,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 04:00:18,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:18,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 04:00:18,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:00:18,590 INFO L87 Difference]: Start difference. First operand 264 states and 357 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-11-03 04:00:18,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:18,906 INFO L93 Difference]: Finished difference Result 808 states and 1094 transitions. [2022-11-03 04:00:18,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 04:00:18,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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 65 [2022-11-03 04:00:18,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:18,912 INFO L225 Difference]: With dead ends: 808 [2022-11-03 04:00:18,912 INFO L226 Difference]: Without dead ends: 550 [2022-11-03 04:00:18,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-03 04:00:18,915 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 244 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:18,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 239 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:00:18,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-11-03 04:00:18,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 496. [2022-11-03 04:00:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 355 states have (on average 1.3380281690140845) internal successors, (475), 360 states have internal predecessors, (475), 92 states have call successors, (92), 48 states have call predecessors, (92), 48 states have return successors, (92), 88 states have call predecessors, (92), 92 states have call successors, (92) [2022-11-03 04:00:18,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 659 transitions. [2022-11-03 04:00:18,991 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 659 transitions. Word has length 65 [2022-11-03 04:00:18,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:18,992 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 659 transitions. [2022-11-03 04:00:18,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-11-03 04:00:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 659 transitions. [2022-11-03 04:00:18,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-03 04:00:18,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:18,996 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-11-03 04:00:18,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 04:00:18,997 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:18,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:18,997 INFO L85 PathProgramCache]: Analyzing trace with hash 141324835, now seen corresponding path program 1 times [2022-11-03 04:00:18,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:18,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928804913] [2022-11-03 04:00:18,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:18,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 04:00:19,296 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:19,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928804913] [2022-11-03 04:00:19,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928804913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:19,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:19,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 04:00:19,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119461859] [2022-11-03 04:00:19,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:19,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 04:00:19,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:19,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 04:00:19,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:00:19,299 INFO L87 Difference]: Start difference. First operand 496 states and 659 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-11-03 04:00:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:19,602 INFO L93 Difference]: Finished difference Result 1240 states and 1655 transitions. [2022-11-03 04:00:19,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 04:00:19,603 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-11-03 04:00:19,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:19,608 INFO L225 Difference]: With dead ends: 1240 [2022-11-03 04:00:19,608 INFO L226 Difference]: Without dead ends: 750 [2022-11-03 04:00:19,610 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-11-03 04:00:19,611 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 223 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:19,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 219 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:00:19,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-11-03 04:00:19,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 724. [2022-11-03 04:00:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 517 states have (on average 1.321083172147002) internal successors, (683), 524 states have internal predecessors, (683), 134 states have call successors, (134), 72 states have call predecessors, (134), 72 states have return successors, (134), 128 states have call predecessors, (134), 134 states have call successors, (134) [2022-11-03 04:00:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 951 transitions. [2022-11-03 04:00:19,707 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 951 transitions. Word has length 66 [2022-11-03 04:00:19,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:19,708 INFO L495 AbstractCegarLoop]: Abstraction has 724 states and 951 transitions. [2022-11-03 04:00:19,708 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-11-03 04:00:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 951 transitions. [2022-11-03 04:00:19,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-03 04:00:19,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:19,711 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-11-03 04:00:19,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 04:00:19,711 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:19,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:19,712 INFO L85 PathProgramCache]: Analyzing trace with hash 616127469, now seen corresponding path program 1 times [2022-11-03 04:00:19,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:19,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723242509] [2022-11-03 04:00:19,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:19,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 04:00:19,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:19,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723242509] [2022-11-03 04:00:19,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723242509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:19,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:19,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:00:19,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623395320] [2022-11-03 04:00:19,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:19,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:00:19,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:19,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:00:19,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:00:19,770 INFO L87 Difference]: Start difference. First operand 724 states and 951 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-11-03 04:00:19,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:19,905 INFO L93 Difference]: Finished difference Result 1269 states and 1679 transitions. [2022-11-03 04:00:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:00:19,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 67 [2022-11-03 04:00:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:19,910 INFO L225 Difference]: With dead ends: 1269 [2022-11-03 04:00:19,910 INFO L226 Difference]: Without dead ends: 897 [2022-11-03 04:00:19,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:00:19,912 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 36 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:19,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 215 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:00:19,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2022-11-03 04:00:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 804. [2022-11-03 04:00:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 585 states have (on average 1.335042735042735) internal successors, (781), 592 states have internal predecessors, (781), 140 states have call successors, (140), 78 states have call predecessors, (140), 78 states have return successors, (140), 134 states have call predecessors, (140), 140 states have call successors, (140) [2022-11-03 04:00:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1061 transitions. [2022-11-03 04:00:20,003 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1061 transitions. Word has length 67 [2022-11-03 04:00:20,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:20,004 INFO L495 AbstractCegarLoop]: Abstraction has 804 states and 1061 transitions. [2022-11-03 04:00:20,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-11-03 04:00:20,004 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1061 transitions. [2022-11-03 04:00:20,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-03 04:00:20,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:20,007 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] [2022-11-03 04:00:20,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 04:00:20,008 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:20,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:20,008 INFO L85 PathProgramCache]: Analyzing trace with hash 981825165, now seen corresponding path program 1 times [2022-11-03 04:00:20,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:20,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741189922] [2022-11-03 04:00:20,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:20,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-03 04:00:20,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:20,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741189922] [2022-11-03 04:00:20,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741189922] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:20,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:20,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:00:20,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227346496] [2022-11-03 04:00:20,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:20,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:00:20,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:20,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:00:20,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:00:20,061 INFO L87 Difference]: Start difference. First operand 804 states and 1061 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-11-03 04:00:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:20,253 INFO L93 Difference]: Finished difference Result 2000 states and 2655 transitions. [2022-11-03 04:00:20,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:00:20,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 86 [2022-11-03 04:00:20,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:20,260 INFO L225 Difference]: With dead ends: 2000 [2022-11-03 04:00:20,260 INFO L226 Difference]: Without dead ends: 1201 [2022-11-03 04:00:20,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:00:20,263 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 75 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 195 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-11-03 04:00:20,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 195 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:00:20,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2022-11-03 04:00:20,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1190. [2022-11-03 04:00:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 867 states have (on average 1.314878892733564) internal successors, (1140), 877 states have internal predecessors, (1140), 205 states have call successors, (205), 117 states have call predecessors, (205), 117 states have return successors, (205), 196 states have call predecessors, (205), 205 states have call successors, (205) [2022-11-03 04:00:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1550 transitions. [2022-11-03 04:00:20,399 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1550 transitions. Word has length 86 [2022-11-03 04:00:20,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:20,400 INFO L495 AbstractCegarLoop]: Abstraction has 1190 states and 1550 transitions. [2022-11-03 04:00:20,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-11-03 04:00:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1550 transitions. [2022-11-03 04:00:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-03 04:00:20,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:20,410 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] [2022-11-03 04:00:20,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 04:00:20,410 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:20,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:20,411 INFO L85 PathProgramCache]: Analyzing trace with hash 153649239, now seen corresponding path program 1 times [2022-11-03 04:00:20,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:20,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924563483] [2022-11-03 04:00:20,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:20,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:20,529 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-03 04:00:20,530 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:20,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924563483] [2022-11-03 04:00:20,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924563483] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:20,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995383614] [2022-11-03 04:00:20,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:20,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:20,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:20,535 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:20,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 04:00:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:20,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 04:00:20,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:20,710 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 04:00:20,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:20,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995383614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:20,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:00:20,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 04:00:20,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735251127] [2022-11-03 04:00:20,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:20,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:00:20,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:20,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:00:20,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:00:20,713 INFO L87 Difference]: Start difference. First operand 1190 states and 1550 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, (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-11-03 04:00:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:20,908 INFO L93 Difference]: Finished difference Result 2251 states and 2957 transitions. [2022-11-03 04:00:20,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:00:20,909 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, (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 100 [2022-11-03 04:00:20,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:20,917 INFO L225 Difference]: With dead ends: 2251 [2022-11-03 04:00:20,917 INFO L226 Difference]: Without dead ends: 1459 [2022-11-03 04:00:20,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:00:20,922 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 51 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:20,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 226 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:00:20,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2022-11-03 04:00:21,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1295. [2022-11-03 04:00:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 954 states have (on average 1.3238993710691824) internal successors, (1263), 964 states have internal predecessors, (1263), 214 states have call successors, (214), 126 states have call predecessors, (214), 126 states have return successors, (214), 205 states have call predecessors, (214), 214 states have call successors, (214) [2022-11-03 04:00:21,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1691 transitions. [2022-11-03 04:00:21,071 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1691 transitions. Word has length 100 [2022-11-03 04:00:21,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:21,071 INFO L495 AbstractCegarLoop]: Abstraction has 1295 states and 1691 transitions. [2022-11-03 04:00:21,071 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, (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-11-03 04:00:21,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1691 transitions. [2022-11-03 04:00:21,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-03 04:00:21,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:21,076 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] [2022-11-03 04:00:21,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:21,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:21,303 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:21,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:21,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1699567136, now seen corresponding path program 2 times [2022-11-03 04:00:21,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:21,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269448039] [2022-11-03 04:00:21,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:21,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:21,514 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-03 04:00:21,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:21,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269448039] [2022-11-03 04:00:21,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269448039] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:21,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992695611] [2022-11-03 04:00:21,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:00:21,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:21,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:21,519 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:21,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 04:00:21,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 04:00:21,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:00:21,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-03 04:00:21,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:21,934 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 04:00:21,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-03 04:00:22,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992695611] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:22,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 04:00:22,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 14 [2022-11-03 04:00:22,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082223329] [2022-11-03 04:00:22,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:22,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:00:22,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:22,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:00:22,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-03 04:00:22,234 INFO L87 Difference]: Start difference. First operand 1295 states and 1691 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 04:00:22,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:22,544 INFO L93 Difference]: Finished difference Result 2584 states and 3421 transitions. [2022-11-03 04:00:22,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:00:22,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 100 [2022-11-03 04:00:22,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:22,553 INFO L225 Difference]: With dead ends: 2584 [2022-11-03 04:00:22,553 INFO L226 Difference]: Without dead ends: 1687 [2022-11-03 04:00:22,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-03 04:00:22,557 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 89 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:22,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 219 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:00:22,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2022-11-03 04:00:22,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1623. [2022-11-03 04:00:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1246 states have (on average 1.3089887640449438) internal successors, (1631), 1256 states have internal predecessors, (1631), 220 states have call successors, (220), 156 states have call predecessors, (220), 156 states have return successors, (236), 211 states have call predecessors, (236), 220 states have call successors, (236) [2022-11-03 04:00:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2087 transitions. [2022-11-03 04:00:22,751 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2087 transitions. Word has length 100 [2022-11-03 04:00:22,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:22,751 INFO L495 AbstractCegarLoop]: Abstraction has 1623 states and 2087 transitions. [2022-11-03 04:00:22,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 04:00:22,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2087 transitions. [2022-11-03 04:00:22,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-03 04:00:22,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:22,757 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] [2022-11-03 04:00:22,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:22,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:22,983 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:22,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:22,984 INFO L85 PathProgramCache]: Analyzing trace with hash 510483117, now seen corresponding path program 1 times [2022-11-03 04:00:22,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:22,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742334069] [2022-11-03 04:00:22,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:22,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:23,093 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-03 04:00:23,093 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:23,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742334069] [2022-11-03 04:00:23,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742334069] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:23,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617794011] [2022-11-03 04:00:23,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:23,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:23,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:23,095 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:23,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 04:00:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:23,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 04:00:23,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 04:00:23,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:23,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617794011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:23,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:00:23,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 04:00:23,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548502698] [2022-11-03 04:00:23,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:23,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:00:23,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:23,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:00:23,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:00:23,252 INFO L87 Difference]: Start difference. First operand 1623 states and 2087 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-11-03 04:00:23,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:23,458 INFO L93 Difference]: Finished difference Result 3076 states and 4009 transitions. [2022-11-03 04:00:23,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:00:23,458 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 99 [2022-11-03 04:00:23,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:23,466 INFO L225 Difference]: With dead ends: 3076 [2022-11-03 04:00:23,467 INFO L226 Difference]: Without dead ends: 1953 [2022-11-03 04:00:23,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:00:23,470 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 44 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:23,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 218 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:00:23,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2022-11-03 04:00:23,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1760. [2022-11-03 04:00:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1359 states have (on average 1.3171449595290654) internal successors, (1790), 1369 states have internal predecessors, (1790), 232 states have call successors, (232), 168 states have call predecessors, (232), 168 states have return successors, (248), 223 states have call predecessors, (248), 232 states have call successors, (248) [2022-11-03 04:00:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2270 transitions. [2022-11-03 04:00:23,625 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2270 transitions. Word has length 99 [2022-11-03 04:00:23,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:23,625 INFO L495 AbstractCegarLoop]: Abstraction has 1760 states and 2270 transitions. [2022-11-03 04:00:23,625 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-11-03 04:00:23,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2270 transitions. [2022-11-03 04:00:23,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-03 04:00:23,630 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:23,630 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] [2022-11-03 04:00:23,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:23,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:23,855 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:23,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:23,856 INFO L85 PathProgramCache]: Analyzing trace with hash 350188677, now seen corresponding path program 2 times [2022-11-03 04:00:23,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:23,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78780710] [2022-11-03 04:00:23,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:23,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-03 04:00:24,079 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:24,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78780710] [2022-11-03 04:00:24,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78780710] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:24,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843365204] [2022-11-03 04:00:24,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:00:24,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:24,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:24,081 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:24,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 04:00:24,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 04:00:24,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:00:24,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 04:00:24,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-03 04:00:24,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:24,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843365204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:24,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:00:24,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 04:00:24,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149208855] [2022-11-03 04:00:24,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:24,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:00:24,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:24,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:00:24,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:00:24,208 INFO L87 Difference]: Start difference. First operand 1760 states and 2270 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-11-03 04:00:24,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:24,413 INFO L93 Difference]: Finished difference Result 3028 states and 3998 transitions. [2022-11-03 04:00:24,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:00:24,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 99 [2022-11-03 04:00:24,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:24,421 INFO L225 Difference]: With dead ends: 3028 [2022-11-03 04:00:24,422 INFO L226 Difference]: Without dead ends: 1768 [2022-11-03 04:00:24,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:00:24,426 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 85 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:24,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 219 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:00:24,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2022-11-03 04:00:24,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1748. [2022-11-03 04:00:24,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1347 states have (on average 1.2798812175204157) internal successors, (1724), 1357 states have internal predecessors, (1724), 232 states have call successors, (232), 168 states have call predecessors, (232), 168 states have return successors, (248), 223 states have call predecessors, (248), 232 states have call successors, (248) [2022-11-03 04:00:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2204 transitions. [2022-11-03 04:00:24,609 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2204 transitions. Word has length 99 [2022-11-03 04:00:24,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:24,609 INFO L495 AbstractCegarLoop]: Abstraction has 1748 states and 2204 transitions. [2022-11-03 04:00:24,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-11-03 04:00:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2204 transitions. [2022-11-03 04:00:24,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-03 04:00:24,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:24,614 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] [2022-11-03 04:00:24,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:24,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 04:00:24,827 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:24,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:24,828 INFO L85 PathProgramCache]: Analyzing trace with hash -579169819, now seen corresponding path program 1 times [2022-11-03 04:00:24,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:24,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75100125] [2022-11-03 04:00:24,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:24,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:25,037 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-03 04:00:25,037 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:25,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75100125] [2022-11-03 04:00:25,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75100125] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:25,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990762250] [2022-11-03 04:00:25,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:25,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:25,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:25,043 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:25,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 04:00:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:25,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 04:00:25,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:25,185 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-03 04:00:25,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:25,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990762250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:25,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:00:25,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 04:00:25,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494343446] [2022-11-03 04:00:25,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:25,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:00:25,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:25,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:00:25,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:00:25,190 INFO L87 Difference]: Start difference. First operand 1748 states and 2204 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-11-03 04:00:25,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:25,369 INFO L93 Difference]: Finished difference Result 3196 states and 4053 transitions. [2022-11-03 04:00:25,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:00:25,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 99 [2022-11-03 04:00:25,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:25,379 INFO L225 Difference]: With dead ends: 3196 [2022-11-03 04:00:25,379 INFO L226 Difference]: Without dead ends: 1997 [2022-11-03 04:00:25,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:00:25,383 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 84 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:25,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 112 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:00:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2022-11-03 04:00:25,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1997. [2022-11-03 04:00:25,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1566 states have (on average 1.248403575989783) internal successors, (1955), 1576 states have internal predecessors, (1955), 238 states have call successors, (238), 192 states have call predecessors, (238), 192 states have return successors, (254), 229 states have call predecessors, (254), 238 states have call successors, (254) [2022-11-03 04:00:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2447 transitions. [2022-11-03 04:00:25,575 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2447 transitions. Word has length 99 [2022-11-03 04:00:25,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:25,576 INFO L495 AbstractCegarLoop]: Abstraction has 1997 states and 2447 transitions. [2022-11-03 04:00:25,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-11-03 04:00:25,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2447 transitions. [2022-11-03 04:00:25,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-03 04:00:25,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:25,581 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] [2022-11-03 04:00:25,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:25,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 04:00:25,795 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:25,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:25,796 INFO L85 PathProgramCache]: Analyzing trace with hash -461371372, now seen corresponding path program 1 times [2022-11-03 04:00:25,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:25,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420034960] [2022-11-03 04:00:25,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:25,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:26,003 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-03 04:00:26,003 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:26,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420034960] [2022-11-03 04:00:26,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420034960] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:26,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753980957] [2022-11-03 04:00:26,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:26,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:26,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:26,005 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:26,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 04:00:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:26,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 04:00:26,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:26,149 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 04:00:26,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:26,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753980957] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:26,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:00:26,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 04:00:26,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750615826] [2022-11-03 04:00:26,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:26,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:00:26,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:26,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:00:26,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:00:26,152 INFO L87 Difference]: Start difference. First operand 1997 states and 2447 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-11-03 04:00:26,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:26,371 INFO L93 Difference]: Finished difference Result 3367 states and 4218 transitions. [2022-11-03 04:00:26,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:00:26,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 99 [2022-11-03 04:00:26,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:26,380 INFO L225 Difference]: With dead ends: 3367 [2022-11-03 04:00:26,380 INFO L226 Difference]: Without dead ends: 1981 [2022-11-03 04:00:26,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:00:26,384 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 72 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:26,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 225 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:00:26,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2022-11-03 04:00:26,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1961. [2022-11-03 04:00:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1534 states have (on average 1.2118644067796611) internal successors, (1859), 1540 states have internal predecessors, (1859), 238 states have call successors, (238), 192 states have call predecessors, (238), 188 states have return successors, (250), 229 states have call predecessors, (250), 238 states have call successors, (250) [2022-11-03 04:00:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2347 transitions. [2022-11-03 04:00:26,590 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2347 transitions. Word has length 99 [2022-11-03 04:00:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:26,590 INFO L495 AbstractCegarLoop]: Abstraction has 1961 states and 2347 transitions. [2022-11-03 04:00:26,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-11-03 04:00:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2347 transitions. [2022-11-03 04:00:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-03 04:00:26,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:26,596 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-11-03 04:00:26,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:26,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 04:00:26,819 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:26,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:26,820 INFO L85 PathProgramCache]: Analyzing trace with hash 292411212, now seen corresponding path program 1 times [2022-11-03 04:00:26,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:26,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657893394] [2022-11-03 04:00:26,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:26,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-03 04:00:27,024 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:27,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657893394] [2022-11-03 04:00:27,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657893394] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:27,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668921041] [2022-11-03 04:00:27,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:27,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:27,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:27,026 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:27,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 04:00:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:27,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 04:00:27,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 04:00:27,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:27,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668921041] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:27,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:00:27,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 04:00:27,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001365232] [2022-11-03 04:00:27,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:27,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:00:27,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:27,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:00:27,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:00:27,171 INFO L87 Difference]: Start difference. First operand 1961 states and 2347 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, (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-11-03 04:00:27,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:27,434 INFO L93 Difference]: Finished difference Result 4621 states and 5593 transitions. [2022-11-03 04:00:27,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:00:27,435 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, (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-11-03 04:00:27,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:27,445 INFO L225 Difference]: With dead ends: 4621 [2022-11-03 04:00:27,445 INFO L226 Difference]: Without dead ends: 2666 [2022-11-03 04:00:27,449 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-11-03 04:00:27,449 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 40 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:27,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 185 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:00:27,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2022-11-03 04:00:27,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2149. [2022-11-03 04:00:27,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 1686 states have (on average 1.2188612099644127) internal successors, (2055), 1693 states have internal predecessors, (2055), 256 states have call successors, (256), 210 states have call predecessors, (256), 206 states have return successors, (268), 246 states have call predecessors, (268), 256 states have call successors, (268) [2022-11-03 04:00:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 2579 transitions. [2022-11-03 04:00:27,643 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 2579 transitions. Word has length 100 [2022-11-03 04:00:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:27,643 INFO L495 AbstractCegarLoop]: Abstraction has 2149 states and 2579 transitions. [2022-11-03 04:00:27,643 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, (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-11-03 04:00:27,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2579 transitions. [2022-11-03 04:00:27,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-03 04:00:27,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:27,649 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-11-03 04:00:27,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:27,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 04:00:27,862 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:27,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:27,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1361042196, now seen corresponding path program 1 times [2022-11-03 04:00:27,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:27,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021527086] [2022-11-03 04:00:27,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:27,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 04:00:28,039 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:28,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021527086] [2022-11-03 04:00:28,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021527086] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:28,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542995677] [2022-11-03 04:00:28,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:28,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:28,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:28,041 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:28,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 04:00:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:28,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 04:00:28,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 04:00:28,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:28,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542995677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:28,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:00:28,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-11-03 04:00:28,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337012125] [2022-11-03 04:00:28,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:28,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:00:28,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:28,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:00:28,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:00:28,270 INFO L87 Difference]: Start difference. First operand 2149 states and 2579 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-11-03 04:00:28,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:28,621 INFO L93 Difference]: Finished difference Result 3835 states and 4646 transitions. [2022-11-03 04:00:28,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:00:28,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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 101 [2022-11-03 04:00:28,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:28,634 INFO L225 Difference]: With dead ends: 3835 [2022-11-03 04:00:28,635 INFO L226 Difference]: Without dead ends: 2738 [2022-11-03 04:00:28,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 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-11-03 04:00:28,638 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 120 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:28,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 223 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:00:28,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2738 states. [2022-11-03 04:00:28,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2738 to 2414. [2022-11-03 04:00:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2414 states, 1916 states have (on average 1.2014613778705636) internal successors, (2302), 1929 states have internal predecessors, (2302), 268 states have call successors, (268), 229 states have call predecessors, (268), 229 states have return successors, (285), 256 states have call predecessors, (285), 268 states have call successors, (285) [2022-11-03 04:00:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 2855 transitions. [2022-11-03 04:00:28,884 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 2855 transitions. Word has length 101 [2022-11-03 04:00:28,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:28,885 INFO L495 AbstractCegarLoop]: Abstraction has 2414 states and 2855 transitions. [2022-11-03 04:00:28,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-11-03 04:00:28,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 2855 transitions. [2022-11-03 04:00:28,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-03 04:00:28,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:28,890 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:28,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:29,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 04:00:29,103 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:29,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:29,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1962250413, now seen corresponding path program 1 times [2022-11-03 04:00:29,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:29,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362240103] [2022-11-03 04:00:29,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:29,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:29,168 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 04:00:29,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:29,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362240103] [2022-11-03 04:00:29,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362240103] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:29,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:29,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:00:29,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443550285] [2022-11-03 04:00:29,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:29,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:00:29,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:29,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:00:29,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:00:29,172 INFO L87 Difference]: Start difference. First operand 2414 states and 2855 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 04:00:29,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:29,629 INFO L93 Difference]: Finished difference Result 3729 states and 4492 transitions. [2022-11-03 04:00:29,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 04:00:29,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 101 [2022-11-03 04:00:29,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:29,639 INFO L225 Difference]: With dead ends: 3729 [2022-11-03 04:00:29,639 INFO L226 Difference]: Without dead ends: 2414 [2022-11-03 04:00:29,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:00:29,643 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 169 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:29,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 242 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:00:29,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2022-11-03 04:00:29,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2405. [2022-11-03 04:00:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2405 states, 1907 states have (on average 1.1793392763502883) internal successors, (2249), 1920 states have internal predecessors, (2249), 268 states have call successors, (268), 229 states have call predecessors, (268), 229 states have return successors, (285), 256 states have call predecessors, (285), 268 states have call successors, (285) [2022-11-03 04:00:29,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 2802 transitions. [2022-11-03 04:00:29,911 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 2802 transitions. Word has length 101 [2022-11-03 04:00:29,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:29,911 INFO L495 AbstractCegarLoop]: Abstraction has 2405 states and 2802 transitions. [2022-11-03 04:00:29,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 04:00:29,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 2802 transitions. [2022-11-03 04:00:29,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-03 04:00:29,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:29,917 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] [2022-11-03 04:00:29,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 04:00:29,917 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:29,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:29,918 INFO L85 PathProgramCache]: Analyzing trace with hash -149093846, now seen corresponding path program 1 times [2022-11-03 04:00:29,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:29,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940791122] [2022-11-03 04:00:29,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:29,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:30,078 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-03 04:00:30,079 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:30,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940791122] [2022-11-03 04:00:30,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940791122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:30,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:00:30,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 04:00:30,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507123056] [2022-11-03 04:00:30,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:30,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:00:30,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:30,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:00:30,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:00:30,081 INFO L87 Difference]: Start difference. First operand 2405 states and 2802 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-11-03 04:00:30,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:30,596 INFO L93 Difference]: Finished difference Result 4587 states and 5361 transitions. [2022-11-03 04:00:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:00:30,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 102 [2022-11-03 04:00:30,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:30,609 INFO L225 Difference]: With dead ends: 4587 [2022-11-03 04:00:30,609 INFO L226 Difference]: Without dead ends: 3281 [2022-11-03 04:00:30,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:00:30,613 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 74 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:30,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 344 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:00:30,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2022-11-03 04:00:30,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 3179. [2022-11-03 04:00:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3179 states, 2494 states have (on average 1.165597433841219) internal successors, (2907), 2518 states have internal predecessors, (2907), 368 states have call successors, (368), 311 states have call predecessors, (368), 316 states have return successors, (419), 350 states have call predecessors, (419), 368 states have call successors, (419) [2022-11-03 04:00:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3179 states to 3179 states and 3694 transitions. [2022-11-03 04:00:30,988 INFO L78 Accepts]: Start accepts. Automaton has 3179 states and 3694 transitions. Word has length 102 [2022-11-03 04:00:30,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:30,988 INFO L495 AbstractCegarLoop]: Abstraction has 3179 states and 3694 transitions. [2022-11-03 04:00:30,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-11-03 04:00:30,989 INFO L276 IsEmpty]: Start isEmpty. Operand 3179 states and 3694 transitions. [2022-11-03 04:00:30,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-03 04:00:30,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:30,995 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] [2022-11-03 04:00:30,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 04:00:30,995 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:30,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:30,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1848578586, now seen corresponding path program 1 times [2022-11-03 04:00:30,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:30,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099849911] [2022-11-03 04:00:30,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:30,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 04:00:31,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:31,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099849911] [2022-11-03 04:00:31,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099849911] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:31,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238404660] [2022-11-03 04:00:31,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:31,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:31,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:31,173 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:31,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 04:00:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:31,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 04:00:31,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:31,351 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:00:31,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238404660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:00:31,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:00:31,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2022-11-03 04:00:31,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029331704] [2022-11-03 04:00:31,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:00:31,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 04:00:31,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:31,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 04:00:31,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:00:31,353 INFO L87 Difference]: Start difference. First operand 3179 states and 3694 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-11-03 04:00:32,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:32,064 INFO L93 Difference]: Finished difference Result 6281 states and 7325 transitions. [2022-11-03 04:00:32,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 04:00:32,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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 102 [2022-11-03 04:00:32,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:32,080 INFO L225 Difference]: With dead ends: 6281 [2022-11-03 04:00:32,080 INFO L226 Difference]: Without dead ends: 4084 [2022-11-03 04:00:32,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-03 04:00:32,085 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 160 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:32,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 291 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:00:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4084 states. [2022-11-03 04:00:32,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4084 to 3834. [2022-11-03 04:00:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3834 states, 3002 states have (on average 1.1578947368421053) internal successors, (3476), 3029 states have internal predecessors, (3476), 452 states have call successors, (452), 377 states have call predecessors, (452), 379 states have return successors, (524), 428 states have call predecessors, (524), 452 states have call successors, (524) [2022-11-03 04:00:32,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3834 states to 3834 states and 4452 transitions. [2022-11-03 04:00:32,532 INFO L78 Accepts]: Start accepts. Automaton has 3834 states and 4452 transitions. Word has length 102 [2022-11-03 04:00:32,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:32,533 INFO L495 AbstractCegarLoop]: Abstraction has 3834 states and 4452 transitions. [2022-11-03 04:00:32,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-11-03 04:00:32,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3834 states and 4452 transitions. [2022-11-03 04:00:32,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-03 04:00:32,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:32,540 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] [2022-11-03 04:00:32,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:32,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 04:00:32,755 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:32,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:32,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1977234743, now seen corresponding path program 1 times [2022-11-03 04:00:32,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:32,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630576919] [2022-11-03 04:00:32,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:32,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-03 04:00:33,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:33,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630576919] [2022-11-03 04:00:33,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630576919] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:33,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267401272] [2022-11-03 04:00:33,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:33,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:33,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:33,245 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:33,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 04:00:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:33,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 04:00:33,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:33,542 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:00:33,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:33,834 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-03 04:00:33,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267401272] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:33,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2058920590] [2022-11-03 04:00:33,854 INFO L159 IcfgInterpreter]: Started Sifa with 62 locations of interest [2022-11-03 04:00:33,871 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:00:33,897 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:00:33,904 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:00:33,905 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:00:38,211 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 118 for LOIs [2022-11-03 04:00:40,806 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 148 for LOIs [2022-11-03 04:00:42,271 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 124 for LOIs [2022-11-03 04:00:42,298 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 32 for LOIs [2022-11-03 04:00:42,304 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 41 for LOIs [2022-11-03 04:00:42,442 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 50 for LOIs [2022-11-03 04:00:42,570 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:00:54,776 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '109860#(and (<= ~local~0 2147483647) (<= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483647) (= ~t1_pc~0 0) (= ~t1_i~0 1) (not (= ~token~0 (+ 2 ~local~0))) (<= 0 (+ ~local~0 2147483648)) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= |ULTIMATE.start_eval_~tmp~0#1| 1) (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483648)) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~m_pc~0 1) (<= 1 ~m_i~0) (= ~t2_i~0 1) (= 0 ~t2_pc~0) (not (= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 0)) (<= ~m_i~0 1) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_eval_~tmp~0#1|) (= |#NULL.base| 0))' at error location [2022-11-03 04:00:54,777 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:00:54,777 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:00:54,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 6] total 20 [2022-11-03 04:00:54,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616055789] [2022-11-03 04:00:54,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:54,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 04:00:54,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:54,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 04:00:54,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=3727, Unknown=0, NotChecked=0, Total=4160 [2022-11-03 04:00:54,780 INFO L87 Difference]: Start difference. First operand 3834 states and 4452 transitions. Second operand has 20 states, 16 states have (on average 7.875) internal successors, (126), 18 states have internal predecessors, (126), 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-11-03 04:00:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:56,969 INFO L93 Difference]: Finished difference Result 6864 states and 8091 transitions. [2022-11-03 04:00:56,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-03 04:00:56,969 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 7.875) internal successors, (126), 18 states have internal predecessors, (126), 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 108 [2022-11-03 04:00:56,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:56,994 INFO L225 Difference]: With dead ends: 6864 [2022-11-03 04:00:57,000 INFO L226 Difference]: Without dead ends: 3030 [2022-11-03 04:00:57,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 287 SyntacticMatches, 10 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4770 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=927, Invalid=10203, Unknown=0, NotChecked=0, Total=11130 [2022-11-03 04:00:57,011 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 607 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:57,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1652 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 04:00:57,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2022-11-03 04:00:57,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 2395. [2022-11-03 04:00:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2395 states, 1902 states have (on average 1.1635120925341746) internal successors, (2213), 1916 states have internal predecessors, (2213), 258 states have call successors, (258), 234 states have call predecessors, (258), 234 states have return successors, (286), 244 states have call predecessors, (286), 258 states have call successors, (286) [2022-11-03 04:00:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 2757 transitions. [2022-11-03 04:00:57,302 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 2757 transitions. Word has length 108 [2022-11-03 04:00:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:57,302 INFO L495 AbstractCegarLoop]: Abstraction has 2395 states and 2757 transitions. [2022-11-03 04:00:57,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 7.875) internal successors, (126), 18 states have internal predecessors, (126), 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-11-03 04:00:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 2757 transitions. [2022-11-03 04:00:57,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-03 04:00:57,307 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:57,307 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] [2022-11-03 04:00:57,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:57,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 04:00:57,523 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:00:57,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:57,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1012204749, now seen corresponding path program 1 times [2022-11-03 04:00:57,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:57,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963214216] [2022-11-03 04:00:57,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:57,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-03 04:00:58,089 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:58,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963214216] [2022-11-03 04:00:58,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963214216] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:58,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763433382] [2022-11-03 04:00:58,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:58,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:58,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:58,091 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:58,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 04:00:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:58,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 04:00:58,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:00:58,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-03 04:00:58,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763433382] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:58,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1181772234] [2022-11-03 04:00:58,662 INFO L159 IcfgInterpreter]: Started Sifa with 65 locations of interest [2022-11-03 04:00:58,662 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:00:58,663 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:00:58,663 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:00:58,664 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:01:01,532 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 119 for LOIs [2022-11-03 04:01:04,209 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 149 for LOIs [2022-11-03 04:01:06,681 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 125 for LOIs [2022-11-03 04:01:06,699 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 52 for LOIs [2022-11-03 04:01:06,707 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 42 for LOIs [2022-11-03 04:01:06,761 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 33 for LOIs [2022-11-03 04:01:06,943 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:01:13,127 WARN L234 SmtUtils]: Spent 5.18s on a formula simplification. DAG size of input: 317 DAG size of output: 233 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:01:24,619 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '123629#(and (<= ~t1_pc~0 1) (<= ~local~0 2147483647) (<= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483647) (= ~t1_i~0 1) (not (= ~token~0 (+ 2 ~local~0))) (<= 0 (+ ~local~0 2147483648)) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= |ULTIMATE.start_eval_~tmp~0#1| 1) (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483648)) (<= |#NULL.offset| 0) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~m_pc~0 1) (<= 1 ~m_i~0) (= ~t2_i~0 1) (= 0 ~t2_pc~0) (not (= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 0)) (<= ~m_i~0 1) (= ~m_st~0 1) (<= ~token~0 2147483647) (<= 0 |#NULL.offset|) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_eval_~tmp~0#1|) (<= 0 ~t1_pc~0) (= |#NULL.base| 0))' at error location [2022-11-03 04:01:24,619 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:01:24,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:01:24,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 21 [2022-11-03 04:01:24,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707204922] [2022-11-03 04:01:24,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:01:24,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 04:01:24,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:01:24,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 04:01:24,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=4427, Unknown=0, NotChecked=0, Total=4830 [2022-11-03 04:01:24,623 INFO L87 Difference]: Start difference. First operand 2395 states and 2757 transitions. Second operand has 21 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 19 states have internal predecessors, (135), 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-11-03 04:01:27,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:01:27,315 INFO L93 Difference]: Finished difference Result 4335 states and 5041 transitions. [2022-11-03 04:01:27,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-11-03 04:01:27,315 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 19 states have internal predecessors, (135), 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 111 [2022-11-03 04:01:27,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:01:27,322 INFO L225 Difference]: With dead ends: 4335 [2022-11-03 04:01:27,322 INFO L226 Difference]: Without dead ends: 2090 [2022-11-03 04:01:27,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 298 SyntacticMatches, 15 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9279 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=1374, Invalid=19506, Unknown=0, NotChecked=0, Total=20880 [2022-11-03 04:01:27,334 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 483 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 04:01:27,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1442 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1452 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 04:01:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2022-11-03 04:01:27,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 1715. [2022-11-03 04:01:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1366 states have (on average 1.1544655929721817) internal successors, (1577), 1375 states have internal predecessors, (1577), 180 states have call successors, (180), 168 states have call predecessors, (180), 168 states have return successors, (202), 171 states have call predecessors, (202), 180 states have call successors, (202) [2022-11-03 04:01:27,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 1959 transitions. [2022-11-03 04:01:27,547 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 1959 transitions. Word has length 111 [2022-11-03 04:01:27,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:01:27,549 INFO L495 AbstractCegarLoop]: Abstraction has 1715 states and 1959 transitions. [2022-11-03 04:01:27,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 7.9411764705882355) internal successors, (135), 19 states have internal predecessors, (135), 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-11-03 04:01:27,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 1959 transitions. [2022-11-03 04:01:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-03 04:01:27,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:01:27,553 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:01:27,593 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-03 04:01:27,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:01:27,779 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:01:27,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:01:27,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1801256207, now seen corresponding path program 1 times [2022-11-03 04:01:27,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:01:27,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614682265] [2022-11-03 04:01:27,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:27,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:01:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:28,417 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 23 proven. 21 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 04:01:28,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:01:28,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614682265] [2022-11-03 04:01:28,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614682265] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:01:28,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571553865] [2022-11-03 04:01:28,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:28,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:01:28,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:01:28,419 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:01:28,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 04:01:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:28,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 04:01:28,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:01:28,929 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-03 04:01:28,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:01:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-03 04:01:29,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571553865] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:01:29,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1293134930] [2022-11-03 04:01:29,755 INFO L159 IcfgInterpreter]: Started Sifa with 68 locations of interest [2022-11-03 04:01:29,755 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 04:01:29,756 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 04:01:29,756 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 04:01:29,756 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 04:01:32,556 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 120 for LOIs [2022-11-03 04:01:34,212 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 150 for LOIs [2022-11-03 04:01:35,305 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 126 for LOIs [2022-11-03 04:01:35,325 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 34 for LOIs [2022-11-03 04:01:35,332 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 43 for LOIs [2022-11-03 04:01:35,391 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 34 for LOIs [2022-11-03 04:01:35,545 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 04:01:51,898 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '132949#(and (<= ~t1_pc~0 1) (<= ~local~0 2147483647) (<= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483647) (= ~t1_i~0 1) (not (= ~token~0 (+ 2 ~local~0))) (<= 0 (+ ~local~0 2147483648)) (<= 0 ~t2_pc~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= |ULTIMATE.start_eval_~tmp~0#1| 1) (<= 0 (+ |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 2147483648)) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~m_pc~0 1) (<= ~t2_pc~0 1) (<= 1 ~m_i~0) (= ~t2_i~0 1) (not (= |ULTIMATE.start_eval_~tmp_ndt_1~0#1| 0)) (<= ~m_i~0 1) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_eval_~tmp~0#1|) (<= 0 ~t1_pc~0) (= |#NULL.base| 0))' at error location [2022-11-03 04:01:51,898 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 04:01:51,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:01:51,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 12] total 36 [2022-11-03 04:01:51,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831470832] [2022-11-03 04:01:51,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:01:51,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 04:01:51,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:01:51,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 04:01:51,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=7223, Unknown=0, NotChecked=0, Total=7832 [2022-11-03 04:01:51,902 INFO L87 Difference]: Start difference. First operand 1715 states and 1959 transitions. Second operand has 36 states, 24 states have (on average 6.916666666666667) internal successors, (166), 27 states have internal predecessors, (166), 14 states have call successors, (40), 11 states have call predecessors, (40), 18 states have return successors, (40), 14 states have call predecessors, (40), 14 states have call successors, (40) [2022-11-03 04:01:56,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:01:56,368 INFO L93 Difference]: Finished difference Result 4173 states and 4850 transitions. [2022-11-03 04:01:56,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-03 04:01:56,369 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 24 states have (on average 6.916666666666667) internal successors, (166), 27 states have internal predecessors, (166), 14 states have call successors, (40), 11 states have call predecessors, (40), 18 states have return successors, (40), 14 states have call predecessors, (40), 14 states have call successors, (40) Word has length 113 [2022-11-03 04:01:56,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:01:56,377 INFO L225 Difference]: With dead ends: 4173 [2022-11-03 04:01:56,378 INFO L226 Difference]: Without dead ends: 2765 [2022-11-03 04:01:56,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 278 SyntacticMatches, 4 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6407 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=1738, Invalid=15292, Unknown=0, NotChecked=0, Total=17030 [2022-11-03 04:01:56,386 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 3391 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 1608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3391 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 3783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1608 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:01:56,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3391 Valid, 1088 Invalid, 3783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1608 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-03 04:01:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2765 states. [2022-11-03 04:01:56,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2765 to 1537. [2022-11-03 04:01:56,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1214 states have (on average 1.1523887973640856) internal successors, (1399), 1224 states have internal predecessors, (1399), 169 states have call successors, (169), 153 states have call predecessors, (169), 153 states have return successors, (169), 159 states have call predecessors, (169), 169 states have call successors, (169) [2022-11-03 04:01:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 1737 transitions. [2022-11-03 04:01:56,593 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 1737 transitions. Word has length 113 [2022-11-03 04:01:56,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:01:56,593 INFO L495 AbstractCegarLoop]: Abstraction has 1537 states and 1737 transitions. [2022-11-03 04:01:56,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 24 states have (on average 6.916666666666667) internal successors, (166), 27 states have internal predecessors, (166), 14 states have call successors, (40), 11 states have call predecessors, (40), 18 states have return successors, (40), 14 states have call predecessors, (40), 14 states have call successors, (40) [2022-11-03 04:01:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1737 transitions. [2022-11-03 04:01:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-11-03 04:01:56,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:01:56,596 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] [2022-11-03 04:01:56,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 04:01:56,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:01:56,823 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:01:56,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:01:56,823 INFO L85 PathProgramCache]: Analyzing trace with hash 634959828, now seen corresponding path program 1 times [2022-11-03 04:01:56,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:01:56,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099304998] [2022-11-03 04:01:56,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:56,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:01:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-03 04:01:56,973 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:01:56,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099304998] [2022-11-03 04:01:56,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099304998] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:01:56,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:01:56,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 04:01:56,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121450960] [2022-11-03 04:01:56,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:01:56,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:01:56,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:01:56,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:01:56,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:01:56,976 INFO L87 Difference]: Start difference. First operand 1537 states and 1737 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-11-03 04:01:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:01:57,750 INFO L93 Difference]: Finished difference Result 3939 states and 4488 transitions. [2022-11-03 04:01:57,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:01:57,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 126 [2022-11-03 04:01:57,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:01:57,759 INFO L225 Difference]: With dead ends: 3939 [2022-11-03 04:01:57,760 INFO L226 Difference]: Without dead ends: 3227 [2022-11-03 04:01:57,762 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-11-03 04:01:57,763 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 230 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:01:57,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 554 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:01:57,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2022-11-03 04:01:58,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 2272. [2022-11-03 04:01:58,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 1777 states have (on average 1.152504220596511) internal successors, (2048), 1792 states have internal predecessors, (2048), 264 states have call successors, (264), 230 states have call predecessors, (264), 230 states have return successors, (264), 249 states have call predecessors, (264), 264 states have call successors, (264) [2022-11-03 04:01:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2576 transitions. [2022-11-03 04:01:58,125 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2576 transitions. Word has length 126 [2022-11-03 04:01:58,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:01:58,125 INFO L495 AbstractCegarLoop]: Abstraction has 2272 states and 2576 transitions. [2022-11-03 04:01:58,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-11-03 04:01:58,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2576 transitions. [2022-11-03 04:01:58,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-03 04:01:58,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:01:58,130 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] [2022-11-03 04:01:58,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-03 04:01:58,130 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:01:58,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:01:58,130 INFO L85 PathProgramCache]: Analyzing trace with hash 798613505, now seen corresponding path program 1 times [2022-11-03 04:01:58,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:01:58,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477329493] [2022-11-03 04:01:58,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:58,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:01:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:58,308 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 72 proven. 11 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-03 04:01:58,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:01:58,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477329493] [2022-11-03 04:01:58,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477329493] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:01:58,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518743156] [2022-11-03 04:01:58,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:58,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:01:58,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:01:58,311 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:01:58,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 04:01:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:58,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 04:01:58,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:01:58,506 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-03 04:01:58,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:01:58,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518743156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:01:58,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:01:58,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-11-03 04:01:58,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337182395] [2022-11-03 04:01:58,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:01:58,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:01:58,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:01:58,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:01:58,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:01:58,509 INFO L87 Difference]: Start difference. First operand 2272 states and 2576 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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-11-03 04:01:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:01:59,011 INFO L93 Difference]: Finished difference Result 4334 states and 4895 transitions. [2022-11-03 04:01:59,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:01:59,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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 157 [2022-11-03 04:01:59,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:01:59,018 INFO L225 Difference]: With dead ends: 4334 [2022-11-03 04:01:59,018 INFO L226 Difference]: Without dead ends: 2401 [2022-11-03 04:01:59,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 158 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-11-03 04:01:59,024 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 68 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:01:59,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 381 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:01:59,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2022-11-03 04:01:59,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2346. [2022-11-03 04:01:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 1829 states have (on average 1.1219245489338436) internal successors, (2052), 1845 states have internal predecessors, (2052), 277 states have call successors, (277), 239 states have call predecessors, (277), 239 states have return successors, (277), 261 states have call predecessors, (277), 277 states have call successors, (277) [2022-11-03 04:01:59,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 2606 transitions. [2022-11-03 04:01:59,460 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 2606 transitions. Word has length 157 [2022-11-03 04:01:59,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:01:59,460 INFO L495 AbstractCegarLoop]: Abstraction has 2346 states and 2606 transitions. [2022-11-03 04:01:59,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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-11-03 04:01:59,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 2606 transitions. [2022-11-03 04:01:59,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-11-03 04:01:59,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:01:59,465 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:01:59,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 04:01:59,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:01:59,691 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:01:59,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:01:59,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1388921939, now seen corresponding path program 1 times [2022-11-03 04:01:59,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:01:59,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284461162] [2022-11-03 04:01:59,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:59,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:01:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 87 proven. 15 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-03 04:01:59,947 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:01:59,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284461162] [2022-11-03 04:01:59,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284461162] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:01:59,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507568276] [2022-11-03 04:01:59,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:59,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:01:59,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:01:59,949 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:01:59,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 04:02:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:00,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 04:02:00,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-11-03 04:02:00,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:02:00,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507568276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:02:00,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:02:00,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-11-03 04:02:00,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361974615] [2022-11-03 04:02:00,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:02:00,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:02:00,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:02:00,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:02:00,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:02:00,118 INFO L87 Difference]: Start difference. First operand 2346 states and 2606 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-11-03 04:02:00,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:00,426 INFO L93 Difference]: Finished difference Result 3364 states and 3713 transitions. [2022-11-03 04:02:00,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:02:00,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-11-03 04:02:00,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:00,433 INFO L225 Difference]: With dead ends: 3364 [2022-11-03 04:02:00,433 INFO L226 Difference]: Without dead ends: 1406 [2022-11-03 04:02:00,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-03 04:02:00,437 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 53 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:00,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 328 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:02:00,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2022-11-03 04:02:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1342. [2022-11-03 04:02:00,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1052 states have (on average 1.1036121673003803) internal successors, (1161), 1062 states have internal predecessors, (1161), 154 states have call successors, (154), 135 states have call predecessors, (154), 135 states have return successors, (154), 144 states have call predecessors, (154), 154 states have call successors, (154) [2022-11-03 04:02:00,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1469 transitions. [2022-11-03 04:02:00,692 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1469 transitions. Word has length 158 [2022-11-03 04:02:00,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:00,693 INFO L495 AbstractCegarLoop]: Abstraction has 1342 states and 1469 transitions. [2022-11-03 04:02:00,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-11-03 04:02:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1469 transitions. [2022-11-03 04:02:00,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-03 04:02:00,698 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:00,698 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] [2022-11-03 04:02:00,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:00,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-03 04:02:00,911 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:02:00,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:00,912 INFO L85 PathProgramCache]: Analyzing trace with hash 636932029, now seen corresponding path program 1 times [2022-11-03 04:02:00,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:02:00,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968650174] [2022-11-03 04:02:00,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:00,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:02:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 89 proven. 15 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-03 04:02:01,124 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:02:01,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968650174] [2022-11-03 04:02:01,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968650174] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:02:01,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797722653] [2022-11-03 04:02:01,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:01,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:01,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:02:01,127 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:02:01,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 04:02:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:01,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-03 04:02:01,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-03 04:02:01,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:02:01,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797722653] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:02:01,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 04:02:01,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2022-11-03 04:02:01,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695351947] [2022-11-03 04:02:01,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:02:01,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 04:02:01,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:02:01,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 04:02:01,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 04:02:01,328 INFO L87 Difference]: Start difference. First operand 1342 states and 1469 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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-11-03 04:02:01,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:01,730 INFO L93 Difference]: Finished difference Result 1876 states and 2055 transitions. [2022-11-03 04:02:01,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 04:02:01,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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 159 [2022-11-03 04:02:01,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:01,731 INFO L225 Difference]: With dead ends: 1876 [2022-11-03 04:02:01,732 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 04:02:01,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-03 04:02:01,735 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 164 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:01,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 305 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:02:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 04:02:01,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 04:02:01,736 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-11-03 04:02:01,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 04:02:01,737 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 159 [2022-11-03 04:02:01,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:01,737 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 04:02:01,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 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-11-03 04:02:01,737 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 04:02:01,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 04:02:01,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-03 04:02:01,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-03 04:02:01,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-03 04:02:01,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 04:02:09,868 WARN L234 SmtUtils]: Spent 7.07s on a formula simplification. DAG size of input: 412 DAG size of output: 382 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-03 04:02:29,768 WARN L234 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 412 DAG size of output: 382 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-03 04:02:58,866 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 210) no Hoare annotation was computed. [2022-11-03 04:02:58,866 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 194) no Hoare annotation was computed. [2022-11-03 04:02:58,866 INFO L899 garLoopResultBuilder]: For program point L185-2(lines 185 194) no Hoare annotation was computed. [2022-11-03 04:02:58,873 INFO L895 garLoopResultBuilder]: At program point L177(lines 165 179) the Hoare annotation is: (let ((.cse14 (= ~E_2~0 1)) (.cse54 (= ~E_M~0 ~E_1~0)) (.cse21 (= |old(~m_st~0)| 0))) (let ((.cse46 (not .cse21)) (.cse11 (not .cse54)) (.cse51 (<= ~m_pc~0 0)) (.cse50 (not (= ~E_1~0 1))) (.cse49 (not (= ~E_M~0 |old(~m_st~0)|))) (.cse47 (+ ~local~0 1)) (.cse34 (= ~t1_pc~0 1)) (.cse35 (<= 2 ~E_1~0)) (.cse36 (= ~t1_i~0 1)) (.cse37 (= |old(~t1_st~0)| ~t1_st~0)) (.cse38 (<= 1 ~m_pc~0)) (.cse39 (not .cse14)) (.cse40 (= |old(~t2_st~0)| ~t2_st~0)) (.cse41 (= ~t2_pc~0 1)) (.cse48 (= ~m_pc~0 1)) (.cse52 (= ~E_2~0 2)) (.cse42 (= ~t2_i~0 1)) (.cse53 (= ~E_1~0 2)) (.cse22 (= ~m_st~0 |old(~m_st~0)|)) (.cse23 (= |activate_threads_is_master_triggered_~__retres1~0#1| 0)) (.cse45 (= ~t1_st~0 0)) (.cse24 (= 0 ~t2_st~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse9 (not (= ~t1_pc~0 0))) (.cse12 (and .cse22 .cse23 .cse45 .cse24)) (.cse27 (and .cse34 .cse35 .cse36 (= ~m_st~0 ~E_M~0) .cse37 (= 2 ~t2_st~0) .cse22 .cse23 .cse38 .cse39 .cse40 .cse54 .cse41 .cse48 .cse52 .cse42 .cse53)) (.cse33 (not (< .cse47 ~token~0))) (.cse7 (not .cse53)) (.cse43 (not .cse35)) (.cse44 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse25 (and .cse50 .cse49)) (.cse30 (not .cse38)) (.cse1 (not .cse52)) (.cse20 (not (= ~E_M~0 2))) (.cse6 (not .cse51)) (.cse16 (and .cse36 .cse37 .cse22 .cse23 .cse40 .cse51 .cse42)) (.cse17 (not (= |old(~t1_st~0)| 2))) (.cse18 (not .cse41)) (.cse19 (not (= 2 |old(~t2_st~0)|))) (.cse26 (and .cse11 .cse50)) (.cse13 (not (= ~token~0 ~local~0))) (.cse2 (not .cse42)) (.cse3 (not (= ~m_i~0 1))) (.cse4 (not (= |old(~t2_st~0)| 0))) (.cse5 (and .cse46 .cse49)) (.cse28 (not .cse48)) (.cse15 (not .cse34)) (.cse8 (not .cse36)) (.cse10 (not (<= ~t2_pc~0 0))) (.cse29 (not (<= .cse47 ~token~0))) (.cse31 (not (= 2 |old(~m_st~0)|))) (.cse32 (not (<= ~token~0 .cse47)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse2 .cse14 .cse3 .cse15 .cse6 .cse7 .cse8 .cse11 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse2 .cse20 .cse21 .cse3 .cse4 .cse15 .cse6 (and .cse22 .cse23 (= 2 ~t1_st~0) .cse24) .cse8 .cse10 .cse25 .cse17 .cse26 .cse13) (or .cse1 .cse27 .cse2 .cse3 .cse28 .cse15 .cse7 .cse8 .cse11 .cse29 .cse30 .cse17 .cse31 .cse18 .cse19 .cse32) (or .cse33 .cse1 .cse2 .cse14 .cse3 .cse28 .cse15 (and .cse34 .cse35 .cse36 .cse37 (<= 1 |activate_threads_is_master_triggered_~__retres1~0#1|) .cse22 .cse38 .cse39 .cse40 .cse41 .cse42) .cse7 .cse8 .cse30 .cse17 .cse18 .cse43 .cse44 (not (= ~E_M~0 1))) (or .cse0 .cse1 .cse2 .cse20 .cse21 .cse3 .cse6 .cse8 .cse9 (and .cse22 .cse23 .cse40 .cse45) .cse25 .cse18 .cse19 .cse26 .cse13) (or .cse2 .cse20 (not (<= 2 |old(~m_st~0)|)) .cse3 .cse5 .cse28 .cse15 .cse8 .cse39 .cse11 .cse29 .cse30 (and .cse36 .cse37 .cse22 .cse23 .cse38 .cse40 .cse42) .cse18 .cse32) (or .cse0 .cse1 .cse2 .cse20 .cse21 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse12 .cse25 .cse26 .cse13) (or .cse1 .cse27 .cse2 .cse3 .cse28 .cse15 .cse7 .cse8 .cse11 .cse30 .cse31 .cse18 .cse19 .cse13) (or .cse33 .cse1 .cse2 .cse14 .cse3 .cse28 .cse15 .cse7 .cse8 .cse11 .cse30 .cse46 .cse17 (and .cse34 .cse35 .cse36 .cse37 .cse22 .cse23 .cse38 .cse39 .cse40 .cse41 .cse42) .cse18 .cse19 .cse43 .cse44) (or .cse1 .cse2 .cse20 .cse21 .cse14 .cse3 .cse28 .cse15 .cse8 .cse25 (and .cse36 .cse37 .cse22 .cse23 .cse38 .cse39 .cse40 .cse42) .cse30 .cse17 .cse18 .cse19 .cse26 .cse13) (or .cse1 .cse2 .cse20 .cse21 .cse14 .cse3 .cse15 .cse6 .cse8 .cse16 .cse17 .cse18 .cse19 .cse26 .cse13) (or .cse2 .cse3 .cse4 .cse5 .cse28 .cse15 .cse8 .cse39 .cse10 .cse11 .cse29 .cse31 (and .cse37 .cse22 .cse23 .cse40) .cse32))))) [2022-11-03 04:02:58,874 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 191) no Hoare annotation was computed. [2022-11-03 04:02:58,875 INFO L895 garLoopResultBuilder]: At program point L215(lines 203 217) the Hoare annotation is: (let ((.cse37 (= |old(~m_st~0)| 0))) (let ((.cse9 (not (= ~E_M~0 ~E_1~0))) (.cse45 (= ~t2_i~0 1)) (.cse47 (not (= ~E_1~0 1))) (.cse49 (+ ~local~0 1)) (.cse22 (= ~E_2~0 1)) (.cse25 (not .cse37)) (.cse48 (not (= ~E_M~0 |old(~m_st~0)|))) (.cse42 (= 2 ~t1_st~0)) (.cse41 (= |old(~t2_st~0)| ~t2_st~0)) (.cse43 (= ~t1_i~0 1)) (.cse12 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= |activate_threads_is_master_triggered_~__retres1~0#1| 0)) (.cse46 (= ~t1_st~0 0)) (.cse44 (<= ~m_pc~0 0)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse17 (= |activate_threads_is_transmit2_triggered_~__retres1~2#1| 0)) (.cse50 (<= ~t2_pc~0 0))) (let ((.cse32 (and .cse43 .cse12 .cse13 .cse14 .cse46 .cse44 .cse15 .cse16 .cse17 .cse50)) (.cse2 (not (= |old(~t2_st~0)| 0))) (.cse8 (not .cse50)) (.cse21 (and .cse13 .cse14 .cse42 .cse41 .cse16 .cse17)) (.cse3 (and .cse25 .cse48)) (.cse7 (not .cse22)) (.cse10 (not (<= .cse49 ~token~0))) (.cse18 (not (<= ~token~0 .cse49))) (.cse19 (not (< .cse49 ~token~0))) (.cse29 (not (<= 2 ~E_1~0))) (.cse30 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse40 (and .cse13 .cse14 .cse41 .cse17)) (.cse31 (not (= |old(~t1_st~0)| 0))) (.cse34 (not (= ~t1_pc~0 0))) (.cse38 (and .cse47 .cse48)) (.cse4 (not (= ~m_pc~0 1))) (.cse23 (not (= ~E_1~0 2))) (.cse24 (not (<= 1 ~m_pc~0))) (.cse11 (not (= 2 |old(~m_st~0)|))) (.cse20 (not (= ~E_2~0 2))) (.cse0 (not .cse45)) (.cse36 (not (= ~E_M~0 2))) (.cse1 (not (= ~m_i~0 1))) (.cse5 (not (= ~t1_pc~0 1))) (.cse33 (not .cse44)) (.cse6 (not .cse43)) (.cse26 (not (= |old(~t1_st~0)| 2))) (.cse27 (not (= ~t2_pc~0 1))) (.cse28 (not (= 2 |old(~t2_st~0)|))) (.cse39 (and .cse9 .cse47)) (.cse35 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18) (or .cse19 .cse20 .cse0 .cse21 .cse22 .cse1 .cse4 .cse5 .cse23 .cse6 .cse9 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) (or .cse31 .cse20 .cse0 .cse32 .cse1 .cse2 .cse3 .cse33 .cse23 .cse6 .cse34 .cse8 .cse9 .cse35) (or .cse31 .cse20 .cse0 .cse36 .cse37 .cse32 .cse1 .cse2 .cse33 .cse6 .cse34 .cse8 .cse38 .cse39 .cse35) (or .cse20 .cse0 .cse36 .cse37 .cse1 .cse2 .cse5 .cse33 .cse6 .cse8 .cse38 .cse26 .cse40 .cse39 .cse35) (or .cse20 .cse0 .cse21 .cse1 .cse4 .cse5 .cse23 .cse6 .cse9 .cse10 .cse24 .cse26 .cse11 .cse27 .cse28 .cse18) (or .cse0 .cse36 (not (<= 2 |old(~m_st~0)|)) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse24 (and .cse12 .cse13 .cse14 .cse41 (= |activate_threads_is_transmit2_triggered_~__retres1~2#1| 1) .cse16) .cse27 .cse18) (or .cse19 .cse20 .cse0 .cse22 .cse1 .cse4 .cse5 .cse23 .cse6 .cse24 .cse26 .cse27 (and (<= 1 |activate_threads_is_master_triggered_~__retres1~0#1|) (= ~m_st~0 0) .cse42 .cse41 .cse16 .cse17) .cse29 .cse30 (not (= ~E_M~0 1))) (or .cse20 (and .cse43 .cse13 .cse14 .cse42 .cse41 .cse44 .cse45 .cse16 .cse17) .cse0 .cse22 .cse1 .cse5 .cse33 .cse23 .cse6 .cse9 .cse26 .cse27 .cse28) (or .cse20 .cse0 .cse36 .cse37 .cse22 .cse1 .cse4 .cse5 .cse6 .cse38 .cse24 .cse26 .cse40 .cse27 .cse28 .cse39 .cse35) (or .cse31 .cse20 .cse0 (and .cse13 .cse14 .cse41 .cse46 .cse16 .cse17) .cse36 .cse37 .cse1 .cse33 .cse6 .cse34 .cse38 .cse27 .cse28 .cse39 .cse35) (or .cse20 .cse0 .cse1 (and .cse12 .cse13 .cse14 .cse41 .cse16 .cse17) .cse4 .cse5 .cse23 .cse6 .cse9 .cse24 .cse11 .cse27 .cse28 .cse35) (or .cse20 .cse0 (and .cse43 .cse13 .cse14 .cse41 .cse44 .cse45 .cse17) .cse36 .cse37 .cse22 .cse1 .cse5 .cse33 .cse6 .cse26 .cse27 .cse28 .cse39 .cse35))))) [2022-11-03 04:02:58,875 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 175) no Hoare annotation was computed. [2022-11-03 04:02:58,875 INFO L899 garLoopResultBuilder]: For program point L166-2(lines 166 175) no Hoare annotation was computed. [2022-11-03 04:02:58,876 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 416 449) the Hoare annotation is: (let ((.cse4 (= |old(~m_st~0)| 0)) (.cse47 (= ~E_M~0 ~E_1~0))) (let ((.cse39 (= ~t2_pc~0 1)) (.cse33 (<= 1 ~m_pc~0)) (.cse51 (= ~E_1~0 2)) (.cse37 (= ~t1_pc~0 1)) (.cse48 (= ~m_pc~0 1)) (.cse49 (= ~m_i~0 1)) (.cse50 (= ~E_2~0 2)) (.cse24 (not .cse47)) (.cse31 (= ~t1_i~0 1)) (.cse34 (= ~t2_i~0 1)) (.cse53 (<= ~m_pc~0 0)) (.cse28 (= ~E_2~0 1)) (.cse44 (not .cse4)) (.cse32 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= |old(~t2_st~0)| ~t2_st~0)) (.cse38 (<= 2 ~E_1~0)) (.cse54 (+ ~local~0 1)) (.cse52 (not (= ~E_1~0 1))) (.cse55 (not (= ~E_M~0 |old(~m_st~0)|))) (.cse7 (= ~m_st~0 |old(~m_st~0)|)) (.cse9 (= ~t1_st~0 0)) (.cse42 (= 0 ~t2_st~0))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse18 (not (= |old(~t2_st~0)| 0))) (.cse43 (and .cse7 .cse9 .cse42)) (.cse11 (not (= ~t1_pc~0 0))) (.cse23 (not (<= ~t2_pc~0 0))) (.cse12 (and .cse52 .cse55)) (.cse35 (not (< .cse54 ~token~0))) (.cse40 (not .cse38)) (.cse41 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse17 (and .cse32 .cse7 .cse8)) (.cse19 (and .cse44 .cse55)) (.cse22 (not .cse28)) (.cse25 (not (<= .cse54 ~token~0))) (.cse27 (not (<= ~token~0 .cse54))) (.cse3 (not (= ~E_M~0 2))) (.cse6 (not .cse53)) (.cse30 (not (= |old(~t1_st~0)| 2))) (.cse46 (and .cse31 .cse32 .cse7 .cse8 .cse53 .cse34)) (.cse15 (and .cse24 .cse52)) (.cse1 (not .cse50)) (.cse2 (not .cse34)) (.cse5 (not .cse49)) (.cse20 (not .cse48)) (.cse21 (not .cse37)) (.cse36 (not .cse51)) (.cse10 (not .cse31)) (.cse29 (not .cse33)) (.cse26 (not (= 2 |old(~m_st~0)|))) (.cse45 (and .cse37 (= ~m_st~0 2) .cse31 .cse32 (= 2 ~t2_st~0) .cse7 .cse33 .cse8 .cse47 .cse39 .cse48 .cse49 .cse50 .cse34 .cse51)) (.cse13 (not .cse39)) (.cse14 (not (= 2 |old(~t2_st~0)|))) (.cse16 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse2 .cse17 .cse5 .cse18 .cse19 .cse20 .cse21 .cse10 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse1 .cse2 .cse3 .cse4 .cse28 .cse5 .cse20 .cse21 .cse10 .cse12 .cse29 .cse30 (and .cse31 .cse32 .cse7 .cse33 .cse22 .cse8 .cse34) .cse13 .cse14 .cse15 .cse16) (or .cse35 .cse1 .cse2 .cse28 .cse5 .cse20 .cse21 .cse36 .cse10 .cse29 .cse30 (and .cse37 .cse38 .cse31 .cse32 .cse7 .cse33 .cse22 .cse8 .cse39 .cse34) .cse13 .cse40 .cse41 (not (= ~E_M~0 1))) (or .cse1 .cse2 (and .cse7 (= 2 ~t1_st~0) .cse42) .cse3 .cse4 .cse5 .cse18 .cse21 .cse6 .cse10 .cse23 .cse12 .cse30 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse5 .cse18 .cse19 .cse43 .cse6 .cse36 .cse10 .cse11 .cse23 .cse24 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse43 .cse6 .cse10 .cse11 .cse23 .cse12 .cse15 .cse16) (or .cse35 .cse1 (and .cse37 .cse38 .cse31 .cse32 (= ~m_st~0 0) .cse33 .cse22 .cse8 .cse39 .cse34) .cse2 .cse28 .cse5 .cse20 .cse21 .cse36 .cse10 .cse24 .cse29 .cse44 .cse30 .cse13 .cse14 .cse40 .cse41) (or .cse2 .cse17 .cse3 (not (<= 2 |old(~m_st~0)|)) .cse5 .cse19 .cse20 .cse21 .cse10 .cse22 .cse24 .cse25 .cse29 .cse13 .cse27) (or .cse1 .cse2 .cse5 .cse20 .cse21 .cse36 .cse10 .cse24 .cse25 .cse29 .cse30 .cse26 .cse45 .cse13 .cse14 .cse27) (or .cse1 .cse2 .cse28 .cse5 .cse21 .cse6 .cse36 .cse10 .cse24 .cse30 .cse13 .cse46 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse28 .cse5 .cse21 .cse6 .cse10 .cse30 .cse13 .cse46 .cse14 .cse15 .cse16) (or .cse1 .cse2 .cse5 .cse20 .cse21 .cse36 .cse10 .cse24 .cse29 .cse26 .cse45 .cse13 .cse14 .cse16))))) [2022-11-03 04:02:58,876 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 213) no Hoare annotation was computed. [2022-11-03 04:02:58,876 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 416 449) no Hoare annotation was computed. [2022-11-03 04:02:58,876 INFO L899 garLoopResultBuilder]: For program point L204-2(lines 204 213) no Hoare annotation was computed. [2022-11-03 04:02:58,877 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2022-11-03 04:02:58,877 INFO L895 garLoopResultBuilder]: At program point L196(lines 184 198) the Hoare annotation is: (let ((.cse18 (= ~E_2~0 1)) (.cse54 (= ~E_M~0 ~E_1~0)) (.cse3 (= |old(~m_st~0)| 0))) (let ((.cse23 (not .cse3)) (.cse21 (not .cse54)) (.cse52 (not (= ~E_1~0 1))) (.cse50 (not (= ~E_M~0 |old(~m_st~0)|))) (.cse48 (= ~t1_pc~0 1)) (.cse42 (<= 1 ~m_pc~0)) (.cse43 (not .cse18)) (.cse34 (= |old(~t2_st~0)| ~t2_st~0)) (.cse47 (= ~t2_pc~0 1)) (.cse49 (= ~m_pc~0 1)) (.cse51 (= ~m_i~0 1)) (.cse53 (= ~E_2~0 2)) (.cse44 (= ~t2_i~0 1)) (.cse55 (= ~E_1~0 2)) (.cse39 (= ~t1_i~0 1)) (.cse40 (= |old(~t1_st~0)| ~t1_st~0)) (.cse8 (= ~m_st~0 |old(~m_st~0)|)) (.cse9 (= |activate_threads_is_master_triggered_~__retres1~0#1| 0)) (.cse35 (= ~t1_st~0 0)) (.cse41 (<= ~m_pc~0 0)) (.cse10 (= 0 ~t2_st~0)) (.cse36 (= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse56 (<= ~t2_pc~0 0)) (.cse46 (+ ~local~0 1))) (let ((.cse17 (not (< .cse46 ~token~0))) (.cse27 (not (<= 2 ~E_1~0))) (.cse28 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse33 (not (= |old(~t1_st~0)| 0))) (.cse38 (and .cse39 .cse40 .cse8 .cse9 .cse35 .cse41 .cse10 .cse36 .cse56)) (.cse5 (not (= |old(~t2_st~0)| 0))) (.cse37 (not (= ~t1_pc~0 0))) (.cse12 (not .cse56)) (.cse7 (not .cse41)) (.cse20 (not .cse55)) (.cse30 (and .cse48 .cse39 (= ~m_st~0 ~E_M~0) .cse40 (= 2 ~t2_st~0) .cse8 .cse9 .cse42 .cse43 .cse34 .cse54 .cse47 .cse49 .cse51 .cse53 .cse44 .cse36 .cse55)) (.cse31 (not (= 2 |old(~m_st~0)|))) (.cse0 (not .cse53)) (.cse13 (and .cse52 .cse50)) (.cse14 (not (= |old(~t1_st~0)| 2))) (.cse25 (not (= 2 |old(~t2_st~0)|))) (.cse15 (and .cse21 .cse52)) (.cse16 (not (= ~token~0 ~local~0))) (.cse1 (not .cse44)) (.cse2 (not (= ~E_M~0 2))) (.cse4 (not .cse51)) (.cse45 (and .cse23 .cse50)) (.cse19 (not .cse49)) (.cse6 (not .cse48)) (.cse11 (not .cse39)) (.cse29 (not (<= .cse46 ~token~0))) (.cse22 (not .cse42)) (.cse24 (not .cse47)) (.cse26 (and .cse39 .cse40 .cse8 .cse9 .cse42 .cse34 .cse44 .cse36)) (.cse32 (not (<= ~token~0 .cse46)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 (= 2 ~t1_st~0) .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse1 .cse18 .cse4 .cse19 .cse6 .cse20 .cse11 .cse21 .cse22 .cse23 .cse14 .cse24 .cse25 .cse26 .cse27 .cse28) (or .cse0 .cse1 .cse4 .cse19 .cse6 .cse20 .cse11 .cse21 .cse29 .cse30 .cse22 .cse14 .cse31 .cse24 .cse25 .cse32) (or .cse33 .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse11 (and .cse8 .cse9 .cse34 .cse35 .cse36) .cse37 .cse13 .cse24 .cse25 .cse15 .cse16) (or .cse33 .cse0 .cse1 .cse38 .cse2 .cse3 .cse4 .cse5 .cse7 .cse11 .cse37 .cse12 .cse13 .cse15 .cse16) (or .cse0 .cse1 .cse4 .cse6 .cse7 .cse20 .cse11 .cse21 .cse14 .cse24 (and .cse39 .cse40 .cse8 .cse9 .cse34 .cse41 .cse36) .cse25) (or .cse17 .cse0 .cse1 .cse18 .cse4 .cse19 .cse6 .cse20 .cse11 .cse22 .cse14 .cse24 .cse27 (and .cse39 .cse40 (<= 1 |activate_threads_is_master_triggered_~__retres1~0#1|) (= ~m_st~0 0) .cse42 .cse43 .cse34 .cse44 .cse36) .cse28 (not (= ~E_M~0 1))) (or (and .cse40 .cse8 .cse9 .cse10 .cse36) .cse1 .cse4 .cse5 .cse45 .cse19 .cse6 .cse11 .cse43 .cse12 .cse21 .cse29 .cse31 .cse32) (or .cse33 .cse0 .cse1 .cse38 .cse4 .cse5 .cse45 .cse7 .cse20 .cse11 .cse37 .cse12 .cse21 .cse16) (or .cse0 .cse1 (and .cse39 .cse40 .cse8 .cse9 .cse34 .cse41) .cse2 .cse3 .cse4 .cse6 .cse7 .cse11 .cse14 .cse24 .cse25 .cse15 .cse16) (or .cse0 .cse1 .cse4 .cse19 .cse6 .cse20 .cse11 .cse21 .cse30 .cse22 .cse31 .cse24 .cse25 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse19 .cse6 .cse11 .cse13 (and .cse39 .cse40 .cse8 .cse9 .cse42 .cse43 .cse34 .cse44) .cse22 .cse14 .cse24 .cse25 .cse15 .cse16) (or .cse1 .cse2 (not (<= 2 |old(~m_st~0)|)) .cse4 .cse45 .cse19 .cse6 .cse11 .cse43 .cse21 .cse29 .cse22 .cse24 .cse26 .cse32))))) [2022-11-03 04:02:58,877 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 450 460) no Hoare annotation was computed. [2022-11-03 04:02:58,878 INFO L895 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 450 460) the Hoare annotation is: (let ((.cse16 (= ~E_2~0 1))) (let ((.cse15 (+ ~local~0 1)) (.cse4 (= |old(~m_st~0)| 0)) (.cse29 (not (= ~E_M~0 ~E_1~0))) (.cse38 (not (= ~E_1~0 1))) (.cse35 (not (= ~E_M~0 |old(~m_st~0)|))) (.cse34 (= ~t1_i~0 1)) (.cse36 (= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (= ~m_st~0 |old(~m_st~0)|)) (.cse33 (<= 1 ~m_pc~0)) (.cse27 (not .cse16)) (.cse22 (= |old(~t2_st~0)| ~t2_st~0)) (.cse37 (= ~t2_i~0 1))) (let ((.cse19 (and .cse34 .cse36 .cse21 .cse33 .cse27 .cse22 .cse37)) (.cse12 (not (= 2 |old(~t2_st~0)|))) (.cse10 (not (= |old(~t1_st~0)| 2))) (.cse20 (not (= |old(~t1_st~0)| 0))) (.cse0 (not (= ~E_2~0 2))) (.cse25 (not (= |old(~t2_st~0)| 0))) (.cse23 (= ~t1_st~0 0)) (.cse32 (= 0 ~t2_st~0)) (.cse7 (not (<= ~m_pc~0 0))) (.cse24 (not (= ~t1_pc~0 0))) (.cse28 (not (<= ~t2_pc~0 0))) (.cse9 (and .cse38 .cse35)) (.cse13 (and .cse29 .cse38)) (.cse14 (not (= ~token~0 ~local~0))) (.cse1 (not .cse37)) (.cse2 (and .cse36 .cse21 .cse22)) (.cse3 (not (= ~E_M~0 2))) (.cse5 (not (= ~m_i~0 1))) (.cse26 (and (not .cse4) .cse35)) (.cse17 (not (= ~m_pc~0 1))) (.cse6 (not (= ~t1_pc~0 1))) (.cse8 (not .cse34)) (.cse30 (not (<= .cse15 ~token~0))) (.cse18 (not .cse33)) (.cse11 (not (= ~t2_pc~0 1))) (.cse31 (not (<= ~token~0 .cse15)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or (not (< .cse15 ~token~0)) .cse0 .cse1 .cse16 .cse5 .cse17 .cse6 (not (= ~E_1~0 2)) .cse8 .cse18 .cse10 .cse19 .cse11 (not (<= ~token~0 (+ 2 ~local~0))) (not (= ~E_M~0 1))) (or .cse20 .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 (and .cse21 .cse22 .cse23) .cse8 .cse24 .cse9 .cse11 .cse12 .cse13 .cse14) (or .cse1 .cse2 .cse5 .cse25 .cse26 .cse17 .cse6 .cse8 .cse27 .cse28 .cse29 .cse30 (not (= 2 |old(~m_st~0)|)) .cse31) (or .cse0 .cse1 .cse3 .cse4 .cse16 .cse5 .cse17 .cse6 .cse8 .cse9 .cse18 .cse10 .cse19 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 (and .cse21 (= 2 ~t1_st~0) .cse32) .cse3 .cse4 .cse5 .cse25 .cse6 .cse7 .cse8 .cse28 .cse9 .cse10 .cse13 .cse14) (or .cse20 .cse0 .cse1 .cse3 .cse4 .cse5 .cse25 (and .cse21 .cse23 .cse32) .cse7 .cse8 .cse24 .cse28 .cse9 .cse13 .cse14) (or .cse1 .cse2 .cse3 (not (<= 2 |old(~m_st~0)|)) .cse5 .cse26 .cse17 .cse6 .cse8 .cse27 .cse29 .cse30 .cse18 .cse11 .cse31))))) [2022-11-03 04:02:58,878 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 450 460) no Hoare annotation was computed. [2022-11-03 04:02:58,878 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 250 274) no Hoare annotation was computed. [2022-11-03 04:02:58,878 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 250 274) the Hoare annotation is: true [2022-11-03 04:02:58,883 INFO L895 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 340 377) the Hoare annotation is: (let ((.cse28 (= ~t1_pc~0 1)) (.cse26 (= ~t1_i~0 1)) (.cse27 (= 2 ~t2_st~0)) (.cse23 (= ~E_M~0 ~E_1~0)) (.cse22 (= ~t2_pc~0 1)) (.cse30 (= ~m_pc~0 1)) (.cse29 (= ~t2_i~0 1)) (.cse24 (= ~E_2~0 |old(~E_2~0)|)) (.cse25 (= ~E_1~0 2)) (.cse21 (not (= ~m_st~0 0))) (.cse31 (= ~m_st~0 2))) (let ((.cse15 (not .cse31)) (.cse8 (and (not (= ~m_st~0 |old(~E_M~0)|)) .cse21)) (.cse20 (and .cse28 .cse31 .cse26 (= ~E_M~0 |old(~E_M~0)|) .cse27 .cse23 .cse22 .cse30 (= ~E_2~0 2) .cse29 (= ~E_1~0 |old(~E_1~0)|) .cse24 .cse25)) (.cse9 (not (= ~token~0 ~local~0))) (.cse16 (+ ~local~0 1)) (.cse10 (not .cse30)) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse17 (= |old(~E_2~0)| 1)) (.cse18 (not (<= 1 ~m_pc~0))) (.cse0 (not (= 2 |old(~E_2~0)|))) (.cse1 (not .cse29)) (.cse2 (not (= ~m_i~0 1))) (.cse11 (not .cse28)) (.cse3 (not (= 2 |old(~E_1~0)|))) (.cse4 (not (<= ~m_pc~0 0))) (.cse12 (not .cse27)) (.cse5 (not .cse26)) (.cse13 (not (= 2 ~t1_st~0))) (.cse6 (not (= |old(~E_1~0)| |old(~E_M~0)|))) (.cse7 (and .cse23 .cse24 .cse25)) (.cse19 (not .cse22))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~t1_pc~0 0)) (not (<= ~t2_pc~0 0)) .cse6 .cse7 (not (= 0 ~t2_st~0)) .cse8 (not (= ~t1_st~0 0)) .cse9) (or .cse0 .cse1 .cse2 .cse10 .cse11 .cse12 .cse5 .cse13 .cse14 .cse15 .cse6 (not (<= .cse16 ~token~0)) .cse17 .cse18 .cse8 .cse19 .cse20 (not (<= ~token~0 .cse16))) (or .cse0 .cse1 .cse2 .cse10 .cse11 .cse12 .cse5 .cse14 .cse15 .cse6 .cse17 .cse18 .cse8 .cse19 .cse20 .cse9) (or (not (< .cse16 ~token~0)) .cse0 .cse1 .cse2 .cse10 .cse11 .cse3 .cse12 .cse5 .cse13 .cse14 .cse6 .cse17 .cse7 .cse18 .cse21 .cse19 (not (<= ~token~0 (+ 2 ~local~0)))) (or .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse12 .cse5 .cse13 .cse6 .cse7 .cse19)))) [2022-11-03 04:02:58,883 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 340 377) no Hoare annotation was computed. [2022-11-03 04:02:58,885 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 219 226) no Hoare annotation was computed. [2022-11-03 04:02:58,885 INFO L902 garLoopResultBuilder]: At program point update_channelsFINAL(lines 219 226) the Hoare annotation is: true [2022-11-03 04:02:58,885 INFO L895 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 378 415) the Hoare annotation is: (let ((.cse12 (not (= ~m_st~0 0)))) (let ((.cse16 (not (= ~token~0 ~local~0))) (.cse4 (not (= ~m_pc~0 1))) (.cse17 (not (= ~m_st~0 2))) (.cse15 (and (not (= ~m_st~0 |old(~E_M~0)|)) .cse12)) (.cse0 (+ ~local~0 1)) (.cse1 (not (= 2 |old(~E_2~0)|))) (.cse2 (not (= ~t2_i~0 1))) (.cse3 (not (= ~m_i~0 1))) (.cse5 (not (= ~t1_pc~0 1))) (.cse6 (not (= 2 |old(~E_1~0)|))) (.cse14 (not (<= ~m_pc~0 0))) (.cse7 (not (= 2 ~t2_st~0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= 2 ~t1_st~0))) (.cse10 (not (= |old(~E_1~0)| |old(~E_M~0)|))) (.cse11 (and (= ~E_M~0 ~E_1~0) (= ~E_2~0 |old(~E_2~0)|) (= ~E_1~0 2))) (.cse13 (not (= ~t2_pc~0 1)))) (and (or (not (< .cse0 ~token~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (<= ~token~0 (+ 2 ~local~0)))) (or .cse1 .cse2 .cse3 .cse6 .cse14 .cse8 (not (= ~t1_pc~0 0)) (not (<= ~t2_pc~0 0)) .cse10 .cse11 (not (= 0 ~t2_st~0)) .cse15 (not (= ~t1_st~0 0)) .cse16) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse17 .cse10 .cse11 .cse15 .cse13 .cse16) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse17 .cse10 (not (<= .cse0 ~token~0)) .cse11 .cse15 .cse13 (not (<= ~token~0 .cse0))) (or .cse1 .cse2 .cse3 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13)))) [2022-11-03 04:02:58,886 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 378 415) no Hoare annotation was computed. [2022-11-03 04:02:58,886 INFO L895 garLoopResultBuilder]: At program point L151(line 151) the Hoare annotation is: (and (= ~t1_pc~0 1) (or (not (= 0 ~t2_st~0)) (= |exists_runnable_thread_#res| 1)) (= ~t1_i~0 1) (<= ~token~0 (+ 2 ~local~0)) (= 2 ~t1_st~0) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~t2_pc~0 1) (= ~m_pc~0 1) (= ~m_i~0 1) (= ~E_2~0 2) (= ~t2_i~0 1) (< (+ ~local~0 1) ~token~0) (= ~E_1~0 2) (= ~E_M~0 1)) [2022-11-03 04:02:58,886 INFO L899 garLoopResultBuilder]: For program point L151-1(line 151) no Hoare annotation was computed. [2022-11-03 04:02:58,886 INFO L895 garLoopResultBuilder]: At program point L548(line 548) the Hoare annotation is: (and (= ~t1_pc~0 0) (= ~t1_i~0 1) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~E_2~0 2) (<= ~m_pc~0 0) (= ~t2_i~0 1) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2022-11-03 04:02:58,887 INFO L895 garLoopResultBuilder]: At program point L548-1(line 548) the Hoare annotation is: (and (= ~t1_pc~0 0) (= ~t1_i~0 1) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~E_2~0 2) (<= ~m_pc~0 0) (= ~t2_i~0 1) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2022-11-03 04:02:58,887 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-03 04:02:58,887 INFO L899 garLoopResultBuilder]: For program point L284(line 284) no Hoare annotation was computed. [2022-11-03 04:02:58,887 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2022-11-03 04:02:58,887 INFO L895 garLoopResultBuilder]: At program point L565(line 565) the Hoare annotation is: (let ((.cse15 (= ~m_st~0 2)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (not (= ~E_2~0 1))) (.cse8 (= ~m_pc~0 1)) (.cse12 (+ ~local~0 1)) (.cse14 (not (= ~E_M~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse6 (= ~E_M~0 ~E_1~0)) (.cse7 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~E_2~0 2)) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 (= ~m_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< .cse12 ~token~0) .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~token~0 ~local~0) .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 (<= ~token~0 .cse12) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse12 ~token~0) .cse10 .cse11 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse9 .cse10 (<= ~m_pc~0 0) .cse11 .cse13))) [2022-11-03 04:02:58,887 INFO L895 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: false [2022-11-03 04:02:58,888 INFO L895 garLoopResultBuilder]: At program point L565-1(line 565) the Hoare annotation is: (let ((.cse12 (+ ~local~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse14 (= ~m_st~0 2)) (.cse5 (<= 1 ~m_pc~0)) (.cse8 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse6 (= ~E_M~0 ~E_1~0)) (.cse7 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~E_2~0 2)) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< .cse12 ~token~0) .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse3 (<= ~token~0 .cse12) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse12 ~token~0) .cse10 .cse11 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~token~0 ~local~0) .cse13) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 (<= ~m_pc~0 0) .cse11 .cse13))) [2022-11-03 04:02:58,888 INFO L895 garLoopResultBuilder]: At program point L334(lines 275 339) the Hoare annotation is: (let ((.cse15 (= ~m_st~0 2)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (not (= ~E_2~0 1))) (.cse8 (= ~m_pc~0 1)) (.cse12 (+ ~local~0 1)) (.cse14 (not (= ~E_M~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse6 (= ~E_M~0 ~E_1~0)) (.cse7 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~E_2~0 2)) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 (= ~m_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< .cse12 ~token~0) .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~token~0 ~local~0) .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 (<= ~token~0 .cse12) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse12 ~token~0) .cse10 .cse11 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse9 .cse10 (<= ~m_pc~0 0) .cse11 .cse13))) [2022-11-03 04:02:58,888 INFO L895 garLoopResultBuilder]: At program point L549(line 549) the Hoare annotation is: (and (= ~t1_pc~0 0) (= ~t1_i~0 1) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~E_2~0 2) (<= ~m_pc~0 0) (= ~t2_i~0 1) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2022-11-03 04:02:58,888 INFO L895 garLoopResultBuilder]: At program point L54(lines 49 88) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~t1_i~0 1) (<= ~token~0 (+ 2 ~local~0)) (= 2 ~t2_st~0) (= 2 ~t1_st~0) (= ~E_M~0 ~E_1~0) (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~t2_pc~0 1) (= ~m_pc~0 1) (= ~m_i~0 1) (= ~E_2~0 2) (not (= ~m_st~0 0)) (= ~t2_i~0 1) (< (+ ~local~0 1) ~token~0) (= ~E_1~0 2)) [2022-11-03 04:02:58,888 INFO L895 garLoopResultBuilder]: At program point L566(line 566) the Hoare annotation is: (let ((.cse10 (+ ~local~0 1)) (.cse12 (= ~m_st~0 ~E_M~0)) (.cse6 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_M~0 ~E_1~0)) (.cse5 (= ~t2_pc~0 1)) (.cse7 (= ~m_i~0 1)) (.cse8 (= ~E_2~0 2)) (.cse9 (= ~t2_i~0 1)) (.cse11 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 (= ~m_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse10 ~token~0) .cse11) (and .cse0 .cse1 .cse12 .cse2 (<= ~token~0 .cse10) .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse10 ~token~0) .cse8 .cse9 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~token~0 ~local~0) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (<= ~m_pc~0 0) .cse9 .cse11))) [2022-11-03 04:02:58,889 INFO L895 garLoopResultBuilder]: At program point L319(lines 281 333) the Hoare annotation is: (let ((.cse13 (= ~m_st~0 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse11 (+ ~local~0 1))) (let ((.cse14 (<= ~token~0 .cse11)) (.cse15 (<= .cse11 ~token~0)) (.cse16 (= ~t1_pc~0 0)) (.cse18 (= ~t1_st~0 0)) (.cse17 (or .cse13 .cse3)) (.cse24 (= ~m_st~0 2)) (.cse7 (= ~m_pc~0 1)) (.cse23 (= |ULTIMATE.start_eval_~tmp~0#1| 1)) (.cse20 (= 0 ~t2_st~0)) (.cse21 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~E_M~0 ~E_1~0)) (.cse6 (= ~t2_pc~0 1)) (.cse8 (= ~m_i~0 1)) (.cse9 (= ~E_2~0 2)) (.cse19 (<= ~m_pc~0 0)) (.cse10 (= ~t2_i~0 1)) (.cse12 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< .cse11 ~token~0) .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse12) (and .cse16 .cse1 .cse17 .cse5 .cse18 .cse8 .cse9 .cse19 .cse10 .cse20 .cse21 .cse12 .cse22) (and .cse0 .cse1 .cse14 .cse4 .cse5 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) .cse6 .cse7 .cse8 .cse15 .cse9 (not .cse3) .cse10 .cse20 .cse12) (and .cse16 .cse1 .cse13 .cse5 .cse18 .cse7 .cse8 .cse23 .cse9 .cse10 .cse20 .cse21 .cse12 .cse22) (and .cse0 .cse24 .cse1 .cse14 .cse4 .cse5 .cse7 .cse8 .cse15 .cse23 .cse9 .cse10 .cse20 .cse12 .cse22) (and .cse24 .cse16 .cse1 .cse2 .cse5 .cse18 .cse6 .cse7 .cse8 .cse23 .cse9 .cse10 .cse21 .cse12) (and .cse16 .cse1 .cse13 .cse2 .cse5 .cse18 .cse6 .cse8 .cse23 .cse9 .cse19 .cse10 .cse21 .cse12) (and .cse16 .cse1 .cse2 .cse3 .cse5 .cse18 .cse6 .cse8 .cse23 .cse9 .cse19 .cse10 .cse21 .cse12) (and .cse0 .cse1 .cse4 .cse17 .cse5 .cse8 .cse23 .cse9 .cse19 .cse10 .cse20 .cse21 .cse12 .cse22) (and .cse0 .cse1 .cse13 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse12) (and .cse0 .cse24 .cse1 .cse5 .cse7 .cse8 .cse23 .cse9 .cse10 .cse20 .cse21 .cse12 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse19 .cse10 .cse12)))) [2022-11-03 04:02:58,889 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 290) no Hoare annotation was computed. [2022-11-03 04:02:58,889 INFO L899 garLoopResultBuilder]: For program point L286-1(lines 281 333) no Hoare annotation was computed. [2022-11-03 04:02:58,889 INFO L895 garLoopResultBuilder]: At program point L567(line 567) the Hoare annotation is: (let ((.cse10 (+ ~local~0 1)) (.cse12 (= ~m_st~0 ~E_M~0)) (.cse6 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_M~0 ~E_1~0)) (.cse5 (= ~t2_pc~0 1)) (.cse7 (= ~m_i~0 1)) (.cse8 (= ~E_2~0 2)) (.cse9 (= ~t2_i~0 1)) (.cse11 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 (= ~m_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse10 ~token~0) .cse11) (and .cse0 .cse1 .cse12 .cse2 (<= ~token~0 .cse10) .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse10 ~token~0) .cse8 .cse9 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~token~0 ~local~0) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (<= ~m_pc~0 0) .cse9 .cse11))) [2022-11-03 04:02:58,890 INFO L895 garLoopResultBuilder]: At program point L105-1(lines 93 124) the Hoare annotation is: (let ((.cse23 (+ ~local~0 1))) (let ((.cse15 (= ~m_st~0 0)) (.cse3 (<= ~token~0 .cse23)) (.cse9 (<= .cse23 ~token~0)) (.cse21 (= 2 ~t2_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse6 (= ~t2_pc~0 1)) (.cse1 (= ~m_st~0 2)) (.cse7 (= ~m_pc~0 1)) (.cse0 (or (= |exists_runnable_thread_#res| 1) (not (= ~t1_st~0 0)))) (.cse14 (= ~t1_pc~0 0)) (.cse2 (= ~t1_i~0 1)) (.cse22 (= ~m_st~0 ~E_M~0)) (.cse16 (not (= ~E_2~0 1))) (.cse5 (= ~E_M~0 ~E_1~0)) (.cse8 (= ~m_i~0 1)) (.cse17 (= |ULTIMATE.start_eval_~tmp~0#1| 1)) (.cse10 (= ~E_2~0 2)) (.cse18 (<= ~m_pc~0 0)) (.cse11 (= ~t2_i~0 1)) (.cse12 (= 0 ~t2_st~0)) (.cse19 (= ~token~0 ~local~0)) (.cse13 (= ~E_1~0 2)) (.cse20 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse14 .cse2 .cse15 .cse16 .cse5 .cse8 .cse17 .cse10 .cse18 .cse11 .cse12 .cse19 .cse13 .cse20) (and .cse0 .cse14 .cse2 .cse21 (or .cse22 .cse15) .cse5 .cse6 .cse8 .cse17 .cse10 .cse18 .cse11 .cse19 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse20) (and .cse0 .cse1 .cse14 .cse2 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse11 .cse19 .cse13) (and .cse0 .cse1 .cse2 .cse5 .cse7 .cse8 .cse17 .cse10 .cse11 .cse12 .cse19 .cse13 .cse20) (and .cse0 .cse14 .cse2 .cse22 .cse16 .cse5 .cse8 .cse17 .cse10 .cse18 .cse11 .cse12 .cse19 .cse13 .cse20)))) [2022-11-03 04:02:58,890 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2022-11-03 04:02:58,890 INFO L899 garLoopResultBuilder]: For program point L305(lines 281 333) no Hoare annotation was computed. [2022-11-03 04:02:58,891 INFO L895 garLoopResultBuilder]: At program point L553-1(lines 550 590) the Hoare annotation is: (let ((.cse11 (+ ~local~0 1)) (.cse3 (= ~m_st~0 0)) (.cse13 (= ~m_st~0 ~E_M~0)) (.cse7 (= ~m_pc~0 1)) (.cse15 (= ~token~0 ~local~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~E_M~0 ~E_1~0)) (.cse6 (= ~t2_pc~0 1)) (.cse8 (= ~m_i~0 1)) (.cse9 (= ~E_2~0 2)) (.cse14 (<= ~m_pc~0 0)) (.cse10 (= ~t2_i~0 1)) (.cse12 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< .cse11 ~token~0) .cse12) (and .cse0 .cse1 .cse13 .cse2 (<= ~token~0 .cse11) .cse4 .cse5 .cse6 .cse7 .cse8 (<= .cse11 ~token~0) .cse9 .cse10 .cse12) (and (= ~t1_pc~0 0) .cse1 (or .cse13 .cse3) .cse5 (= ~t1_st~0 0) .cse8 .cse9 .cse14 .cse10 (= 0 ~t2_st~0) .cse15 .cse12 (<= ~t2_pc~0 0)) (and .cse0 .cse1 .cse13 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse14 .cse10 .cse12))) [2022-11-03 04:02:58,891 INFO L899 garLoopResultBuilder]: For program point L322(lines 322 329) no Hoare annotation was computed. [2022-11-03 04:02:58,891 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 04:02:58,891 INFO L899 garLoopResultBuilder]: For program point L570(line 570) no Hoare annotation was computed. [2022-11-03 04:02:58,891 INFO L895 garLoopResultBuilder]: At program point L141-1(lines 129 160) the Hoare annotation is: (let ((.cse19 (+ ~local~0 1)) (.cse18 (<= 1 ~m_pc~0)) (.cse6 (= ~m_pc~0 1)) (.cse16 (= ~t1_pc~0 1)) (.cse17 (= 2 ~t1_st~0)) (.cse13 (= ~m_st~0 0)) (.cse0 (or (not (= 0 ~t2_st~0)) (= |exists_runnable_thread_#res| 1))) (.cse1 (= ~t1_pc~0 0)) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~m_st~0 ~E_M~0)) (.cse14 (not (= ~E_2~0 1))) (.cse4 (= ~E_M~0 ~E_1~0)) (.cse5 (= ~t1_st~0 0)) (.cse7 (= ~m_i~0 1)) (.cse8 (= |ULTIMATE.start_eval_~tmp~0#1| 1)) (.cse9 (= ~E_2~0 2)) (.cse15 (<= ~m_pc~0 0)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~token~0 ~local~0)) (.cse12 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse13 .cse14 .cse4 .cse5 .cse7 .cse8 .cse9 .cse15 .cse10 .cse11 .cse12) (and .cse16 .cse0 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse13 .cse17 .cse18 .cse14 .cse4 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) .cse6 .cse7 .cse9 .cse10 (< .cse19 ~token~0) .cse12) (and .cse16 .cse0 (= ~m_st~0 2) .cse2 (<= ~token~0 .cse19) .cse17 .cse4 .cse6 .cse7 (<= .cse19 ~token~0) .cse8 .cse9 .cse10 .cse12) (and .cse16 .cse0 .cse2 .cse3 .cse18 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse16 .cse0 .cse2 .cse17 (or .cse3 .cse13) .cse4 .cse7 .cse8 .cse9 .cse15 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse7 .cse8 .cse9 .cse15 .cse10 .cse11 .cse12))) [2022-11-03 04:02:58,891 INFO L895 garLoopResultBuilder]: At program point L75-1(lines 49 88) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 0)) (.cse14 (= ~t1_st~0 0)) (.cse15 (= |ULTIMATE.start_eval_~tmp~0#1| 1)) (.cse10 (<= ~m_pc~0 0)) (.cse16 (= 0 ~t2_st~0)) (.cse17 (= ~token~0 ~local~0)) (.cse18 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_M~0 ~E_1~0)) (.cse5 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_i~0 1)) (.cse8 (= ~E_2~0 2)) (.cse9 (not (= ~m_st~0 0))) (.cse11 (= ~t2_i~0 1)) (.cse12 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse1 .cse4 .cse14 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse16 .cse17 .cse12 .cse18) (and .cse13 .cse1 .cse2 .cse4 .cse14 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12) (and .cse0 .cse1 .cse3 .cse4 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse16 .cse17 .cse12 .cse18) (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 1) .cse7 .cse8 .cse9 .cse11 (< (+ ~local~0 1) ~token~0) .cse12))) [2022-11-03 04:02:58,891 INFO L899 garLoopResultBuilder]: For program point L291(lines 281 333) no Hoare annotation was computed. [2022-11-03 04:02:58,892 INFO L895 garLoopResultBuilder]: At program point L572(lines 572 581) the Hoare annotation is: (let ((.cse10 (+ ~local~0 1)) (.cse12 (= ~m_st~0 ~E_M~0)) (.cse6 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_M~0 ~E_1~0)) (.cse5 (= ~t2_pc~0 1)) (.cse7 (= ~m_i~0 1)) (.cse8 (= ~E_2~0 2)) (.cse9 (= ~t2_i~0 1)) (.cse11 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 (= ~m_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse10 ~token~0) .cse11) (and .cse0 .cse1 .cse12 .cse2 (<= ~token~0 .cse10) .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse10 ~token~0) .cse8 .cse9 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~token~0 ~local~0) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (<= ~m_pc~0 0) .cse9 .cse11))) [2022-11-03 04:02:58,892 INFO L899 garLoopResultBuilder]: For program point L572-2(lines 572 581) no Hoare annotation was computed. [2022-11-03 04:02:58,892 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 315) no Hoare annotation was computed. [2022-11-03 04:02:58,892 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 102) no Hoare annotation was computed. [2022-11-03 04:02:58,892 INFO L902 garLoopResultBuilder]: At program point L591(lines 538 596) the Hoare annotation is: true [2022-11-03 04:02:58,892 INFO L895 garLoopResultBuilder]: At program point L525(line 525) the Hoare annotation is: (let ((.cse10 (+ ~local~0 1)) (.cse12 (= ~m_st~0 ~E_M~0)) (.cse6 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_M~0 ~E_1~0)) (.cse5 (= ~t2_pc~0 1)) (.cse7 (= ~m_i~0 1)) (.cse8 (= ~E_2~0 2)) (.cse9 (= ~t2_i~0 1)) (.cse11 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 (= ~m_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse10 ~token~0) .cse11) (and .cse0 .cse1 .cse12 .cse2 (<= ~token~0 .cse10) .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse10 ~token~0) .cse8 .cse9 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~token~0 ~local~0) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (<= ~m_pc~0 0) .cse9 .cse11))) [2022-11-03 04:02:58,892 INFO L895 garLoopResultBuilder]: At program point L525-1(line 525) the Hoare annotation is: (let ((.cse10 (+ ~local~0 1)) (.cse12 (= ~m_st~0 ~E_M~0)) (.cse6 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_M~0 ~E_1~0)) (.cse5 (= ~t2_pc~0 1)) (.cse7 (= ~m_i~0 1)) (.cse8 (= ~E_2~0 2)) (.cse9 (= ~t2_i~0 1)) (.cse11 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 (= ~m_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse10 ~token~0) .cse11) (and .cse0 .cse1 .cse12 .cse2 (<= ~token~0 .cse10) .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse10 ~token~0) .cse8 .cse9 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~token~0 ~local~0) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (<= ~m_pc~0 0) .cse9 .cse11))) [2022-11-03 04:02:58,892 INFO L899 garLoopResultBuilder]: For program point L294(lines 294 301) no Hoare annotation was computed. [2022-11-03 04:02:58,893 INFO L899 garLoopResultBuilder]: For program point L130(lines 130 138) no Hoare annotation was computed. [2022-11-03 04:02:58,893 INFO L895 garLoopResultBuilder]: At program point L97(lines 97 101) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (or (= |exists_runnable_thread_#res| 1) (not (= ~t1_st~0 0)))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= ~E_M~0 ~E_1~0)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ~m_i~0 1)) (.cse6 (= ~E_2~0 2)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~token~0 ~local~0)) (.cse9 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 (= ~m_st~0 ~E_M~0) .cse3 .cse4 .cse5 (= |ULTIMATE.start_eval_~tmp~0#1| 1) .cse6 .cse7 (= 0 ~t2_st~0) .cse8 .cse9 (<= ~t2_pc~0 0)) (and .cse0 .cse1 (= ~m_st~0 2) .cse2 .cse3 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~t2_pc~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2022-11-03 04:02:58,893 INFO L895 garLoopResultBuilder]: At program point L576(line 576) the Hoare annotation is: (let ((.cse10 (+ ~local~0 1)) (.cse12 (= ~m_st~0 ~E_M~0)) (.cse6 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_M~0 ~E_1~0)) (.cse5 (= ~t2_pc~0 1)) (.cse7 (= ~m_i~0 1)) (.cse8 (= ~E_2~0 2)) (.cse9 (= ~t2_i~0 1)) (.cse11 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 (= ~m_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse10 ~token~0) .cse11) (and .cse0 .cse1 .cse12 .cse2 (<= ~token~0 .cse10) .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse10 ~token~0) .cse8 .cse9 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~token~0 ~local~0) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (<= ~m_pc~0 0) .cse9 .cse11))) [2022-11-03 04:02:58,893 INFO L895 garLoopResultBuilder]: At program point L576-1(line 576) the Hoare annotation is: (let ((.cse10 (+ ~local~0 1)) (.cse12 (= ~m_st~0 ~E_M~0)) (.cse6 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_M~0 ~E_1~0)) (.cse5 (= ~t2_pc~0 1)) (.cse7 (= ~m_i~0 1)) (.cse8 (= ~E_2~0 2)) (.cse9 (= ~t2_i~0 1)) (.cse11 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 (= ~m_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse10 ~token~0) .cse11) (and .cse0 .cse1 .cse12 .cse2 (<= ~token~0 .cse10) .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse10 ~token~0) .cse8 .cse9 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~token~0 ~local~0) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (<= ~m_pc~0 0) .cse9 .cse11))) [2022-11-03 04:02:58,893 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-11-03 04:02:58,895 INFO L895 garLoopResultBuilder]: At program point L115(line 115) the Hoare annotation is: (let ((.cse12 (+ ~local~0 1))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (or (= |exists_runnable_thread_#res| 1) (not (= ~t1_st~0 0)))) (.cse2 (= ~m_st~0 2)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~E_2~0 1)) (.cse5 (<= ~token~0 .cse12)) (.cse6 (= ~E_M~0 ~E_1~0)) (.cse7 (= ~m_pc~0 1)) (.cse8 (= ~m_i~0 1)) (.cse9 (<= .cse12 ~token~0)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_eval_~tmp~0#1| 1) .cse10 .cse11 (= 0 ~t2_st~0) (<= ~t2_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~t2_pc~0 1) .cse7 .cse8 .cse9 .cse10 .cse11)))) [2022-11-03 04:02:58,895 INFO L899 garLoopResultBuilder]: For program point L115-1(line 115) no Hoare annotation was computed. [2022-11-03 04:02:58,895 INFO L895 garLoopResultBuilder]: At program point L561(line 561) the Hoare annotation is: (let ((.cse15 (= ~m_st~0 2)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (not (= ~E_2~0 1))) (.cse8 (= ~m_pc~0 1)) (.cse12 (+ ~local~0 1)) (.cse14 (not (= ~E_M~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse6 (= ~E_M~0 ~E_1~0)) (.cse7 (= ~t2_pc~0 1)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~E_2~0 2)) (.cse11 (= ~t2_i~0 1)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 (= ~m_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< .cse12 ~token~0) .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~token~0 ~local~0) .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse2 (<= ~token~0 .cse12) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse12 ~token~0) .cse10 .cse11 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse9 .cse10 (<= ~m_pc~0 0) .cse11 .cse13))) [2022-11-03 04:02:58,895 INFO L899 garLoopResultBuilder]: For program point L561-1(line 561) no Hoare annotation was computed. [2022-11-03 04:02:58,896 INFO L895 garLoopResultBuilder]: At program point L83(lines 46 89) the Hoare annotation is: (let ((.cse9 (= 0 ~t2_st~0)) (.cse12 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse13 (= ~t1_pc~0 0)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= ~m_st~0 ~E_M~0)) (.cse15 (= 2 ~t2_st~0)) (.cse3 (= ~E_M~0 ~E_1~0)) (.cse14 (= ~t1_st~0 0)) (.cse16 (= ~t2_pc~0 1)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ~m_i~0 1)) (.cse6 (= |ULTIMATE.start_eval_~tmp~0#1| 1)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse10 (= ~token~0 ~local~0)) (.cse11 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse15 .cse3 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) .cse16 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11) (and .cse13 .cse1 .cse2 .cse15 .cse3 .cse14 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11))) [2022-11-03 04:02:58,896 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 58) no Hoare annotation was computed. [2022-11-03 04:02:58,896 INFO L895 garLoopResultBuilder]: At program point L133(lines 133 137) the Hoare annotation is: (let ((.cse21 (+ ~local~0 1))) (let ((.cse13 (= ~t1_pc~0 0)) (.cse15 (= ~t1_st~0 0)) (.cse2 (= ~m_st~0 2)) (.cse16 (<= ~token~0 .cse21)) (.cse5 (= ~m_pc~0 1)) (.cse18 (<= .cse21 ~token~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (or (not (= 0 ~t2_st~0)) (= |exists_runnable_thread_#res| 1))) (.cse3 (= ~t1_i~0 1)) (.cse17 (= 2 ~t1_st~0)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse19 (= ~m_st~0 0)) (.cse4 (= ~E_M~0 ~E_1~0)) (.cse6 (= ~m_i~0 1)) (.cse7 (= |ULTIMATE.start_eval_~tmp~0#1| 1)) (.cse8 (= ~E_2~0 2)) (.cse20 (<= ~m_pc~0 0)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~token~0 ~local~0)) (.cse11 (= ~E_1~0 2)) (.cse12 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse16 .cse17 .cse4 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) (= ~t2_pc~0 1) .cse5 .cse6 .cse18 .cse8 .cse9 .cse11) (and .cse1 .cse13 .cse3 .cse19 .cse4 .cse15 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 .cse14 .cse4 .cse15 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse17 .cse4 .cse5 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse17 (or .cse14 .cse19) .cse4 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12)))) [2022-11-03 04:02:58,896 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse21 (= ~E_1~0 1))) (let ((.cse0 (= ~t1_pc~0 0)) (.cse5 (= ~t1_st~0 0)) (.cse8 (= |ULTIMATE.start_eval_~tmp~0#1| 1)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (<= ~t2_pc~0 0)) (.cse16 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (or .cse21 (= ~E_M~0 ~E_1~0))) (.cse3 (= 2 ~t2_st~0)) (.cse4 (or (= ~m_st~0 ~E_M~0) .cse21)) (.cse17 (= 2 ~t1_st~0)) (.cse20 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0))) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_i~0 1)) (.cse9 (or .cse21 (and (or (= |old(~E_M~0)| 0) (= ~E_M~0 |old(~E_M~0)|)) (= ~E_1~0 |old(~E_1~0)|)))) (.cse10 (= ~E_2~0 2)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (<= ~m_pc~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~E_M~0 2)) (.cse15 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse1 .cse2 .cse4 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15 .cse19) (and .cse16 .cse1 .cse2 .cse3 .cse4 .cse17 .cse20 .cse6 (= ~m_pc~0 1) .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15 .cse19) (and .cse16 .cse1 .cse2 .cse3 .cse4 .cse17 .cse20 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2022-11-03 04:02:58,896 INFO L895 garLoopResultBuilder]: At program point L546(line 546) the Hoare annotation is: (and (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~m_st~0 0) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~E_2~0 2) (<= ~m_pc~0 0) (= ~t2_i~0 1) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2022-11-03 04:02:58,897 INFO L899 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2022-11-03 04:02:58,897 INFO L895 garLoopResultBuilder]: At program point L546-1(line 546) the Hoare annotation is: (and (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~m_st~0 0) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~E_2~0 2) (<= ~m_pc~0 0) (= ~t2_i~0 1) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2022-11-03 04:02:58,897 INFO L895 garLoopResultBuilder]: At program point L282(line 282) the Hoare annotation is: (let ((.cse13 (= ~m_st~0 ~E_M~0)) (.cse3 (= ~m_st~0 0)) (.cse11 (+ ~local~0 1))) (let ((.cse14 (<= ~token~0 .cse11)) (.cse15 (<= .cse11 ~token~0)) (.cse16 (= ~t1_pc~0 0)) (.cse18 (= ~t1_st~0 0)) (.cse17 (or .cse13 .cse3)) (.cse24 (= ~m_st~0 2)) (.cse7 (= ~m_pc~0 1)) (.cse23 (= |ULTIMATE.start_eval_~tmp~0#1| 1)) (.cse20 (= 0 ~t2_st~0)) (.cse21 (= ~token~0 ~local~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~t1_i~0 1)) (.cse2 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~E_M~0 ~E_1~0)) (.cse6 (= ~t2_pc~0 1)) (.cse8 (= ~m_i~0 1)) (.cse9 (= ~E_2~0 2)) (.cse19 (<= ~m_pc~0 0)) (.cse10 (= ~t2_i~0 1)) (.cse12 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< .cse11 ~token~0) .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 .cse12) (and .cse16 .cse1 .cse17 .cse5 .cse18 .cse8 .cse9 .cse19 .cse10 .cse20 .cse21 .cse12 .cse22) (and .cse0 .cse1 .cse14 .cse4 .cse5 (not (= |ULTIMATE.start_eval_~tmp~0#1| 0)) .cse6 .cse7 .cse8 .cse15 .cse9 (not .cse3) .cse10 .cse20 .cse12) (and .cse16 .cse1 .cse13 .cse5 .cse18 .cse7 .cse8 .cse23 .cse9 .cse10 .cse20 .cse21 .cse12 .cse22) (and .cse0 .cse24 .cse1 .cse14 .cse4 .cse5 .cse7 .cse8 .cse15 .cse23 .cse9 .cse10 .cse20 .cse12 .cse22) (and .cse24 .cse16 .cse1 .cse2 .cse5 .cse18 .cse6 .cse7 .cse8 .cse23 .cse9 .cse10 .cse21 .cse12) (and .cse16 .cse1 .cse13 .cse2 .cse5 .cse18 .cse6 .cse8 .cse23 .cse9 .cse19 .cse10 .cse21 .cse12) (and .cse16 .cse1 .cse2 .cse3 .cse5 .cse18 .cse6 .cse8 .cse23 .cse9 .cse19 .cse10 .cse21 .cse12) (and .cse0 .cse1 .cse4 .cse17 .cse5 .cse8 .cse23 .cse9 .cse19 .cse10 .cse20 .cse21 .cse12 .cse22) (and .cse0 .cse1 .cse13 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse12) (and .cse0 .cse24 .cse1 .cse5 .cse7 .cse8 .cse23 .cse9 .cse10 .cse20 .cse21 .cse12 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse19 .cse10 .cse12)))) [2022-11-03 04:02:58,900 INFO L444 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] [2022-11-03 04:02:58,901 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 04:02:58,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 04:02:58 BoogieIcfgContainer [2022-11-03 04:02:58,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 04:02:58,983 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 04:02:58,983 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 04:02:58,984 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 04:02:58,984 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:00:16" (3/4) ... [2022-11-03 04:02:58,987 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 04:02:58,992 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-11-03 04:02:58,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-11-03 04:02:58,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-11-03 04:02:58,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-11-03 04:02:58,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-11-03 04:02:58,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-11-03 04:02:59,001 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 60 nodes and edges [2022-11-03 04:02:59,002 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-03 04:02:59,002 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-03 04:02:59,003 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-03 04:02:59,028 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc <= 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || !(E_M == E_1)) || (((m_st == \old(m_st) && __retres1 == 0) && t1_st == 0) && 0 == t2_st)) || !(token == local)) && ((((((((((((!(E_2 == 2) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || ((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && m_pc <= 0) && t2_i == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st)))) && ((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc <= 0)) || (((m_st == \old(m_st) && __retres1 == 0) && 2 == t1_st) && 0 == t2_st)) || !(t1_i == 1)) || !(t2_pc <= 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(\old(t1_st) == 2)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((!(E_2 == 2) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && m_st == E_M) && \old(t1_st) == t1_st) && 2 == t2_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && t2_i == 1) && E_1 == 2)) || !(t2_i == 1)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(token <= local + 1))) && (((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && \old(t1_st) == t1_st) && 1 <= __retres1) && m_st == \old(m_st)) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || (((m_st == \old(m_st) && __retres1 == 0) && \old(t2_st) == t2_st) && t1_st == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(2 <= \old(m_st))) || !(m_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || ((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && \old(t2_st) == t2_st) && t2_i == 1)) || !(t2_pc == 1)) || !(token <= local + 1))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || (((m_st == \old(m_st) && __retres1 == 0) && t1_st == 0) && 0 == t2_st)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((!(E_2 == 2) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && m_st == E_M) && \old(t1_st) == t1_st) && 2 == t2_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && t2_i == 1) && E_1 == 2)) || !(t2_i == 1)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(token == local))) && (((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= 2 + local))) && ((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_i == 1)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || E_2 == 1) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || ((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && m_pc <= 0) && t2_i == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((!(t2_i == 1) || !(m_i == 1)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(t2_pc <= 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st)) || !(token <= local + 1)) [2022-11-03 04:02:59,030 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 1 || !(t1_st == 0)) && m_st == 2) && t1_i == 1) && token <= local + 1) && 1 <= m_pc) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && E_1 == 2) || (((((((((((((((\result == 1 || !(t1_st == 0)) && t1_pc == 0) && t1_i == 1) && m_st == 0) && !(E_2 == 1)) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((\result == 1 || !(t1_st == 0)) && t1_pc == 0) && t1_i == 1) && 2 == t2_st) && (m_st == E_M || m_st == 0)) && E_M == E_1) && t2_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((((((\result == 1 || !(t1_st == 0)) && m_st == 2) && t1_i == 1) && token <= local + 1) && E_M == E_1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((\result == 1 || !(t1_st == 0)) && m_st == 2) && t1_pc == 0) && t1_i == 1) && 2 == t2_st) && 1 <= m_pc) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || (((((((((((((\result == 1 || !(t1_st == 0)) && m_st == 2) && t1_i == 1) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((\result == 1 || !(t1_st == 0)) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && !(E_2 == 1)) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) [2022-11-03 04:02:59,030 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) || ((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && m_st == 2) && t1_i == 1) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) [2022-11-03 04:02:59,030 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc <= 0)) || (((m_st == \old(m_st) && __retres1 == 0) && 2 == t1_st) && 0 == t2_st)) || !(t1_i == 1)) || !(t2_pc <= 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(\old(t1_st) == 2)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local)) && (((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && \old(t2_st) == t2_st) && t2_i == 1) && __retres1 == 0)) || !(2 <= E_1)) || !(token <= 2 + local))) && (((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || (((((((((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && \old(t1_st) == t1_st) && 2 == t2_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && __retres1 == 0) && E_1 == 2)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(token <= local + 1))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || ((((m_st == \old(m_st) && __retres1 == 0) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(t1_pc == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || ((((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && 0 == t2_st) && __retres1 == 0) && t2_pc <= 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || ((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && m_pc <= 0) && __retres1 == 0)) || !(2 == \old(t2_st)))) && (((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 <= E_1)) || ((((((((t1_i == 1 && \old(t1_st) == t1_st) && 1 <= __retres1) && m_st == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_i == 1) && __retres1 == 0)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && 0 == t2_st) && __retres1 == 0) || !(t2_i == 1)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(t2_pc <= 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(token <= local + 1))) && (((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || ((((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && 0 == t2_st) && __retres1 == 0) && t2_pc <= 0)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc <= 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || !(E_M == E_1)) || !(token == local))) && (((((((((((((!(E_2 == 2) || !(t2_i == 1)) || (((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && m_pc <= 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || (((((((((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && \old(t1_st) == t1_st) && 2 == t2_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && __retres1 == 0) && E_1 == 2)) || !(1 <= m_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(token == local))) && ((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_i == 1)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(2 <= \old(m_st))) || !(m_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || !(t2_pc == 1)) || (((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && \old(t2_st) == t2_st) && t2_i == 1) && __retres1 == 0)) || !(token <= local + 1)) [2022-11-03 04:02:59,031 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && E_M == E_1) && t1_st == 0) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) || ((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == 0) && !(E_2 == 1)) && E_M == E_1) && t1_st == 0) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2)) || (((((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && t1_i == 1) && token <= 2 + local) && m_st == 0) && 2 == t1_st) && 1 <= m_pc) && !(E_2 == 1)) && E_M == E_1) && !(tmp == 0)) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && tmp == 1) && E_2 == 2) && t2_i == 1) && E_1 == 2)) || (((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && t1_i == 1) && m_st == E_M) && 1 <= m_pc) && !(E_2 == 1)) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && t1_i == 1) && 2 == t1_st) && (m_st == E_M || m_st == 0)) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && !(E_2 == 1)) && E_M == E_1) && t1_st == 0) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2) [2022-11-03 04:02:59,031 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && m_st == 2) && t1_i == 1) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) && t2_pc <= 0) || ((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && E_M == E_1) && t1_st == 0) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2)) || ((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == 0) && E_M == E_1) && t1_st == 0) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && E_M == E_1) && t1_st == 0) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && tmp == 1) && E_2 == 2) && t2_i == 1) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && t1_i == 1) && 2 == t1_st) && (m_st == E_M || m_st == 0)) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2) && t2_pc <= 0) [2022-11-03 04:02:59,032 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(t2_i == 1) || !(m_i == 1)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(t2_pc <= 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && 0 == t2_st) && __retres1 == 0) && __retres1 == 0)) || !(token <= local + 1)) && (((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || (((((m_st == \old(m_st) && __retres1 == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0) && __retres1 == 0)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= 2 + local))) && (((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || (((((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && 0 == t2_st) && __retres1 == 0) && __retres1 == 0) && t2_pc <= 0)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc <= 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || !(E_M == E_1)) || !(token == local))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || (((((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && 0 == t2_st) && __retres1 == 0) && __retres1 == 0) && t2_pc <= 0)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(\old(t1_st) == 2)) || (((m_st == \old(m_st) && __retres1 == 0) && \old(t2_st) == t2_st) && __retres1 == 0)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || (((((m_st == \old(m_st) && __retres1 == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0) && __retres1 == 0)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(token <= local + 1))) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(2 <= \old(m_st))) || !(m_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && __retres1 == 1) && __retres1 == 0)) || !(t2_pc == 1)) || !(token <= local + 1))) && (((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || (((((1 <= __retres1 && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0) && __retres1 == 0)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && ((((((((((((!(E_2 == 2) || ((((((((t1_i == 1 && m_st == \old(m_st)) && __retres1 == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && m_pc <= 0) && t2_i == 1) && __retres1 == 0) && __retres1 == 0)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st)))) && ((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || (((m_st == \old(m_st) && __retres1 == 0) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || (((((m_st == \old(m_st) && __retres1 == 0) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0) && __retres1 == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && __retres1 == 0) && __retres1 == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(token == local))) && ((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || ((((((t1_i == 1 && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && m_pc <= 0) && t2_i == 1) && __retres1 == 0)) || !(E_M == 2)) || \old(m_st) == 0) || E_2 == 1) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local)) [2022-11-03 04:02:59,061 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 04:02:59,061 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 04:02:59,061 INFO L158 Benchmark]: Toolchain (without parser) took 164005.18ms. Allocated memory was 94.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 74.1MB in the beginning and 1.0GB in the end (delta: -941.8MB). Peak memory consumption was 357.3MB. Max. memory is 16.1GB. [2022-11-03 04:02:59,062 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 94.4MB. Free memory is still 68.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 04:02:59,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.60ms. Allocated memory is still 94.4MB. Free memory was 74.1MB in the beginning and 67.3MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 04:02:59,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.51ms. Allocated memory is still 94.4MB. Free memory was 67.3MB in the beginning and 65.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 04:02:59,062 INFO L158 Benchmark]: Boogie Preprocessor took 33.48ms. Allocated memory is still 94.4MB. Free memory was 65.2MB in the beginning and 63.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 04:02:59,063 INFO L158 Benchmark]: RCFGBuilder took 885.67ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 63.1MB in the beginning and 83.2MB in the end (delta: -20.1MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2022-11-03 04:02:59,063 INFO L158 Benchmark]: TraceAbstraction took 162546.82ms. Allocated memory was 113.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 82.6MB in the beginning and 1.0GB in the end (delta: -940.7MB). Peak memory consumption was 859.4MB. Max. memory is 16.1GB. [2022-11-03 04:02:59,063 INFO L158 Benchmark]: Witness Printer took 77.76ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-03 04:02:59,065 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.29ms. Allocated memory is still 94.4MB. Free memory is still 68.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.60ms. Allocated memory is still 94.4MB. Free memory was 74.1MB in the beginning and 67.3MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.51ms. Allocated memory is still 94.4MB. Free memory was 67.3MB in the beginning and 65.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.48ms. Allocated memory is still 94.4MB. Free memory was 65.2MB in the beginning and 63.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 885.67ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 63.1MB in the beginning and 83.2MB in the end (delta: -20.1MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. * TraceAbstraction took 162546.82ms. Allocated memory was 113.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 82.6MB in the beginning and 1.0GB in the end (delta: -940.7MB). Peak memory consumption was 859.4MB. Max. memory is 16.1GB. * Witness Printer took 77.76ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. 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: 20]: 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 7 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 162.4s, OverallIterations: 24, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 56.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6884 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6826 mSDsluCounter, 9566 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7459 mSDsCounter, 2433 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7174 IncrementalHoareTripleChecker+Invalid, 9607 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2433 mSolverCounterUnsat, 3216 mSDtfsCounter, 7174 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2977 GetRequests, 2463 SyntacticMatches, 29 SemanticMatches, 485 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20508 ImplicationChecksByTransitivity, 52.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3834occurred in iteration=17, InterpolantAutomatonStates: 273, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 5164 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 41 LocationsWithAnnotation, 6766 PreInvPairs, 7033 NumberOfFragments, 11543 HoareAnnotationTreeSize, 6766 FomulaSimplifications, 217523 FormulaSimplificationTreeSizeReduction, 27.8s HoareSimplificationTime, 41 FomulaSimplificationsInter, 712243 FormulaSimplificationTreeSizeReductionInter, 28.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 4189 NumberOfCodeBlocks, 4134 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 4577 ConstructedInterpolants, 0 QuantifiedInterpolants, 8732 SizeOfPredicates, 31 NumberOfNonLiveVariables, 7586 ConjunctsInSsa, 170 ConjunctsInUnsatCore, 44 InterpolantComputations, 21 PerfectInterpolantSequences, 3098/3402 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 1 specifications checked. All of them hold - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && !(m_st == 0)) && t2_i == 1) && local + 1 < token) && E_1 == 2 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2) || (((((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2)) || (((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && E_1 == 2) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc <= 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || !(E_M == E_1)) || (((m_st == \old(m_st) && __retres1 == 0) && t1_st == 0) && 0 == t2_st)) || !(token == local)) && ((((((((((((!(E_2 == 2) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || ((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && m_pc <= 0) && t2_i == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st)))) && ((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc <= 0)) || (((m_st == \old(m_st) && __retres1 == 0) && 2 == t1_st) && 0 == t2_st)) || !(t1_i == 1)) || !(t2_pc <= 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(\old(t1_st) == 2)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((!(E_2 == 2) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && m_st == E_M) && \old(t1_st) == t1_st) && 2 == t2_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && t2_i == 1) && E_1 == 2)) || !(t2_i == 1)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(token <= local + 1))) && (((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && \old(t1_st) == t1_st) && 1 <= __retres1) && m_st == \old(m_st)) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || (((m_st == \old(m_st) && __retres1 == 0) && \old(t2_st) == t2_st) && t1_st == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(2 <= \old(m_st))) || !(m_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || ((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && \old(t2_st) == t2_st) && t2_i == 1)) || !(t2_pc == 1)) || !(token <= local + 1))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || (((m_st == \old(m_st) && __retres1 == 0) && t1_st == 0) && 0 == t2_st)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((!(E_2 == 2) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && m_st == E_M) && \old(t1_st) == t1_st) && 2 == t2_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && t2_i == 1) && E_1 == 2)) || !(t2_i == 1)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(token == local))) && (((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= 2 + local))) && ((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_i == 1)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || E_2 == 1) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || ((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && m_pc <= 0) && t2_i == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((!(t2_i == 1) || !(m_i == 1)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(t2_pc <= 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st)) || !(token <= local + 1)) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc <= 0)) || (((m_st == \old(m_st) && __retres1 == 0) && 2 == t1_st) && 0 == t2_st)) || !(t1_i == 1)) || !(t2_pc <= 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(\old(t1_st) == 2)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local)) && (((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && \old(t2_st) == t2_st) && t2_i == 1) && __retres1 == 0)) || !(2 <= E_1)) || !(token <= 2 + local))) && (((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || (((((((((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && \old(t1_st) == t1_st) && 2 == t2_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && __retres1 == 0) && E_1 == 2)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(token <= local + 1))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || ((((m_st == \old(m_st) && __retres1 == 0) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(t1_pc == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || ((((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && 0 == t2_st) && __retres1 == 0) && t2_pc <= 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || ((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && m_pc <= 0) && __retres1 == 0)) || !(2 == \old(t2_st)))) && (((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 <= E_1)) || ((((((((t1_i == 1 && \old(t1_st) == t1_st) && 1 <= __retres1) && m_st == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_i == 1) && __retres1 == 0)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && 0 == t2_st) && __retres1 == 0) || !(t2_i == 1)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(t2_pc <= 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(token <= local + 1))) && (((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || ((((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && 0 == t2_st) && __retres1 == 0) && t2_pc <= 0)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc <= 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || !(E_M == E_1)) || !(token == local))) && (((((((((((((!(E_2 == 2) || !(t2_i == 1)) || (((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && m_pc <= 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || (((((((((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && \old(t1_st) == t1_st) && 2 == t2_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && __retres1 == 0) && E_1 == 2)) || !(1 <= m_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(token == local))) && ((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_i == 1)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(2 <= \old(m_st))) || !(m_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || !(t2_pc == 1)) || (((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && 1 <= m_pc) && \old(t2_st) == t2_st) && t2_i == 1) && __retres1 == 0)) || !(token <= local + 1)) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) || (((((((((((((t1_pc == 0 && t1_i == 1) && m_st == E_M) && E_M == E_1) && t1_st == 0) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || (((((((((((((t1_pc == 0 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) || ((((((((((((t1_pc == 1 && (\result == 1 || !(t1_st == 0))) && m_st == 2) && t1_i == 1) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2) || (((((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2)) || ((((((((((((t1_pc == 0 && t1_i == 1) && (m_st == E_M || m_st == 0)) && E_M == E_1) && t1_st == 0) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || (((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && E_1 == 2) - InvariantResult [Line: 546]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 0 && t1_i == 1) && m_st == 0) && E_M == E_1) && t1_st == 0) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0 - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && m_st == 2) && t1_i == 1) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) && t2_pc <= 0) || ((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && E_M == E_1) && t1_st == 0) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2)) || ((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == 0) && E_M == E_1) && t1_st == 0) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && E_M == E_1) && t1_st == 0) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && tmp == 1) && E_2 == 2) && t2_i == 1) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && t1_i == 1) && 2 == t1_st) && (m_st == E_M || m_st == 0)) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2) && t2_pc <= 0) - InvariantResult [Line: 525]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2) || (((((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2)) || (((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && E_1 == 2) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 1 || !(t1_st == 0)) && m_st == 2) && t1_i == 1) && token <= local + 1) && 1 <= m_pc) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && E_1 == 2) || (((((((((((((((\result == 1 || !(t1_st == 0)) && t1_pc == 0) && t1_i == 1) && m_st == 0) && !(E_2 == 1)) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((\result == 1 || !(t1_st == 0)) && t1_pc == 0) && t1_i == 1) && 2 == t2_st) && (m_st == E_M || m_st == 0)) && E_M == E_1) && t2_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((((((\result == 1 || !(t1_st == 0)) && m_st == 2) && t1_i == 1) && token <= local + 1) && E_M == E_1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((\result == 1 || !(t1_st == 0)) && m_st == 2) && t1_pc == 0) && t1_i == 1) && 2 == t2_st) && 1 <= m_pc) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || (((((((((((((\result == 1 || !(t1_st == 0)) && m_st == 2) && t1_i == 1) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((\result == 1 || !(t1_st == 0)) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && !(E_2 == 1)) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) - InvariantResult [Line: 538]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_i == 1) && E_2 == 2) && !(m_st == 0)) && m_pc <= 0) && t2_i == 1) && E_1 == 2) || (((((((((((((t1_pc == 0 && t1_i == 1) && E_M == E_1) && t1_st == 0) && m_i == 1) && tmp == 1) && E_2 == 2) && !(m_st == 0)) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((t1_pc == 0 && t1_i == 1) && 2 == t2_st) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && !(m_st == 0)) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2)) || (((((((((((((t1_pc == 1 && t1_i == 1) && 2 == t1_st) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && !(m_st == 0)) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((t1_pc == 1 && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && !(m_st == 0)) && t2_i == 1) && local + 1 < token) && E_1 == 2) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2) || (((((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2)) || (((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && E_1 == 2) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && E_M == E_1) && t1_st == 0) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) || ((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == 0) && !(E_2 == 1)) && E_M == E_1) && t1_st == 0) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2)) || (((((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && t1_i == 1) && token <= 2 + local) && m_st == 0) && 2 == t1_st) && 1 <= m_pc) && !(E_2 == 1)) && E_M == E_1) && !(tmp == 0)) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && tmp == 1) && E_2 == 2) && t2_i == 1) && E_1 == 2)) || (((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && t1_i == 1) && m_st == E_M) && 1 <= m_pc) && !(E_2 == 1)) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((((t1_pc == 1 && (!(0 == t2_st) || \result == 1)) && t1_i == 1) && 2 == t1_st) && (m_st == E_M || m_st == 0)) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((((((!(0 == t2_st) || \result == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && !(E_2 == 1)) && E_M == E_1) && t1_st == 0) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(t2_i == 1) || !(m_i == 1)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(t2_pc <= 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && 0 == t2_st) && __retres1 == 0) && __retres1 == 0)) || !(token <= local + 1)) && (((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || (((((m_st == \old(m_st) && __retres1 == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0) && __retres1 == 0)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= 2 + local))) && (((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || (((((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && 0 == t2_st) && __retres1 == 0) && __retres1 == 0) && t2_pc <= 0)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc <= 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || !(E_M == E_1)) || !(token == local))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || (((((((((t1_i == 1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && __retres1 == 0) && t1_st == 0) && m_pc <= 0) && 0 == t2_st) && __retres1 == 0) && __retres1 == 0) && t2_pc <= 0)) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || !(t2_pc <= 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t2_pc <= 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(\old(t1_st) == 2)) || (((m_st == \old(m_st) && __retres1 == 0) && \old(t2_st) == t2_st) && __retres1 == 0)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || (((((m_st == \old(m_st) && __retres1 == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0) && __retres1 == 0)) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(token <= local + 1))) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(2 <= \old(m_st))) || !(m_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(1 <= m_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && __retres1 == 1) && __retres1 == 0)) || !(t2_pc == 1)) || !(token <= local + 1))) && (((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || (((((1 <= __retres1 && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0) && __retres1 == 0)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && ((((((((((((!(E_2 == 2) || ((((((((t1_i == 1 && m_st == \old(m_st)) && __retres1 == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && m_pc <= 0) && t2_i == 1) && __retres1 == 0) && __retres1 == 0)) || !(t2_i == 1)) || E_2 == 1) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st)))) && ((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || E_2 == 1) || !(m_i == 1)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(1 <= m_pc)) || !(\old(t1_st) == 2)) || (((m_st == \old(m_st) && __retres1 == 0) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || (((((m_st == \old(m_st) && __retres1 == 0) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0) && __retres1 == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(t1_pc == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(m_i == 1)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && __retres1 == 0) && __retres1 == 0)) || !(m_pc == 1)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_M == E_1)) || !(1 <= m_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(token == local))) && ((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || ((((((t1_i == 1 && m_st == \old(m_st)) && __retres1 == 0) && \old(t2_st) == t2_st) && m_pc <= 0) && t2_i == 1) && __retres1 == 0)) || !(E_M == 2)) || \old(m_st) == 0) || E_2 == 1) || !(m_i == 1)) || !(t1_pc == 1)) || !(m_pc <= 0)) || !(t1_i == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local)) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && 1 <= m_pc) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2) && !(E_M == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && 2 == t2_st) && 1 <= m_pc) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && 1 <= m_pc) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2) && !(E_M == 1))) || ((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && E_1 == 2) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 250]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((t1_pc == 1 && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && local + 1 < token) && E_1 == 2) || (((((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && E_1 == 2)) || ((((((((((((t1_pc == 0 && t1_i == 1) && (m_st == E_M || m_st == 0)) && E_M == E_1) && t1_st == 0) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((t1_pc == 1 && t1_i == 1) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && !(tmp == 0)) && t2_pc == 1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && t2_i == 1) && 0 == t2_st) && E_1 == 2)) || (((((((((((((t1_pc == 0 && t1_i == 1) && m_st == E_M) && E_M == E_1) && t1_st == 0) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && E_M == E_1) && m_pc == 1) && m_i == 1) && local + 1 <= token) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((m_st == 2 && t1_pc == 0) && t1_i == 1) && 2 == t2_st) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || (((((((((((((t1_pc == 0 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2)) || (((((((((((((t1_pc == 0 && t1_i == 1) && 2 == t2_st) && m_st == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && token == local) && E_1 == 2)) || (((((((((((((t1_pc == 1 && t1_i == 1) && 2 == t1_st) && (m_st == E_M || m_st == 0)) && E_M == E_1) && m_i == 1) && tmp == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || (((((((((((t1_pc == 1 && t1_i == 1) && m_st == E_M) && 2 == t2_st) && E_M == E_1) && t2_pc == 1) && m_pc == 1) && m_i == 1) && E_2 == 2) && t2_i == 1) && token == local) && E_1 == 2)) || ((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && E_M == E_1) && m_pc == 1) && m_i == 1) && tmp == 1) && E_2 == 2) && t2_i == 1) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && m_i == 1) && E_2 == 2) && m_pc <= 0) && t2_i == 1) && E_1 == 2) RESULT: Ultimate proved your program to be correct! [2022-11-03 04:02:59,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29e73855-e689-46b7-a15b-899591eb7cbc/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE