./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 20:58:46,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 20:58:46,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 20:58:46,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 20:58:46,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 20:58:46,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 20:58:46,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 20:58:46,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 20:58:46,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 20:58:46,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 20:58:46,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 20:58:46,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 20:58:46,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 20:58:46,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 20:58:46,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 20:58:46,514 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 20:58:46,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 20:58:46,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 20:58:46,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 20:58:46,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 20:58:46,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 20:58:46,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 20:58:46,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 20:58:46,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 20:58:46,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 20:58:46,527 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 20:58:46,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 20:58:46,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 20:58:46,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 20:58:46,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 20:58:46,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 20:58:46,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 20:58:46,530 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 20:58:46,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 20:58:46,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 20:58:46,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 20:58:46,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 20:58:46,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 20:58:46,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 20:58:46,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 20:58:46,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 20:58:46,535 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 20:58:46,559 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 20:58:46,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 20:58:46,560 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 20:58:46,560 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 20:58:46,561 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 20:58:46,561 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 20:58:46,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 20:58:46,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 20:58:46,562 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 20:58:46,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 20:58:46,562 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 20:58:46,562 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 20:58:46,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 20:58:46,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 20:58:46,563 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 20:58:46,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 20:58:46,563 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 20:58:46,563 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 20:58:46,563 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 20:58:46,564 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 20:58:46,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 20:58:46,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 20:58:46,564 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 20:58:46,564 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 20:58:46,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:58:46,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 20:58:46,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 20:58:46,565 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 20:58:46,565 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 20:58:46,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 20:58:46,566 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 20:58:46,566 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 20:58:46,566 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 20:58:46,566 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 20:58:46,566 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_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/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_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa 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 -> Automizer 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 -> f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 [2021-12-06 20:58:46,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 20:58:46,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 20:58:46,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 20:58:46,759 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 20:58:46,759 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 20:58:46,760 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2021-12-06 20:58:46,801 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/data/42f65c043/df21b4f849df482aabf041b2e1e2d45b/FLAGf34ae80f6 [2021-12-06 20:58:47,197 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 20:58:47,197 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2021-12-06 20:58:47,206 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/data/42f65c043/df21b4f849df482aabf041b2e1e2d45b/FLAGf34ae80f6 [2021-12-06 20:58:47,217 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/data/42f65c043/df21b4f849df482aabf041b2e1e2d45b [2021-12-06 20:58:47,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 20:58:47,220 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 20:58:47,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 20:58:47,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 20:58:47,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 20:58:47,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:58:47" (1/1) ... [2021-12-06 20:58:47,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60390f11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:58:47, skipping insertion in model container [2021-12-06 20:58:47,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:58:47" (1/1) ... [2021-12-06 20:58:47,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 20:58:47,262 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 20:58:47,385 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_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2021-12-06 20:58:47,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2021-12-06 20:58:47,437 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:58:47,444 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 20:58:47,452 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_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2021-12-06 20:58:47,466 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_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2021-12-06 20:58:47,479 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:58:47,492 INFO L208 MainTranslator]: Completed translation [2021-12-06 20:58:47,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:58:47 WrapperNode [2021-12-06 20:58:47,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 20:58:47,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 20:58:47,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 20:58:47,494 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 20:58:47,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:58:47" (1/1) ... [2021-12-06 20:58:47,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:58:47" (1/1) ... [2021-12-06 20:58:47,529 INFO L137 Inliner]: procedures = 55, calls = 60, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 402 [2021-12-06 20:58:47,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 20:58:47,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 20:58:47,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 20:58:47,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 20:58:47,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:58:47" (1/1) ... [2021-12-06 20:58:47,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:58:47" (1/1) ... [2021-12-06 20:58:47,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:58:47" (1/1) ... [2021-12-06 20:58:47,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:58:47" (1/1) ... [2021-12-06 20:58:47,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:58:47" (1/1) ... [2021-12-06 20:58:47,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:58:47" (1/1) ... [2021-12-06 20:58:47,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:58:47" (1/1) ... [2021-12-06 20:58:47,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 20:58:47,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 20:58:47,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 20:58:47,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 20:58:47,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:58:47" (1/1) ... [2021-12-06 20:58:47,566 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:58:47,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:58:47,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 20:58:47,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 20:58:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 20:58:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-06 20:58:47,617 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-06 20:58:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-06 20:58:47,617 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-06 20:58:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-06 20:58:47,617 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-06 20:58:47,617 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-06 20:58:47,618 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-06 20:58:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-06 20:58:47,618 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-06 20:58:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-06 20:58:47,618 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-06 20:58:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-06 20:58:47,618 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-06 20:58:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-06 20:58:47,618 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-06 20:58:47,618 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-06 20:58:47,619 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-06 20:58:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-06 20:58:47,619 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-06 20:58:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-06 20:58:47,619 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-06 20:58:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 20:58:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-06 20:58:47,619 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-06 20:58:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-06 20:58:47,619 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-06 20:58:47,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 20:58:47,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 20:58:47,620 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-06 20:58:47,620 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-06 20:58:47,683 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 20:58:47,685 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 20:58:47,966 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 20:58:47,973 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 20:58:47,973 INFO L301 CfgBuilder]: Removed 8 assume(true) statements. [2021-12-06 20:58:47,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:58:47 BoogieIcfgContainer [2021-12-06 20:58:47,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 20:58:47,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 20:58:47,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 20:58:47,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 20:58:47,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 08:58:47" (1/3) ... [2021-12-06 20:58:47,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe6fdc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 08:58:47, skipping insertion in model container [2021-12-06 20:58:47,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:58:47" (2/3) ... [2021-12-06 20:58:47,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe6fdc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 08:58:47, skipping insertion in model container [2021-12-06 20:58:47,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:58:47" (3/3) ... [2021-12-06 20:58:47,981 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2021-12-06 20:58:47,985 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 20:58:47,985 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 20:58:48,020 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 20:58:48,025 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 20:58:48,025 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-06 20:58:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 168 states have internal predecessors, (248), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2021-12-06 20:58:48,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 20:58:48,049 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:58:48,050 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:58:48,050 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:58:48,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:58:48,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1497674214, now seen corresponding path program 1 times [2021-12-06 20:58:48,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:58:48,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923959732] [2021-12-06 20:58:48,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:58:48,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:58:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:48,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:58:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:48,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:58:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:48,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:58:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:48,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:58:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:48,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:58:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:48,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:58:48,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:58:48,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923959732] [2021-12-06 20:58:48,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923959732] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:58:48,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:58:48,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:58:48,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127691056] [2021-12-06 20:58:48,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:58:48,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:58:48,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:58:48,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:58:48,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:58:48,320 INFO L87 Difference]: Start difference. First operand has 208 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 168 states have internal predecessors, (248), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:58:48,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:58:48,815 INFO L93 Difference]: Finished difference Result 530 states and 790 transitions. [2021-12-06 20:58:48,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 20:58:48,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 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 57 [2021-12-06 20:58:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:58:48,827 INFO L225 Difference]: With dead ends: 530 [2021-12-06 20:58:48,827 INFO L226 Difference]: Without dead ends: 329 [2021-12-06 20:58:48,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:58:48,833 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 516 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 20:58:48,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 775 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 20:58:48,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-12-06 20:58:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 288. [2021-12-06 20:58:48,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 227 states have (on average 1.4317180616740088) internal successors, (325), 232 states have internal predecessors, (325), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2021-12-06 20:58:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 404 transitions. [2021-12-06 20:58:48,890 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 404 transitions. Word has length 57 [2021-12-06 20:58:48,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:58:48,890 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 404 transitions. [2021-12-06 20:58:48,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:58:48,891 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 404 transitions. [2021-12-06 20:58:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 20:58:48,893 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:58:48,893 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:58:48,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 20:58:48,894 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:58:48,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:58:48,894 INFO L85 PathProgramCache]: Analyzing trace with hash -604187876, now seen corresponding path program 1 times [2021-12-06 20:58:48,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:58:48,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763422449] [2021-12-06 20:58:48,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:58:48,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:58:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:48,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:58:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:48,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:58:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:48,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:58:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:48,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:58:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:48,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:58:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:58:48,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:58:48,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763422449] [2021-12-06 20:58:48,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763422449] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:58:48,980 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:58:48,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:58:48,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671347201] [2021-12-06 20:58:48,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:58:48,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:58:48,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:58:48,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:58:48,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:58:48,983 INFO L87 Difference]: Start difference. First operand 288 states and 404 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:58:49,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:58:49,452 INFO L93 Difference]: Finished difference Result 620 states and 878 transitions. [2021-12-06 20:58:49,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 20:58:49,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 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 57 [2021-12-06 20:58:49,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:58:49,456 INFO L225 Difference]: With dead ends: 620 [2021-12-06 20:58:49,456 INFO L226 Difference]: Without dead ends: 437 [2021-12-06 20:58:49,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-06 20:58:49,459 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 493 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 20:58:49,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [511 Valid, 1059 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 20:58:49,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-12-06 20:58:49,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 373. [2021-12-06 20:58:49,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 295 states have (on average 1.423728813559322) internal successors, (420), 301 states have internal predecessors, (420), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2021-12-06 20:58:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 521 transitions. [2021-12-06 20:58:49,489 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 521 transitions. Word has length 57 [2021-12-06 20:58:49,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:58:49,490 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 521 transitions. [2021-12-06 20:58:49,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:58:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 521 transitions. [2021-12-06 20:58:49,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 20:58:49,491 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:58:49,492 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:58:49,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 20:58:49,492 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:58:49,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:58:49,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1641391578, now seen corresponding path program 1 times [2021-12-06 20:58:49,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:58:49,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747059299] [2021-12-06 20:58:49,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:58:49,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:58:49,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:49,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:58:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:49,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:58:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:49,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:58:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:49,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:58:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:49,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:58:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:49,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:58:49,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:58:49,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747059299] [2021-12-06 20:58:49,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747059299] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:58:49,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:58:49,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:58:49,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554122625] [2021-12-06 20:58:49,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:58:49,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:58:49,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:58:49,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:58:49,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:58:49,562 INFO L87 Difference]: Start difference. First operand 373 states and 521 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:58:50,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:58:50,055 INFO L93 Difference]: Finished difference Result 956 states and 1345 transitions. [2021-12-06 20:58:50,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 20:58:50,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 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 57 [2021-12-06 20:58:50,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:58:50,060 INFO L225 Difference]: With dead ends: 956 [2021-12-06 20:58:50,060 INFO L226 Difference]: Without dead ends: 688 [2021-12-06 20:58:50,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-06 20:58:50,063 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 506 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 20:58:50,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 1060 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 20:58:50,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2021-12-06 20:58:50,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 538. [2021-12-06 20:58:50,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 428 states have (on average 1.4182242990654206) internal successors, (607), 436 states have internal predecessors, (607), 67 states have call successors, (67), 38 states have call predecessors, (67), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2021-12-06 20:58:50,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 752 transitions. [2021-12-06 20:58:50,102 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 752 transitions. Word has length 57 [2021-12-06 20:58:50,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:58:50,102 INFO L470 AbstractCegarLoop]: Abstraction has 538 states and 752 transitions. [2021-12-06 20:58:50,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:58:50,102 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 752 transitions. [2021-12-06 20:58:50,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 20:58:50,104 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:58:50,104 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:58:50,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 20:58:50,104 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:58:50,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:58:50,104 INFO L85 PathProgramCache]: Analyzing trace with hash 743998300, now seen corresponding path program 1 times [2021-12-06 20:58:50,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:58:50,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041497782] [2021-12-06 20:58:50,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:58:50,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:58:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:50,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:58:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:50,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:58:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:50,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:58:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:50,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:58:50,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:50,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:58:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:58:50,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:58:50,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041497782] [2021-12-06 20:58:50,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041497782] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:58:50,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:58:50,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:58:50,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241278211] [2021-12-06 20:58:50,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:58:50,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:58:50,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:58:50,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:58:50,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:58:50,182 INFO L87 Difference]: Start difference. First operand 538 states and 752 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:58:50,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:58:50,522 INFO L93 Difference]: Finished difference Result 1128 states and 1612 transitions. [2021-12-06 20:58:50,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 20:58:50,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 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 57 [2021-12-06 20:58:50,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:58:50,527 INFO L225 Difference]: With dead ends: 1128 [2021-12-06 20:58:50,528 INFO L226 Difference]: Without dead ends: 696 [2021-12-06 20:58:50,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-12-06 20:58:50,531 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 268 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:58:50,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 1026 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:58:50,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2021-12-06 20:58:50,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 553. [2021-12-06 20:58:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 443 states have (on average 1.4040632054176072) internal successors, (622), 451 states have internal predecessors, (622), 67 states have call successors, (67), 38 states have call predecessors, (67), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2021-12-06 20:58:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 767 transitions. [2021-12-06 20:58:50,577 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 767 transitions. Word has length 57 [2021-12-06 20:58:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:58:50,577 INFO L470 AbstractCegarLoop]: Abstraction has 553 states and 767 transitions. [2021-12-06 20:58:50,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:58:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 767 transitions. [2021-12-06 20:58:50,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-06 20:58:50,579 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:58:50,579 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:58:50,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 20:58:50,579 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:58:50,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:58:50,580 INFO L85 PathProgramCache]: Analyzing trace with hash 671611742, now seen corresponding path program 1 times [2021-12-06 20:58:50,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:58:50,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971119609] [2021-12-06 20:58:50,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:58:50,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:58:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:50,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:58:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:50,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:58:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:50,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:58:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:50,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:58:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:50,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:58:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:58:50,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:58:50,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971119609] [2021-12-06 20:58:50,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971119609] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:58:50,663 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:58:50,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:58:50,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472315829] [2021-12-06 20:58:50,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:58:50,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:58:50,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:58:50,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:58:50,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:58:50,664 INFO L87 Difference]: Start difference. First operand 553 states and 767 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:58:51,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:58:51,406 INFO L93 Difference]: Finished difference Result 2414 states and 3494 transitions. [2021-12-06 20:58:51,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 20:58:51,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 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 57 [2021-12-06 20:58:51,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:58:51,421 INFO L225 Difference]: With dead ends: 2414 [2021-12-06 20:58:51,421 INFO L226 Difference]: Without dead ends: 1967 [2021-12-06 20:58:51,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-12-06 20:58:51,426 INFO L933 BasicCegarLoop]: 396 mSDtfsCounter, 945 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 20:58:51,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [964 Valid, 981 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 20:58:51,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2021-12-06 20:58:51,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1712. [2021-12-06 20:58:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1359 states have (on average 1.3745401030169242) internal successors, (1868), 1394 states have internal predecessors, (1868), 208 states have call successors, (208), 128 states have call predecessors, (208), 143 states have return successors, (303), 194 states have call predecessors, (303), 206 states have call successors, (303) [2021-12-06 20:58:51,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2379 transitions. [2021-12-06 20:58:51,527 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2379 transitions. Word has length 57 [2021-12-06 20:58:51,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:58:51,527 INFO L470 AbstractCegarLoop]: Abstraction has 1712 states and 2379 transitions. [2021-12-06 20:58:51,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-06 20:58:51,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2379 transitions. [2021-12-06 20:58:51,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 20:58:51,528 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:58:51,528 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:58:51,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 20:58:51,529 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:58:51,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:58:51,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1385451018, now seen corresponding path program 1 times [2021-12-06 20:58:51,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:58:51,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185959126] [2021-12-06 20:58:51,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:58:51,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:58:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:51,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:58:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:51,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 20:58:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:51,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 20:58:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:51,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:58:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:51,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:58:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:51,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:58:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:51,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 20:58:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:51,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:58:51,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:58:51,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185959126] [2021-12-06 20:58:51,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185959126] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:58:51,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:58:51,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 20:58:51,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712924431] [2021-12-06 20:58:51,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:58:51,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 20:58:51,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:58:51,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 20:58:51,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:58:51,604 INFO L87 Difference]: Start difference. First operand 1712 states and 2379 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 20:58:52,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:58:52,079 INFO L93 Difference]: Finished difference Result 1935 states and 2694 transitions. [2021-12-06 20:58:52,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 20:58:52,079 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-12-06 20:58:52,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:58:52,092 INFO L225 Difference]: With dead ends: 1935 [2021-12-06 20:58:52,092 INFO L226 Difference]: Without dead ends: 1847 [2021-12-06 20:58:52,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-06 20:58:52,095 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 411 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:58:52,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 1058 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:58:52,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2021-12-06 20:58:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1808. [2021-12-06 20:58:52,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1435 states have (on average 1.3749128919860627) internal successors, (1973), 1472 states have internal predecessors, (1973), 219 states have call successors, (219), 135 states have call predecessors, (219), 152 states have return successors, (319), 206 states have call predecessors, (319), 217 states have call successors, (319) [2021-12-06 20:58:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2511 transitions. [2021-12-06 20:58:52,199 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2511 transitions. Word has length 65 [2021-12-06 20:58:52,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:58:52,199 INFO L470 AbstractCegarLoop]: Abstraction has 1808 states and 2511 transitions. [2021-12-06 20:58:52,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 20:58:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2511 transitions. [2021-12-06 20:58:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 20:58:52,202 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:58:52,202 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:58:52,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 20:58:52,202 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:58:52,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:58:52,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1789236969, now seen corresponding path program 1 times [2021-12-06 20:58:52,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:58:52,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548477935] [2021-12-06 20:58:52,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:58:52,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:58:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:52,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:58:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:52,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 20:58:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:52,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 20:58:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:52,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:58:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:52,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:58:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:52,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:58:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:52,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 20:58:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:58:52,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:58:52,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548477935] [2021-12-06 20:58:52,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548477935] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:58:52,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:58:52,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 20:58:52,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473905552] [2021-12-06 20:58:52,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:58:52,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 20:58:52,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:58:52,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 20:58:52,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:58:52,278 INFO L87 Difference]: Start difference. First operand 1808 states and 2511 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 20:58:52,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:58:52,730 INFO L93 Difference]: Finished difference Result 2155 states and 2988 transitions. [2021-12-06 20:58:52,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 20:58:52,731 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-12-06 20:58:52,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:58:52,740 INFO L225 Difference]: With dead ends: 2155 [2021-12-06 20:58:52,740 INFO L226 Difference]: Without dead ends: 1978 [2021-12-06 20:58:52,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-06 20:58:52,743 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 740 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:58:52,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [760 Valid, 1086 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:58:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2021-12-06 20:58:52,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1904. [2021-12-06 20:58:52,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1904 states, 1511 states have (on average 1.3745863666446063) internal successors, (2077), 1550 states have internal predecessors, (2077), 230 states have call successors, (230), 142 states have call predecessors, (230), 161 states have return successors, (338), 218 states have call predecessors, (338), 228 states have call successors, (338) [2021-12-06 20:58:52,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2645 transitions. [2021-12-06 20:58:52,838 INFO L78 Accepts]: Start accepts. Automaton has 1904 states and 2645 transitions. Word has length 65 [2021-12-06 20:58:52,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:58:52,838 INFO L470 AbstractCegarLoop]: Abstraction has 1904 states and 2645 transitions. [2021-12-06 20:58:52,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 20:58:52,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1904 states and 2645 transitions. [2021-12-06 20:58:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 20:58:52,840 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:58:52,840 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:58:52,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 20:58:52,840 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:58:52,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:58:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash -239349141, now seen corresponding path program 1 times [2021-12-06 20:58:52,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:58:52,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206842697] [2021-12-06 20:58:52,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:58:52,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:58:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:52,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:58:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:52,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 20:58:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:52,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 20:58:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:52,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:58:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:52,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:58:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:52,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:58:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:52,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 20:58:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:58:52,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:58:52,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206842697] [2021-12-06 20:58:52,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206842697] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:58:52,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:58:52,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 20:58:52,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801837999] [2021-12-06 20:58:52,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:58:52,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 20:58:52,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:58:52,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 20:58:52,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:58:52,927 INFO L87 Difference]: Start difference. First operand 1904 states and 2645 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 20:58:53,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:58:53,296 INFO L93 Difference]: Finished difference Result 2205 states and 3059 transitions. [2021-12-06 20:58:53,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 20:58:53,296 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2021-12-06 20:58:53,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:58:53,305 INFO L225 Difference]: With dead ends: 2205 [2021-12-06 20:58:53,305 INFO L226 Difference]: Without dead ends: 1938 [2021-12-06 20:58:53,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-06 20:58:53,307 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 210 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:58:53,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 1332 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:58:53,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2021-12-06 20:58:53,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1909. [2021-12-06 20:58:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1909 states, 1515 states have (on average 1.3722772277227724) internal successors, (2079), 1554 states have internal predecessors, (2079), 230 states have call successors, (230), 142 states have call predecessors, (230), 162 states have return successors, (339), 219 states have call predecessors, (339), 228 states have call successors, (339) [2021-12-06 20:58:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1909 states to 1909 states and 2648 transitions. [2021-12-06 20:58:53,397 INFO L78 Accepts]: Start accepts. Automaton has 1909 states and 2648 transitions. Word has length 65 [2021-12-06 20:58:53,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:58:53,397 INFO L470 AbstractCegarLoop]: Abstraction has 1909 states and 2648 transitions. [2021-12-06 20:58:53,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 20:58:53,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1909 states and 2648 transitions. [2021-12-06 20:58:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 20:58:53,399 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:58:53,399 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:58:53,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 20:58:53,399 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:58:53,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:58:53,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1268708439, now seen corresponding path program 1 times [2021-12-06 20:58:53,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:58:53,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903462045] [2021-12-06 20:58:53,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:58:53,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:58:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:53,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:58:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:53,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 20:58:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:53,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 20:58:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:58:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:53,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:58:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:53,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:58:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:53,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 20:58:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:58:53,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:58:53,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903462045] [2021-12-06 20:58:53,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903462045] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:58:53,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:58:53,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 20:58:53,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46900831] [2021-12-06 20:58:53,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:58:53,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 20:58:53,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:58:53,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 20:58:53,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:58:53,494 INFO L87 Difference]: Start difference. First operand 1909 states and 2648 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-06 20:58:54,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:58:54,431 INFO L93 Difference]: Finished difference Result 3571 states and 4920 transitions. [2021-12-06 20:58:54,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-06 20:58:54,432 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2021-12-06 20:58:54,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:58:54,450 INFO L225 Difference]: With dead ends: 3571 [2021-12-06 20:58:54,450 INFO L226 Difference]: Without dead ends: 3299 [2021-12-06 20:58:54,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2021-12-06 20:58:54,453 INFO L933 BasicCegarLoop]: 489 mSDtfsCounter, 1450 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 20:58:54,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1467 Valid, 1411 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [481 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 20:58:54,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2021-12-06 20:58:54,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 3049. [2021-12-06 20:58:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3049 states, 2415 states have (on average 1.349896480331263) internal successors, (3260), 2474 states have internal predecessors, (3260), 347 states have call successors, (347), 244 states have call predecessors, (347), 285 states have return successors, (525), 337 states have call predecessors, (525), 345 states have call successors, (525) [2021-12-06 20:58:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3049 states to 3049 states and 4132 transitions. [2021-12-06 20:58:54,634 INFO L78 Accepts]: Start accepts. Automaton has 3049 states and 4132 transitions. Word has length 65 [2021-12-06 20:58:54,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:58:54,634 INFO L470 AbstractCegarLoop]: Abstraction has 3049 states and 4132 transitions. [2021-12-06 20:58:54,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-06 20:58:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand 3049 states and 4132 transitions. [2021-12-06 20:58:54,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 20:58:54,636 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:58:54,636 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:58:54,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-06 20:58:54,636 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:58:54,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:58:54,636 INFO L85 PathProgramCache]: Analyzing trace with hash -217259350, now seen corresponding path program 1 times [2021-12-06 20:58:54,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:58:54,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821134182] [2021-12-06 20:58:54,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:58:54,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:58:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:54,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:58:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:54,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 20:58:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:54,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 20:58:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:54,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:58:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:54,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:58:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:54,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:58:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:54,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 20:58:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:54,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:58:54,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:58:54,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821134182] [2021-12-06 20:58:54,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821134182] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:58:54,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:58:54,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 20:58:54,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209901419] [2021-12-06 20:58:54,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:58:54,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 20:58:54,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:58:54,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 20:58:54,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:58:54,714 INFO L87 Difference]: Start difference. First operand 3049 states and 4132 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 20:58:55,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:58:55,148 INFO L93 Difference]: Finished difference Result 4650 states and 6256 transitions. [2021-12-06 20:58:55,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 20:58:55,149 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2021-12-06 20:58:55,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:58:55,163 INFO L225 Difference]: With dead ends: 4650 [2021-12-06 20:58:55,163 INFO L226 Difference]: Without dead ends: 3238 [2021-12-06 20:58:55,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-06 20:58:55,168 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 208 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:58:55,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 1325 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:58:55,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3238 states. [2021-12-06 20:58:55,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3238 to 3094. [2021-12-06 20:58:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3094 states, 2451 states have (on average 1.3410852713178294) internal successors, (3287), 2510 states have internal predecessors, (3287), 347 states have call successors, (347), 244 states have call predecessors, (347), 294 states have return successors, (537), 346 states have call predecessors, (537), 345 states have call successors, (537) [2021-12-06 20:58:55,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 4171 transitions. [2021-12-06 20:58:55,322 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 4171 transitions. Word has length 65 [2021-12-06 20:58:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:58:55,323 INFO L470 AbstractCegarLoop]: Abstraction has 3094 states and 4171 transitions. [2021-12-06 20:58:55,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 20:58:55,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 4171 transitions. [2021-12-06 20:58:55,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 20:58:55,324 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:58:55,324 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:58:55,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-06 20:58:55,325 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:58:55,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:58:55,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1168944044, now seen corresponding path program 1 times [2021-12-06 20:58:55,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:58:55,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644627019] [2021-12-06 20:58:55,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:58:55,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:58:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:55,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:58:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:55,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 20:58:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:55,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 20:58:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:55,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:58:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:55,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:58:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:55,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:58:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:55,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 20:58:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:58:55,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:58:55,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644627019] [2021-12-06 20:58:55,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644627019] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:58:55,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:58:55,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 20:58:55,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139605502] [2021-12-06 20:58:55,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:58:55,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 20:58:55,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:58:55,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 20:58:55,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:58:55,390 INFO L87 Difference]: Start difference. First operand 3094 states and 4171 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 20:58:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:58:55,857 INFO L93 Difference]: Finished difference Result 4529 states and 6010 transitions. [2021-12-06 20:58:55,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 20:58:55,857 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-12-06 20:58:55,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:58:55,870 INFO L225 Difference]: With dead ends: 4529 [2021-12-06 20:58:55,870 INFO L226 Difference]: Without dead ends: 3292 [2021-12-06 20:58:55,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-12-06 20:58:55,873 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 557 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:58:55,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [575 Valid, 976 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:58:55,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3292 states. [2021-12-06 20:58:56,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3292 to 3072. [2021-12-06 20:58:56,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 2437 states have (on average 1.3389413212966763) internal successors, (3263), 2490 states have internal predecessors, (3263), 347 states have call successors, (347), 244 states have call predecessors, (347), 286 states have return successors, (521), 344 states have call predecessors, (521), 345 states have call successors, (521) [2021-12-06 20:58:56,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 4131 transitions. [2021-12-06 20:58:56,016 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 4131 transitions. Word has length 65 [2021-12-06 20:58:56,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:58:56,016 INFO L470 AbstractCegarLoop]: Abstraction has 3072 states and 4131 transitions. [2021-12-06 20:58:56,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 20:58:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 4131 transitions. [2021-12-06 20:58:56,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 20:58:56,017 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:58:56,017 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:58:56,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-06 20:58:56,018 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:58:56,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:58:56,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1034930538, now seen corresponding path program 1 times [2021-12-06 20:58:56,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:58:56,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828630907] [2021-12-06 20:58:56,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:58:56,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:58:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:56,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:58:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:56,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 20:58:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:56,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 20:58:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:56,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:58:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:56,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:58:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:56,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:58:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:56,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 20:58:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:58:56,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:58:56,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828630907] [2021-12-06 20:58:56,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828630907] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:58:56,074 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:58:56,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:58:56,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581565259] [2021-12-06 20:58:56,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:58:56,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:58:56,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:58:56,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:58:56,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:58:56,075 INFO L87 Difference]: Start difference. First operand 3072 states and 4131 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 20:58:56,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:58:56,450 INFO L93 Difference]: Finished difference Result 6147 states and 8110 transitions. [2021-12-06 20:58:56,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 20:58:56,450 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-12-06 20:58:56,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:58:56,478 INFO L225 Difference]: With dead ends: 6147 [2021-12-06 20:58:56,478 INFO L226 Difference]: Without dead ends: 4715 [2021-12-06 20:58:56,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2021-12-06 20:58:56,484 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 657 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:58:56,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [681 Valid, 664 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:58:56,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4715 states. [2021-12-06 20:58:56,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4715 to 4443. [2021-12-06 20:58:56,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4443 states, 3503 states have (on average 1.3074507564944333) internal successors, (4580), 3577 states have internal predecessors, (4580), 499 states have call successors, (499), 367 states have call predecessors, (499), 439 states have return successors, (793), 508 states have call predecessors, (793), 497 states have call successors, (793) [2021-12-06 20:58:56,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4443 states to 4443 states and 5872 transitions. [2021-12-06 20:58:56,708 INFO L78 Accepts]: Start accepts. Automaton has 4443 states and 5872 transitions. Word has length 65 [2021-12-06 20:58:56,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:58:56,709 INFO L470 AbstractCegarLoop]: Abstraction has 4443 states and 5872 transitions. [2021-12-06 20:58:56,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 20:58:56,709 INFO L276 IsEmpty]: Start isEmpty. Operand 4443 states and 5872 transitions. [2021-12-06 20:58:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 20:58:56,712 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:58:56,712 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:58:56,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-06 20:58:56,712 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:58:56,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:58:56,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1593552473, now seen corresponding path program 1 times [2021-12-06 20:58:56,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:58:56,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443674802] [2021-12-06 20:58:56,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:58:56,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:58:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:56,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:58:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:56,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 20:58:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:56,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 20:58:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:56,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:58:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:56,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:58:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:56,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:58:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:56,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 20:58:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:56,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:58:56,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:58:56,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443674802] [2021-12-06 20:58:56,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443674802] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:58:56,766 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:58:56,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:58:56,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668904178] [2021-12-06 20:58:56,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:58:56,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:58:56,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:58:56,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:58:56,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:58:56,767 INFO L87 Difference]: Start difference. First operand 4443 states and 5872 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 20:58:57,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:58:57,222 INFO L93 Difference]: Finished difference Result 9461 states and 12386 transitions. [2021-12-06 20:58:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-06 20:58:57,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2021-12-06 20:58:57,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:58:57,245 INFO L225 Difference]: With dead ends: 9461 [2021-12-06 20:58:57,246 INFO L226 Difference]: Without dead ends: 6637 [2021-12-06 20:58:57,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:58:57,251 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 379 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:58:57,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 798 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:58:57,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6637 states. [2021-12-06 20:58:57,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6637 to 6121. [2021-12-06 20:58:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6121 states, 4788 states have (on average 1.2907268170426065) internal successors, (6180), 4869 states have internal predecessors, (6180), 693 states have call successors, (693), 541 states have call predecessors, (693), 638 states have return successors, (1114), 720 states have call predecessors, (1114), 691 states have call successors, (1114) [2021-12-06 20:58:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 7987 transitions. [2021-12-06 20:58:57,504 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 7987 transitions. Word has length 66 [2021-12-06 20:58:57,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:58:57,504 INFO L470 AbstractCegarLoop]: Abstraction has 6121 states and 7987 transitions. [2021-12-06 20:58:57,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 20:58:57,504 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 7987 transitions. [2021-12-06 20:58:57,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-06 20:58:57,507 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:58:57,507 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:58:57,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-06 20:58:57,507 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:58:57,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:58:57,507 INFO L85 PathProgramCache]: Analyzing trace with hash -455119352, now seen corresponding path program 1 times [2021-12-06 20:58:57,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:58:57,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412777303] [2021-12-06 20:58:57,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:58:57,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:58:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:57,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:58:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:57,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 20:58:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:57,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 20:58:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:57,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:58:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:57,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:58:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:57,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:58:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:57,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 20:58:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:58:57,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:58:57,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412777303] [2021-12-06 20:58:57,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412777303] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:58:57,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:58:57,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:58:57,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426679605] [2021-12-06 20:58:57,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:58:57,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:58:57,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:58:57,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:58:57,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:58:57,569 INFO L87 Difference]: Start difference. First operand 6121 states and 7987 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-06 20:58:58,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:58:58,098 INFO L93 Difference]: Finished difference Result 7751 states and 9989 transitions. [2021-12-06 20:58:58,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 20:58:58,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2021-12-06 20:58:58,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:58:58,123 INFO L225 Difference]: With dead ends: 7751 [2021-12-06 20:58:58,123 INFO L226 Difference]: Without dead ends: 7748 [2021-12-06 20:58:58,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-12-06 20:58:58,126 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 791 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:58:58,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [800 Valid, 684 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:58:58,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7748 states. [2021-12-06 20:58:58,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7748 to 7175. [2021-12-06 20:58:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7175 states, 5591 states have (on average 1.2788409944553747) internal successors, (7150), 5681 states have internal predecessors, (7150), 819 states have call successors, (819), 655 states have call predecessors, (819), 763 states have return successors, (1307), 848 states have call predecessors, (1307), 818 states have call successors, (1307) [2021-12-06 20:58:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7175 states to 7175 states and 9276 transitions. [2021-12-06 20:58:58,459 INFO L78 Accepts]: Start accepts. Automaton has 7175 states and 9276 transitions. Word has length 73 [2021-12-06 20:58:58,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:58:58,459 INFO L470 AbstractCegarLoop]: Abstraction has 7175 states and 9276 transitions. [2021-12-06 20:58:58,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-06 20:58:58,459 INFO L276 IsEmpty]: Start isEmpty. Operand 7175 states and 9276 transitions. [2021-12-06 20:58:58,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-06 20:58:58,462 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:58:58,462 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:58:58,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-06 20:58:58,462 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:58:58,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:58:58,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1224424688, now seen corresponding path program 1 times [2021-12-06 20:58:58,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:58:58,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867133270] [2021-12-06 20:58:58,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:58:58,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:58:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:58,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:58:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:58,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 20:58:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:58,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 20:58:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:58,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:58:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:58,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:58:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:58,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:58:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:58,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 20:58:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:58:58,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:58:58,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867133270] [2021-12-06 20:58:58,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867133270] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:58:58,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742714299] [2021-12-06 20:58:58,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:58:58,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:58:58,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:58:58,537 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:58:58,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 20:58:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:58:58,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 20:58:58,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:58:58,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:58:58,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:58:59,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:58:59,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742714299] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 20:58:59,042 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 20:58:59,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2021-12-06 20:58:59,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074519228] [2021-12-06 20:58:59,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 20:58:59,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 20:58:59,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:58:59,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 20:58:59,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-06 20:58:59,043 INFO L87 Difference]: Start difference. First operand 7175 states and 9276 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-06 20:59:00,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:00,423 INFO L93 Difference]: Finished difference Result 14821 states and 18804 transitions. [2021-12-06 20:59:00,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-06 20:59:00,424 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2021-12-06 20:59:00,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:00,453 INFO L225 Difference]: With dead ends: 14821 [2021-12-06 20:59:00,453 INFO L226 Difference]: Without dead ends: 14818 [2021-12-06 20:59:00,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2021-12-06 20:59:00,457 INFO L933 BasicCegarLoop]: 438 mSDtfsCounter, 1185 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:00,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1243 Valid, 1537 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-06 20:59:00,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14818 states. [2021-12-06 20:59:01,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14818 to 12433. [2021-12-06 20:59:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12433 states, 9683 states have (on average 1.2660332541567696) internal successors, (12259), 9825 states have internal predecessors, (12259), 1385 states have call successors, (1385), 1145 states have call predecessors, (1385), 1363 states have return successors, (2246), 1472 states have call predecessors, (2246), 1384 states have call successors, (2246) [2021-12-06 20:59:01,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12433 states to 12433 states and 15890 transitions. [2021-12-06 20:59:01,069 INFO L78 Accepts]: Start accepts. Automaton has 12433 states and 15890 transitions. Word has length 74 [2021-12-06 20:59:01,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:01,069 INFO L470 AbstractCegarLoop]: Abstraction has 12433 states and 15890 transitions. [2021-12-06 20:59:01,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-12-06 20:59:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 12433 states and 15890 transitions. [2021-12-06 20:59:01,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-06 20:59:01,072 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:01,072 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:59:01,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 20:59:01,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-06 20:59:01,273 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:59:01,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:01,273 INFO L85 PathProgramCache]: Analyzing trace with hash -499209592, now seen corresponding path program 2 times [2021-12-06 20:59:01,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:59:01,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403603030] [2021-12-06 20:59:01,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:01,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:59:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:01,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:59:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:01,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 20:59:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:01,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 20:59:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:01,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:59:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:01,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:59:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:01,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:59:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:01,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 20:59:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:59:01,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:59:01,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403603030] [2021-12-06 20:59:01,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403603030] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:59:01,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:59:01,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:59:01,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873849975] [2021-12-06 20:59:01,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:59:01,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:59:01,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:59:01,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:59:01,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:59:01,316 INFO L87 Difference]: Start difference. First operand 12433 states and 15890 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-06 20:59:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:01,972 INFO L93 Difference]: Finished difference Result 18976 states and 24232 transitions. [2021-12-06 20:59:01,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 20:59:01,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2021-12-06 20:59:01,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:01,994 INFO L225 Difference]: With dead ends: 18976 [2021-12-06 20:59:01,994 INFO L226 Difference]: Without dead ends: 9038 [2021-12-06 20:59:02,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-06 20:59:02,012 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 527 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:02,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [551 Valid, 662 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:59:02,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9038 states. [2021-12-06 20:59:02,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9038 to 8486. [2021-12-06 20:59:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8486 states, 6630 states have (on average 1.251734539969834) internal successors, (8299), 6728 states have internal predecessors, (8299), 952 states have call successors, (952), 769 states have call predecessors, (952), 902 states have return successors, (1465), 998 states have call predecessors, (1465), 951 states have call successors, (1465) [2021-12-06 20:59:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8486 states to 8486 states and 10716 transitions. [2021-12-06 20:59:02,440 INFO L78 Accepts]: Start accepts. Automaton has 8486 states and 10716 transitions. Word has length 77 [2021-12-06 20:59:02,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:02,440 INFO L470 AbstractCegarLoop]: Abstraction has 8486 states and 10716 transitions. [2021-12-06 20:59:02,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-12-06 20:59:02,440 INFO L276 IsEmpty]: Start isEmpty. Operand 8486 states and 10716 transitions. [2021-12-06 20:59:02,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-06 20:59:02,443 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:02,443 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:59:02,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-06 20:59:02,443 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:59:02,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:02,444 INFO L85 PathProgramCache]: Analyzing trace with hash 867535010, now seen corresponding path program 1 times [2021-12-06 20:59:02,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:59:02,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813168670] [2021-12-06 20:59:02,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:02,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:59:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:02,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:59:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:02,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 20:59:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:02,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 20:59:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:02,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:59:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:02,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:59:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:02,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:59:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:02,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 20:59:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:02,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 20:59:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:02,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-06 20:59:02,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:59:02,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813168670] [2021-12-06 20:59:02,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813168670] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:59:02,499 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:59:02,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 20:59:02,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408815727] [2021-12-06 20:59:02,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:59:02,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 20:59:02,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:59:02,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 20:59:02,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:59:02,500 INFO L87 Difference]: Start difference. First operand 8486 states and 10716 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 20:59:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:03,594 INFO L93 Difference]: Finished difference Result 22360 states and 27933 transitions. [2021-12-06 20:59:03,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-06 20:59:03,595 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2021-12-06 20:59:03,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:03,627 INFO L225 Difference]: With dead ends: 22360 [2021-12-06 20:59:03,627 INFO L226 Difference]: Without dead ends: 15517 [2021-12-06 20:59:03,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2021-12-06 20:59:03,641 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 768 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:03,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [784 Valid, 1067 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 20:59:03,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15517 states. [2021-12-06 20:59:04,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15517 to 14658. [2021-12-06 20:59:04,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14658 states, 11306 states have (on average 1.2193525561648682) internal successors, (13786), 11510 states have internal predecessors, (13786), 1668 states have call successors, (1668), 1373 states have call predecessors, (1668), 1682 states have return successors, (2868), 1790 states have call predecessors, (2868), 1667 states have call successors, (2868) [2021-12-06 20:59:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14658 states to 14658 states and 18322 transitions. [2021-12-06 20:59:04,469 INFO L78 Accepts]: Start accepts. Automaton has 14658 states and 18322 transitions. Word has length 84 [2021-12-06 20:59:04,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:04,470 INFO L470 AbstractCegarLoop]: Abstraction has 14658 states and 18322 transitions. [2021-12-06 20:59:04,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 20:59:04,470 INFO L276 IsEmpty]: Start isEmpty. Operand 14658 states and 18322 transitions. [2021-12-06 20:59:04,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-06 20:59:04,475 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:04,475 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:59:04,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-06 20:59:04,475 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:59:04,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:04,475 INFO L85 PathProgramCache]: Analyzing trace with hash 260386383, now seen corresponding path program 1 times [2021-12-06 20:59:04,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:59:04,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056826848] [2021-12-06 20:59:04,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:04,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:59:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:04,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:59:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:04,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:59:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:04,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:59:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:04,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:59:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:04,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:59:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:04,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-06 20:59:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:04,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:59:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:04,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 20:59:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 20:59:04,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:59:04,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056826848] [2021-12-06 20:59:04,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056826848] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:59:04,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119533638] [2021-12-06 20:59:04,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:04,533 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:59:04,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:59:04,534 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:59:04,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 20:59:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:04,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 20:59:04,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:59:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-06 20:59:04,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:59:04,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119533638] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:59:04,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:59:04,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 20:59:04,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091253407] [2021-12-06 20:59:04,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:59:04,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:59:04,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:59:04,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:59:04,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:59:04,667 INFO L87 Difference]: Start difference. First operand 14658 states and 18322 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 20:59:05,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:05,290 INFO L93 Difference]: Finished difference Result 17700 states and 22591 transitions. [2021-12-06 20:59:05,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:59:05,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2021-12-06 20:59:05,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:05,317 INFO L225 Difference]: With dead ends: 17700 [2021-12-06 20:59:05,317 INFO L226 Difference]: Without dead ends: 15051 [2021-12-06 20:59:05,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:59:05,325 INFO L933 BasicCegarLoop]: 385 mSDtfsCounter, 114 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:05,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 652 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:59:05,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15051 states. [2021-12-06 20:59:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15051 to 15051. [2021-12-06 20:59:05,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15051 states, 11625 states have (on average 1.2227096774193549) internal successors, (14214), 11833 states have internal predecessors, (14214), 1710 states have call successors, (1710), 1401 states have call predecessors, (1710), 1714 states have return successors, (2932), 1832 states have call predecessors, (2932), 1709 states have call successors, (2932) [2021-12-06 20:59:06,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15051 states to 15051 states and 18856 transitions. [2021-12-06 20:59:06,020 INFO L78 Accepts]: Start accepts. Automaton has 15051 states and 18856 transitions. Word has length 92 [2021-12-06 20:59:06,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:06,021 INFO L470 AbstractCegarLoop]: Abstraction has 15051 states and 18856 transitions. [2021-12-06 20:59:06,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 20:59:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 15051 states and 18856 transitions. [2021-12-06 20:59:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-06 20:59:06,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:06,028 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:59:06,048 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 20:59:06,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-06 20:59:06,230 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:59:06,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:06,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1083636890, now seen corresponding path program 1 times [2021-12-06 20:59:06,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:59:06,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194762359] [2021-12-06 20:59:06,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:06,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:59:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:06,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:59:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:06,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 20:59:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:06,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 20:59:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:06,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:59:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:06,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:59:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:06,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:59:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:06,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 20:59:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:06,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-06 20:59:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 20:59:06,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:59:06,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194762359] [2021-12-06 20:59:06,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194762359] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:59:06,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:59:06,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 20:59:06,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407828193] [2021-12-06 20:59:06,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:59:06,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 20:59:06,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:59:06,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 20:59:06,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:59:06,315 INFO L87 Difference]: Start difference. First operand 15051 states and 18856 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 20:59:07,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:07,606 INFO L93 Difference]: Finished difference Result 25925 states and 32175 transitions. [2021-12-06 20:59:07,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-06 20:59:07,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2021-12-06 20:59:07,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:07,636 INFO L225 Difference]: With dead ends: 25925 [2021-12-06 20:59:07,636 INFO L226 Difference]: Without dead ends: 13526 [2021-12-06 20:59:07,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2021-12-06 20:59:07,660 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 1326 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:07,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1361 Valid, 1082 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-06 20:59:07,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13526 states. [2021-12-06 20:59:08,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13526 to 12626. [2021-12-06 20:59:08,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12626 states, 9791 states have (on average 1.2179552650393217) internal successors, (11925), 9966 states have internal predecessors, (11925), 1411 states have call successors, (1411), 1150 states have call predecessors, (1411), 1422 states have return successors, (2264), 1522 states have call predecessors, (2264), 1410 states have call successors, (2264) [2021-12-06 20:59:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12626 states to 12626 states and 15600 transitions. [2021-12-06 20:59:08,270 INFO L78 Accepts]: Start accepts. Automaton has 12626 states and 15600 transitions. Word has length 93 [2021-12-06 20:59:08,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:08,271 INFO L470 AbstractCegarLoop]: Abstraction has 12626 states and 15600 transitions. [2021-12-06 20:59:08,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-06 20:59:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 12626 states and 15600 transitions. [2021-12-06 20:59:08,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-12-06 20:59:08,277 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:08,277 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:59:08,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-06 20:59:08,277 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:59:08,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:08,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1789084765, now seen corresponding path program 1 times [2021-12-06 20:59:08,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:59:08,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131745422] [2021-12-06 20:59:08,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:08,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:59:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:08,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:59:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:08,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:59:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:08,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:59:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:08,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:59:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:08,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:59:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:08,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-12-06 20:59:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:08,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:59:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:08,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-06 20:59:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:08,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:59:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:08,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-12-06 20:59:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-12-06 20:59:08,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:59:08,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131745422] [2021-12-06 20:59:08,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131745422] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:59:08,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335948891] [2021-12-06 20:59:08,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:08,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:59:08,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:59:08,337 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:59:08,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 20:59:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:08,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 20:59:08,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:59:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-06 20:59:08,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:59:08,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335948891] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:59:08,499 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:59:08,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-06 20:59:08,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097218785] [2021-12-06 20:59:08,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:59:08,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:59:08,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:59:08,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:59:08,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:59:08,500 INFO L87 Difference]: Start difference. First operand 12626 states and 15600 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-06 20:59:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:09,050 INFO L93 Difference]: Finished difference Result 15426 states and 19539 transitions. [2021-12-06 20:59:09,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:59:09,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 118 [2021-12-06 20:59:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:09,071 INFO L225 Difference]: With dead ends: 15426 [2021-12-06 20:59:09,072 INFO L226 Difference]: Without dead ends: 13808 [2021-12-06 20:59:09,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:59:09,077 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 197 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:09,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 408 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:59:09,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13808 states. [2021-12-06 20:59:09,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13808 to 13766. [2021-12-06 20:59:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13766 states, 10706 states have (on average 1.2296842891836353) internal successors, (13165), 10898 states have internal predecessors, (13165), 1539 states have call successors, (1539), 1235 states have call predecessors, (1539), 1519 states have return successors, (2444), 1645 states have call predecessors, (2444), 1538 states have call successors, (2444) [2021-12-06 20:59:09,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13766 states to 13766 states and 17148 transitions. [2021-12-06 20:59:09,705 INFO L78 Accepts]: Start accepts. Automaton has 13766 states and 17148 transitions. Word has length 118 [2021-12-06 20:59:09,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:09,706 INFO L470 AbstractCegarLoop]: Abstraction has 13766 states and 17148 transitions. [2021-12-06 20:59:09,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-06 20:59:09,706 INFO L276 IsEmpty]: Start isEmpty. Operand 13766 states and 17148 transitions. [2021-12-06 20:59:09,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-06 20:59:09,714 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:09,714 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:59:09,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-06 20:59:09,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:59:09,916 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:59:09,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:09,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2070810004, now seen corresponding path program 1 times [2021-12-06 20:59:09,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:59:09,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082078375] [2021-12-06 20:59:09,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:09,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:59:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:09,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:59:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:09,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:59:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:09,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:59:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:09,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:59:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:09,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:59:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:09,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-06 20:59:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:09,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-06 20:59:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:09,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:59:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:09,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-06 20:59:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:09,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:59:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:09,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-06 20:59:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-06 20:59:09,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:59:09,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082078375] [2021-12-06 20:59:09,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082078375] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:59:09,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455226774] [2021-12-06 20:59:09,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:09,999 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:59:09,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:59:09,999 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:59:10,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 20:59:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:10,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 20:59:10,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:59:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-06 20:59:10,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:59:10,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455226774] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:59:10,172 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:59:10,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 20:59:10,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483960619] [2021-12-06 20:59:10,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:59:10,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:59:10,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:59:10,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:59:10,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:59:10,173 INFO L87 Difference]: Start difference. First operand 13766 states and 17148 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) [2021-12-06 20:59:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:10,764 INFO L93 Difference]: Finished difference Result 17400 states and 22224 transitions. [2021-12-06 20:59:10,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:59:10,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 134 [2021-12-06 20:59:10,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:10,791 INFO L225 Difference]: With dead ends: 17400 [2021-12-06 20:59:10,791 INFO L226 Difference]: Without dead ends: 14260 [2021-12-06 20:59:10,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:59:10,801 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 248 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:10,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 295 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:59:10,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14260 states. [2021-12-06 20:59:11,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14260 to 14150. [2021-12-06 20:59:11,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14150 states, 11065 states have (on average 1.215634884771803) internal successors, (13451), 11252 states have internal predecessors, (13451), 1535 states have call successors, (1535), 1261 states have call predecessors, (1535), 1548 states have return successors, (2426), 1649 states have call predecessors, (2426), 1534 states have call successors, (2426) [2021-12-06 20:59:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 17412 transitions. [2021-12-06 20:59:11,619 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 17412 transitions. Word has length 134 [2021-12-06 20:59:11,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:11,619 INFO L470 AbstractCegarLoop]: Abstraction has 14150 states and 17412 transitions. [2021-12-06 20:59:11,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) [2021-12-06 20:59:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 17412 transitions. [2021-12-06 20:59:11,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-06 20:59:11,628 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:11,628 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:59:11,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 20:59:11,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-06 20:59:11,830 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:59:11,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:11,832 INFO L85 PathProgramCache]: Analyzing trace with hash -931525195, now seen corresponding path program 1 times [2021-12-06 20:59:11,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:59:11,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612502665] [2021-12-06 20:59:11,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:11,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:59:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:11,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:59:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:11,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:59:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:11,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:59:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:11,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:59:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:11,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:59:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:11,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-06 20:59:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:11,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-06 20:59:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:11,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:59:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:11,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-06 20:59:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:11,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:59:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:11,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-06 20:59:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-06 20:59:11,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:59:11,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612502665] [2021-12-06 20:59:11,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612502665] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:59:11,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769878380] [2021-12-06 20:59:11,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:11,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:59:11,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:59:11,925 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:59:11,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 20:59:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:11,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 20:59:11,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:59:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-06 20:59:12,075 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:59:12,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769878380] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:59:12,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:59:12,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 20:59:12,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463240646] [2021-12-06 20:59:12,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:59:12,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:59:12,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:59:12,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:59:12,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:59:12,076 INFO L87 Difference]: Start difference. First operand 14150 states and 17412 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 20:59:12,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:12,699 INFO L93 Difference]: Finished difference Result 17757 states and 22151 transitions. [2021-12-06 20:59:12,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:59:12,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 134 [2021-12-06 20:59:12,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:12,722 INFO L225 Difference]: With dead ends: 17757 [2021-12-06 20:59:12,722 INFO L226 Difference]: Without dead ends: 14235 [2021-12-06 20:59:12,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:59:12,727 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 248 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:12,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 407 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:59:12,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14235 states. [2021-12-06 20:59:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14235 to 14120. [2021-12-06 20:59:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14120 states, 11035 states have (on average 1.2080652469415496) internal successors, (13331), 11222 states have internal predecessors, (13331), 1535 states have call successors, (1535), 1261 states have call predecessors, (1535), 1548 states have return successors, (2426), 1649 states have call predecessors, (2426), 1534 states have call successors, (2426) [2021-12-06 20:59:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14120 states to 14120 states and 17292 transitions. [2021-12-06 20:59:13,402 INFO L78 Accepts]: Start accepts. Automaton has 14120 states and 17292 transitions. Word has length 134 [2021-12-06 20:59:13,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:13,402 INFO L470 AbstractCegarLoop]: Abstraction has 14120 states and 17292 transitions. [2021-12-06 20:59:13,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-12-06 20:59:13,403 INFO L276 IsEmpty]: Start isEmpty. Operand 14120 states and 17292 transitions. [2021-12-06 20:59:13,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-06 20:59:13,411 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:13,411 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-06 20:59:13,431 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-06 20:59:13,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:59:13,613 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:59:13,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:13,614 INFO L85 PathProgramCache]: Analyzing trace with hash -564892461, now seen corresponding path program 1 times [2021-12-06 20:59:13,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:59:13,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461144518] [2021-12-06 20:59:13,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:13,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:59:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:13,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:59:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:13,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:59:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:13,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:59:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:13,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:59:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:13,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:59:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:13,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 20:59:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:13,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 20:59:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:13,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:59:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:13,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 20:59:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:13,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:59:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:13,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-06 20:59:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:13,698 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-06 20:59:13,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:59:13,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461144518] [2021-12-06 20:59:13,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461144518] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:59:13,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998984276] [2021-12-06 20:59:13,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:13,698 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:59:13,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:59:13,699 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:59:13,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 20:59:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:13,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 20:59:13,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:59:13,856 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-06 20:59:13,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:59:13,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998984276] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:59:13,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:59:13,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 20:59:13,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979726473] [2021-12-06 20:59:13,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:59:13,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:59:13,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:59:13,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:59:13,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:59:13,857 INFO L87 Difference]: Start difference. First operand 14120 states and 17292 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 20:59:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:14,437 INFO L93 Difference]: Finished difference Result 15596 states and 19282 transitions. [2021-12-06 20:59:14,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:59:14,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 135 [2021-12-06 20:59:14,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:14,464 INFO L225 Difference]: With dead ends: 15596 [2021-12-06 20:59:14,464 INFO L226 Difference]: Without dead ends: 13839 [2021-12-06 20:59:14,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:59:14,470 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 76 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:14,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 626 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:59:14,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13839 states. [2021-12-06 20:59:15,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13839 to 13777. [2021-12-06 20:59:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13777 states, 10760 states have (on average 1.2018587360594795) internal successors, (12932), 10943 states have internal predecessors, (12932), 1499 states have call successors, (1499), 1236 states have call predecessors, (1499), 1516 states have return successors, (2362), 1610 states have call predecessors, (2362), 1498 states have call successors, (2362) [2021-12-06 20:59:15,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13777 states to 13777 states and 16793 transitions. [2021-12-06 20:59:15,177 INFO L78 Accepts]: Start accepts. Automaton has 13777 states and 16793 transitions. Word has length 135 [2021-12-06 20:59:15,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:15,177 INFO L470 AbstractCegarLoop]: Abstraction has 13777 states and 16793 transitions. [2021-12-06 20:59:15,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-06 20:59:15,177 INFO L276 IsEmpty]: Start isEmpty. Operand 13777 states and 16793 transitions. [2021-12-06 20:59:15,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-06 20:59:15,186 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:15,186 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-06 20:59:15,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-06 20:59:15,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:59:15,387 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:59:15,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:15,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1386105035, now seen corresponding path program 1 times [2021-12-06 20:59:15,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:59:15,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161630479] [2021-12-06 20:59:15,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:15,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:59:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:15,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:59:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:15,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:59:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:15,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:59:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:15,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:59:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:15,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:59:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:15,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 20:59:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:15,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 20:59:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:15,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:59:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:15,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 20:59:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:15,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:59:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:15,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 20:59:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:15,460 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-06 20:59:15,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:59:15,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161630479] [2021-12-06 20:59:15,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161630479] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:59:15,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097848221] [2021-12-06 20:59:15,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:15,461 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:59:15,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:59:15,461 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:59:15,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 20:59:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:15,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 20:59:15,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:59:15,623 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-06 20:59:15,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:59:15,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097848221] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:59:15,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:59:15,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-06 20:59:15,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255276334] [2021-12-06 20:59:15,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:59:15,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:59:15,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:59:15,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:59:15,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 20:59:15,625 INFO L87 Difference]: Start difference. First operand 13777 states and 16793 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 20:59:16,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:16,317 INFO L93 Difference]: Finished difference Result 15113 states and 18526 transitions. [2021-12-06 20:59:16,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:59:16,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2021-12-06 20:59:16,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:16,341 INFO L225 Difference]: With dead ends: 15113 [2021-12-06 20:59:16,341 INFO L226 Difference]: Without dead ends: 13155 [2021-12-06 20:59:16,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:59:16,349 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 302 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:16,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 480 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:59:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13155 states. [2021-12-06 20:59:16,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13155 to 13134. [2021-12-06 20:59:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13134 states, 10235 states have (on average 1.1930630190522715) internal successors, (12211), 10401 states have internal predecessors, (12211), 1440 states have call successors, (1440), 1191 states have call predecessors, (1440), 1457 states have return successors, (2244), 1552 states have call predecessors, (2244), 1439 states have call successors, (2244) [2021-12-06 20:59:17,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13134 states to 13134 states and 15895 transitions. [2021-12-06 20:59:17,030 INFO L78 Accepts]: Start accepts. Automaton has 13134 states and 15895 transitions. Word has length 136 [2021-12-06 20:59:17,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:17,030 INFO L470 AbstractCegarLoop]: Abstraction has 13134 states and 15895 transitions. [2021-12-06 20:59:17,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 20:59:17,030 INFO L276 IsEmpty]: Start isEmpty. Operand 13134 states and 15895 transitions. [2021-12-06 20:59:17,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-06 20:59:17,038 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:17,038 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-06 20:59:17,057 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 20:59:17,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-06 20:59:17,240 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:59:17,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:17,241 INFO L85 PathProgramCache]: Analyzing trace with hash 78962637, now seen corresponding path program 1 times [2021-12-06 20:59:17,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:59:17,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616904248] [2021-12-06 20:59:17,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:17,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:59:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:17,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:59:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:17,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:59:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:17,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:59:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:17,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:59:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:17,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:59:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:17,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 20:59:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:17,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 20:59:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:17,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:59:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:17,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 20:59:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:17,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:59:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:17,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 20:59:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-06 20:59:17,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:59:17,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616904248] [2021-12-06 20:59:17,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616904248] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:59:17,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626630784] [2021-12-06 20:59:17,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:17,316 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:59:17,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:59:17,317 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:59:17,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 20:59:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:17,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 20:59:17,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:59:17,469 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-06 20:59:17,469 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:59:17,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626630784] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:59:17,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:59:17,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-06 20:59:17,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518168708] [2021-12-06 20:59:17,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:59:17,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:59:17,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:59:17,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:59:17,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 20:59:17,470 INFO L87 Difference]: Start difference. First operand 13134 states and 15895 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 20:59:18,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:18,181 INFO L93 Difference]: Finished difference Result 14753 states and 17891 transitions. [2021-12-06 20:59:18,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 20:59:18,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2021-12-06 20:59:18,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:18,205 INFO L225 Difference]: With dead ends: 14753 [2021-12-06 20:59:18,206 INFO L226 Difference]: Without dead ends: 12328 [2021-12-06 20:59:18,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-06 20:59:18,211 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 321 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:18,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 488 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:59:18,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12328 states. [2021-12-06 20:59:18,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12328 to 11814. [2021-12-06 20:59:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11814 states, 9169 states have (on average 1.185189224561021) internal successors, (10867), 9319 states have internal predecessors, (10867), 1294 states have call successors, (1294), 1088 states have call predecessors, (1294), 1349 states have return successors, (2052), 1416 states have call predecessors, (2052), 1293 states have call successors, (2052) [2021-12-06 20:59:18,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11814 states to 11814 states and 14213 transitions. [2021-12-06 20:59:18,935 INFO L78 Accepts]: Start accepts. Automaton has 11814 states and 14213 transitions. Word has length 136 [2021-12-06 20:59:18,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:18,935 INFO L470 AbstractCegarLoop]: Abstraction has 11814 states and 14213 transitions. [2021-12-06 20:59:18,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 20:59:18,935 INFO L276 IsEmpty]: Start isEmpty. Operand 11814 states and 14213 transitions. [2021-12-06 20:59:18,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-06 20:59:18,942 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:18,942 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-06 20:59:18,962 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 20:59:19,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-06 20:59:19,145 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:59:19,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:19,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1976459403, now seen corresponding path program 1 times [2021-12-06 20:59:19,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:59:19,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416733893] [2021-12-06 20:59:19,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:19,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:59:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:19,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:59:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:19,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:59:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:19,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:59:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:19,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:59:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:19,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:59:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:19,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 20:59:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:19,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 20:59:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:19,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:59:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:19,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 20:59:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:19,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:59:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:19,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 20:59:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-06 20:59:19,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:59:19,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416733893] [2021-12-06 20:59:19,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416733893] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:59:19,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719954986] [2021-12-06 20:59:19,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:19,240 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:59:19,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:59:19,240 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:59:19,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 20:59:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:19,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 20:59:19,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:59:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-06 20:59:19,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:59:19,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719954986] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:59:19,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:59:19,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-06 20:59:19,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595677390] [2021-12-06 20:59:19,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:59:19,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:59:19,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:59:19,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:59:19,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:59:19,394 INFO L87 Difference]: Start difference. First operand 11814 states and 14213 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 20:59:19,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:19,973 INFO L93 Difference]: Finished difference Result 13036 states and 15700 transitions. [2021-12-06 20:59:19,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-06 20:59:19,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2021-12-06 20:59:19,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:19,991 INFO L225 Difference]: With dead ends: 13036 [2021-12-06 20:59:19,991 INFO L226 Difference]: Without dead ends: 11849 [2021-12-06 20:59:19,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-06 20:59:19,994 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 10 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:19,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1043 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:59:20,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2021-12-06 20:59:20,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 11829. [2021-12-06 20:59:20,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11829 states, 9184 states have (on average 1.1824912891986064) internal successors, (10860), 9334 states have internal predecessors, (10860), 1294 states have call successors, (1294), 1088 states have call predecessors, (1294), 1349 states have return successors, (2052), 1416 states have call predecessors, (2052), 1293 states have call successors, (2052) [2021-12-06 20:59:20,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11829 states to 11829 states and 14206 transitions. [2021-12-06 20:59:20,617 INFO L78 Accepts]: Start accepts. Automaton has 11829 states and 14206 transitions. Word has length 136 [2021-12-06 20:59:20,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:20,617 INFO L470 AbstractCegarLoop]: Abstraction has 11829 states and 14206 transitions. [2021-12-06 20:59:20,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-06 20:59:20,617 INFO L276 IsEmpty]: Start isEmpty. Operand 11829 states and 14206 transitions. [2021-12-06 20:59:20,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-12-06 20:59:20,625 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:20,625 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:59:20,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 20:59:20,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-06 20:59:20,826 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:59:20,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:20,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1219164295, now seen corresponding path program 1 times [2021-12-06 20:59:20,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:59:20,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48980257] [2021-12-06 20:59:20,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:20,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:59:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:20,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:59:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:20,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:59:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:20,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:59:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:20,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:59:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:20,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:59:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:20,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 20:59:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:20,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 20:59:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:20,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:59:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:20,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 20:59:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:20,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:59:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:20,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 20:59:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-06 20:59:20,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:59:20,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48980257] [2021-12-06 20:59:20,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48980257] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:59:20,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:59:20,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:59:20,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076992756] [2021-12-06 20:59:20,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:59:20,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:59:20,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:59:20,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:59:20,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:59:20,919 INFO L87 Difference]: Start difference. First operand 11829 states and 14206 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-06 20:59:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:21,863 INFO L93 Difference]: Finished difference Result 12808 states and 15307 transitions. [2021-12-06 20:59:21,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-06 20:59:21,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 136 [2021-12-06 20:59:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:21,884 INFO L225 Difference]: With dead ends: 12808 [2021-12-06 20:59:21,884 INFO L226 Difference]: Without dead ends: 12806 [2021-12-06 20:59:21,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-12-06 20:59:21,887 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 690 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:21,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [723 Valid, 788 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 20:59:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12806 states. [2021-12-06 20:59:22,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12806 to 12533. [2021-12-06 20:59:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12533 states, 9764 states have (on average 1.1788201556739042) internal successors, (11510), 9920 states have internal predecessors, (11510), 1362 states have call successors, (1362), 1136 states have call predecessors, (1362), 1405 states have return successors, (2131), 1486 states have call predecessors, (2131), 1361 states have call successors, (2131) [2021-12-06 20:59:22,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12533 states to 12533 states and 15003 transitions. [2021-12-06 20:59:22,568 INFO L78 Accepts]: Start accepts. Automaton has 12533 states and 15003 transitions. Word has length 136 [2021-12-06 20:59:22,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:22,569 INFO L470 AbstractCegarLoop]: Abstraction has 12533 states and 15003 transitions. [2021-12-06 20:59:22,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-06 20:59:22,569 INFO L276 IsEmpty]: Start isEmpty. Operand 12533 states and 15003 transitions. [2021-12-06 20:59:22,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-12-06 20:59:22,574 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:22,575 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:59:22,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-06 20:59:22,575 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:59:22,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:22,575 INFO L85 PathProgramCache]: Analyzing trace with hash 114815496, now seen corresponding path program 1 times [2021-12-06 20:59:22,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:59:22,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631465014] [2021-12-06 20:59:22,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:22,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:59:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:22,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:59:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:22,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 20:59:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:22,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 20:59:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:22,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:59:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:22,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:59:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:22,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:59:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:22,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 20:59:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:22,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 20:59:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:22,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 20:59:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:22,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 20:59:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:22,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-06 20:59:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:22,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:59:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:22,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:59:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:22,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-06 20:59:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:22,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-06 20:59:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:22,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-12-06 20:59:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-06 20:59:22,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:59:22,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631465014] [2021-12-06 20:59:22,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631465014] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:59:22,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97283481] [2021-12-06 20:59:22,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:22,647 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:59:22,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:59:22,647 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:59:22,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 20:59:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:22,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 20:59:22,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:59:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-06 20:59:22,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:59:22,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97283481] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:59:22,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:59:22,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2021-12-06 20:59:22,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767163728] [2021-12-06 20:59:22,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:59:22,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:59:22,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:59:22,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:59:22,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-12-06 20:59:22,804 INFO L87 Difference]: Start difference. First operand 12533 states and 15003 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-06 20:59:23,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:23,232 INFO L93 Difference]: Finished difference Result 17681 states and 21223 transitions. [2021-12-06 20:59:23,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 20:59:23,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2021-12-06 20:59:23,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:23,244 INFO L225 Difference]: With dead ends: 17681 [2021-12-06 20:59:23,245 INFO L226 Difference]: Without dead ends: 7099 [2021-12-06 20:59:23,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-12-06 20:59:23,253 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 34 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:23,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 1283 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:59:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7099 states. [2021-12-06 20:59:23,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7099 to 6657. [2021-12-06 20:59:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6657 states, 5329 states have (on average 1.1589416400825672) internal successors, (6176), 5383 states have internal predecessors, (6176), 664 states have call successors, (664), 530 states have call predecessors, (664), 662 states have return successors, (971), 744 states have call predecessors, (971), 663 states have call successors, (971) [2021-12-06 20:59:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 7811 transitions. [2021-12-06 20:59:23,624 INFO L78 Accepts]: Start accepts. Automaton has 6657 states and 7811 transitions. Word has length 145 [2021-12-06 20:59:23,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:23,624 INFO L470 AbstractCegarLoop]: Abstraction has 6657 states and 7811 transitions. [2021-12-06 20:59:23,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-06 20:59:23,625 INFO L276 IsEmpty]: Start isEmpty. Operand 6657 states and 7811 transitions. [2021-12-06 20:59:23,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-06 20:59:23,628 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:23,629 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:59:23,648 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-06 20:59:23,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-06 20:59:23,830 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:59:23,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:23,831 INFO L85 PathProgramCache]: Analyzing trace with hash 62040612, now seen corresponding path program 1 times [2021-12-06 20:59:23,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:59:23,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014961085] [2021-12-06 20:59:23,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:23,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:59:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:23,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:59:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:23,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 20:59:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:23,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 20:59:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:23,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:59:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:23,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:59:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:23,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:59:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:23,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 20:59:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:23,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 20:59:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:23,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-06 20:59:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:23,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-06 20:59:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:23,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 20:59:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:23,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:59:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:23,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:59:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:23,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-06 20:59:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:23,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-06 20:59:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:23,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-06 20:59:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-12-06 20:59:23,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:59:23,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014961085] [2021-12-06 20:59:23,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014961085] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:59:23,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:59:23,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:59:23,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315319761] [2021-12-06 20:59:23,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:59:23,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:59:23,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:59:23,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:59:23,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:59:23,919 INFO L87 Difference]: Start difference. First operand 6657 states and 7811 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-06 20:59:24,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:24,354 INFO L93 Difference]: Finished difference Result 7205 states and 8429 transitions. [2021-12-06 20:59:24,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 20:59:24,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 147 [2021-12-06 20:59:24,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:24,365 INFO L225 Difference]: With dead ends: 7205 [2021-12-06 20:59:24,365 INFO L226 Difference]: Without dead ends: 6456 [2021-12-06 20:59:24,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-06 20:59:24,368 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 388 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:24,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 551 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:59:24,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6456 states. [2021-12-06 20:59:24,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6456 to 6232. [2021-12-06 20:59:24,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6232 states, 5000 states have (on average 1.1592) internal successors, (5796), 5051 states have internal predecessors, (5796), 618 states have call successors, (618), 490 states have call predecessors, (618), 612 states have return successors, (907), 691 states have call predecessors, (907), 617 states have call successors, (907) [2021-12-06 20:59:24,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6232 states to 6232 states and 7321 transitions. [2021-12-06 20:59:24,724 INFO L78 Accepts]: Start accepts. Automaton has 6232 states and 7321 transitions. Word has length 147 [2021-12-06 20:59:24,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:24,724 INFO L470 AbstractCegarLoop]: Abstraction has 6232 states and 7321 transitions. [2021-12-06 20:59:24,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2021-12-06 20:59:24,725 INFO L276 IsEmpty]: Start isEmpty. Operand 6232 states and 7321 transitions. [2021-12-06 20:59:24,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-12-06 20:59:24,729 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:24,729 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:59:24,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-06 20:59:24,729 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:59:24,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:24,729 INFO L85 PathProgramCache]: Analyzing trace with hash -818503781, now seen corresponding path program 1 times [2021-12-06 20:59:24,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:59:24,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913027261] [2021-12-06 20:59:24,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:24,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:59:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:24,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:59:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:24,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-06 20:59:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:24,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:59:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:24,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:59:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:24,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:59:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:24,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:59:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:24,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 20:59:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:24,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-06 20:59:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:24,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-06 20:59:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:24,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-06 20:59:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:24,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 20:59:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:24,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:59:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:24,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:59:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:24,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-12-06 20:59:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:24,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-06 20:59:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:24,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-12-06 20:59:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-12-06 20:59:24,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:59:24,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913027261] [2021-12-06 20:59:24,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913027261] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:59:24,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532098105] [2021-12-06 20:59:24,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:24,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:59:24,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:59:24,797 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:59:24,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 20:59:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:24,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-06 20:59:24,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:59:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-06 20:59:24,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:59:24,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532098105] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:59:24,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:59:24,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-06 20:59:24,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276301246] [2021-12-06 20:59:24,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:59:24,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:59:24,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:59:24,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:59:24,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:59:24,990 INFO L87 Difference]: Start difference. First operand 6232 states and 7321 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-06 20:59:25,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:25,260 INFO L93 Difference]: Finished difference Result 8068 states and 9481 transitions. [2021-12-06 20:59:25,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:59:25,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 158 [2021-12-06 20:59:25,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:25,266 INFO L225 Difference]: With dead ends: 8068 [2021-12-06 20:59:25,266 INFO L226 Difference]: Without dead ends: 4028 [2021-12-06 20:59:25,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:59:25,271 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 171 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:25,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 372 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:59:25,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4028 states. [2021-12-06 20:59:25,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4028 to 4028. [2021-12-06 20:59:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4028 states, 3266 states have (on average 1.144213104715248) internal successors, (3737), 3301 states have internal predecessors, (3737), 389 states have call successors, (389), 302 states have call predecessors, (389), 371 states have return successors, (525), 425 states have call predecessors, (525), 388 states have call successors, (525) [2021-12-06 20:59:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4028 states to 4028 states and 4651 transitions. [2021-12-06 20:59:25,504 INFO L78 Accepts]: Start accepts. Automaton has 4028 states and 4651 transitions. Word has length 158 [2021-12-06 20:59:25,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:25,504 INFO L470 AbstractCegarLoop]: Abstraction has 4028 states and 4651 transitions. [2021-12-06 20:59:25,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-06 20:59:25,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4028 states and 4651 transitions. [2021-12-06 20:59:25,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-12-06 20:59:25,507 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:25,507 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:59:25,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-06 20:59:25,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:59:25,708 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:59:25,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:25,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1011844634, now seen corresponding path program 1 times [2021-12-06 20:59:25,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:59:25,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290867810] [2021-12-06 20:59:25,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:25,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:59:25,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:25,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:59:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:25,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 20:59:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:25,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 20:59:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:25,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:59:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:25,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:59:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:25,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:59:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:25,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 20:59:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:25,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 20:59:25,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:25,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 20:59:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:25,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-06 20:59:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:25,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 20:59:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:25,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:59:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:25,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:59:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:25,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-06 20:59:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:25,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-06 20:59:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:25,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-06 20:59:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:25,776 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-12-06 20:59:25,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:59:25,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290867810] [2021-12-06 20:59:25,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290867810] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:59:25,777 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:59:25,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 20:59:25,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939593903] [2021-12-06 20:59:25,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:59:25,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 20:59:25,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:59:25,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 20:59:25,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 20:59:25,778 INFO L87 Difference]: Start difference. First operand 4028 states and 4651 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-06 20:59:26,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:26,242 INFO L93 Difference]: Finished difference Result 5892 states and 6861 transitions. [2021-12-06 20:59:26,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 20:59:26,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 159 [2021-12-06 20:59:26,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:26,248 INFO L225 Difference]: With dead ends: 5892 [2021-12-06 20:59:26,248 INFO L226 Difference]: Without dead ends: 4131 [2021-12-06 20:59:26,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:59:26,251 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 223 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:26,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 961 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:59:26,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4131 states. [2021-12-06 20:59:26,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4131 to 3587. [2021-12-06 20:59:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3587 states, 2917 states have (on average 1.1450119986287282) internal successors, (3340), 2951 states have internal predecessors, (3340), 345 states have call successors, (345), 266 states have call predecessors, (345), 323 states have return successors, (457), 370 states have call predecessors, (457), 344 states have call successors, (457) [2021-12-06 20:59:26,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 3587 states and 4142 transitions. [2021-12-06 20:59:26,461 INFO L78 Accepts]: Start accepts. Automaton has 3587 states and 4142 transitions. Word has length 159 [2021-12-06 20:59:26,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:26,461 INFO L470 AbstractCegarLoop]: Abstraction has 3587 states and 4142 transitions. [2021-12-06 20:59:26,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2021-12-06 20:59:26,461 INFO L276 IsEmpty]: Start isEmpty. Operand 3587 states and 4142 transitions. [2021-12-06 20:59:26,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-12-06 20:59:26,463 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:26,464 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:59:26,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-06 20:59:26,464 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:59:26,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:26,464 INFO L85 PathProgramCache]: Analyzing trace with hash 978764957, now seen corresponding path program 1 times [2021-12-06 20:59:26,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:59:26,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346622844] [2021-12-06 20:59:26,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:26,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:59:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:26,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:59:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:26,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 20:59:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:26,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 20:59:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:26,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:59:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:26,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:59:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:26,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:59:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:26,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 20:59:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:26,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 20:59:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:26,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 20:59:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:26,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-06 20:59:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:26,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-06 20:59:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:26,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:59:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:26,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:59:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:26,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 20:59:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:26,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-12-06 20:59:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:26,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-12-06 20:59:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-06 20:59:26,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:59:26,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346622844] [2021-12-06 20:59:26,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346622844] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:59:26,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302215980] [2021-12-06 20:59:26,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:26,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:59:26,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:59:26,538 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:59:26,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 20:59:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:26,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-06 20:59:26,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:59:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-06 20:59:26,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:59:26,926 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-12-06 20:59:26,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302215980] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 20:59:26,926 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 20:59:26,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2021-12-06 20:59:26,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810144017] [2021-12-06 20:59:26,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 20:59:26,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 20:59:26,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:59:26,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 20:59:26,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-12-06 20:59:26,928 INFO L87 Difference]: Start difference. First operand 3587 states and 4142 transitions. Second operand has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2021-12-06 20:59:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:27,635 INFO L93 Difference]: Finished difference Result 5622 states and 6620 transitions. [2021-12-06 20:59:27,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 20:59:27,635 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 162 [2021-12-06 20:59:27,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:27,641 INFO L225 Difference]: With dead ends: 5622 [2021-12-06 20:59:27,641 INFO L226 Difference]: Without dead ends: 3874 [2021-12-06 20:59:27,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2021-12-06 20:59:27,643 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 1336 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:27,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1357 Valid, 788 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 20:59:27,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2021-12-06 20:59:27,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3674. [2021-12-06 20:59:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3674 states, 2962 states have (on average 1.1323430114787305) internal successors, (3354), 3001 states have internal predecessors, (3354), 367 states have call successors, (367), 290 states have call predecessors, (367), 343 states have return successors, (508), 383 states have call predecessors, (508), 366 states have call successors, (508) [2021-12-06 20:59:27,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3674 states to 3674 states and 4229 transitions. [2021-12-06 20:59:27,860 INFO L78 Accepts]: Start accepts. Automaton has 3674 states and 4229 transitions. Word has length 162 [2021-12-06 20:59:27,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:27,860 INFO L470 AbstractCegarLoop]: Abstraction has 3674 states and 4229 transitions. [2021-12-06 20:59:27,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2021-12-06 20:59:27,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3674 states and 4229 transitions. [2021-12-06 20:59:27,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-12-06 20:59:27,863 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:27,863 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-06 20:59:27,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-06 20:59:28,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:59:28,065 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:59:28,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:28,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1575925759, now seen corresponding path program 2 times [2021-12-06 20:59:28,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:59:28,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787649402] [2021-12-06 20:59:28,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:28,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:59:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:59:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-06 20:59:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 20:59:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 20:59:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:59:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-06 20:59:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 20:59:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:59:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 20:59:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:59:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-06 20:59:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-06 20:59:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 20:59:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-06 20:59:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-12-06 20:59:28,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:59:28,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787649402] [2021-12-06 20:59:28,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787649402] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:59:28,148 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:59:28,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 20:59:28,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130087457] [2021-12-06 20:59:28,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:59:28,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 20:59:28,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:59:28,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 20:59:28,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-06 20:59:28,149 INFO L87 Difference]: Start difference. First operand 3674 states and 4229 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-06 20:59:28,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:28,663 INFO L93 Difference]: Finished difference Result 5637 states and 6478 transitions. [2021-12-06 20:59:28,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 20:59:28,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 175 [2021-12-06 20:59:28,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:28,666 INFO L225 Difference]: With dead ends: 5637 [2021-12-06 20:59:28,666 INFO L226 Difference]: Without dead ends: 1760 [2021-12-06 20:59:28,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-12-06 20:59:28,671 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 796 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:28,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [821 Valid, 714 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:59:28,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2021-12-06 20:59:28,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1760. [2021-12-06 20:59:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1387 states have (on average 1.1391492429704397) internal successors, (1580), 1408 states have internal predecessors, (1580), 180 states have call successors, (180), 156 states have call predecessors, (180), 192 states have return successors, (286), 195 states have call predecessors, (286), 179 states have call successors, (286) [2021-12-06 20:59:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2046 transitions. [2021-12-06 20:59:28,779 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2046 transitions. Word has length 175 [2021-12-06 20:59:28,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:28,779 INFO L470 AbstractCegarLoop]: Abstraction has 1760 states and 2046 transitions. [2021-12-06 20:59:28,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-06 20:59:28,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2046 transitions. [2021-12-06 20:59:28,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-12-06 20:59:28,781 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:28,781 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:59:28,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-06 20:59:28,781 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:59:28,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:28,781 INFO L85 PathProgramCache]: Analyzing trace with hash -61354190, now seen corresponding path program 1 times [2021-12-06 20:59:28,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:59:28,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702482206] [2021-12-06 20:59:28,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:28,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:59:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:59:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-12-06 20:59:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-06 20:59:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:59:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:59:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-06 20:59:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 20:59:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 20:59:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-06 20:59:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-06 20:59:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-06 20:59:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-06 20:59:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:59:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:59:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-12-06 20:59:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-06 20:59:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-12-06 20:59:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-12-06 20:59:28,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:59:28,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702482206] [2021-12-06 20:59:28,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702482206] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:59:28,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64463104] [2021-12-06 20:59:28,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:28,831 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:59:28,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:59:28,831 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:59:28,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 20:59:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:28,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 20:59:28,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:59:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-12-06 20:59:29,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 20:59:29,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64463104] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:59:29,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 20:59:29,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-06 20:59:29,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909334435] [2021-12-06 20:59:29,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:59:29,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 20:59:29,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:59:29,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 20:59:29,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-06 20:59:29,014 INFO L87 Difference]: Start difference. First operand 1760 states and 2046 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-06 20:59:29,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:29,183 INFO L93 Difference]: Finished difference Result 3405 states and 3969 transitions. [2021-12-06 20:59:29,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 20:59:29,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 179 [2021-12-06 20:59:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:29,186 INFO L225 Difference]: With dead ends: 3405 [2021-12-06 20:59:29,186 INFO L226 Difference]: Without dead ends: 1477 [2021-12-06 20:59:29,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-12-06 20:59:29,188 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 151 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:29,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 276 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:59:29,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2021-12-06 20:59:29,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1440. [2021-12-06 20:59:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1143 states have (on average 1.1286089238845145) internal successors, (1290), 1155 states have internal predecessors, (1290), 145 states have call successors, (145), 124 states have call predecessors, (145), 151 states have return successors, (214), 160 states have call predecessors, (214), 144 states have call successors, (214) [2021-12-06 20:59:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 1649 transitions. [2021-12-06 20:59:29,278 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 1649 transitions. Word has length 179 [2021-12-06 20:59:29,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:29,279 INFO L470 AbstractCegarLoop]: Abstraction has 1440 states and 1649 transitions. [2021-12-06 20:59:29,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-06 20:59:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1649 transitions. [2021-12-06 20:59:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-12-06 20:59:29,280 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:59:29,280 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:59:29,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-06 20:59:29,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:59:29,482 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:59:29,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:59:29,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1658574142, now seen corresponding path program 1 times [2021-12-06 20:59:29,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:59:29,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219479697] [2021-12-06 20:59:29,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:29,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:59:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 20:59:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 20:59:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 20:59:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:59:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:59:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 20:59:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 20:59:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-06 20:59:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-06 20:59:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-06 20:59:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-06 20:59:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:59:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:59:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-06 20:59:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-06 20:59:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-06 20:59:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-06 20:59:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-06 20:59:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2021-12-06 20:59:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-12-06 20:59:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 20:59:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 20:59:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2021-12-06 20:59:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2021-12-06 20:59:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2021-12-06 20:59:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2021-12-06 20:59:29,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:59:29,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219479697] [2021-12-06 20:59:29,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219479697] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:59:29,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236189420] [2021-12-06 20:59:29,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:59:29,584 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:59:29,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:59:29,584 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:59:29,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 20:59:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:59:29,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-06 20:59:29,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:59:29,841 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 256 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-12-06 20:59:29,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:59:30,073 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-12-06 20:59:30,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236189420] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 20:59:30,073 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 20:59:30,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2021-12-06 20:59:30,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505889564] [2021-12-06 20:59:30,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 20:59:30,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-06 20:59:30,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:59:30,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-06 20:59:30,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-06 20:59:30,075 INFO L87 Difference]: Start difference. First operand 1440 states and 1649 transitions. Second operand has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2021-12-06 20:59:30,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:59:30,364 INFO L93 Difference]: Finished difference Result 1743 states and 1984 transitions. [2021-12-06 20:59:30,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 20:59:30,365 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) Word has length 253 [2021-12-06 20:59:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:59:30,365 INFO L225 Difference]: With dead ends: 1743 [2021-12-06 20:59:30,365 INFO L226 Difference]: Without dead ends: 0 [2021-12-06 20:59:30,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 551 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2021-12-06 20:59:30,367 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 372 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 20:59:30,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 450 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 20:59:30,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-06 20:59:30,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-06 20:59:30,367 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) [2021-12-06 20:59:30,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-06 20:59:30,368 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 253 [2021-12-06 20:59:30,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:59:30,368 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-06 20:59:30,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2021-12-06 20:59:30,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-06 20:59:30,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-06 20:59:30,370 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-06 20:59:30,370 INFO L764 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-06 20:59:30,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-06 20:59:30,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-12-06 20:59:30,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-06 21:00:32,779 INFO L858 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 812 822) no Hoare annotation was computed. [2021-12-06 21:00:32,779 INFO L854 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 812 822) the Hoare annotation is: (let ((.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse4 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse5 (not (= ~t1_pc~0 1))) (.cse6 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse14 (not (<= 2 ~E_M~0))) (.cse12 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse15 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (< ~local~0 ~token~0)) .cse12 .cse13 (not (<= 2 ~E_1~0)) (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse3 .cse4 .cse6 (not (<= ~t1_pc~0 0)) .cse7 .cse9 .cse10 .cse11 .cse14 .cse12 .cse13 .cse15) (or .cse1 (and (not (< 0 ~m_pc~0)) (not (<= 1 ~t1_pc~0))) .cse2 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 (and (or (not (< 1 ~m_pc~0)) (not (<= ~t1_pc~0 1))) (not (<= ~m_pc~0 0))) .cse12 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0))) .cse13) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse12 .cse13 .cse15))) [2021-12-06 21:00:32,779 INFO L858 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 812 822) no Hoare annotation was computed. [2021-12-06 21:00:32,779 INFO L858 garLoopResultBuilder]: For program point update_channels1EXIT(lines 226 240) no Hoare annotation was computed. [2021-12-06 21:00:32,780 INFO L854 garLoopResultBuilder]: At program point update_channels1ENTRY(lines 226 240) the Hoare annotation is: (let ((.cse32 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse33 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse34 (= ~q_req_up~0 |old(~q_req_up~0)|))) (let ((.cse0 (not (<= ~c_dr_pc~0 0))) (.cse4 (and .cse32 .cse33 .cse34 (= ~q_read_ev~0 2))) (.cse29 (not (= |old(~q_req_up~0)| 1))) (.cse23 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse24 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse26 (not (<= 2 |old(~q_write_ev~0)|))) (.cse28 (not (<= 1 ~c_dr_pc~0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse27 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse16 (not (= ~q_free~0 1))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse20 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (not (= ~M_E~0 2))) (.cse21 (and .cse32 .cse33 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse34)) (.cse30 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (<= ~t1_pc~0 0))) (.cse31 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse22 (not (= ~q_free~0 0))) (.cse25 (not (<= ~c_dr_pc~0 1))) (.cse10 (not (<= |old(~q_req_up~0)| 0))) (.cse2 (= ~p_dw_st~0 0)) (.cse11 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse12 (not (= ~T1_E~0 ~M_E~0))) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= |old(~q_read_ev~0)| 2))) (.cse15 (not (= ~p_dw_i~0 1))) (.cse18 (not (<= 2 ~E_1~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 (not .cse2) .cse3 .cse4 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse0 .cse1 .cse3 .cse21 .cse5 .cse6 .cse8 .cse22 .cse2 .cse12 .cse13 .cse15 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse21 .cse5 .cse23 .cse6 .cse8 .cse24 .cse25 .cse2 .cse12 .cse13 .cse26 .cse27 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse22 .cse25 .cse10 .cse2 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse29 .cse21 .cse30 .cse5 .cse6 .cse31 .cse8 .cse22 .cse25 .cse2 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse21 .cse5 .cse23 .cse6 .cse8 .cse24 .cse25 .cse10 .cse2 .cse12 .cse13 .cse26 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse1 .cse3 (not (<= 1 |old(~q_read_ev~0)|)) .cse29 .cse21 .cse5 .cse23 .cse6 .cse8 .cse24 .cse25 .cse2 .cse12 .cse13 .cse26 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse21 .cse5 .cse7 .cse8 .cse9 .cse2 .cse11 .cse12 .cse27 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse16 .cse17) (or .cse20 .cse1 .cse3 .cse21 .cse30 .cse5 .cse6 .cse31 .cse8 .cse22 .cse25 .cse10 .cse2 .cse11 .cse12 .cse13 .cse14 .cse15 (= |old(~q_write_ev~0)| 0) .cse18 .cse19)))) [2021-12-06 21:00:32,780 INFO L854 garLoopResultBuilder]: At program point L56(lines 39 58) the Hoare annotation is: (let ((.cse26 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse27 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse20 (not (= ~q_free~0 0))) (.cse28 (not (<= ~c_dr_pc~0 0))) (.cse23 (not (= |old(~q_read_ev~0)| 2))) (.cse25 (not (= |old(~q_req_up~0)| 1))) (.cse24 (<= ~q_req_up~0 0)) (.cse9 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse4 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse8 (not (<= ~c_dr_pc~0 1))) (.cse21 (not (<= |old(~q_req_up~0)| 0))) (.cse10 (= ~p_dw_st~0 0)) (.cse22 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~T1_E~0 ~M_E~0))) (.cse12 (not (= ~m_st~0 0))) (.cse13 (not (<= 2 |old(~q_write_ev~0)|))) (.cse14 (not (<= 1 ~c_dr_pc~0))) (.cse15 (not (= ~p_dw_i~0 1))) (.cse16 (not (= ~q_free~0 1))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse18 (not (<= 2 ~E_1~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse20 .cse8 .cse21 .cse10 .cse22 .cse11 .cse12 .cse13 .cse23 .cse14 .cse15 .cse18 .cse19) (or .cse0 (and .cse24 (= ~q_read_ev~0 2)) .cse1 .cse2 .cse25 .cse26 .cse3 .cse5 .cse27 .cse6 .cse20 .cse8 .cse10 .cse22 .cse11 .cse12 .cse13 .cse23 .cse14 .cse15 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse26 .cse3 .cse5 .cse27 .cse6 .cse20 .cse8 .cse21 .cse10 .cse22 .cse11 .cse12 .cse23 .cse14 .cse15 (= |old(~q_write_ev~0)| 0) .cse18 .cse19) (or .cse0 .cse28 .cse1 .cse2 .cse3 .cse5 .cse6 .cse20 .cse10 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse11 .cse12 .cse15 .cse18 .cse19) (or .cse28 .cse1 (not .cse10) .cse2 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse3 .cse5 (not (= ~p_num_write~0 0)) .cse6 (not (= ~c_num_read~0 0)) .cse21 .cse22 .cse11 .cse12 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 (not (<= 1 |old(~q_read_ev~0)|)) .cse25 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 (and .cse24 .cse9) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse10 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2021-12-06 21:00:32,780 INFO L858 garLoopResultBuilder]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2021-12-06 21:00:32,780 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2021-12-06 21:00:32,780 INFO L858 garLoopResultBuilder]: For program point L43-2(lines 42 57) no Hoare annotation was computed. [2021-12-06 21:00:32,780 INFO L858 garLoopResultBuilder]: For program point L230-1(lines 226 240) no Hoare annotation was computed. [2021-12-06 21:00:32,780 INFO L858 garLoopResultBuilder]: For program point L803-2(lines 787 811) no Hoare annotation was computed. [2021-12-06 21:00:32,781 INFO L854 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 787 811) the Hoare annotation is: (let ((.cse12 (not (< ~local~0 ~token~0))) (.cse16 (not (<= ~token~0 (+ ~local~0 1)))) (.cse17 (not (<= ~t1_pc~0 0))) (.cse15 (not (<= 2 ~E_1~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse5 (not (= ~t1_pc~0 1))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse18 (not (<= 2 ~E_M~0))) (.cse19 (not (= ~token~0 ~local~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse4 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse6 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse13 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse3 .cse4 .cse6 .cse17 .cse7 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse19) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse12 .cse13 (not (= |old(~m_st~0)| 0)) .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse17 .cse7 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse19) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse19) (or .cse1 .cse2 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0))) (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse14))) [2021-12-06 21:00:32,781 INFO L858 garLoopResultBuilder]: For program point L795(lines 795 799) no Hoare annotation was computed. [2021-12-06 21:00:32,781 INFO L858 garLoopResultBuilder]: For program point L601(lines 601 606) no Hoare annotation was computed. [2021-12-06 21:00:32,781 INFO L858 garLoopResultBuilder]: For program point L795-2(lines 795 799) no Hoare annotation was computed. [2021-12-06 21:00:32,781 INFO L854 garLoopResultBuilder]: At program point L630(lines 618 632) the Hoare annotation is: (let ((.cse20 (<= ~p_dw_pc~0 0)) (.cse21 (< 1 ~p_dw_pc~0))) (let ((.cse36 (= ~c_num_read~0 0)) (.cse37 (= ~p_last_write~0 ~q_buf_0~0)) (.cse40 (= ~p_dw_st~0 0)) (.cse29 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse30 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse38 (= ~p_num_write~0 0)) (.cse42 (< 1 ~m_pc~0)) (.cse41 (<= ~m_pc~0 0)) (.cse31 (= |old(~t1_st~0)| ~t1_st~0)) (.cse39 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse32 (= ~m_st~0 |old(~m_st~0)|)) (.cse35 (= ~q_free~0 0)) (.cse43 (<= 2 ~m_st~0)) (.cse34 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse44 (or .cse20 .cse21)) (.cse33 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse3 (not (= ~M_E~0 2))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse19 (and .cse38 (or .cse42 .cse41) .cse31 .cse39 .cse32 .cse35 .cse43 .cse34 .cse44 .cse33)) (.cse23 (not (<= ~t1_pc~0 0))) (.cse14 (and .cse29 .cse30)) (.cse22 (and (not .cse42) (not .cse41))) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse27 (and .cse38 .cse36 .cse37 (or .cse41 (and (<= ~t1_pc~0 1) .cse42)) .cse39 .cse32 .cse35 .cse43 .cse34 .cse44 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse40 .cse33)) (.cse13 (not (< ~local~0 ~token~0))) (.cse25 (and .cse31 .cse32 .cse29 .cse30)) (.cse28 (not (= |old(~m_st~0)| 0))) (.cse17 (not (<= 2 ~E_1~0))) (.cse18 (not (<= ~token~0 (+ ~local~0 1)))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not .cse40)) (.cse5 (not (<= 2 ~T1_E~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not .cse39)) (.cse8 (not .cse38)) (.cse9 (= |old(~t1_st~0)| 0)) (.cse10 (not .cse37)) (.cse11 (not .cse36)) (.cse12 (not .cse35)) (.cse24 (not (<= 2 ~E_M~0))) (.cse15 (not .cse34)) (.cse16 (not .cse33)) (.cse26 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse2 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 (and (not .cse20) (not .cse21)) .cse22 .cse16) (or .cse1 (not (= ~m_pc~0 ~t1_pc~0)) .cse2 .cse5 .cse7 .cse23 .cse8 .cse10 .cse11 .cse12 .cse24 .cse15 .cse25 .cse16 .cse26) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24 .cse15 .cse25 .cse16 .cse17) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse23 .cse8 .cse10 .cse11 .cse12 .cse24 .cse14 (and .cse0 (= ~E_M~0 ~M_E~0)) .cse15 .cse16 .cse17 .cse26) (or .cse19 .cse1 .cse2 .cse4 .cse5 .cse7 .cse23 .cse8 .cse10 .cse11 .cse12 .cse24 .cse15 .cse25 .cse16 .cse17 .cse26) (or .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24 .cse14 .cse15 .cse28 .cse22 .cse16 .cse17 .cse26) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse10 .cse11 .cse12 .cse24 .cse15 .cse25 .cse16 .cse17 .cse26) (or .cse1 .cse2 (and (= ~m_st~0 0) .cse29 .cse30 (not (= ~t1_st~0 0))) .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse25 .cse16 .cse17 .cse18) (or .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24 .cse13 .cse15 .cse25 .cse28 .cse16 .cse17 .cse18) (or .cse1 .cse2 .cse5 (and .cse31 .cse32) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse24 .cse15 .cse16 .cse26))))) [2021-12-06 21:00:32,781 INFO L858 garLoopResultBuilder]: For program point L620(lines 620 625) no Hoare annotation was computed. [2021-12-06 21:00:32,781 INFO L854 garLoopResultBuilder]: At program point L612(lines 596 614) the Hoare annotation is: (let ((.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse13 (not (< ~local~0 ~token~0))) (.cse17 (not (<= ~token~0 (+ ~local~0 1)))) (.cse19 (not (<= ~t1_pc~0 0))) (.cse21 (not (= ~token~0 ~local~0))) (.cse18 (and (<= |activate_threads2_is_master_triggered_#res#1| 0) .cse4 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse5 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse8 (not (= ~p_num_write~0 0))) (.cse9 (= |old(~t1_st~0)| 0)) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= ~c_num_read~0 0))) (.cse12 (not (= ~q_free~0 0))) (.cse20 (not (<= 2 ~E_M~0))) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse2 .cse3 .cse7 .cse19 .cse8 .cse10 .cse11 .cse12 .cse20 .cse14 .cse15 .cse16 .cse21) (or .cse18 .cse0 .cse1 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse20 .cse13 .cse14 (not (= |old(~m_st~0)| 0)) .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse20 .cse14 .cse15 .cse16 .cse21) (or .cse18 .cse0 .cse1 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse20 .cse14 .cse15 .cse21) (or .cse18 .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse3 .cse7 .cse19 .cse8 .cse10 .cse11 .cse12 .cse20 .cse14 .cse15 .cse21) (or .cse18 .cse1 .cse2 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0))) (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse15) (or .cse18 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse20 .cse14 .cse15 .cse16)))) [2021-12-06 21:00:32,781 INFO L858 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 787 811) no Hoare annotation was computed. [2021-12-06 21:00:32,782 INFO L858 garLoopResultBuilder]: For program point L600(lines 600 609) no Hoare annotation was computed. [2021-12-06 21:00:32,782 INFO L854 garLoopResultBuilder]: At program point L631(lines 615 633) the Hoare annotation is: (let ((.cse9 (<= ~p_dw_pc~0 0)) (.cse10 (< 1 ~p_dw_pc~0))) (let ((.cse38 (= ~c_num_read~0 0)) (.cse39 (= ~p_last_write~0 ~q_buf_0~0)) (.cse42 (= ~p_dw_st~0 0)) (.cse31 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse32 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse33 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse34 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse40 (= ~p_num_write~0 0)) (.cse29 (= |old(~t1_st~0)| ~t1_st~0)) (.cse41 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse30 (= ~m_st~0 |old(~m_st~0)|)) (.cse37 (= ~q_free~0 0)) (.cse45 (<= 2 ~m_st~0)) (.cse36 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse46 (or .cse9 .cse10)) (.cse35 (= ~c_last_read~0 ~p_last_write~0)) (.cse44 (< 1 ~m_pc~0)) (.cse43 (<= ~m_pc~0 0))) (let ((.cse11 (and (not .cse44) (not .cse43))) (.cse0 (and .cse40 (or .cse44 .cse43) .cse29 .cse41 .cse30 .cse37 .cse45 .cse36 .cse46 .cse35)) (.cse26 (not (= ~M_E~0 2))) (.cse25 (= ~T1_E~0 ~M_E~0)) (.cse23 (and .cse31 .cse32 .cse33 .cse34)) (.cse22 (not (= |old(~m_st~0)| 0))) (.cse14 (and .cse40 .cse38 .cse39 (or .cse43 (and (<= ~t1_pc~0 1) .cse44)) .cse29 .cse41 .cse30 .cse37 .cse45 .cse36 .cse46 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse42 .cse35)) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not (= ~t1_pc~0 1))) (.cse21 (= |old(~t1_st~0)| 0)) (.cse27 (not (< ~local~0 ~token~0))) (.cse19 (not (<= 2 ~E_1~0))) (.cse28 (not (<= ~token~0 (+ ~local~0 1)))) (.cse13 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse42)) (.cse15 (not (<= 2 ~T1_E~0))) (.cse3 (not .cse41)) (.cse24 (not (<= ~t1_pc~0 0))) (.cse4 (not .cse40)) (.cse5 (not .cse39)) (.cse6 (not .cse38)) (.cse7 (not .cse37)) (.cse17 (not (<= 2 ~E_M~0))) (.cse8 (not .cse36)) (.cse18 (and .cse29 .cse30 .cse31 .cse32 .cse33 .cse34)) (.cse12 (not .cse35)) (.cse20 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and (not .cse9) (not .cse10)) .cse11 .cse12) (or .cse13 .cse1 .cse14 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse18 .cse12 .cse19 .cse20) (or .cse13 .cse1 .cse15 .cse16 .cse3 .cse4 .cse21 .cse5 .cse6 .cse7 .cse17 .cse8 .cse22 .cse11 .cse12 .cse19 .cse23 .cse20) (or .cse0 .cse13 .cse1 .cse2 .cse15 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse18 .cse12 .cse19 .cse20) (or .cse13 .cse1 .cse14 .cse2 .cse15 .cse16 .cse3 .cse4 .cse21 .cse5 .cse6 .cse7 .cse17 .cse8 .cse18 .cse12 .cse19) (or .cse25 .cse13 .cse1 .cse26 .cse2 .cse15 .cse16 .cse3 .cse4 .cse21 .cse5 .cse6 .cse7 .cse27 .cse8 .cse12 .cse19 .cse28 .cse23) (or .cse13 .cse1 .cse26 .cse2 .cse15 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse17 (and .cse25 (= ~E_M~0 ~M_E~0)) .cse8 .cse12 .cse19 .cse23 .cse20) (or .cse13 .cse1 .cse15 .cse16 .cse3 .cse4 .cse21 .cse5 .cse6 .cse7 .cse17 .cse27 .cse8 .cse22 .cse18 .cse12 .cse19 .cse28) (or .cse13 .cse1 .cse15 (and .cse29 .cse30) .cse16 .cse3 .cse4 .cse21 .cse5 .cse6 .cse7 .cse17 .cse8 .cse12 .cse20) (or .cse13 .cse1 .cse14 .cse2 .cse15 .cse16 .cse3 .cse4 .cse21 .cse5 .cse6 .cse7 .cse27 (and (= ~m_st~0 0) .cse31 .cse32 .cse33 (not (= ~t1_st~0 0)) .cse34) .cse8 .cse18 .cse12 .cse19 .cse28) (or .cse13 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse15 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse18 .cse12 .cse20))))) [2021-12-06 21:00:32,782 INFO L858 garLoopResultBuilder]: For program point L600-2(lines 600 609) no Hoare annotation was computed. [2021-12-06 21:00:32,782 INFO L858 garLoopResultBuilder]: For program point L619(lines 619 628) no Hoare annotation was computed. [2021-12-06 21:00:32,782 INFO L858 garLoopResultBuilder]: For program point L619-2(lines 619 628) no Hoare annotation was computed. [2021-12-06 21:00:32,782 INFO L854 garLoopResultBuilder]: At program point L611(lines 599 613) the Hoare annotation is: (let ((.cse16 (= |old(~t1_st~0)| ~t1_st~0)) (.cse17 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse20 (not (<= ~t1_pc~0 0))) (.cse18 (not (< ~local~0 ~token~0))) (.cse15 (not (<= 2 ~E_1~0))) (.cse19 (not (<= ~token~0 (+ ~local~0 1)))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (not (= ~t1_pc~0 1))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse12 (not (<= 2 ~E_M~0))) (.cse21 (not (= ~token~0 ~local~0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (and .cse16 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse17 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse6 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse13 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse3 .cse4 (and .cse16 .cse17) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse14 .cse15 .cse19) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse4 .cse6 .cse20 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse20 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13 (not (= |old(~m_st~0)| 0)) .cse14 .cse15 .cse19) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21) (or .cse1 .cse2 .cse3 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0))) (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse14)))) [2021-12-06 21:00:32,782 INFO L858 garLoopResultBuilder]: For program point L803(lines 803 807) no Hoare annotation was computed. [2021-12-06 21:00:32,783 INFO L854 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (let ((.cse3 (= |old(~p_dw_st~0)| 0)) (.cse30 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse0 (not (<= ~c_dr_pc~0 0))) (.cse18 (and .cse30 (= ~p_dw_st~0 0))) (.cse20 (not .cse3)) (.cse15 (not (= ~p_num_write~0 0))) (.cse16 (not (= ~c_num_read~0 0))) (.cse8 (not (= ~q_free~0 0))) (.cse17 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse22 (not (= ~q_read_ev~0 2))) (.cse21 (not (<= ~q_req_up~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~M_E~0 2))) (.cse4 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse30)) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse27 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse6 (not (<= ~t1_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse28 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse25 (not (<= ~c_dr_pc~0 1))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse24 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse26 (not (<= 2 ~q_write_ev~0))) (.cse29 (not (<= 1 ~c_dr_pc~0))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse19 (not (= ~q_free~0 1))) (.cse12 (= |old(~c_dr_st~0)| 0)) (.cse23 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not (<= 2 ~E_1~0))) (.cse14 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse5 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse6 .cse15 .cse7 .cse16 .cse17 .cse9 .cse10 .cse18 .cse11 .cse19 .cse20 .cse21 .cse22 .cse23 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse15 .cse7 .cse16 .cse17 .cse9 .cse10 .cse18 .cse11 .cse19 .cse12 .cse20 .cse23 .cse13 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse7 .cse16 .cse17 .cse9 .cse24 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse19 .cse12 .cse23) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse17 .cse9 .cse10 .cse26 .cse11 .cse12 .cse21 .cse22 .cse13 .cse14) (or .cse1 .cse2 .cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse4 .cse5 .cse6 (not (< ~c_num_read~0 ~p_num_write~0)) .cse7 .cse8 .cse25 .cse17 .cse9 .cse10 (= ~q_write_ev~0 0) .cse11 .cse12 .cse21 .cse22 .cse13 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse28 .cse25 .cse9 .cse10 .cse26 .cse29 .cse11 .cse19 .cse12 .cse21 .cse23 .cse13 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse28 .cse25 .cse9 .cse10 .cse24 .cse26 .cse29 .cse11 .cse19 .cse12 .cse23 .cse13 .cse14)))) [2021-12-06 21:00:32,783 INFO L854 garLoopResultBuilder]: At program point L323-2(lines 323 327) the Hoare annotation is: (let ((.cse39 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse38 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse19 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse20 (<= activate_threads1_~tmp~1 0)) (.cse22 (< 0 (+ activate_threads1_~tmp~1 1))) (.cse21 (= ~p_dw_st~0 0)) (.cse24 (= |old(~p_dw_st~0)| 0))) (let ((.cse14 (not .cse24)) (.cse33 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0)))) (.cse35 (not .cse21)) (.cse37 (not (= ~c_dr_st~0 0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse6 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse31 (and .cse20 .cse22)) (.cse40 (and .cse38 .cse19 .cse20 .cse22)) (.cse34 (not (= ~q_free~0 0))) (.cse9 (not .cse39)) (.cse15 (not (<= ~q_req_up~0 0))) (.cse16 (not (= ~q_read_ev~0 2))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~M_E~0 2))) (.cse36 (and .cse38 .cse19)) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse25 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse26 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse27 (not (<= ~c_dr_pc~0 1))) (.cse10 (not (= ~T1_E~0 ~M_E~0))) (.cse11 (not (= ~m_st~0 0))) (.cse28 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse29 (not (<= 2 ~q_write_ev~0))) (.cse30 (not (<= 1 ~c_dr_pc~0))) (.cse12 (not (= ~p_dw_i~0 1))) (.cse13 (not (= ~q_free~0 1))) (.cse32 (= |old(~c_dr_st~0)| 0)) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse18 (not (<= 2 ~E_1~0))) (.cse23 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (and .cse19 .cse20 .cse21 .cse22) .cse23) (or .cse1 .cse2 .cse24 .cse3 .cse25 .cse5 .cse7 .cse26 .cse27 .cse10 .cse11 .cse28 .cse29 .cse30 .cse31 .cse12 .cse13 .cse32 .cse16 .cse17 .cse18 .cse23) (or .cse1 .cse2 .cse24 .cse3 .cse25 .cse5 .cse7 .cse26 .cse27 .cse10 .cse11 .cse29 .cse30 .cse31 .cse12 .cse13 .cse32 .cse15 .cse16 .cse17 .cse18 .cse23) (or .cse1 .cse2 .cse24 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse28 .cse33 .cse31 .cse13 .cse32 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse24 .cse3 .cse5 .cse7 .cse34 .cse10 .cse11 (and .cse35 .cse20 .cse22) .cse12 .cse32 .cse16 .cse18 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse19 .cse21) .cse12 .cse13 .cse32 .cse14 .cse17 .cse18 .cse23) (or .cse1 .cse2 .cse24 .cse36 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse28 .cse33 .cse13 .cse32 .cse17) (or .cse1 (and (= ~q_read_ev~0 1) .cse37 .cse21) .cse2 .cse24 .cse3 .cse25 .cse5 .cse7 .cse26 .cse27 .cse10 .cse11 .cse29 .cse30 .cse12 .cse13 .cse32 (and .cse38 .cse19 .cse39) .cse15 .cse17 .cse18 .cse23) (or .cse0 .cse1 .cse35 .cse2 .cse24 .cse3 .cse5 .cse7 .cse34 .cse10 .cse11 .cse28 .cse12 .cse32 .cse18 .cse23) (or .cse0 .cse1 .cse2 (and .cse37 .cse21) .cse24 .cse36 .cse3 .cse5 .cse7 .cse34 .cse10 .cse11 .cse12 .cse32 .cse18 .cse23) (or .cse1 .cse2 .cse24 .cse40 .cse3 .cse5 .cse7 .cse34 .cse27 .cse9 .cse10 .cse11 .cse29 .cse12 .cse32 .cse15 .cse16 .cse18 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse31 .cse12 .cse13 .cse32 .cse16 .cse17 .cse18 .cse23) (or .cse1 .cse2 .cse24 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse40 .cse3 .cse5 (not (< ~c_num_read~0 ~p_num_write~0)) .cse7 .cse34 .cse27 .cse9 .cse10 .cse11 (= ~q_write_ev~0 0) .cse12 .cse32 .cse15 .cse16 .cse18 .cse23) (or .cse1 .cse2 .cse24 .cse36 .cse3 .cse25 .cse5 .cse7 .cse26 .cse27 .cse10 .cse11 .cse28 .cse29 .cse30 .cse12 .cse13 .cse32 .cse17 .cse18 .cse23)))) [2021-12-06 21:00:32,783 INFO L858 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2021-12-06 21:00:32,783 INFO L854 garLoopResultBuilder]: At program point activate_threads1ENTRY(lines 315 339) the Hoare annotation is: (let ((.cse3 (= |old(~p_dw_st~0)| 0)) (.cse30 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse0 (not (<= ~c_dr_pc~0 0))) (.cse18 (and .cse30 (= ~p_dw_st~0 0))) (.cse20 (not .cse3)) (.cse15 (not (= ~p_num_write~0 0))) (.cse16 (not (= ~c_num_read~0 0))) (.cse8 (not (= ~q_free~0 0))) (.cse17 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse22 (not (= ~q_read_ev~0 2))) (.cse21 (not (<= ~q_req_up~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~M_E~0 2))) (.cse4 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse30)) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse27 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse6 (not (<= ~t1_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse28 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse25 (not (<= ~c_dr_pc~0 1))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse24 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse26 (not (<= 2 ~q_write_ev~0))) (.cse29 (not (<= 1 ~c_dr_pc~0))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse19 (not (= ~q_free~0 1))) (.cse12 (= |old(~c_dr_st~0)| 0)) (.cse23 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not (<= 2 ~E_1~0))) (.cse14 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse5 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse6 .cse15 .cse7 .cse16 .cse17 .cse9 .cse10 .cse18 .cse11 .cse19 .cse20 .cse21 .cse22 .cse23 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse15 .cse7 .cse16 .cse17 .cse9 .cse10 .cse18 .cse11 .cse19 .cse12 .cse20 .cse23 .cse13 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse7 .cse16 .cse17 .cse9 .cse24 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse19 .cse12 .cse23) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse17 .cse9 .cse10 .cse26 .cse11 .cse12 .cse21 .cse22 .cse13 .cse14) (or .cse1 .cse2 .cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse4 .cse5 .cse6 (not (< ~c_num_read~0 ~p_num_write~0)) .cse7 .cse8 .cse25 .cse17 .cse9 .cse10 (= ~q_write_ev~0 0) .cse11 .cse12 .cse21 .cse22 .cse13 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse28 .cse25 .cse9 .cse10 .cse26 .cse29 .cse11 .cse19 .cse12 .cse21 .cse23 .cse13 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse28 .cse25 .cse9 .cse10 .cse24 .cse26 .cse29 .cse11 .cse19 .cse12 .cse23 .cse13 .cse14)))) [2021-12-06 21:00:32,783 INFO L858 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 315 339) no Hoare annotation was computed. [2021-12-06 21:00:32,783 INFO L858 garLoopResultBuilder]: For program point L331(lines 331 335) no Hoare annotation was computed. [2021-12-06 21:00:32,783 INFO L858 garLoopResultBuilder]: For program point L329(line 329) no Hoare annotation was computed. [2021-12-06 21:00:32,783 INFO L858 garLoopResultBuilder]: For program point L331-2(lines 315 339) no Hoare annotation was computed. [2021-12-06 21:00:32,784 INFO L858 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2021-12-06 21:00:32,784 INFO L858 garLoopResultBuilder]: For program point update_channels2EXIT(lines 634 641) no Hoare annotation was computed. [2021-12-06 21:00:32,784 INFO L861 garLoopResultBuilder]: At program point update_channels2FINAL(lines 634 641) the Hoare annotation is: true [2021-12-06 21:00:32,784 INFO L858 garLoopResultBuilder]: For program point L735-1(lines 734 757) no Hoare annotation was computed. [2021-12-06 21:00:32,784 INFO L854 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 731 758) the Hoare annotation is: (let ((.cse14 (not (= ~m_st~0 0))) (.cse6 (= ~t1_st~0 0)) (.cse15 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0)))) (.cse18 (not (<= ~t1_pc~0 0))) (.cse19 (not (<= 2 ~m_st~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse5 (not (<= 2 |old(~T1_E~0)|))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~c_num_read~0 0))) (.cse10 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse11 (not (= ~q_free~0 0))) (.cse12 (not (<= 2 |old(~E_M~0)|))) (.cse13 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse3 .cse18 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (< ~local~0 ~token~0)) .cse12 .cse13 .cse14 .cse16 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16) (or .cse19 .cse1 .cse3 .cse4 .cse7 .cse9 .cse10 .cse11 .cse13 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0))) .cse15 .cse16) (or .cse19 .cse0 .cse1 .cse3 .cse18 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17))) [2021-12-06 21:00:32,784 INFO L858 garLoopResultBuilder]: For program point L750-1(lines 731 758) no Hoare annotation was computed. [2021-12-06 21:00:32,784 INFO L858 garLoopResultBuilder]: For program point L745-1(lines 734 757) no Hoare annotation was computed. [2021-12-06 21:00:32,784 INFO L858 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 731 758) no Hoare annotation was computed. [2021-12-06 21:00:32,784 INFO L858 garLoopResultBuilder]: For program point L740-1(lines 734 757) no Hoare annotation was computed. [2021-12-06 21:00:32,784 INFO L854 garLoopResultBuilder]: At program point fire_delta_events1ENTRY(lines 279 296) the Hoare annotation is: (let ((.cse29 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse17 (and .cse29 (= ~q_read_ev~0 2))) (.cse24 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse25 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse12 (not (<= 2 |old(~q_write_ev~0)|))) (.cse27 (not (<= 1 ~c_dr_pc~0))) (.cse28 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse6 (not (= ~q_free~0 0))) (.cse7 (not (<= ~c_dr_pc~0 1))) (.cse8 (= ~p_dw_st~0 0)) (.cse13 (not (= |old(~q_read_ev~0)| 2))) (.cse15 (not (<= ~q_req_up~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse19 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (= ~E_M~0 ~M_E~0))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse20 (not (= ~p_num_write~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse26 (and .cse29 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse21 (not (= ~c_num_read~0 0))) (.cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse10 (not (= ~T1_E~0 ~M_E~0))) (.cse11 (not (= ~m_st~0 0))) (.cse14 (not (= ~p_dw_i~0 1))) (.cse22 (not (= ~q_free~0 1))) (.cse23 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (not (<= 2 ~E_1~0))) (.cse18 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse1 (not .cse8) .cse2 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse3 .cse4 .cse20 .cse5 .cse21 .cse9 .cse10 .cse11 .cse13 .cse14 .cse22 .cse15 .cse23 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse25 .cse26 .cse7 .cse8 .cse10 .cse11 .cse12 .cse27 .cse14 .cse22 .cse15 .cse23 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse25 .cse26 .cse7 .cse8 .cse10 .cse11 .cse12 .cse28 .cse27 .cse14 .cse22 .cse23 .cse16 .cse18) (or .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse5 .cse26 .cse6 .cse8 .cse10 .cse11 .cse14 .cse16 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse20 .cse5 .cse26 .cse21 .cse8 .cse9 .cse10 .cse28 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse22 .cse23) (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse3 .cse4 (not (< ~c_num_read~0 ~p_num_write~0)) .cse5 .cse26 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18) (or .cse0 .cse19 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse26 .cse21 .cse9 .cse10 .cse11 .cse14 .cse22 .cse23 .cse16 .cse18)))) [2021-12-06 21:00:32,785 INFO L858 garLoopResultBuilder]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2021-12-06 21:00:32,785 INFO L858 garLoopResultBuilder]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2021-12-06 21:00:32,785 INFO L858 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 279 296) no Hoare annotation was computed. [2021-12-06 21:00:32,785 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2021-12-06 21:00:32,785 INFO L861 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 88 106) the Hoare annotation is: true [2021-12-06 21:00:32,785 INFO L858 garLoopResultBuilder]: For program point L92(lines 92 101) no Hoare annotation was computed. [2021-12-06 21:00:32,785 INFO L858 garLoopResultBuilder]: For program point L92-2(lines 92 101) no Hoare annotation was computed. [2021-12-06 21:00:32,785 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 88 106) no Hoare annotation was computed. [2021-12-06 21:00:32,785 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 88 106) no Hoare annotation was computed. [2021-12-06 21:00:32,785 INFO L854 garLoopResultBuilder]: At program point L103(lines 91 105) the Hoare annotation is: (let ((.cse33 (= ~T1_E~0 ~M_E~0)) (.cse30 (< 1 ~m_pc~0)) (.cse31 (<= ~m_pc~0 0)) (.cse38 (= ~m_pc~0 ~t1_pc~0)) (.cse32 (<= 1 ~c_dr_pc~0)) (.cse35 (<= ~c_dr_pc~0 1)) (.cse34 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse36 (= ~E_M~0 ~M_E~0)) (.cse37 (= ~M_E~0 2)) (.cse39 (<= is_do_read_c_triggered_~__retres1~1 0)) (.cse40 (<= 0 is_do_read_c_triggered_~__retres1~1))) (let ((.cse28 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse25 (not (= ~p_num_write~0 0))) (.cse26 (not (= ~c_num_read~0 0))) (.cse7 (not (= ~q_free~0 0))) (.cse10 (and .cse39 .cse40)) (.cse29 (not (= ~q_read_ev~0 2))) (.cse0 (= ~c_dr_st~0 0)) (.cse15 (and .cse33 (or .cse30 .cse31) .cse38 .cse32 .cse35 .cse39 .cse34 .cse40 .cse36 .cse37)) (.cse2 (not .cse38)) (.cse3 (not .cse37)) (.cse4 (not .cse36)) (.cse16 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse17 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse18 (not .cse35)) (.cse27 (= ~p_dw_st~0 0)) (.cse19 (not .cse34)) (.cse8 (not .cse33)) (.cse9 (not (= ~m_st~0 0))) (.cse20 (not (<= 2 ~q_write_ev~0))) (.cse21 (not .cse32)) (.cse11 (and (not .cse30) (not .cse31))) (.cse12 (not (= ~p_dw_i~0 1))) (.cse22 (not (= ~q_free~0 1))) (.cse23 (not (<= ~q_req_up~0 0))) (.cse24 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not (<= 2 ~E_1~0))) (.cse14 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse15 .cse2 (not (= ~q_read_ev~0 1)) .cse3 .cse4 .cse16 .cse5 .cse6 .cse17 .cse18 .cse19 .cse8 .cse9 .cse20 .cse21 .cse11 .cse12 .cse22 .cse23 .cse24 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse6 .cse26 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12 .cse22 .cse24 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse17 .cse18 .cse27 .cse8 .cse9 .cse28 .cse10 .cse20 .cse21 .cse11 .cse12 .cse22 .cse24 .cse13 .cse14) (or .cse0 .cse2 .cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse4 .cse5 (< 0 ~q_write_ev~0) (not (< ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 .cse18 .cse27 .cse19 .cse8 .cse9 (= ~q_write_ev~0 0) .cse10 .cse12 .cse23 .cse29 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse25 .cse6 .cse26 .cse27 .cse19 .cse8 .cse28 .cse10 .cse11 .cse22 .cse24) (or .cse1 .cse2 (not .cse27) .cse3 .cse4 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse5 .cse25 .cse6 .cse26 .cse19 .cse8 .cse9 .cse10 .cse12 .cse22 .cse23 .cse29 .cse24 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse27 .cse19 .cse8 .cse9 .cse10 .cse20 .cse12 .cse23 .cse29 .cse13 .cse14) (or .cse0 .cse15 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse17 .cse18 .cse27 .cse19 .cse8 .cse9 .cse20 .cse21 .cse11 .cse12 .cse22 .cse23 .cse24 .cse13 .cse14)))) [2021-12-06 21:00:32,785 INFO L858 garLoopResultBuilder]: For program point L960(lines 960 966) no Hoare annotation was computed. [2021-12-06 21:00:32,786 INFO L854 garLoopResultBuilder]: At program point L927(line 927) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-12-06 21:00:32,786 INFO L858 garLoopResultBuilder]: For program point L927-1(line 927) no Hoare annotation was computed. [2021-12-06 21:00:32,786 INFO L854 garLoopResultBuilder]: At program point L250-1(lines 241 258) the Hoare annotation is: (let ((.cse10 (= ~p_dw_st~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse17 (not (= ~c_dr_st~0 0))) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= ~t1_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 ~M_E~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_write_ev~0 ~q_read_ev~0) .cse6 .cse7 .cse8 .cse9 (<= ~q_req_up~0 0) .cse10 (= ~q_read_ev~0 2) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 (not .cse10) .cse3 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse4 .cse5 .cse7 .cse17 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse12 .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2021-12-06 21:00:32,786 INFO L858 garLoopResultBuilder]: For program point L696(lines 686 724) no Hoare annotation was computed. [2021-12-06 21:00:32,786 INFO L858 garLoopResultBuilder]: For program point L564(lines 564 572) no Hoare annotation was computed. [2021-12-06 21:00:32,786 INFO L858 garLoopResultBuilder]: For program point L878(lines 878 883) no Hoare annotation was computed. [2021-12-06 21:00:32,786 INFO L858 garLoopResultBuilder]: For program point L713(lines 713 720) no Hoare annotation was computed. [2021-12-06 21:00:32,786 INFO L854 garLoopResultBuilder]: At program point L482(lines 473 484) the Hoare annotation is: (= ~M_E~0 2) [2021-12-06 21:00:32,786 INFO L858 garLoopResultBuilder]: For program point L350(line 350) no Hoare annotation was computed. [2021-12-06 21:00:32,786 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-06 21:00:32,786 INFO L854 garLoopResultBuilder]: At program point L829(lines 823 831) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-12-06 21:00:32,786 INFO L858 garLoopResultBuilder]: For program point L532(line 532) no Hoare annotation was computed. [2021-12-06 21:00:32,787 INFO L854 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse23 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse18 (< ~c_num_read~0 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse20 (<= 1 ~c_dr_pc~0)) (.cse21 (= ~q_free~0 1)) (.cse6 (<= 2 ~q_write_ev~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse13 (= ~q_read_ev~0 2)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse11 .cse22 .cse23 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse11 .cse22 .cse12 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 (= ~p_num_write~0 0) .cse2 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse21 .cse8 .cse10 .cse23 .cse24 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse20 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9 .cse11 .cse14 .cse15 (<= ~c_dr_pc~0 0) .cse16 .cse17))) [2021-12-06 21:00:32,787 INFO L854 garLoopResultBuilder]: At program point L912(line 912) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-12-06 21:00:32,787 INFO L858 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2021-12-06 21:00:32,787 INFO L858 garLoopResultBuilder]: For program point L912-1(line 912) no Hoare annotation was computed. [2021-12-06 21:00:32,787 INFO L858 garLoopResultBuilder]: For program point L846-1(lines 835 858) no Hoare annotation was computed. [2021-12-06 21:00:32,787 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2021-12-06 21:00:32,787 INFO L858 garLoopResultBuilder]: For program point L962(lines 962 965) no Hoare annotation was computed. [2021-12-06 21:00:32,787 INFO L854 garLoopResultBuilder]: At program point L450(lines 413 455) the Hoare annotation is: (= ~M_E~0 2) [2021-12-06 21:00:32,787 INFO L854 garLoopResultBuilder]: At program point L897(line 897) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-12-06 21:00:32,787 INFO L858 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2021-12-06 21:00:32,787 INFO L858 garLoopResultBuilder]: For program point L897-1(line 897) no Hoare annotation was computed. [2021-12-06 21:00:32,788 INFO L858 garLoopResultBuilder]: For program point L352-1(lines 347 387) no Hoare annotation was computed. [2021-12-06 21:00:32,788 INFO L854 garLoopResultBuilder]: At program point L220(lines 173 225) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse12 (= ~p_dw_st~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 1 ~c_dr_pc~0)) (.cse5 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse9 (<= ~c_dr_pc~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse11 (<= ~t1_pc~0 0)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (<= ~q_req_up~0 0) .cse12 (= ~q_read_ev~0 2) .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 (= ~q_req_up~0 1) .cse1 (not .cse12) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~p_num_write~0 ~c_num_read~0) (<= 1 ~q_read_ev~0) .cse13 .cse14 .cse15 .cse16 .cse17 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2021-12-06 21:00:32,788 INFO L858 garLoopResultBuilder]: For program point L699(lines 699 706) no Hoare annotation was computed. [2021-12-06 21:00:32,788 INFO L858 garLoopResultBuilder]: For program point L567(lines 567 571) no Hoare annotation was computed. [2021-12-06 21:00:32,788 INFO L854 garLoopResultBuilder]: At program point L435(line 435) the Hoare annotation is: (let ((.cse1 (= ~q_req_up~0 1)) (.cse6 (< ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~q_free~0 0)) (.cse14 (= ~q_read_ev~0 2)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse2 (<= 2 ~E_1~0)) (.cse21 (<= 1 ~c_dr_pc~0)) (.cse7 (= ~m_st~0 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse9 (<= ~c_dr_pc~0 1)) (.cse13 (<= ~t1_pc~0 0)) (.cse23 (<= ~p_num_write~0 ~c_num_read~0)) (.cse20 (<= ~q_req_up~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse22 (= ~q_free~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse12 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse26 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~E_M~0 ~M_E~0)) (.cse18 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse10 .cse11 .cse13 .cse15 .cse16 (<= ~c_dr_pc~0 0) .cse17 .cse18) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse13 .cse23 (<= 1 ~q_read_ev~0) .cse15 .cse24 .cse16 .cse17 .cse18 .cse25) (and .cse0 .cse2 .cse3 .cse4 .cse5 (not (= ~q_write_ev~0 0)) .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse13 .cse23 .cse26 .cse15 .cse24 .cse16 .cse17 .cse18 .cse25) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse13 .cse23 .cse20 .cse15 .cse24 .cse16 .cse17 .cse18 .cse25) (and .cse0 (= ~p_num_write~0 0) .cse3 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse4 .cse5 .cse22 .cse10 .cse12 .cse26 .cse24 .cse16 .cse18))) [2021-12-06 21:00:32,788 INFO L858 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2021-12-06 21:00:32,788 INFO L858 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2021-12-06 21:00:32,788 INFO L854 garLoopResultBuilder]: At program point L568(lines 563 594) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (= ~q_free~0 0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 (or (<= ~m_pc~0 0) (and (<= ~t1_pc~0 1) (< 1 ~m_pc~0))) .cse3 .cse4 .cse5 .cse6 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse7 .cse8) (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) .cse0 .cse1 .cse2 (<= 2 ~E_M~0) .cse3 .cse4 .cse5 .cse6 (<= 2 ~T1_E~0) .cse7 .cse8 (<= ~c_dr_pc~0 0) (not (= ~t1_st~0 0)) (= ~token~0 ~local~0)))) [2021-12-06 21:00:32,788 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2021-12-06 21:00:32,789 INFO L854 garLoopResultBuilder]: At program point L651-1(lines 642 659) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse11) (and .cse0 .cse1 .cse2 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse8 .cse9 .cse10 .cse11))) [2021-12-06 21:00:32,789 INFO L854 garLoopResultBuilder]: At program point L585(line 585) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse4 (= ~q_free~0 0)) (.cse5 (<= 2 ~m_st~0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0))) (or (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse6 (<= 2 ~T1_E~0) .cse7 .cse8 (<= ~c_dr_pc~0 0) (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 (or (<= ~m_pc~0 0) (and (<= ~t1_pc~0 1) (< 1 ~m_pc~0))) .cse3 .cse4 .cse5 .cse6 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse7 .cse8))) [2021-12-06 21:00:32,789 INFO L858 garLoopResultBuilder]: For program point L585-1(line 585) no Hoare annotation was computed. [2021-12-06 21:00:32,789 INFO L854 garLoopResultBuilder]: At program point L420(line 420) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-12-06 21:00:32,789 INFO L858 garLoopResultBuilder]: For program point L420-1(line 420) no Hoare annotation was computed. [2021-12-06 21:00:32,789 INFO L854 garLoopResultBuilder]: At program point L899(line 899) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse11) (and .cse0 .cse1 .cse2 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse8 .cse9 .cse10 .cse11))) [2021-12-06 21:00:32,789 INFO L854 garLoopResultBuilder]: At program point L899-1(line 899) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse11) (and .cse0 .cse1 .cse2 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse8 .cse9 .cse10 .cse11))) [2021-12-06 21:00:32,789 INFO L858 garLoopResultBuilder]: For program point L189(lines 188 219) no Hoare annotation was computed. [2021-12-06 21:00:32,789 INFO L854 garLoopResultBuilder]: At program point L470(lines 456 472) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-12-06 21:00:32,789 INFO L854 garLoopResultBuilder]: At program point L916(line 916) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-12-06 21:00:32,790 INFO L854 garLoopResultBuilder]: At program point L916-1(line 916) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-12-06 21:00:32,790 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2021-12-06 21:00:32,790 INFO L854 garLoopResultBuilder]: At program point L553(lines 516 559) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= 2 ~T1_E~0)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= ~c_dr_pc~0 0)) (.cse13 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~t1_pc~0 0) .cse9 .cse10 .cse11 .cse12 .cse13) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-06 21:00:32,790 INFO L858 garLoopResultBuilder]: For program point L520(lines 520 528) no Hoare annotation was computed. [2021-12-06 21:00:32,790 INFO L854 garLoopResultBuilder]: At program point L388(lines 340 393) the Hoare annotation is: (let ((.cse1 (= ~q_req_up~0 1)) (.cse6 (< ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~q_free~0 0)) (.cse14 (= ~q_read_ev~0 2)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse2 (<= 2 ~E_1~0)) (.cse21 (<= 1 ~c_dr_pc~0)) (.cse7 (= ~m_st~0 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse9 (<= ~c_dr_pc~0 1)) (.cse13 (<= ~t1_pc~0 0)) (.cse23 (<= ~p_num_write~0 ~c_num_read~0)) (.cse20 (<= ~q_req_up~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse17 (= ~token~0 ~local~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse22 (= ~q_free~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse12 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse26 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~E_M~0 ~M_E~0)) (.cse18 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse10 .cse11 .cse13 .cse15 .cse16 (<= ~c_dr_pc~0 0) .cse17 .cse18) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse13 .cse23 (<= 1 ~q_read_ev~0) .cse15 .cse24 .cse16 .cse17 .cse18 .cse25) (and .cse0 .cse2 .cse3 .cse4 .cse5 (not (= ~q_write_ev~0 0)) .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse13 .cse23 .cse26 .cse15 .cse24 .cse16 .cse17 .cse18 .cse25) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse7 .cse22 .cse8 .cse9 .cse10 .cse13 .cse23 .cse20 .cse15 .cse24 .cse16 .cse17 .cse18 .cse25) (and .cse0 (= ~p_num_write~0 0) .cse3 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse4 .cse5 .cse22 .cse10 .cse12 .cse26 .cse24 .cse16 .cse18))) [2021-12-06 21:00:32,790 INFO L854 garLoopResultBuilder]: At program point L900(line 900) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse11) (and .cse0 .cse1 .cse2 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse8 .cse9 .cse10 .cse11))) [2021-12-06 21:00:32,790 INFO L854 garLoopResultBuilder]: At program point L867(lines 860 869) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 ~M_E~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-12-06 21:00:32,790 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-06 21:00:32,790 INFO L858 garLoopResultBuilder]: For program point L190-1(lines 190 200) no Hoare annotation was computed. [2021-12-06 21:00:32,791 INFO L854 garLoopResultBuilder]: At program point L537(line 537) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse11 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse3 .cse4 .cse5 .cse6 (<= ~t1_pc~0 0) .cse7 .cse8 .cse9 .cse10 .cse11) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~t1_st~0 0)) .cse11))) [2021-12-06 21:00:32,791 INFO L858 garLoopResultBuilder]: For program point L537-1(line 537) no Hoare annotation was computed. [2021-12-06 21:00:32,791 INFO L854 garLoopResultBuilder]: At program point L917(line 917) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-12-06 21:00:32,791 INFO L854 garLoopResultBuilder]: At program point L372(lines 347 387) the Hoare annotation is: (let ((.cse32 (= ~p_dw_st~0 0))) (let ((.cse18 (= ~q_req_up~0 1)) (.cse21 (<= 1 ~q_read_ev~0)) (.cse28 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse20 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse31 (= ~p_num_write~0 0)) (.cse19 (= ~c_num_read~0 0)) (.cse24 (= ~q_free~0 1)) (.cse6 (<= 2 ~q_write_ev~0)) (.cse25 (<= ~p_num_write~0 ~c_num_read~0)) (.cse26 (= ~c_last_read~0 ~p_last_write~0)) (.cse27 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse22 (<= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (not .cse32)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse29 (< ~c_num_read~0 ~p_num_write~0)) (.cse23 (<= 1 ~c_dr_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (<= ~q_req_up~0 0)) (.cse13 (= ~q_read_ev~0 2)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2)) (.cse30 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse19 .cse3 .cse4 .cse20 .cse5 .cse6 .cse9 .cse11 (<= ~p_num_write~0 1) .cse21 .cse14 .cse15 .cse22 (<= 1 ~p_num_write~0) .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse24 .cse6 .cse7 .cse8 .cse10 .cse11 .cse25 .cse12 .cse14 .cse26 .cse15 .cse16 .cse17 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse24 .cse6 .cse7 .cse8 .cse11 .cse25 .cse28 .cse14 .cse26 .cse15 .cse16 .cse17 .cse27) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse29 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse24 .cse6 .cse7 .cse8 .cse10 .cse11 .cse25 .cse21 .cse14 .cse26 .cse15 .cse16 .cse17 .cse27) (and .cse0 .cse31 .cse2 .cse19 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse24 .cse8 .cse10 .cse28 .cse26 .cse15 .cse17) (and .cse0 .cse1 .cse31 .cse19 .cse3 .cse4 .cse5 .cse24 .cse6 .cse10 .cse11 .cse12 .cse32 .cse13 .cse14 .cse26 .cse15 .cse22 .cse16 .cse17) (and .cse0 .cse1 .cse31 .cse19 .cse3 .cse4 .cse23 .cse20 .cse5 .cse24 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse29 .cse23 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30) (and .cse0 .cse1 .cse31 .cse19 .cse3 .cse4 .cse5 .cse24 .cse8 .cse10 .cse11 .cse14 .cse26 .cse15 .cse22 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse23 .cse5 .cse24 .cse6 .cse7 .cse8 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17 .cse27) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9 .cse11 .cse14 .cse15 .cse22 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) .cse29 .cse23 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30)))) [2021-12-06 21:00:32,791 INFO L854 garLoopResultBuilder]: At program point L851-1(lines 832 859) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-12-06 21:00:32,791 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2021-12-06 21:00:32,791 INFO L854 garLoopResultBuilder]: At program point L422(line 422) the Hoare annotation is: (let ((.cse10 (= ~p_dw_st~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse17 (not (= ~c_dr_st~0 0))) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= ~t1_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 ~M_E~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_write_ev~0 ~q_read_ev~0) .cse6 .cse7 .cse8 .cse9 (<= ~q_req_up~0 0) .cse10 (= ~q_read_ev~0 2) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 (not .cse10) .cse3 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse4 .cse5 .cse7 .cse17 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse12 .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2021-12-06 21:00:32,792 INFO L854 garLoopResultBuilder]: At program point L422-1(line 422) the Hoare annotation is: (let ((.cse10 (= ~p_dw_st~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse17 (not (= ~c_dr_st~0 0))) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= ~t1_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 ~M_E~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_write_ev~0 ~q_read_ev~0) .cse6 .cse7 .cse8 .cse9 (<= ~q_req_up~0 0) .cse10 (= ~q_read_ev~0 2) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 (not .cse10) .cse3 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse4 .cse5 .cse7 .cse17 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse12 .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2021-12-06 21:00:32,792 INFO L854 garLoopResultBuilder]: At program point L439(line 439) the Hoare annotation is: (let ((.cse18 (<= 1 ~c_dr_pc~0)) (.cse13 (<= 2 ~q_write_ev~0)) (.cse20 (<= ~p_num_write~0 ~c_num_read~0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse19 (= ~q_free~0 1)) (.cse21 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= ~q_free~0 0)) (.cse15 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (<= ~t1_pc~0 0)) (.cse16 (<= ~q_req_up~0 0)) (.cse17 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse11 (= ~token~0 ~local~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 0) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse14 .cse6 .cse7 .cse15 .cse8 .cse16 .cse17 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse19 .cse13 .cse14 .cse6 .cse8 .cse20 .cse21 .cse9 .cse22 .cse10 .cse11 .cse12 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse19 .cse13 .cse14 .cse6 .cse8 .cse20 .cse16 .cse9 .cse22 .cse10 .cse11 .cse12 .cse23) (and .cse0 (= ~p_num_write~0 0) .cse2 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse19 .cse6 .cse15 .cse21 .cse22 .cse10 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< ~c_num_read~0 ~p_num_write~0) .cse5 .cse14 .cse6 .cse7 .cse15 .cse8 .cse16 .cse17 .cse9 .cse10 .cse11 .cse12 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2021-12-06 21:00:32,792 INFO L854 garLoopResultBuilder]: At program point L439-1(line 439) the Hoare annotation is: (let ((.cse7 (= ~q_free~0 0)) (.cse17 (= ~q_read_ev~0 2)) (.cse1 (<= 2 ~E_1~0)) (.cse18 (<= 1 ~c_dr_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse13 (<= 2 ~q_write_ev~0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse8 (<= ~t1_pc~0 0)) (.cse20 (<= ~p_num_write~0 ~c_num_read~0)) (.cse16 (<= ~q_req_up~0 0)) (.cse9 (= ~p_dw_i~0 1)) (.cse11 (= ~token~0 ~local~0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse19 (= ~q_free~0 1)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse15 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse21 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~E_M~0 ~M_E~0)) (.cse12 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 0) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13 .cse14 .cse6 .cse7 .cse15 .cse8 .cse16 .cse17 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) (< ~c_num_read~0 ~p_num_write~0) .cse5 .cse14 .cse6 .cse7 .cse15 .cse8 .cse16 .cse17 .cse9 .cse10 .cse11 .cse12 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse19 .cse13 .cse14 .cse6 .cse8 .cse20 .cse21 .cse9 .cse22 .cse10 .cse11 .cse12 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse19 .cse13 .cse14 .cse6 .cse8 .cse20 .cse16 .cse9 .cse22 .cse10 .cse11 .cse12 .cse23) (and .cse0 (= ~p_num_write~0 0) .cse2 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse19 .cse6 .cse15 .cse21 .cse22 .cse10 .cse12))) [2021-12-06 21:00:32,792 INFO L854 garLoopResultBuilder]: At program point L918(line 918) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-12-06 21:00:32,792 INFO L854 garLoopResultBuilder]: At program point L885(lines 874 887) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-12-06 21:00:32,792 INFO L854 garLoopResultBuilder]: At program point L687(line 687) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-12-06 21:00:32,792 INFO L854 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse10 (= ~p_dw_st~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse17 (not (= ~c_dr_st~0 0))) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= ~t1_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= ~E_M~0 ~M_E~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse15 (= ~token~0 ~local~0)) (.cse16 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_write_ev~0 ~q_read_ev~0) .cse6 .cse7 .cse8 .cse9 (<= ~q_req_up~0 0) .cse10 (= ~q_read_ev~0 2) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse2 (not .cse10) .cse3 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse4 .cse5 .cse7 .cse17 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse12 .cse13 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2021-12-06 21:00:32,793 INFO L858 garLoopResultBuilder]: For program point L357(lines 347 387) no Hoare annotation was computed. [2021-12-06 21:00:32,793 INFO L858 garLoopResultBuilder]: For program point L836(lines 836 840) no Hoare annotation was computed. [2021-12-06 21:00:32,793 INFO L858 garLoopResultBuilder]: For program point L836-2(lines 835 858) no Hoare annotation was computed. [2021-12-06 21:00:32,793 INFO L854 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse23 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse5 (< ~c_num_read~0 ~p_num_write~0)) (.cse18 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse26 (< 0 ~q_write_ev~0)) (.cse13 (= ~q_read_ev~0 2)) (.cse9 (= ~q_free~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse19 (<= 1 ~c_dr_pc~0)) (.cse6 (= ~m_st~0 0)) (.cse20 (= ~q_free~0 1)) (.cse21 (<= 2 ~q_write_ev~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse20 .cse21 .cse7 .cse8 .cse11 .cse22 .cse23 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse6 .cse20 .cse21 .cse7 .cse8 .cse11 .cse22 .cse12 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 (= ~p_num_write~0 0) .cse2 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse20 .cse8 .cse10 .cse23 .cse24 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse7 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse8 .cse9 .cse11 .cse14 .cse15 (<= ~c_dr_pc~0 0) .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse19 .cse6 .cse20 (= ~q_read_ev~0 1) .cse21 .cse7 .cse8 .cse10 .cse11 .cse22 .cse12 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25))) [2021-12-06 21:00:32,793 INFO L854 garLoopResultBuilder]: At program point L886(lines 870 888) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-12-06 21:00:32,793 INFO L854 garLoopResultBuilder]: At program point L589(lines 560 595) the Hoare annotation is: (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (or (<= ~m_pc~0 0) (and (<= ~t1_pc~0 1) (< 1 ~m_pc~0)))) (.cse12 (<= 2 ~E_M~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse5 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse15 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse8 .cse9) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse5 .cse6 .cse7 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse4 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse7 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse3 .cse12 .cse4 .cse16 .cse5 .cse7 .cse13 .cse8 .cse9 .cse14 .cse15 (= ~token~0 ~local~0)))) [2021-12-06 21:00:32,793 INFO L858 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2021-12-06 21:00:32,793 INFO L858 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2021-12-06 21:00:32,793 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-06 21:00:32,793 INFO L858 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2021-12-06 21:00:32,793 INFO L858 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2021-12-06 21:00:32,794 INFO L858 garLoopResultBuilder]: For program point L689(line 689) no Hoare annotation was computed. [2021-12-06 21:00:32,794 INFO L854 garLoopResultBuilder]: At program point L524(lines 519 558) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= 2 ~T1_E~0) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)) [2021-12-06 21:00:32,794 INFO L854 garLoopResultBuilder]: At program point L904-1(lines 901 941) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-12-06 21:00:32,794 INFO L854 garLoopResultBuilder]: At program point L409(lines 398 411) the Hoare annotation is: (let ((.cse23 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse18 (< ~c_num_read~0 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse20 (<= 1 ~c_dr_pc~0)) (.cse21 (= ~q_free~0 1)) (.cse6 (<= 2 ~q_write_ev~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse13 (= ~q_read_ev~0 2)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse11 .cse22 .cse23 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse11 .cse22 .cse12 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 (= ~p_num_write~0 0) .cse2 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse21 .cse8 .cse10 .cse23 .cse24 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse20 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9 .cse11 .cse14 .cse15 (<= ~c_dr_pc~0 0) .cse16 .cse17))) [2021-12-06 21:00:32,794 INFO L858 garLoopResultBuilder]: For program point L921(line 921) no Hoare annotation was computed. [2021-12-06 21:00:32,794 INFO L858 garLoopResultBuilder]: For program point L376(lines 376 383) no Hoare annotation was computed. [2021-12-06 21:00:32,794 INFO L854 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: false [2021-12-06 21:00:32,794 INFO L858 garLoopResultBuilder]: For program point L905(line 905) no Hoare annotation was computed. [2021-12-06 21:00:32,794 INFO L854 garLoopResultBuilder]: At program point L575-1(lines 563 594) the Hoare annotation is: (let ((.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse6 (= ~m_st~0 0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse7 (= ~q_free~0 0)) (.cse15 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= 2 ~T1_E~0)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= ~c_dr_pc~0 0)) (.cse13 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse14 .cse3 .cse5 .cse7 .cse15 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-12-06 21:00:32,795 INFO L854 garLoopResultBuilder]: At program point L410(lines 394 412) the Hoare annotation is: (let ((.cse23 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse18 (< ~c_num_read~0 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse20 (<= 1 ~c_dr_pc~0)) (.cse21 (= ~q_free~0 1)) (.cse6 (<= 2 ~q_write_ev~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse13 (= ~q_read_ev~0 2)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse11 .cse22 .cse23 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse11 .cse22 .cse12 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 (= ~p_num_write~0 0) .cse2 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse21 .cse8 .cse10 .cse23 .cse24 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse20 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9 .cse11 .cse14 .cse15 (<= ~c_dr_pc~0 0) .cse16 .cse17))) [2021-12-06 21:00:32,795 INFO L858 garLoopResultBuilder]: For program point L245(lines 245 249) no Hoare annotation was computed. [2021-12-06 21:00:32,795 INFO L858 garLoopResultBuilder]: For program point L245-2(lines 244 257) no Hoare annotation was computed. [2021-12-06 21:00:32,795 INFO L858 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2021-12-06 21:00:32,795 INFO L858 garLoopResultBuilder]: For program point L691-1(lines 686 724) no Hoare annotation was computed. [2021-12-06 21:00:32,795 INFO L854 garLoopResultBuilder]: At program point L427-1(lines 424 449) the Hoare annotation is: (let ((.cse28 (= ~p_dw_st~0 0))) (let ((.cse23 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse2 (not .cse28)) (.cse18 (< ~c_num_read~0 ~p_num_write~0)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse26 (= ~p_num_write~0 0)) (.cse27 (= ~c_num_read~0 0)) (.cse20 (<= 1 ~c_dr_pc~0)) (.cse21 (= ~q_free~0 1)) (.cse6 (<= 2 ~q_write_ev~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (<= ~q_req_up~0 0)) (.cse13 (= ~q_read_ev~0 2)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse29 (<= ~c_dr_pc~0 0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) .cse18 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse11 .cse22 .cse23 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse11 .cse22 .cse12 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 .cse26 .cse2 .cse27 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse21 .cse8 .cse10 .cse23 .cse24 .cse15 .cse17) (and .cse0 .cse1 .cse26 .cse27 .cse3 .cse4 .cse5 .cse21 .cse6 .cse10 .cse11 .cse12 .cse28 .cse13 .cse14 .cse24 .cse15 .cse29 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse20 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse26 .cse27 .cse3 .cse4 .cse5 .cse21 .cse8 .cse10 .cse11 .cse14 .cse24 .cse15 .cse29 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse20 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse24 .cse15 .cse16 .cse17 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9 .cse11 .cse14 .cse15 .cse29 .cse16 .cse17)))) [2021-12-06 21:00:32,795 INFO L858 garLoopResultBuilder]: For program point L361(lines 361 368) no Hoare annotation was computed. [2021-12-06 21:00:32,795 INFO L858 garLoopResultBuilder]: For program point L576(line 576) no Hoare annotation was computed. [2021-12-06 21:00:32,795 INFO L858 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2021-12-06 21:00:32,795 INFO L858 garLoopResultBuilder]: For program point L923(lines 923 932) no Hoare annotation was computed. [2021-12-06 21:00:32,795 INFO L858 garLoopResultBuilder]: For program point L923-2(lines 923 932) no Hoare annotation was computed. [2021-12-06 21:00:32,796 INFO L854 garLoopResultBuilder]: At program point L725(lines 680 730) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-12-06 21:00:32,796 INFO L858 garLoopResultBuilder]: For program point L180(lines 180 184) no Hoare annotation was computed. [2021-12-06 21:00:32,796 INFO L854 garLoopResultBuilder]: At program point L147-1(lines 135 170) the Hoare annotation is: (let ((.cse1 (= ~q_req_up~0 1)) (.cse24 (<= 1 ~q_read_ev~0)) (.cse13 (= ~q_free~0 0)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse11 (<= ~c_dr_pc~0 1)) (.cse23 (<= ~q_req_up~0 0)) (.cse15 (= ~q_read_ev~0 2)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse2 (<= 2 ~E_1~0)) (.cse20 (= ~p_num_write~0 0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse21 (= ~c_num_read~0 0)) (.cse4 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse8 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse9 (= ~m_st~0 0)) (.cse22 (= ~q_free~0 1)) (.cse12 (not (= ~c_dr_st~0 0))) (.cse14 (<= ~t1_pc~0 0)) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (= ~E_M~0 ~M_E~0)) (.cse25 (<= ~c_dr_pc~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< ~c_num_read~0 ~p_num_write~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse2 .cse20 .cse3 .cse21 .cse4 .cse5 .cse6 .cse8 .cse9 .cse22 .cse10 .cse14 .cse23 .cse24 .cse16 .cse17 .cse25 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13 .cse14 (<= ~p_num_write~0 1) .cse24 .cse16 .cse17 .cse25 (<= 1 ~p_num_write~0) .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse12 .cse13 .cse14 .cse16 .cse17 .cse25 .cse18 .cse19) (and .cse0 .cse2 .cse20 .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse22 .cse10 .cse11 .cse12 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse20 .cse3 .cse21 .cse4 .cse5 .cse6 .cse8 .cse9 .cse22 .cse12 .cse14 .cse16 .cse17 .cse25 .cse18 .cse19))) [2021-12-06 21:00:32,796 INFO L858 garLoopResultBuilder]: For program point L428(line 428) no Hoare annotation was computed. [2021-12-06 21:00:32,796 INFO L858 garLoopResultBuilder]: For program point L841-1(lines 835 858) no Hoare annotation was computed. [2021-12-06 21:00:32,796 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-06 21:00:32,796 INFO L861 garLoopResultBuilder]: At program point L957(lines 948 959) the Hoare annotation is: true [2021-12-06 21:00:32,796 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2021-12-06 21:00:32,796 INFO L854 garLoopResultBuilder]: At program point L181(lines 176 224) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (not (= ~p_dw_st~0 0)) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (< ~c_num_read~0 ~p_num_write~0) (<= 1 ~c_dr_pc~0) (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|) (= ~m_st~0 0) (<= 2 ~q_write_ev~0) (<= ~c_dr_pc~0 1) (not (= ~c_dr_st~0 0)) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (<= ~q_req_up~0 0) (<= 1 ~q_read_ev~0) (= ~p_dw_i~0 1) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2021-12-06 21:00:32,796 INFO L858 garLoopResultBuilder]: For program point L148(lines 147 165) no Hoare annotation was computed. [2021-12-06 21:00:32,796 INFO L854 garLoopResultBuilder]: At program point L710(lines 686 724) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-12-06 21:00:32,797 INFO L854 garLoopResultBuilder]: At program point L545-1(lines 519 558) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (<= ~c_dr_pc~0 0)) (.cse13 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 .cse10 .cse11 (= ~token~0 ~local~0)) (and .cse12 .cse0 .cse1 .cse2 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 (< ~local~0 ~token~0)))) [2021-12-06 21:00:32,797 INFO L854 garLoopResultBuilder]: At program point L149(lines 135 170) the Hoare annotation is: (let ((.cse8 (not (= ~c_dr_st~0 0))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse16 (= ~p_num_write~0 0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse17 (= ~c_num_read~0 0)) (.cse14 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse6 (= ~m_st~0 0)) (.cse7 (<= 2 ~q_write_ev~0)) (.cse9 (<= ~t1_pc~0 0)) (.cse10 (= ~p_dw_i~0 1)) (.cse11 (= ~E_M~0 ~M_E~0)) (.cse15 (<= ~c_dr_pc~0 0)) (.cse12 (= ~token~0 ~local~0)) (.cse13 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ~c_dr_pc~0) .cse5 .cse6 .cse7 (<= ~c_dr_pc~0 1) .cse8 .cse9 (<= ~p_num_write~0 ~c_num_read~0) (= ~q_read_ev~0 2) .cse10 .cse11 .cse12 .cse13 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse0 .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse8 (= ~q_free~0 0) .cse9 .cse10 .cse11 .cse15 .cse12 .cse13) (and .cse0 .cse1 .cse16 .cse2 .cse17 .cse14 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse15 .cse12 .cse13) (and .cse0 .cse1 .cse16 .cse2 .cse17 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 (<= ~q_req_up~0 0) (<= 1 ~q_read_ev~0) .cse10 .cse11 .cse15 .cse12 .cse13))) [2021-12-06 21:00:32,797 INFO L858 garLoopResultBuilder]: For program point L496(line 496) no Hoare annotation was computed. [2021-12-06 21:00:32,797 INFO L861 garLoopResultBuilder]: At program point L942(lines 889 947) the Hoare annotation is: true [2021-12-06 21:00:32,797 INFO L854 garLoopResultBuilder]: At program point L876(line 876) the Hoare annotation is: (let ((.cse8 (<= 2 ~m_st~0)) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse14 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= ~t1_pc~0 0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse18 .cse7 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13 .cse17))) [2021-12-06 21:00:32,797 INFO L858 garLoopResultBuilder]: For program point L876-1(line 876) no Hoare annotation was computed. [2021-12-06 21:00:32,797 INFO L854 garLoopResultBuilder]: At program point L166(lines 132 171) the Hoare annotation is: (let ((.cse13 (<= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~q_req_up~0 1)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse7 (= ~m_st~0 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse16 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~E_M~0 ~M_E~0)) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_num_read~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~p_num_write~0 1) (<= 1 ~q_read_ev~0) .cse11 .cse12 .cse13 (<= 1 ~p_num_write~0) .cse14 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< ~c_num_read~0 ~p_num_write~0) .cse6 .cse7 .cse8 (<= ~c_dr_pc~0 1) .cse16 .cse9 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse10 (= ~q_read_ev~0 2) .cse11 .cse12 .cse14 .cse15 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2021-12-06 21:00:32,797 INFO L854 garLoopResultBuilder]: At program point L348(line 348) the Hoare annotation is: (let ((.cse32 (= ~p_dw_st~0 0))) (let ((.cse18 (= ~q_req_up~0 1)) (.cse21 (<= 1 ~q_read_ev~0)) (.cse28 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse20 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse31 (= ~p_num_write~0 0)) (.cse19 (= ~c_num_read~0 0)) (.cse24 (= ~q_free~0 1)) (.cse6 (<= 2 ~q_write_ev~0)) (.cse25 (<= ~p_num_write~0 ~c_num_read~0)) (.cse26 (= ~c_last_read~0 ~p_last_write~0)) (.cse27 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse22 (<= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (not .cse32)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse29 (< ~c_num_read~0 ~p_num_write~0)) (.cse23 (<= 1 ~c_dr_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (<= ~q_req_up~0 0)) (.cse13 (= ~q_read_ev~0 2)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2)) (.cse30 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse18 .cse1 .cse2 .cse19 .cse3 .cse4 .cse20 .cse5 .cse6 .cse9 .cse11 (<= ~p_num_write~0 1) .cse21 .cse14 .cse15 .cse22 (<= 1 ~p_num_write~0) .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse24 .cse6 .cse7 .cse8 .cse10 .cse11 .cse25 .cse12 .cse14 .cse26 .cse15 .cse16 .cse17 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse24 .cse6 .cse7 .cse8 .cse11 .cse25 .cse28 .cse14 .cse26 .cse15 .cse16 .cse17 .cse27) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse29 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30) (and .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse24 .cse6 .cse7 .cse8 .cse10 .cse11 .cse25 .cse21 .cse14 .cse26 .cse15 .cse16 .cse17 .cse27) (and .cse0 .cse31 .cse2 .cse19 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse24 .cse8 .cse10 .cse28 .cse26 .cse15 .cse17) (and .cse0 .cse1 .cse31 .cse19 .cse3 .cse4 .cse5 .cse24 .cse6 .cse10 .cse11 .cse12 .cse32 .cse13 .cse14 .cse26 .cse15 .cse22 .cse16 .cse17) (and .cse0 .cse1 .cse31 .cse19 .cse3 .cse4 .cse23 .cse20 .cse5 .cse24 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse29 .cse23 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30) (and .cse0 .cse1 .cse31 .cse19 .cse3 .cse4 .cse5 .cse24 .cse8 .cse10 .cse11 .cse14 .cse26 .cse15 .cse22 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse23 .cse5 .cse24 .cse6 .cse7 .cse8 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17 .cse27) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9 .cse11 .cse14 .cse15 .cse22 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) .cse29 .cse23 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30)))) [2021-12-06 21:00:32,798 INFO L854 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2021-12-06 21:00:32,798 INFO L854 garLoopResultBuilder]: At program point L216-1(lines 176 224) the Hoare annotation is: (let ((.cse23 (= ~p_dw_st~0 0))) (let ((.cse1 (= ~q_req_up~0 1)) (.cse3 (not .cse23)) (.cse19 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse21 (<= 1 ~q_read_ev~0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse2 (<= 2 ~E_1~0)) (.cse22 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse7 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 1)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse11 (<= ~t1_pc~0 0)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~E_M~0 ~M_E~0)) (.cse20 (<= ~c_dr_pc~0 0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and (let ((.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse18 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~c_dr_pc~0 1) .cse10 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20 .cse16 .cse17 .cse18))) .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse22 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 (= ~q_free~0 0) .cse11 (<= ~p_num_write~0 1) .cse21 .cse13 .cse15 .cse20 (<= 1 ~p_num_write~0) .cse16 .cse17) (and .cse0 .cse2 (= ~p_num_write~0 0) .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (<= ~q_req_up~0 0) .cse23 (= ~q_read_ev~0 2) .cse13 .cse14 .cse15 .cse20 .cse16 .cse17)))) [2021-12-06 21:00:32,798 INFO L854 garLoopResultBuilder]: At program point L497(lines 492 499) the Hoare annotation is: false [2021-12-06 21:00:32,798 INFO L858 garLoopResultBuilder]: For program point L646(lines 646 650) no Hoare annotation was computed. [2021-12-06 21:00:32,798 INFO L858 garLoopResultBuilder]: For program point L646-2(lines 645 658) no Hoare annotation was computed. [2021-12-06 21:00:32,798 INFO L854 garLoopResultBuilder]: At program point L84(lines 72 86) the Hoare annotation is: (let ((.cse26 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse28 (<= is_do_write_p_triggered_~__retres1~0 0)) (.cse29 (<= 0 is_do_write_p_triggered_~__retres1~0))) (let ((.cse15 (not (<= ~q_req_up~0 0))) (.cse21 (not (= ~q_free~0 0))) (.cse16 (not (= ~q_read_ev~0 2))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse25 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse27 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse23 (not (<= ~c_dr_pc~0 1))) (.cse12 (not (= ~m_st~0 0))) (.cse24 (not (<= 2 ~q_write_ev~0))) (.cse30 (not (<= 1 ~c_dr_pc~0))) (.cse13 (not (= ~p_dw_i~0 1))) (.cse18 (not (<= 2 ~E_1~0))) (.cse19 (not (= ~token~0 ~local~0))) (.cse20 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (not (= ~M_E~0 2))) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse6 (not (= ~p_num_write~0 0))) (.cse7 (and .cse28 .cse29)) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse2 (= ~p_dw_st~0 0)) (.cse10 (not .cse26)) (.cse11 (not (= ~T1_E~0 ~M_E~0))) (.cse22 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse14 (not (= ~q_free~0 1))) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 (not .cse2) .cse3 .cse4 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse21 .cse2 .cse11 .cse12 .cse22 .cse13 .cse18 .cse19) (or .cse20 .cse1 .cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse4 .cse5 .cse7 (not (< ~c_num_read~0 ~p_num_write~0)) .cse8 .cse21 .cse23 .cse2 .cse10 .cse11 .cse12 (= ~q_write_ev~0 0) .cse13 .cse15 .cse16 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse21 .cse23 .cse2 .cse10 .cse11 .cse12 .cse24 .cse13 .cse15 .cse16 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse25 .cse5 (and (= ~q_read_ev~0 1) .cse26) .cse8 .cse27 (and .cse26 .cse28 .cse29) .cse23 .cse2 .cse11 .cse12 .cse24 .cse30 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19) (or .cse20 .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse8 .cse21 .cse2 .cse11 .cse12 .cse13 .cse16 .cse18 .cse19) (or .cse20 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse25 .cse5 .cse7 .cse8 .cse27 .cse23 .cse2 .cse11 .cse12 .cse22 .cse24 .cse30 .cse13 .cse14 .cse17 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse2 .cse10 .cse11 .cse22 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse14 .cse17)))) [2021-12-06 21:00:32,798 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 69 87) no Hoare annotation was computed. [2021-12-06 21:00:32,798 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 69 87) no Hoare annotation was computed. [2021-12-06 21:00:32,798 INFO L858 garLoopResultBuilder]: For program point L74(lines 74 79) no Hoare annotation was computed. [2021-12-06 21:00:32,799 INFO L858 garLoopResultBuilder]: For program point L73(lines 73 82) no Hoare annotation was computed. [2021-12-06 21:00:32,799 INFO L858 garLoopResultBuilder]: For program point L73-2(lines 73 82) no Hoare annotation was computed. [2021-12-06 21:00:32,799 INFO L861 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 69 87) the Hoare annotation is: true [2021-12-06 21:00:32,799 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 259 278) no Hoare annotation was computed. [2021-12-06 21:00:32,799 INFO L854 garLoopResultBuilder]: At program point L275(lines 262 277) the Hoare annotation is: (let ((.cse19 (= ~q_read_ev~0 2)) (.cse0 (= ~c_dr_st~0 0)) (.cse16 (= ~p_dw_st~0 0))) (let ((.cse1 (not (<= ~c_dr_pc~0 0))) (.cse3 (not .cse16)) (.cse20 (not (= ~p_num_write~0 0))) (.cse15 (not (= ~c_num_read~0 0))) (.cse22 (not (= ~q_free~0 1))) (.cse25 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (= ~E_M~0 ~M_E~0))) (.cse18 (not .cse0)) (.cse6 (not (<= ~t1_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~q_free~0 0))) (.cse26 (not (<= ~c_dr_pc~0 1))) (.cse21 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse17 (not (<= 2 ~q_write_ev~0))) (.cse27 (not (<= 1 ~c_dr_pc~0))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse12 (<= 1 exists_runnable_thread1_~__retres1~2)) (.cse23 (not (<= ~q_req_up~0 0))) (.cse24 (not .cse19)) (.cse13 (not (<= 2 ~E_1~0))) (.cse14 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse1 .cse2 .cse4 (not (= ~q_req_up~0 1)) .cse5 .cse6 .cse7 .cse15 .cse8 .cse16 .cse9 .cse10 .cse17 (and (= ~q_write_ev~0 ~q_read_ev~0) .cse18 .cse19) .cse11 .cse12 (not (<= 1 ~p_num_write~0)) (not (<= 1 ~q_read_ev~0)) .cse13 (not (<= ~p_num_write~0 1)) .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse15 .cse21 .cse9 .cse10 .cse17 .cse11 .cse22 .cse12 .cse23 .cse24 .cse25 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse15 .cse26 .cse9 .cse10 .cse17 .cse27 .cse11 .cse22 .cse12 .cse23 .cse24 .cse25 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse5 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse6 .cse7 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse26 .cse21 .cse9 .cse10 .cse17 .cse27 .cse11 .cse22 .cse12 .cse23 .cse24 .cse25 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse15 .cse21 .cse9 .cse10 .cse11 .cse22 .cse12 .cse25 .cse13 .cse14) (or .cse2 .cse4 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse5 .cse18 .cse6 (not (< ~c_num_read~0 ~p_num_write~0)) .cse7 .cse8 .cse26 .cse16 .cse21 .cse9 .cse10 .cse17 .cse27 .cse11 .cse12 .cse23 .cse24 .cse13 .cse14)))) [2021-12-06 21:00:32,799 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 259 278) the Hoare annotation is: true [2021-12-06 21:00:32,799 INFO L858 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2021-12-06 21:00:32,799 INFO L858 garLoopResultBuilder]: For program point L263(lines 263 273) no Hoare annotation was computed. [2021-12-06 21:00:32,799 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 259 278) no Hoare annotation was computed. [2021-12-06 21:00:32,799 INFO L861 garLoopResultBuilder]: At program point error1ENTRY(lines 24 31) the Hoare annotation is: true [2021-12-06 21:00:32,799 INFO L858 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 28) no Hoare annotation was computed. [2021-12-06 21:00:32,799 INFO L858 garLoopResultBuilder]: For program point error1FINAL(lines 24 31) no Hoare annotation was computed. [2021-12-06 21:00:32,800 INFO L858 garLoopResultBuilder]: For program point error1EXIT(lines 24 31) no Hoare annotation was computed. [2021-12-06 21:00:32,800 INFO L858 garLoopResultBuilder]: For program point L668(lines 668 673) no Hoare annotation was computed. [2021-12-06 21:00:32,800 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 660 679) no Hoare annotation was computed. [2021-12-06 21:00:32,800 INFO L858 garLoopResultBuilder]: For program point L664(lines 664 674) no Hoare annotation was computed. [2021-12-06 21:00:32,800 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 660 679) the Hoare annotation is: true [2021-12-06 21:00:32,800 INFO L861 garLoopResultBuilder]: At program point L676(lines 663 678) the Hoare annotation is: true [2021-12-06 21:00:32,800 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 660 679) no Hoare annotation was computed. [2021-12-06 21:00:32,800 INFO L858 garLoopResultBuilder]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2021-12-06 21:00:32,800 INFO L854 garLoopResultBuilder]: At program point reset_delta_events1ENTRY(lines 297 314) the Hoare annotation is: (let ((.cse32 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse31 (not (< 0 |old(~q_write_ev~0)|))) (.cse18 (and .cse32 (= ~q_read_ev~0 2))) (.cse28 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse29 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse30 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse22 (not (= ~q_free~0 0))) (.cse2 (= ~p_dw_st~0 0)) (.cse12 (not (= |old(~q_read_ev~0)| 2))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse6 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse20 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (not (= ~M_E~0 2))) (.cse4 (not (= ~E_M~0 ~M_E~0))) (.cse23 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse24 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse21 (and .cse32 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse25 (not (<= ~c_dr_pc~0 1))) (.cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse10 (not (= ~T1_E~0 ~M_E~0))) (.cse11 (not (= ~m_st~0 0))) (.cse26 (not (<= 2 |old(~q_write_ev~0)|))) (.cse27 (not (<= 1 ~c_dr_pc~0))) (.cse13 (not (= ~p_dw_i~0 1))) (.cse14 (not (= ~q_free~0 1))) (.cse15 (not (<= ~q_req_up~0 0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (<= 2 ~E_1~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 (not .cse2) .cse3 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse21 .cse22 .cse10 .cse11 .cse13 .cse17 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse23 .cse5 .cse7 .cse24 .cse21 .cse25 .cse2 .cse10 .cse11 .cse26 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse23 .cse5 .cse7 .cse24 .cse21 .cse25 .cse2 .cse10 .cse11 .cse26 .cse28 .cse27 .cse13 .cse14 .cse16 .cse17 .cse19) (or .cse1 .cse3 .cse29 .cse4 .cse5 .cse30 .cse7 .cse21 .cse22 .cse25 .cse2 .cse9 .cse10 .cse11 .cse12 .cse31 .cse27 .cse13 .cse15 .cse17 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse5 .cse7 .cse22 .cse25 .cse2 .cse9 .cse10 .cse11 .cse12 .cse31 .cse13 .cse15 .cse17 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse6 .cse7 .cse21 .cse8 .cse2 .cse9 .cse10 .cse28 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse14 .cse16) (or .cse20 .cse1 .cse3 .cse29 .cse4 .cse5 .cse30 .cse7 .cse21 .cse22 .cse25 .cse2 .cse9 .cse10 .cse11 .cse12 .cse13 (= |old(~q_write_ev~0)| 0) .cse15 .cse17 .cse19) (or .cse20 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse23 .cse5 .cse7 .cse24 .cse21 .cse25 .cse9 .cse10 .cse11 (not (= |old(~q_read_ev~0)| 1)) .cse26 .cse27 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19)))) [2021-12-06 21:00:32,800 INFO L858 garLoopResultBuilder]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2021-12-06 21:00:32,800 INFO L858 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 297 314) no Hoare annotation was computed. [2021-12-06 21:00:32,800 INFO L858 garLoopResultBuilder]: For program point L768-1(lines 762 785) no Hoare annotation was computed. [2021-12-06 21:00:32,801 INFO L858 garLoopResultBuilder]: For program point L763-1(lines 762 785) no Hoare annotation was computed. [2021-12-06 21:00:32,801 INFO L858 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 759 786) no Hoare annotation was computed. [2021-12-06 21:00:32,801 INFO L854 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 759 786) the Hoare annotation is: (let ((.cse14 (not (= ~m_st~0 0))) (.cse6 (= ~t1_st~0 0)) (.cse15 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0)))) (.cse18 (not (<= ~t1_pc~0 0))) (.cse19 (not (<= 2 ~m_st~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse5 (not (<= 2 |old(~T1_E~0)|))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (<= 2 |old(~E_1~0)|))) (.cse9 (not (= ~c_num_read~0 0))) (.cse10 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse11 (not (= ~q_free~0 0))) (.cse12 (not (<= 2 |old(~E_M~0)|))) (.cse13 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse3 .cse18 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (< ~local~0 ~token~0)) .cse12 .cse13 .cse14 .cse16 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16) (or .cse19 .cse1 .cse3 .cse4 .cse7 .cse9 .cse10 .cse11 .cse13 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0))) .cse15 .cse16) (or .cse19 .cse0 .cse1 .cse3 .cse18 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17))) [2021-12-06 21:00:32,801 INFO L858 garLoopResultBuilder]: For program point L778-1(lines 759 786) no Hoare annotation was computed. [2021-12-06 21:00:32,801 INFO L858 garLoopResultBuilder]: For program point L773-1(lines 762 785) no Hoare annotation was computed. [2021-12-06 21:00:32,803 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:00:32,804 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 21:00:32,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 09:00:32 BoogieIcfgContainer [2021-12-06 21:00:32,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 21:00:32,877 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 21:00:32,877 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 21:00:32,878 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 21:00:32,878 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:58:47" (3/4) ... [2021-12-06 21:00:32,880 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-06 21:00:32,885 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2021-12-06 21:00:32,885 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2021-12-06 21:00:32,885 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2021-12-06 21:00:32,885 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2021-12-06 21:00:32,885 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2021-12-06 21:00:32,885 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2021-12-06 21:00:32,885 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2021-12-06 21:00:32,885 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2021-12-06 21:00:32,885 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2021-12-06 21:00:32,885 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2021-12-06 21:00:32,886 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2021-12-06 21:00:32,886 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2021-12-06 21:00:32,886 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2021-12-06 21:00:32,886 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2021-12-06 21:00:32,894 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2021-12-06 21:00:32,895 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-06 21:00:32,896 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-06 21:00:32,897 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-06 21:00:32,915 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(\old(q_req_up) == 1)) || !(p_num_write <= c_num_read + 1)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || (q_req_up <= 0 && q_write_ev == \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) [2021-12-06 21:00:32,916 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write)) [2021-12-06 21:00:32,916 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) [2021-12-06 21:00:32,918 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((T1_E == M_E || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) && ((((((((((((((((((((p_num_write == 0 && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || (T1_E == M_E && E_M == M_E)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((((((p_num_write == 0 && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && !(t1_st == 0))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local)) [2021-12-06 21:00:32,918 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((p_num_write == 0 && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write)) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local))) && (((((((((((((((((((((((((p_num_write == 0 && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((T1_E == M_E || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (T1_E == M_E && E_M == M_E)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && !(t1_st == 0)) && 0 <= \result)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(token == local)) [2021-12-06 21:00:32,983 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 21:00:32,983 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 21:00:32,984 INFO L158 Benchmark]: Toolchain (without parser) took 105764.22ms. Allocated memory was 107.0MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 71.4MB in the beginning and 970.6MB in the end (delta: -899.2MB). Peak memory consumption was 975.0MB. Max. memory is 16.1GB. [2021-12-06 21:00:32,984 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 21:00:32,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.20ms. Allocated memory is still 107.0MB. Free memory was 71.2MB in the beginning and 78.9MB in the end (delta: -7.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-06 21:00:32,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.10ms. Allocated memory is still 107.0MB. Free memory was 78.9MB in the beginning and 76.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 21:00:32,985 INFO L158 Benchmark]: Boogie Preprocessor took 27.23ms. Allocated memory is still 107.0MB. Free memory was 76.0MB in the beginning and 73.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 21:00:32,985 INFO L158 Benchmark]: RCFGBuilder took 417.29ms. Allocated memory is still 107.0MB. Free memory was 73.9MB in the beginning and 51.7MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-06 21:00:32,985 INFO L158 Benchmark]: TraceAbstraction took 104900.72ms. Allocated memory was 107.0MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 51.3MB in the beginning and 991.6MB in the end (delta: -940.3MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2021-12-06 21:00:32,985 INFO L158 Benchmark]: Witness Printer took 105.87ms. Allocated memory is still 2.0GB. Free memory was 991.6MB in the beginning and 970.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-12-06 21:00:32,987 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.14ms. Allocated memory is still 107.0MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.20ms. Allocated memory is still 107.0MB. Free memory was 71.2MB in the beginning and 78.9MB in the end (delta: -7.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.10ms. Allocated memory is still 107.0MB. Free memory was 78.9MB in the beginning and 76.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.23ms. Allocated memory is still 107.0MB. Free memory was 76.0MB in the beginning and 73.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 417.29ms. Allocated memory is still 107.0MB. Free memory was 73.9MB in the beginning and 51.7MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 104900.72ms. Allocated memory was 107.0MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 51.3MB in the beginning and 991.6MB in the end (delta: -940.3MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 105.87ms. Allocated memory is still 2.0GB. Free memory was 991.6MB in the beginning and 970.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. 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: 496]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 28]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 208 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 104.8s, OverallIterations: 35, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 62.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18063 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17614 mSDsluCounter, 29165 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18884 mSDsCounter, 4380 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15322 IncrementalHoareTripleChecker+Invalid, 19702 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4380 mSolverCounterUnsat, 10281 mSDtfsCounter, 15322 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3758 GetRequests, 3283 SyntacticMatches, 9 SemanticMatches, 466 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1465 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15051occurred in iteration=18, InterpolantAutomatonStates: 411, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 10070 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 17669 PreInvPairs, 19898 NumberOfFragments, 27648 HoareAnnotationTreeSize, 17669 FomulaSimplifications, 9116 FormulaSimplificationTreeSizeReduction, 15.6s HoareSimplificationTime, 84 FomulaSimplificationsInter, 1174458 FormulaSimplificationTreeSizeReductionInter, 46.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 5734 NumberOfCodeBlocks, 5734 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 6171 ConstructedInterpolants, 0 QuantifiedInterpolants, 11553 SizeOfPredicates, 7 NumberOfNonLiveVariables, 6631 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 52 InterpolantComputations, 32 PerfectInterpolantSequences, 3229/3363 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 889]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 686]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) || ((((((((((p_num_write == 0 && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 642]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_st == 0) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2) || ((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_st == 0) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token) || ((((((((((p_num_write == 0 && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || (((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) - InvariantResult [Line: 615]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((p_num_write == 0 && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write)) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local))) && (((((((((((((((((((((((((p_num_write == 0 && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((T1_E == M_E || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (T1_E == M_E && E_M == M_E)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && !(t1_st == 0)) && 0 <= \result)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 1) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2 - InvariantResult [Line: 680]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) || ((((((((((p_num_write == 0 && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: (((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_st == 0) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(E_M == M_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) && (((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(E_M == M_E)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || q_write_ev == 0) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || (q_read_ev == 1 && c_dr_pc == p_dw_pc)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || ((c_dr_pc == p_dw_pc && __retres1 <= 0) && 0 <= __retres1)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (!(1 < m_pc) && !(m_pc <= 0))) || !(q_free == 1)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 516]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 823]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) || ((((((((((p_num_write == 0 && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local) - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) - InvariantResult [Line: 663]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((((((c_dr_st == 0 || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && __retres1 <= 0) && c_dr_pc == p_dw_pc) && 0 <= __retres1) && E_M == M_E) && M_E == 2)) || !(m_pc == t1_pc)) || !(q_read_ev == 1)) || !(M_E == 2)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(E_M == M_E)) || !(t1_pc <= 0)) || 0 < q_write_ev) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || q_write_ev == 0) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (__retres1 <= 0 && 0 <= __retres1)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(q_free == 1)) || !(c_last_read == p_last_write))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(E_M == M_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((((c_dr_st == 0 || (((((((((T1_E == M_E && (1 < m_pc || m_pc <= 0)) && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && __retres1 <= 0) && c_dr_pc == p_dw_pc) && 0 <= __retres1) && E_M == M_E) && M_E == 2)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1) || (((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2) - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) || ((((((((((p_num_write == 0 && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 832]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) || ((((((((((p_num_write == 0 && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((T1_E == M_E || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) && ((((((((((((((((((((p_num_write == 0 && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || (T1_E == M_E && E_M == M_E)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((((((p_num_write == 0 && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && !(t1_st == 0))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2) || ((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) || (((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && t1_pc <= 0) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && t1_pc <= 0) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: M_E == 2 - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 1) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2) || (((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 901]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) || ((((((((((p_num_write == 0 && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(\old(q_req_up) == 1)) || !(p_num_write <= c_num_read + 1)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || (q_req_up <= 0 && q_write_ev == \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) || ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) && 1 <= q_read_ev) || (((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2)) || (((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && t1_pc <= 0) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 473]: Loop Invariant Derived loop invariant: M_E == 2 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && t1_pc <= 0) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2)) || (((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token) - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (!(1 < m_pc) && !(m_pc <= 0))) || !(c_last_read == p_last_write)) - InvariantResult [Line: 948]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) || (((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) || ((((((((((p_num_write == 0 && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_st == 0) && c_last_read == p_last_write)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || 1 <= __retres1) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(q_req_up == 1)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || ((q_write_ev == q_read_ev && !(c_dr_st == 0)) && q_read_ev == 2)) || !(p_dw_i == 1)) || 1 <= __retres1) || !(1 <= p_num_write)) || !(1 <= q_read_ev)) || !(2 <= E_1)) || !(p_num_write <= 1)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(E_M == M_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc <= 1)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(E_M == M_E)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((!(m_pc == t1_pc) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(E_M == M_E)) || !(c_dr_st == 0)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) || (((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && c_last_read == p_last_write) && E_M == M_E) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == M_E) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && E_M == M_E) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 1 <= c_dr_pc) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && E_M == M_E) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: (((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && (1 <= t1_pc || 0 < m_pc)) && p_dw_st == 0) && c_last_read == p_last_write) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local) RESULT: Ultimate proved your program to be correct! [2021-12-06 21:00:33,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4a9a2af4-7b21-4f84-bd51-9b07cc5b0229/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE