./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 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/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_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y --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.1-dev-63182f1 [2021-11-13 18:52:48,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 18:52:48,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 18:52:48,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 18:52:48,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 18:52:48,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 18:52:48,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 18:52:48,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 18:52:48,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 18:52:48,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 18:52:48,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 18:52:48,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 18:52:48,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 18:52:48,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 18:52:48,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 18:52:48,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 18:52:48,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 18:52:48,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 18:52:48,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 18:52:48,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 18:52:48,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 18:52:48,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 18:52:48,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 18:52:48,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 18:52:48,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 18:52:48,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 18:52:48,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 18:52:48,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 18:52:48,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 18:52:48,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 18:52:48,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 18:52:48,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 18:52:48,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 18:52:48,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 18:52:48,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 18:52:48,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 18:52:48,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 18:52:48,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 18:52:48,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 18:52:48,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 18:52:48,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 18:52:48,577 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-13 18:52:48,635 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 18:52:48,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 18:52:48,636 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-13 18:52:48,637 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-13 18:52:48,638 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-13 18:52:48,638 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-13 18:52:48,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-13 18:52:48,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-13 18:52:48,640 INFO L138 SettingsManager]: * Use SBE=true [2021-11-13 18:52:48,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 18:52:48,642 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 18:52:48,642 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-13 18:52:48,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 18:52:48,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 18:52:48,643 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-13 18:52:48,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-13 18:52:48,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-13 18:52:48,644 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 18:52:48,644 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-13 18:52:48,644 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 18:52:48,645 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-13 18:52:48,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 18:52:48,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-13 18:52:48,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-13 18:52:48,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 18:52:48,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 18:52:48,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-13 18:52:48,647 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-13 18:52:48,647 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-13 18:52:48,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-13 18:52:48,650 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-13 18:52:48,650 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-13 18:52:48,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-13 18:52:48,651 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-13 18:52:48,651 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_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/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_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y 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-11-13 18:52:48,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 18:52:48,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 18:52:48,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 18:52:48,991 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 18:52:48,992 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 18:52:48,994 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2021-11-13 18:52:49,095 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/data/c79474401/17c244b0379f4559aa1b880d4445ca70/FLAGd3b08dfd3 [2021-11-13 18:52:49,730 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 18:52:49,739 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2021-11-13 18:52:49,758 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/data/c79474401/17c244b0379f4559aa1b880d4445ca70/FLAGd3b08dfd3 [2021-11-13 18:52:50,033 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/data/c79474401/17c244b0379f4559aa1b880d4445ca70 [2021-11-13 18:52:50,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 18:52:50,041 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-13 18:52:50,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 18:52:50,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 18:52:50,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 18:52:50,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 06:52:50" (1/1) ... [2021-11-13 18:52:50,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e50cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:52:50, skipping insertion in model container [2021-11-13 18:52:50,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 06:52:50" (1/1) ... [2021-11-13 18:52:50,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 18:52:50,123 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 18:52:50,340 WARN L228 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_e287c0ae-3c7a-4307-b187-05416632f434/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2021-11-13 18:52:50,399 WARN L228 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_e287c0ae-3c7a-4307-b187-05416632f434/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2021-11-13 18:52:50,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 18:52:50,444 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 18:52:50,458 WARN L228 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_e287c0ae-3c7a-4307-b187-05416632f434/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2021-11-13 18:52:50,484 WARN L228 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_e287c0ae-3c7a-4307-b187-05416632f434/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2021-11-13 18:52:50,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 18:52:50,530 INFO L208 MainTranslator]: Completed translation [2021-11-13 18:52:50,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:52:50 WrapperNode [2021-11-13 18:52:50,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 18:52:50,532 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-13 18:52:50,532 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-13 18:52:50,532 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-13 18:52:50,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:52:50" (1/1) ... [2021-11-13 18:52:50,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:52:50" (1/1) ... [2021-11-13 18:52:50,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-13 18:52:50,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 18:52:50,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 18:52:50,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 18:52:50,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:52:50" (1/1) ... [2021-11-13 18:52:50,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:52:50" (1/1) ... [2021-11-13 18:52:50,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:52:50" (1/1) ... [2021-11-13 18:52:50,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:52:50" (1/1) ... [2021-11-13 18:52:50,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:52:50" (1/1) ... [2021-11-13 18:52:50,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:52:50" (1/1) ... [2021-11-13 18:52:50,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:52:50" (1/1) ... [2021-11-13 18:52:50,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 18:52:50,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 18:52:50,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 18:52:50,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 18:52:50,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:52:50" (1/1) ... [2021-11-13 18:52:50,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 18:52:50,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:52:50,738 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-13 18:52:50,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-13 18:52:50,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 18:52:50,815 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-11-13 18:52:50,815 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-11-13 18:52:50,816 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-11-13 18:52:50,817 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-11-13 18:52:50,818 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-11-13 18:52:50,818 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-11-13 18:52:50,818 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-11-13 18:52:50,818 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-11-13 18:52:50,818 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-11-13 18:52:50,819 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-11-13 18:52:50,819 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-11-13 18:52:50,819 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-11-13 18:52:50,819 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-11-13 18:52:50,819 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-11-13 18:52:50,819 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-11-13 18:52:50,819 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-11-13 18:52:50,820 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-11-13 18:52:50,820 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-11-13 18:52:50,820 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-11-13 18:52:50,820 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-11-13 18:52:50,820 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-11-13 18:52:50,820 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-11-13 18:52:50,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-13 18:52:50,821 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-11-13 18:52:50,821 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-11-13 18:52:50,821 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-11-13 18:52:50,821 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-11-13 18:52:50,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 18:52:50,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 18:52:50,822 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-11-13 18:52:50,822 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-11-13 18:52:51,574 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 18:52:51,578 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-11-13 18:52:51,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:52:51 BoogieIcfgContainer [2021-11-13 18:52:51,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 18:52:51,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-13 18:52:51,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-13 18:52:51,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-13 18:52:51,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 06:52:50" (1/3) ... [2021-11-13 18:52:51,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31779c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 06:52:51, skipping insertion in model container [2021-11-13 18:52:51,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:52:50" (2/3) ... [2021-11-13 18:52:51,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31779c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 06:52:51, skipping insertion in model container [2021-11-13 18:52:51,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:52:51" (3/3) ... [2021-11-13 18:52:51,594 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2021-11-13 18:52:51,600 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-13 18:52:51,600 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-13 18:52:51,658 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-13 18:52:51,666 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-11-13 18:52:51,666 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-13 18:52:51,716 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-11-13 18:52:51,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-13 18:52:51,729 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:52:51,730 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-11-13 18:52:51,731 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:52:51,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:52:51,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1497674214, now seen corresponding path program 1 times [2021-11-13 18:52:51,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:52:51,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219053103] [2021-11-13 18:52:51,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:52:51,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:52:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:52,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:52:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:52,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 18:52:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:52,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 18:52:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:52,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 18:52:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:52,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 18:52:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:52:52,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:52:52,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219053103] [2021-11-13 18:52:52,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219053103] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:52:52,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:52:52,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 18:52:52,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953158060] [2021-11-13 18:52:52,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:52:52,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 18:52:52,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:52:52,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 18:52:52,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-13 18:52:52,351 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-11-13 18:52:53,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:52:53,286 INFO L93 Difference]: Finished difference Result 414 states and 616 transitions. [2021-11-13 18:52:53,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 18:52:53,290 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-11-13 18:52:53,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:52:53,320 INFO L225 Difference]: With dead ends: 414 [2021-11-13 18:52:53,320 INFO L226 Difference]: Without dead ends: 218 [2021-11-13 18:52:53,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-13 18:52:53,339 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 428 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 508.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 32.98ms SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 629.43ms IncrementalHoareTripleChecker+Time [2021-11-13 18:52:53,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [447 Valid, 615 Invalid, 454 Unknown, 0 Unchecked, 32.98ms Time], IncrementalHoareTripleChecker [82 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 629.43ms Time] [2021-11-13 18:52:53,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-11-13 18:52:53,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 198. [2021-11-13 18:52:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 154 states have (on average 1.422077922077922) internal successors, (219), 158 states have internal predecessors, (219), 29 states have call successors, (29), 14 states have call predecessors, (29), 13 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2021-11-13 18:52:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 275 transitions. [2021-11-13 18:52:53,423 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 275 transitions. Word has length 57 [2021-11-13 18:52:53,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:52:53,423 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 275 transitions. [2021-11-13 18:52:53,424 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-11-13 18:52:53,424 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 275 transitions. [2021-11-13 18:52:53,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-13 18:52:53,429 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:52:53,429 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-11-13 18:52:53,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-13 18:52:53,430 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:52:53,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:52:53,431 INFO L85 PathProgramCache]: Analyzing trace with hash -604187876, now seen corresponding path program 1 times [2021-11-13 18:52:53,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:52:53,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227036736] [2021-11-13 18:52:53,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:52:53,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:52:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:53,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:52:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:53,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 18:52:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:53,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 18:52:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:53,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 18:52:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:53,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 18:52:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:52:53,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:52:53,624 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227036736] [2021-11-13 18:52:53,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227036736] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:52:53,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:52:53,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 18:52:53,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628508324] [2021-11-13 18:52:53,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:52:53,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 18:52:53,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:52:53,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 18:52:53,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-13 18:52:53,629 INFO L87 Difference]: Start difference. First operand 198 states and 275 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-11-13 18:52:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:52:54,285 INFO L93 Difference]: Finished difference Result 314 states and 446 transitions. [2021-11-13 18:52:54,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 18:52:54,286 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-11-13 18:52:54,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:52:54,290 INFO L225 Difference]: With dead ends: 314 [2021-11-13 18:52:54,290 INFO L226 Difference]: Without dead ends: 221 [2021-11-13 18:52:54,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-11-13 18:52:54,293 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 512 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 427.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.04ms SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 523.17ms IncrementalHoareTripleChecker+Time [2021-11-13 18:52:54,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [531 Valid, 591 Invalid, 491 Unknown, 0 Unchecked, 16.04ms Time], IncrementalHoareTripleChecker [118 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 523.17ms Time] [2021-11-13 18:52:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-11-13 18:52:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 198. [2021-11-13 18:52:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 154 states have (on average 1.4155844155844155) internal successors, (218), 158 states have internal predecessors, (218), 29 states have call successors, (29), 14 states have call predecessors, (29), 13 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2021-11-13 18:52:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 274 transitions. [2021-11-13 18:52:54,347 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 274 transitions. Word has length 57 [2021-11-13 18:52:54,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:52:54,347 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 274 transitions. [2021-11-13 18:52:54,348 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-11-13 18:52:54,348 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 274 transitions. [2021-11-13 18:52:54,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-13 18:52:54,351 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:52:54,352 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-11-13 18:52:54,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-13 18:52:54,352 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:52:54,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:52:54,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1641391578, now seen corresponding path program 1 times [2021-11-13 18:52:54,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:52:54,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029925304] [2021-11-13 18:52:54,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:52:54,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:52:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:54,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:52:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:54,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 18:52:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:54,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 18:52:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:54,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 18:52:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:54,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 18:52:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:52:54,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:52:54,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029925304] [2021-11-13 18:52:54,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029925304] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:52:54,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:52:54,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 18:52:54,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547766222] [2021-11-13 18:52:54,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:52:54,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 18:52:54,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:52:54,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 18:52:54,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-13 18:52:54,512 INFO L87 Difference]: Start difference. First operand 198 states and 274 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-11-13 18:52:55,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:52:55,079 INFO L93 Difference]: Finished difference Result 312 states and 440 transitions. [2021-11-13 18:52:55,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 18:52:55,080 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-11-13 18:52:55,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:52:55,084 INFO L225 Difference]: With dead ends: 312 [2021-11-13 18:52:55,084 INFO L226 Difference]: Without dead ends: 219 [2021-11-13 18:52:55,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-11-13 18:52:55,087 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 508 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 350.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.05ms SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 440.10ms IncrementalHoareTripleChecker+Time [2021-11-13 18:52:55,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [527 Valid, 584 Invalid, 482 Unknown, 0 Unchecked, 12.05ms Time], IncrementalHoareTripleChecker [122 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 440.10ms Time] [2021-11-13 18:52:55,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-11-13 18:52:55,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 198. [2021-11-13 18:52:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 154 states have (on average 1.4090909090909092) internal successors, (217), 158 states have internal predecessors, (217), 29 states have call successors, (29), 14 states have call predecessors, (29), 13 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2021-11-13 18:52:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 273 transitions. [2021-11-13 18:52:55,124 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 273 transitions. Word has length 57 [2021-11-13 18:52:55,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:52:55,125 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 273 transitions. [2021-11-13 18:52:55,125 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-11-13 18:52:55,126 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 273 transitions. [2021-11-13 18:52:55,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-13 18:52:55,129 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:52:55,130 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-11-13 18:52:55,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-13 18:52:55,130 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:52:55,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:52:55,131 INFO L85 PathProgramCache]: Analyzing trace with hash 743998300, now seen corresponding path program 1 times [2021-11-13 18:52:55,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:52:55,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877991965] [2021-11-13 18:52:55,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:52:55,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:52:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:55,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:52:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:55,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 18:52:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:55,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 18:52:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:55,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 18:52:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:55,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 18:52:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:52:55,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:52:55,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877991965] [2021-11-13 18:52:55,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877991965] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:52:55,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:52:55,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 18:52:55,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106343622] [2021-11-13 18:52:55,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:52:55,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 18:52:55,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:52:55,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 18:52:55,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-13 18:52:55,301 INFO L87 Difference]: Start difference. First operand 198 states and 273 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-11-13 18:52:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:52:56,023 INFO L93 Difference]: Finished difference Result 324 states and 464 transitions. [2021-11-13 18:52:56,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-13 18:52:56,025 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-11-13 18:52:56,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:52:56,028 INFO L225 Difference]: With dead ends: 324 [2021-11-13 18:52:56,028 INFO L226 Difference]: Without dead ends: 232 [2021-11-13 18:52:56,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-13 18:52:56,032 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 262 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 405.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.38ms SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 495.78ms IncrementalHoareTripleChecker+Time [2021-11-13 18:52:56,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 1025 Invalid, 544 Unknown, 0 Unchecked, 14.38ms Time], IncrementalHoareTripleChecker [68 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 495.78ms Time] [2021-11-13 18:52:56,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-11-13 18:52:56,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 201. [2021-11-13 18:52:56,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 157 states have (on average 1.4012738853503184) internal successors, (220), 161 states have internal predecessors, (220), 29 states have call successors, (29), 14 states have call predecessors, (29), 13 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2021-11-13 18:52:56,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 276 transitions. [2021-11-13 18:52:56,068 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 276 transitions. Word has length 57 [2021-11-13 18:52:56,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:52:56,069 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 276 transitions. [2021-11-13 18:52:56,069 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-11-13 18:52:56,070 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 276 transitions. [2021-11-13 18:52:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-13 18:52:56,073 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:52:56,073 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-11-13 18:52:56,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-13 18:52:56,074 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:52:56,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:52:56,075 INFO L85 PathProgramCache]: Analyzing trace with hash 671611742, now seen corresponding path program 1 times [2021-11-13 18:52:56,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:52:56,075 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446989678] [2021-11-13 18:52:56,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:52:56,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:52:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:56,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:52:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:56,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 18:52:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:56,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 18:52:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:56,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 18:52:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:56,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 18:52:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:52:56,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:52:56,222 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446989678] [2021-11-13 18:52:56,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446989678] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:52:56,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:52:56,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 18:52:56,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229246636] [2021-11-13 18:52:56,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:52:56,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 18:52:56,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:52:56,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 18:52:56,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-13 18:52:56,225 INFO L87 Difference]: Start difference. First operand 201 states and 276 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-11-13 18:52:57,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:52:57,593 INFO L93 Difference]: Finished difference Result 596 states and 864 transitions. [2021-11-13 18:52:57,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-13 18:52:57,594 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-11-13 18:52:57,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:52:57,600 INFO L225 Difference]: With dead ends: 596 [2021-11-13 18:52:57,600 INFO L226 Difference]: Without dead ends: 501 [2021-11-13 18:52:57,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-11-13 18:52:57,603 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 989 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 848.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.48ms SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1054.09ms IncrementalHoareTripleChecker+Time [2021-11-13 18:52:57,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1013 Valid, 968 Invalid, 999 Unknown, 0 Unchecked, 19.48ms Time], IncrementalHoareTripleChecker [296 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 1054.09ms Time] [2021-11-13 18:52:57,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-11-13 18:52:57,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 440. [2021-11-13 18:52:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 347 states have (on average 1.3717579250720462) internal successors, (476), 354 states have internal predecessors, (476), 60 states have call successors, (60), 32 states have call predecessors, (60), 31 states have return successors, (72), 55 states have call predecessors, (72), 58 states have call successors, (72) [2021-11-13 18:52:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 608 transitions. [2021-11-13 18:52:57,680 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 608 transitions. Word has length 57 [2021-11-13 18:52:57,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:52:57,682 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 608 transitions. [2021-11-13 18:52:57,683 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-11-13 18:52:57,683 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 608 transitions. [2021-11-13 18:52:57,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-13 18:52:57,691 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:52:57,691 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-11-13 18:52:57,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-13 18:52:57,692 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:52:57,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:52:57,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1385451018, now seen corresponding path program 1 times [2021-11-13 18:52:57,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:52:57,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622728963] [2021-11-13 18:52:57,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:52:57,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:52:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:57,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:52:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:57,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-13 18:52:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:57,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-13 18:52:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:57,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:52:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:57,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:52:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:57,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-13 18:52:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:57,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-13 18:52:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:52:57,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:52:57,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622728963] [2021-11-13 18:52:57,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622728963] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:52:57,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:52:57,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-13 18:52:57,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145621398] [2021-11-13 18:52:57,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:52:57,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-13 18:52:57,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:52:57,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-13 18:52:57,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-13 18:52:57,827 INFO L87 Difference]: Start difference. First operand 440 states and 608 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-11-13 18:52:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:52:58,664 INFO L93 Difference]: Finished difference Result 663 states and 923 transitions. [2021-11-13 18:52:58,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-13 18:52:58,665 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-11-13 18:52:58,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:52:58,671 INFO L225 Difference]: With dead ends: 663 [2021-11-13 18:52:58,671 INFO L226 Difference]: Without dead ends: 575 [2021-11-13 18:52:58,672 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-11-13 18:52:58,673 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 658 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 509.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.25ms SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 618.12ms IncrementalHoareTripleChecker+Time [2021-11-13 18:52:58,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [663 Valid, 813 Invalid, 699 Unknown, 0 Unchecked, 13.25ms Time], IncrementalHoareTripleChecker [208 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 618.12ms Time] [2021-11-13 18:52:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-11-13 18:52:58,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 536. [2021-11-13 18:52:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 423 states have (on average 1.3735224586288417) internal successors, (581), 432 states have internal predecessors, (581), 71 states have call successors, (71), 39 states have call predecessors, (71), 40 states have return successors, (88), 67 states have call predecessors, (88), 69 states have call successors, (88) [2021-11-13 18:52:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 740 transitions. [2021-11-13 18:52:58,742 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 740 transitions. Word has length 65 [2021-11-13 18:52:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:52:58,742 INFO L470 AbstractCegarLoop]: Abstraction has 536 states and 740 transitions. [2021-11-13 18:52:58,743 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-11-13 18:52:58,743 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 740 transitions. [2021-11-13 18:52:58,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-13 18:52:58,744 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:52:58,745 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-11-13 18:52:58,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-13 18:52:58,745 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:52:58,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:52:58,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1789236969, now seen corresponding path program 1 times [2021-11-13 18:52:58,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:52:58,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880855010] [2021-11-13 18:52:58,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:52:58,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:52:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:58,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:52:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:58,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-13 18:52:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:58,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-13 18:52:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:58,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:52:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:58,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:52:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:58,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-13 18:52:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:58,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-13 18:52:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:52:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:52:58,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:52:58,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880855010] [2021-11-13 18:52:58,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880855010] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:52:58,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:52:58,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-13 18:52:58,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189181391] [2021-11-13 18:52:58,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:52:58,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-13 18:52:58,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:52:58,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-13 18:52:58,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-13 18:52:58,906 INFO L87 Difference]: Start difference. First operand 536 states and 740 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-11-13 18:52:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:52:59,942 INFO L93 Difference]: Finished difference Result 883 states and 1217 transitions. [2021-11-13 18:52:59,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-13 18:52:59,942 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-11-13 18:52:59,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:52:59,949 INFO L225 Difference]: With dead ends: 883 [2021-11-13 18:52:59,949 INFO L226 Difference]: Without dead ends: 706 [2021-11-13 18:52:59,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-11-13 18:52:59,953 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 563 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 637.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.22ms SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 754.92ms IncrementalHoareTripleChecker+Time [2021-11-13 18:52:59,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [583 Valid, 1254 Invalid, 891 Unknown, 0 Unchecked, 17.22ms Time], IncrementalHoareTripleChecker [120 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 754.92ms Time] [2021-11-13 18:52:59,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2021-11-13 18:53:00,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 632. [2021-11-13 18:53:00,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 499 states have (on average 1.3727454909819639) internal successors, (685), 510 states have internal predecessors, (685), 82 states have call successors, (82), 46 states have call predecessors, (82), 49 states have return successors, (107), 79 states have call predecessors, (107), 80 states have call successors, (107) [2021-11-13 18:53:00,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 874 transitions. [2021-11-13 18:53:00,057 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 874 transitions. Word has length 65 [2021-11-13 18:53:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:00,058 INFO L470 AbstractCegarLoop]: Abstraction has 632 states and 874 transitions. [2021-11-13 18:53:00,058 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-11-13 18:53:00,058 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 874 transitions. [2021-11-13 18:53:00,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-13 18:53:00,061 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:00,061 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-11-13 18:53:00,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-13 18:53:00,061 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:00,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:00,062 INFO L85 PathProgramCache]: Analyzing trace with hash -239349141, now seen corresponding path program 1 times [2021-11-13 18:53:00,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:00,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227615436] [2021-11-13 18:53:00,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:00,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:00,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:00,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-13 18:53:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:00,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-13 18:53:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:00,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:00,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:00,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-13 18:53:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:00,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-13 18:53:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:00,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:53:00,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:00,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227615436] [2021-11-13 18:53:00,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227615436] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:00,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:53:00,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-13 18:53:00,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958661563] [2021-11-13 18:53:00,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:00,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-13 18:53:00,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:00,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 18:53:00,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-13 18:53:00,298 INFO L87 Difference]: Start difference. First operand 632 states and 874 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-11-13 18:53:01,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:01,025 INFO L93 Difference]: Finished difference Result 933 states and 1288 transitions. [2021-11-13 18:53:01,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-13 18:53:01,026 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-11-13 18:53:01,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:01,031 INFO L225 Difference]: With dead ends: 933 [2021-11-13 18:53:01,031 INFO L226 Difference]: Without dead ends: 666 [2021-11-13 18:53:01,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-11-13 18:53:01,037 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 299 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 422.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 21.50ms SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 505.25ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:01,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 1209 Invalid, 650 Unknown, 0 Unchecked, 21.50ms Time], IncrementalHoareTripleChecker [108 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 505.25ms Time] [2021-11-13 18:53:01,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-11-13 18:53:01,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 637. [2021-11-13 18:53:01,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 503 states have (on average 1.3658051689860835) internal successors, (687), 514 states have internal predecessors, (687), 82 states have call successors, (82), 46 states have call predecessors, (82), 50 states have return successors, (108), 80 states have call predecessors, (108), 80 states have call successors, (108) [2021-11-13 18:53:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 877 transitions. [2021-11-13 18:53:01,116 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 877 transitions. Word has length 65 [2021-11-13 18:53:01,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:01,117 INFO L470 AbstractCegarLoop]: Abstraction has 637 states and 877 transitions. [2021-11-13 18:53:01,117 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-11-13 18:53:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 877 transitions. [2021-11-13 18:53:01,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-13 18:53:01,123 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:01,123 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-11-13 18:53:01,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-13 18:53:01,131 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:01,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:01,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1268708439, now seen corresponding path program 1 times [2021-11-13 18:53:01,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:01,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631756222] [2021-11-13 18:53:01,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:01,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:01,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:01,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-13 18:53:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:01,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-13 18:53:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:01,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:01,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:01,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-13 18:53:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:01,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-13 18:53:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:53:01,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:01,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631756222] [2021-11-13 18:53:01,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631756222] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:01,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:53:01,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-13 18:53:01,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76380051] [2021-11-13 18:53:01,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:01,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-13 18:53:01,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:01,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 18:53:01,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-13 18:53:01,352 INFO L87 Difference]: Start difference. First operand 637 states and 877 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-11-13 18:53:03,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:03,650 INFO L93 Difference]: Finished difference Result 2299 states and 3149 transitions. [2021-11-13 18:53:03,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-13 18:53:03,651 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-11-13 18:53:03,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:03,667 INFO L225 Difference]: With dead ends: 2299 [2021-11-13 18:53:03,668 INFO L226 Difference]: Without dead ends: 2027 [2021-11-13 18:53:03,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2021-11-13 18:53:03,674 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 1242 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1287.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 26.20ms SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1527.10ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:03,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1259 Valid, 1616 Invalid, 1725 Unknown, 0 Unchecked, 26.20ms Time], IncrementalHoareTripleChecker [414 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 1527.10ms Time] [2021-11-13 18:53:03,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2021-11-13 18:53:03,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1777. [2021-11-13 18:53:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1403 states have (on average 1.331432644333571) internal successors, (1868), 1434 states have internal predecessors, (1868), 199 states have call successors, (199), 148 states have call predecessors, (199), 173 states have return successors, (294), 198 states have call predecessors, (294), 197 states have call successors, (294) [2021-11-13 18:53:03,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2361 transitions. [2021-11-13 18:53:03,914 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2361 transitions. Word has length 65 [2021-11-13 18:53:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:03,915 INFO L470 AbstractCegarLoop]: Abstraction has 1777 states and 2361 transitions. [2021-11-13 18:53:03,916 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-11-13 18:53:03,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2361 transitions. [2021-11-13 18:53:03,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-13 18:53:03,923 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:03,923 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-11-13 18:53:03,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-13 18:53:03,924 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:03,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:03,924 INFO L85 PathProgramCache]: Analyzing trace with hash -217259350, now seen corresponding path program 1 times [2021-11-13 18:53:03,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:03,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311108423] [2021-11-13 18:53:03,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:03,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:03,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:03,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-13 18:53:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:03,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-13 18:53:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:04,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:04,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:04,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-13 18:53:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:04,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-13 18:53:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:53:04,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:04,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311108423] [2021-11-13 18:53:04,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311108423] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:04,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:53:04,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-13 18:53:04,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729880455] [2021-11-13 18:53:04,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:04,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-13 18:53:04,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:04,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 18:53:04,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-13 18:53:04,098 INFO L87 Difference]: Start difference. First operand 1777 states and 2361 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-11-13 18:53:04,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:04,944 INFO L93 Difference]: Finished difference Result 3378 states and 4485 transitions. [2021-11-13 18:53:04,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-13 18:53:04,945 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-11-13 18:53:04,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:04,964 INFO L225 Difference]: With dead ends: 3378 [2021-11-13 18:53:04,964 INFO L226 Difference]: Without dead ends: 1966 [2021-11-13 18:53:04,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-11-13 18:53:04,973 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 202 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 442.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.33ms SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 530.00ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:04,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 1322 Invalid, 666 Unknown, 0 Unchecked, 10.33ms Time], IncrementalHoareTripleChecker [74 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 530.00ms Time] [2021-11-13 18:53:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2021-11-13 18:53:05,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1822. [2021-11-13 18:53:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1439 states have (on average 1.3168867268936761) internal successors, (1895), 1470 states have internal predecessors, (1895), 199 states have call successors, (199), 148 states have call predecessors, (199), 182 states have return successors, (306), 207 states have call predecessors, (306), 197 states have call successors, (306) [2021-11-13 18:53:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2400 transitions. [2021-11-13 18:53:05,203 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2400 transitions. Word has length 65 [2021-11-13 18:53:05,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:05,204 INFO L470 AbstractCegarLoop]: Abstraction has 1822 states and 2400 transitions. [2021-11-13 18:53:05,204 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-11-13 18:53:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2400 transitions. [2021-11-13 18:53:05,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-13 18:53:05,206 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:05,207 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-11-13 18:53:05,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-13 18:53:05,207 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:05,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:05,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1168944044, now seen corresponding path program 1 times [2021-11-13 18:53:05,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:05,209 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053885019] [2021-11-13 18:53:05,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:05,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:05,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:05,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-13 18:53:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:05,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-13 18:53:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:05,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:05,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:05,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-13 18:53:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:05,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-13 18:53:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:53:05,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:05,349 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053885019] [2021-11-13 18:53:05,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053885019] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:05,350 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:53:05,350 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-13 18:53:05,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582285988] [2021-11-13 18:53:05,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:05,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-13 18:53:05,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:05,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-13 18:53:05,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-13 18:53:05,352 INFO L87 Difference]: Start difference. First operand 1822 states and 2400 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-11-13 18:53:06,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:06,358 INFO L93 Difference]: Finished difference Result 3257 states and 4239 transitions. [2021-11-13 18:53:06,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-13 18:53:06,359 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-11-13 18:53:06,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:06,376 INFO L225 Difference]: With dead ends: 3257 [2021-11-13 18:53:06,377 INFO L226 Difference]: Without dead ends: 2020 [2021-11-13 18:53:06,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-11-13 18:53:06,383 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 672 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 539.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.27ms SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 647.41ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:06,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [690 Valid, 850 Invalid, 835 Unknown, 0 Unchecked, 10.27ms Time], IncrementalHoareTripleChecker [180 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 647.41ms Time] [2021-11-13 18:53:06,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2021-11-13 18:53:06,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1800. [2021-11-13 18:53:06,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1425 states have (on average 1.312982456140351) internal successors, (1871), 1450 states have internal predecessors, (1871), 199 states have call successors, (199), 148 states have call predecessors, (199), 174 states have return successors, (290), 205 states have call predecessors, (290), 197 states have call successors, (290) [2021-11-13 18:53:06,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2360 transitions. [2021-11-13 18:53:06,597 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2360 transitions. Word has length 65 [2021-11-13 18:53:06,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:06,597 INFO L470 AbstractCegarLoop]: Abstraction has 1800 states and 2360 transitions. [2021-11-13 18:53:06,597 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-11-13 18:53:06,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2360 transitions. [2021-11-13 18:53:06,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-13 18:53:06,599 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:06,600 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-11-13 18:53:06,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-13 18:53:06,600 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:06,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:06,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1034930538, now seen corresponding path program 1 times [2021-11-13 18:53:06,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:06,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528347580] [2021-11-13 18:53:06,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:06,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:06,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:06,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-13 18:53:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:06,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-13 18:53:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:06,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:06,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:06,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-13 18:53:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:06,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-13 18:53:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:53:06,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:06,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528347580] [2021-11-13 18:53:06,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528347580] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:06,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:53:06,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 18:53:06,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503867038] [2021-11-13 18:53:06,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:06,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 18:53:06,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:06,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 18:53:06,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-13 18:53:06,723 INFO L87 Difference]: Start difference. First operand 1800 states and 2360 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-11-13 18:53:07,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:07,522 INFO L93 Difference]: Finished difference Result 4875 states and 6339 transitions. [2021-11-13 18:53:07,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-13 18:53:07,522 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-11-13 18:53:07,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:07,547 INFO L225 Difference]: With dead ends: 4875 [2021-11-13 18:53:07,548 INFO L226 Difference]: Without dead ends: 3443 [2021-11-13 18:53:07,553 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-11-13 18:53:07,554 INFO L933 BasicCegarLoop]: 249 mSDtfsCounter, 511 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 332.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.08ms SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 395.02ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:07,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 772 Invalid, 467 Unknown, 0 Unchecked, 7.08ms Time], IncrementalHoareTripleChecker [119 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 395.02ms Time] [2021-11-13 18:53:07,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3443 states. [2021-11-13 18:53:07,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3443 to 3171. [2021-11-13 18:53:07,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3171 states, 2491 states have (on average 1.2798073063026896) internal successors, (3188), 2537 states have internal predecessors, (3188), 351 states have call successors, (351), 271 states have call predecessors, (351), 327 states have return successors, (562), 369 states have call predecessors, (562), 349 states have call successors, (562) [2021-11-13 18:53:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3171 states to 3171 states and 4101 transitions. [2021-11-13 18:53:07,898 INFO L78 Accepts]: Start accepts. Automaton has 3171 states and 4101 transitions. Word has length 65 [2021-11-13 18:53:07,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:07,899 INFO L470 AbstractCegarLoop]: Abstraction has 3171 states and 4101 transitions. [2021-11-13 18:53:07,899 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-11-13 18:53:07,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3171 states and 4101 transitions. [2021-11-13 18:53:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-13 18:53:07,902 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:07,902 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-11-13 18:53:07,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-13 18:53:07,903 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:07,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:07,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1593552473, now seen corresponding path program 1 times [2021-11-13 18:53:07,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:07,904 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736633325] [2021-11-13 18:53:07,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:07,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:07,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:07,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-13 18:53:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:07,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-13 18:53:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:07,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:07,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:07,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-13 18:53:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:07,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-13 18:53:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:07,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-11-13 18:53:07,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:07,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736633325] [2021-11-13 18:53:07,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736633325] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:07,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:53:07,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 18:53:07,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231547872] [2021-11-13 18:53:07,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:07,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 18:53:07,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:07,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 18:53:07,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-13 18:53:07,984 INFO L87 Difference]: Start difference. First operand 3171 states and 4101 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-11-13 18:53:08,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:08,871 INFO L93 Difference]: Finished difference Result 8189 states and 10615 transitions. [2021-11-13 18:53:08,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 18:53:08,872 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-11-13 18:53:08,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:08,922 INFO L225 Difference]: With dead ends: 8189 [2021-11-13 18:53:08,922 INFO L226 Difference]: Without dead ends: 5365 [2021-11-13 18:53:08,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-11-13 18:53:08,935 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 373 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 352.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.78ms SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 422.71ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:08,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 795 Invalid, 412 Unknown, 0 Unchecked, 6.78ms Time], IncrementalHoareTripleChecker [109 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 422.71ms Time] [2021-11-13 18:53:08,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5365 states. [2021-11-13 18:53:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5365 to 4849. [2021-11-13 18:53:09,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4849 states, 3776 states have (on average 1.2680084745762712) internal successors, (4788), 3829 states have internal predecessors, (4788), 545 states have call successors, (545), 445 states have call predecessors, (545), 526 states have return successors, (883), 581 states have call predecessors, (883), 543 states have call successors, (883) [2021-11-13 18:53:09,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4849 states to 4849 states and 6216 transitions. [2021-11-13 18:53:09,606 INFO L78 Accepts]: Start accepts. Automaton has 4849 states and 6216 transitions. Word has length 66 [2021-11-13 18:53:09,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:09,608 INFO L470 AbstractCegarLoop]: Abstraction has 4849 states and 6216 transitions. [2021-11-13 18:53:09,608 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-11-13 18:53:09,608 INFO L276 IsEmpty]: Start isEmpty. Operand 4849 states and 6216 transitions. [2021-11-13 18:53:09,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-13 18:53:09,611 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:09,612 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-11-13 18:53:09,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-13 18:53:09,612 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:09,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:09,613 INFO L85 PathProgramCache]: Analyzing trace with hash -455119352, now seen corresponding path program 1 times [2021-11-13 18:53:09,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:09,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95877070] [2021-11-13 18:53:09,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:09,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:09,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:09,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-13 18:53:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:09,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-13 18:53:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:09,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:09,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:09,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-13 18:53:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:09,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-13 18:53:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:53:09,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:09,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95877070] [2021-11-13 18:53:09,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95877070] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:09,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:53:09,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 18:53:09,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068536290] [2021-11-13 18:53:09,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:09,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 18:53:09,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:09,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 18:53:09,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-13 18:53:09,712 INFO L87 Difference]: Start difference. First operand 4849 states and 6216 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-11-13 18:53:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:10,666 INFO L93 Difference]: Finished difference Result 6479 states and 8218 transitions. [2021-11-13 18:53:10,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-13 18:53:10,667 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-11-13 18:53:10,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:10,718 INFO L225 Difference]: With dead ends: 6479 [2021-11-13 18:53:10,718 INFO L226 Difference]: Without dead ends: 6476 [2021-11-13 18:53:10,723 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-11-13 18:53:10,724 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 779 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 364.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.93ms SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 438.73ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:10,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [788 Valid, 681 Invalid, 500 Unknown, 0 Unchecked, 6.93ms Time], IncrementalHoareTripleChecker [230 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 438.73ms Time] [2021-11-13 18:53:10,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6476 states. [2021-11-13 18:53:11,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6476 to 5903. [2021-11-13 18:53:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5903 states, 4579 states have (on average 1.257479799082769) internal successors, (5758), 4641 states have internal predecessors, (5758), 671 states have call successors, (671), 559 states have call predecessors, (671), 651 states have return successors, (1076), 709 states have call predecessors, (1076), 670 states have call successors, (1076) [2021-11-13 18:53:11,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5903 states to 5903 states and 7505 transitions. [2021-11-13 18:53:11,427 INFO L78 Accepts]: Start accepts. Automaton has 5903 states and 7505 transitions. Word has length 73 [2021-11-13 18:53:11,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:11,428 INFO L470 AbstractCegarLoop]: Abstraction has 5903 states and 7505 transitions. [2021-11-13 18:53:11,429 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-11-13 18:53:11,429 INFO L276 IsEmpty]: Start isEmpty. Operand 5903 states and 7505 transitions. [2021-11-13 18:53:11,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-13 18:53:11,433 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:11,434 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-11-13 18:53:11,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-13 18:53:11,434 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:11,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:11,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1224424688, now seen corresponding path program 1 times [2021-11-13 18:53:11,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:11,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694127664] [2021-11-13 18:53:11,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:11,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:11,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:11,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-13 18:53:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:11,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-13 18:53:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:11,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:11,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:11,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-13 18:53:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:11,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-13 18:53:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:53:11,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:11,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694127664] [2021-11-13 18:53:11,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694127664] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:53:11,601 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037080893] [2021-11-13 18:53:11,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:11,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:53:11,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:53:11,604 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:53:11,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-13 18:53:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:11,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-13 18:53:11,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:53:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:53:12,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 18:53:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:53:12,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037080893] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 18:53:12,827 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 18:53:12,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2021-11-13 18:53:12,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406191038] [2021-11-13 18:53:12,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 18:53:12,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-13 18:53:12,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:12,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-13 18:53:12,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-13 18:53:12,832 INFO L87 Difference]: Start difference. First operand 5903 states and 7505 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-11-13 18:53:15,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:15,635 INFO L93 Difference]: Finished difference Result 13549 states and 17033 transitions. [2021-11-13 18:53:15,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-13 18:53:15,636 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-11-13 18:53:15,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:15,735 INFO L225 Difference]: With dead ends: 13549 [2021-11-13 18:53:15,735 INFO L226 Difference]: Without dead ends: 13546 [2021-11-13 18:53:15,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2021-11-13 18:53:15,744 INFO L933 BasicCegarLoop]: 435 mSDtfsCounter, 1172 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1069.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.37ms SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1278.42ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:15,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1230 Valid, 1534 Invalid, 1554 Unknown, 0 Unchecked, 19.37ms Time], IncrementalHoareTripleChecker [254 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 1278.42ms Time] [2021-11-13 18:53:15,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13546 states. [2021-11-13 18:53:17,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13546 to 11161. [2021-11-13 18:53:17,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11161 states, 8671 states have (on average 1.2532579863914197) internal successors, (10867), 8785 states have internal predecessors, (10867), 1237 states have call successors, (1237), 1049 states have call predecessors, (1237), 1251 states have return successors, (2015), 1333 states have call predecessors, (2015), 1236 states have call successors, (2015) [2021-11-13 18:53:17,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11161 states to 11161 states and 14119 transitions. [2021-11-13 18:53:17,095 INFO L78 Accepts]: Start accepts. Automaton has 11161 states and 14119 transitions. Word has length 74 [2021-11-13 18:53:17,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:17,095 INFO L470 AbstractCegarLoop]: Abstraction has 11161 states and 14119 transitions. [2021-11-13 18:53:17,096 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-11-13 18:53:17,096 INFO L276 IsEmpty]: Start isEmpty. Operand 11161 states and 14119 transitions. [2021-11-13 18:53:17,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-13 18:53:17,101 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:17,101 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-11-13 18:53:17,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-13 18:53:17,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-13 18:53:17,329 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:17,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash -499209592, now seen corresponding path program 2 times [2021-11-13 18:53:17,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:17,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920317733] [2021-11-13 18:53:17,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:17,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:17,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:17,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-13 18:53:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:17,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-13 18:53:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:17,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:17,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:17,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-13 18:53:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:17,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-13 18:53:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:53:17,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:17,440 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920317733] [2021-11-13 18:53:17,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920317733] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:17,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:53:17,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 18:53:17,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16169985] [2021-11-13 18:53:17,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:17,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 18:53:17,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:17,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 18:53:17,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-13 18:53:17,443 INFO L87 Difference]: Start difference. First operand 11161 states and 14119 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-11-13 18:53:18,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:18,818 INFO L93 Difference]: Finished difference Result 17704 states and 22461 transitions. [2021-11-13 18:53:18,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 18:53:18,818 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-11-13 18:53:18,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:18,864 INFO L225 Difference]: With dead ends: 17704 [2021-11-13 18:53:18,864 INFO L226 Difference]: Without dead ends: 7766 [2021-11-13 18:53:18,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-13 18:53:18,894 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 417 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 310.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.31ms SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 371.97ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:18,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 800 Invalid, 381 Unknown, 0 Unchecked, 9.31ms Time], IncrementalHoareTripleChecker [90 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 371.97ms Time] [2021-11-13 18:53:18,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7766 states. [2021-11-13 18:53:19,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7766 to 7214. [2021-11-13 18:53:19,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7214 states, 5618 states have (on average 1.2294410822356712) internal successors, (6907), 5688 states have internal predecessors, (6907), 804 states have call successors, (804), 673 states have call predecessors, (804), 790 states have return successors, (1234), 859 states have call predecessors, (1234), 803 states have call successors, (1234) [2021-11-13 18:53:19,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7214 states to 7214 states and 8945 transitions. [2021-11-13 18:53:19,542 INFO L78 Accepts]: Start accepts. Automaton has 7214 states and 8945 transitions. Word has length 77 [2021-11-13 18:53:19,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:19,542 INFO L470 AbstractCegarLoop]: Abstraction has 7214 states and 8945 transitions. [2021-11-13 18:53:19,543 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-11-13 18:53:19,543 INFO L276 IsEmpty]: Start isEmpty. Operand 7214 states and 8945 transitions. [2021-11-13 18:53:19,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-13 18:53:19,548 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:19,549 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-11-13 18:53:19,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-13 18:53:19,549 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:19,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:19,550 INFO L85 PathProgramCache]: Analyzing trace with hash 867535010, now seen corresponding path program 1 times [2021-11-13 18:53:19,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:19,550 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334068630] [2021-11-13 18:53:19,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:19,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:19,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:19,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-13 18:53:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:19,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-13 18:53:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:19,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:19,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:19,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-13 18:53:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:19,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-13 18:53:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:19,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-13 18:53:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-13 18:53:19,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:19,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334068630] [2021-11-13 18:53:19,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334068630] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:19,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:53:19,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-13 18:53:19,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624812789] [2021-11-13 18:53:19,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:19,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-13 18:53:19,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:19,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-13 18:53:19,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-13 18:53:19,671 INFO L87 Difference]: Start difference. First operand 7214 states and 8945 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-11-13 18:53:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:21,949 INFO L93 Difference]: Finished difference Result 21088 states and 26162 transitions. [2021-11-13 18:53:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-13 18:53:21,950 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-11-13 18:53:21,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:22,015 INFO L225 Difference]: With dead ends: 21088 [2021-11-13 18:53:22,015 INFO L226 Difference]: Without dead ends: 14245 [2021-11-13 18:53:22,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2021-11-13 18:53:22,038 INFO L933 BasicCegarLoop]: 330 mSDtfsCounter, 609 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 770.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.51ms SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 948.78ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:22,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [625 Valid, 1061 Invalid, 993 Unknown, 0 Unchecked, 12.51ms Time], IncrementalHoareTripleChecker [191 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 948.78ms Time] [2021-11-13 18:53:22,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14245 states. [2021-11-13 18:53:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14245 to 13386. [2021-11-13 18:53:23,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13386 states, 10294 states have (on average 1.2040023314552166) internal successors, (12394), 10470 states have internal predecessors, (12394), 1520 states have call successors, (1520), 1277 states have call predecessors, (1520), 1570 states have return successors, (2637), 1651 states have call predecessors, (2637), 1519 states have call successors, (2637) [2021-11-13 18:53:23,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13386 states to 13386 states and 16551 transitions. [2021-11-13 18:53:23,502 INFO L78 Accepts]: Start accepts. Automaton has 13386 states and 16551 transitions. Word has length 84 [2021-11-13 18:53:23,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:23,502 INFO L470 AbstractCegarLoop]: Abstraction has 13386 states and 16551 transitions. [2021-11-13 18:53:23,503 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-11-13 18:53:23,503 INFO L276 IsEmpty]: Start isEmpty. Operand 13386 states and 16551 transitions. [2021-11-13 18:53:23,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-13 18:53:23,514 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:23,514 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-11-13 18:53:23,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-13 18:53:23,515 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:23,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:23,515 INFO L85 PathProgramCache]: Analyzing trace with hash 260386383, now seen corresponding path program 1 times [2021-11-13 18:53:23,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:23,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013210848] [2021-11-13 18:53:23,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:23,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:23,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:23,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 18:53:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:23,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 18:53:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:23,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 18:53:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:23,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 18:53:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:23,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-13 18:53:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:23,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 18:53:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:23,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-13 18:53:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-13 18:53:23,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:23,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013210848] [2021-11-13 18:53:23,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013210848] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:53:23,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409493644] [2021-11-13 18:53:23,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:23,629 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:53:23,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:53:23,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:53:23,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-13 18:53:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:23,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-13 18:53:23,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:53:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-13 18:53:23,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 18:53:23,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409493644] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:23,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 18:53:23,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-11-13 18:53:23,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207798823] [2021-11-13 18:53:23,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:23,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 18:53:23,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:23,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 18:53:23,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-13 18:53:23,951 INFO L87 Difference]: Start difference. First operand 13386 states and 16551 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-11-13 18:53:25,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:25,345 INFO L93 Difference]: Finished difference Result 14024 states and 17443 transitions. [2021-11-13 18:53:25,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 18:53:25,345 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-11-13 18:53:25,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:25,406 INFO L225 Difference]: With dead ends: 14024 [2021-11-13 18:53:25,406 INFO L226 Difference]: Without dead ends: 13469 [2021-11-13 18:53:25,415 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-11-13 18:53:25,416 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 111 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.07ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.40ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:25,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 626 Invalid, 12 Unknown, 0 Unchecked, 3.07ms Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 13.40ms Time] [2021-11-13 18:53:25,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13469 states. [2021-11-13 18:53:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13469 to 13469. [2021-11-13 18:53:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13469 states, 10361 states have (on average 1.204709970080108) internal successors, (12482), 10537 states have internal predecessors, (12482), 1530 states have call successors, (1530), 1283 states have call predecessors, (1530), 1576 states have return successors, (2651), 1661 states have call predecessors, (2651), 1529 states have call successors, (2651) [2021-11-13 18:53:26,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13469 states to 13469 states and 16663 transitions. [2021-11-13 18:53:26,554 INFO L78 Accepts]: Start accepts. Automaton has 13469 states and 16663 transitions. Word has length 92 [2021-11-13 18:53:26,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:26,555 INFO L470 AbstractCegarLoop]: Abstraction has 13469 states and 16663 transitions. [2021-11-13 18:53:26,555 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-11-13 18:53:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 13469 states and 16663 transitions. [2021-11-13 18:53:26,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-13 18:53:26,566 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:26,566 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-11-13 18:53:26,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-13 18:53:26,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-13 18:53:26,793 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:26,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:26,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1083636890, now seen corresponding path program 1 times [2021-11-13 18:53:26,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:26,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169784199] [2021-11-13 18:53:26,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:26,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:26,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:26,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-13 18:53:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:26,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-13 18:53:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:26,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:26,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:26,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-13 18:53:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:26,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-13 18:53:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:26,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-13 18:53:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-13 18:53:26,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:26,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169784199] [2021-11-13 18:53:26,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169784199] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:26,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:53:26,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-13 18:53:26,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577771693] [2021-11-13 18:53:26,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:26,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-13 18:53:26,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:26,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-13 18:53:26,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-13 18:53:26,908 INFO L87 Difference]: Start difference. First operand 13469 states and 16663 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-11-13 18:53:28,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:28,990 INFO L93 Difference]: Finished difference Result 24343 states and 29982 transitions. [2021-11-13 18:53:29,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-13 18:53:29,006 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-11-13 18:53:29,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:29,059 INFO L225 Difference]: With dead ends: 24343 [2021-11-13 18:53:29,060 INFO L226 Difference]: Without dead ends: 11944 [2021-11-13 18:53:29,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2021-11-13 18:53:29,097 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 1302 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 766.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.60ms SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 929.04ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:29,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1337 Valid, 929 Invalid, 1259 Unknown, 0 Unchecked, 12.60ms Time], IncrementalHoareTripleChecker [379 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 929.04ms Time] [2021-11-13 18:53:29,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11944 states. [2021-11-13 18:53:30,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11944 to 11044. [2021-11-13 18:53:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11044 states, 8527 states have (on average 1.1953793831359212) internal successors, (10193), 8670 states have internal predecessors, (10193), 1231 states have call successors, (1231), 1032 states have call predecessors, (1231), 1284 states have return successors, (1983), 1351 states have call predecessors, (1983), 1230 states have call successors, (1983) [2021-11-13 18:53:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11044 states to 11044 states and 13407 transitions. [2021-11-13 18:53:30,151 INFO L78 Accepts]: Start accepts. Automaton has 11044 states and 13407 transitions. Word has length 93 [2021-11-13 18:53:30,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:30,152 INFO L470 AbstractCegarLoop]: Abstraction has 11044 states and 13407 transitions. [2021-11-13 18:53:30,152 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-11-13 18:53:30,152 INFO L276 IsEmpty]: Start isEmpty. Operand 11044 states and 13407 transitions. [2021-11-13 18:53:30,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-11-13 18:53:30,167 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:30,168 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-11-13 18:53:30,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-13 18:53:30,168 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:30,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:30,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1789084765, now seen corresponding path program 1 times [2021-11-13 18:53:30,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:30,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636741488] [2021-11-13 18:53:30,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:30,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:30,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:30,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 18:53:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:30,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 18:53:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:30,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 18:53:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:30,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 18:53:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:30,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-13 18:53:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:30,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 18:53:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:30,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-11-13 18:53:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:30,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 18:53:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:30,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-13 18:53:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:30,299 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-11-13 18:53:30,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:30,300 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636741488] [2021-11-13 18:53:30,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636741488] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:53:30,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48541512] [2021-11-13 18:53:30,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:30,302 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:53:30,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:53:30,305 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:53:30,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-13 18:53:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:30,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-13 18:53:30,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:53:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-13 18:53:30,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 18:53:30,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48541512] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:30,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 18:53:30,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-11-13 18:53:30,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965801482] [2021-11-13 18:53:30,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:30,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 18:53:30,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:30,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 18:53:30,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-13 18:53:30,813 INFO L87 Difference]: Start difference. First operand 11044 states and 13407 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-11-13 18:53:31,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:31,828 INFO L93 Difference]: Finished difference Result 11626 states and 14224 transitions. [2021-11-13 18:53:31,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 18:53:31,829 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-11-13 18:53:31,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:31,877 INFO L225 Difference]: With dead ends: 11626 [2021-11-13 18:53:31,877 INFO L226 Difference]: Without dead ends: 11288 [2021-11-13 18:53:31,886 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-11-13 18:53:31,887 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 194 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.04ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.43ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:31,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 409 Invalid, 12 Unknown, 0 Unchecked, 2.04ms Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 12.43ms Time] [2021-11-13 18:53:31,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11288 states. [2021-11-13 18:53:33,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11288 to 11278. [2021-11-13 18:53:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11278 states, 8716 states have (on average 1.1986002753556677) internal successors, (10447), 8860 states have internal predecessors, (10447), 1259 states have call successors, (1259), 1049 states have call predecessors, (1259), 1301 states have return successors, (2017), 1378 states have call predecessors, (2017), 1258 states have call successors, (2017) [2021-11-13 18:53:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11278 states to 11278 states and 13723 transitions. [2021-11-13 18:53:33,092 INFO L78 Accepts]: Start accepts. Automaton has 11278 states and 13723 transitions. Word has length 118 [2021-11-13 18:53:33,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:33,093 INFO L470 AbstractCegarLoop]: Abstraction has 11278 states and 13723 transitions. [2021-11-13 18:53:33,093 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-11-13 18:53:33,093 INFO L276 IsEmpty]: Start isEmpty. Operand 11278 states and 13723 transitions. [2021-11-13 18:53:33,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-13 18:53:33,114 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:33,115 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-11-13 18:53:33,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-13 18:53:33,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:53:33,341 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:33,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:33,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2070810004, now seen corresponding path program 1 times [2021-11-13 18:53:33,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:33,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703964658] [2021-11-13 18:53:33,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:33,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:33,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:33,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 18:53:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:33,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 18:53:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:33,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 18:53:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:33,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 18:53:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:33,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-13 18:53:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:33,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-13 18:53:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:33,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 18:53:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:33,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-13 18:53:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:33,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 18:53:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:33,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-13 18:53:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-13 18:53:33,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:33,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703964658] [2021-11-13 18:53:33,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703964658] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:53:33,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399854525] [2021-11-13 18:53:33,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:33,495 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:53:33,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:53:33,496 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:53:33,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-13 18:53:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:33,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-13 18:53:33,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:53:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-13 18:53:33,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 18:53:33,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399854525] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:33,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 18:53:33,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-11-13 18:53:33,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521402775] [2021-11-13 18:53:33,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:33,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 18:53:33,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:33,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 18:53:33,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-13 18:53:33,979 INFO L87 Difference]: Start difference. First operand 11278 states and 13723 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-11-13 18:53:34,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:34,828 INFO L93 Difference]: Finished difference Result 12032 states and 14769 transitions. [2021-11-13 18:53:34,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 18:53:34,829 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-11-13 18:53:34,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:34,875 INFO L225 Difference]: With dead ends: 12032 [2021-11-13 18:53:34,875 INFO L226 Difference]: Without dead ends: 11380 [2021-11-13 18:53:34,885 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-11-13 18:53:34,886 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 245 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.68ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.06ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:34,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 292 Invalid, 11 Unknown, 0 Unchecked, 1.68ms Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 12.06ms Time] [2021-11-13 18:53:34,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11380 states. [2021-11-13 18:53:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11380 to 11358. [2021-11-13 18:53:35,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11358 states, 8789 states have (on average 1.195471612242576) internal successors, (10507), 8932 states have internal predecessors, (10507), 1259 states have call successors, (1259), 1055 states have call predecessors, (1259), 1308 states have return successors, (2015), 1380 states have call predecessors, (2015), 1258 states have call successors, (2015) [2021-11-13 18:53:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11358 states to 11358 states and 13781 transitions. [2021-11-13 18:53:35,942 INFO L78 Accepts]: Start accepts. Automaton has 11358 states and 13781 transitions. Word has length 134 [2021-11-13 18:53:35,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:35,943 INFO L470 AbstractCegarLoop]: Abstraction has 11358 states and 13781 transitions. [2021-11-13 18:53:35,943 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-11-13 18:53:35,944 INFO L276 IsEmpty]: Start isEmpty. Operand 11358 states and 13781 transitions. [2021-11-13 18:53:35,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-11-13 18:53:35,959 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:35,960 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-11-13 18:53:36,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-13 18:53:36,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:53:36,173 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:36,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:36,174 INFO L85 PathProgramCache]: Analyzing trace with hash -931525195, now seen corresponding path program 1 times [2021-11-13 18:53:36,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:36,174 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762454007] [2021-11-13 18:53:36,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:36,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:36,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:36,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 18:53:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:36,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 18:53:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:36,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 18:53:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:36,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 18:53:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:36,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-13 18:53:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:36,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-11-13 18:53:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:36,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 18:53:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:36,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-13 18:53:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:36,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 18:53:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:36,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-13 18:53:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-11-13 18:53:36,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:36,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762454007] [2021-11-13 18:53:36,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762454007] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:53:36,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257136842] [2021-11-13 18:53:36,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:36,317 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:53:36,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:53:36,318 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:53:36,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-13 18:53:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:36,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-13 18:53:36,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:53:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-13 18:53:36,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 18:53:36,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257136842] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:36,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 18:53:36,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-11-13 18:53:36,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127013630] [2021-11-13 18:53:36,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:36,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 18:53:36,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:36,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 18:53:36,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-13 18:53:36,767 INFO L87 Difference]: Start difference. First operand 11358 states and 13781 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-11-13 18:53:37,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:37,743 INFO L93 Difference]: Finished difference Result 12105 states and 14760 transitions. [2021-11-13 18:53:37,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 18:53:37,746 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-11-13 18:53:37,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:37,782 INFO L225 Difference]: With dead ends: 12105 [2021-11-13 18:53:37,782 INFO L226 Difference]: Without dead ends: 11375 [2021-11-13 18:53:37,790 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-11-13 18:53:37,791 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 245 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.11ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.09ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:37,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 400 Invalid, 11 Unknown, 0 Unchecked, 2.11ms Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 12.09ms Time] [2021-11-13 18:53:37,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11375 states. [2021-11-13 18:53:38,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11375 to 11352. [2021-11-13 18:53:38,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11352 states, 8783 states have (on average 1.1935557326653763) internal successors, (10483), 8926 states have internal predecessors, (10483), 1259 states have call successors, (1259), 1055 states have call predecessors, (1259), 1308 states have return successors, (2015), 1380 states have call predecessors, (2015), 1258 states have call successors, (2015) [2021-11-13 18:53:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11352 states to 11352 states and 13757 transitions. [2021-11-13 18:53:38,701 INFO L78 Accepts]: Start accepts. Automaton has 11352 states and 13757 transitions. Word has length 134 [2021-11-13 18:53:38,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:38,702 INFO L470 AbstractCegarLoop]: Abstraction has 11352 states and 13757 transitions. [2021-11-13 18:53:38,702 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-11-13 18:53:38,702 INFO L276 IsEmpty]: Start isEmpty. Operand 11352 states and 13757 transitions. [2021-11-13 18:53:38,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-13 18:53:38,718 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:38,718 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-11-13 18:53:38,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-13 18:53:38,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-13 18:53:38,933 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:38,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:38,934 INFO L85 PathProgramCache]: Analyzing trace with hash -564892461, now seen corresponding path program 1 times [2021-11-13 18:53:38,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:38,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913928792] [2021-11-13 18:53:38,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:38,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:38,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:38,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 18:53:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:38,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 18:53:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:39,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 18:53:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:39,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 18:53:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:39,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-13 18:53:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:39,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-13 18:53:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:39,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 18:53:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:39,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-13 18:53:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:39,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 18:53:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:39,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-13 18:53:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-11-13 18:53:39,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:39,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913928792] [2021-11-13 18:53:39,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913928792] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:53:39,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084614903] [2021-11-13 18:53:39,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:39,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:53:39,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:53:39,069 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:53:39,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-13 18:53:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:39,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-13 18:53:39,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:53:39,543 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-13 18:53:39,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 18:53:39,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084614903] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:39,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 18:53:39,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-11-13 18:53:39,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225406065] [2021-11-13 18:53:39,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:39,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 18:53:39,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:39,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 18:53:39,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-13 18:53:39,545 INFO L87 Difference]: Start difference. First operand 11352 states and 13757 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-11-13 18:53:40,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:40,506 INFO L93 Difference]: Finished difference Result 11666 states and 14184 transitions. [2021-11-13 18:53:40,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 18:53:40,507 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-11-13 18:53:40,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:40,545 INFO L225 Difference]: With dead ends: 11666 [2021-11-13 18:53:40,545 INFO L226 Difference]: Without dead ends: 11297 [2021-11-13 18:53:40,553 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-11-13 18:53:40,554 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 73 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.07ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.04ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:40,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 614 Invalid, 10 Unknown, 0 Unchecked, 2.07ms Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 11.04ms Time] [2021-11-13 18:53:40,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11297 states. [2021-11-13 18:53:41,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11297 to 11283. [2021-11-13 18:53:41,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11283 states, 8728 states have (on average 1.1919110907424382) internal successors, (10403), 8871 states have internal predecessors, (10403), 1251 states have call successors, (1251), 1050 states have call predecessors, (1251), 1302 states have return successors, (2001), 1371 states have call predecessors, (2001), 1250 states have call successors, (2001) [2021-11-13 18:53:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11283 states to 11283 states and 13655 transitions. [2021-11-13 18:53:41,498 INFO L78 Accepts]: Start accepts. Automaton has 11283 states and 13655 transitions. Word has length 135 [2021-11-13 18:53:41,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:41,499 INFO L470 AbstractCegarLoop]: Abstraction has 11283 states and 13655 transitions. [2021-11-13 18:53:41,499 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-11-13 18:53:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand 11283 states and 13655 transitions. [2021-11-13 18:53:41,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-13 18:53:41,509 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:41,510 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-11-13 18:53:41,535 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-11-13 18:53:41,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-13 18:53:41,711 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:41,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:41,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1386105035, now seen corresponding path program 1 times [2021-11-13 18:53:41,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:41,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566836549] [2021-11-13 18:53:41,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:41,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:41,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:41,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 18:53:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:41,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 18:53:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:41,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 18:53:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:41,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 18:53:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:41,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-13 18:53:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:41,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-13 18:53:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:41,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 18:53:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:41,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-13 18:53:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:41,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 18:53:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:41,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-13 18:53:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:41,829 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-11-13 18:53:41,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:41,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566836549] [2021-11-13 18:53:41,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566836549] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:53:41,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113923635] [2021-11-13 18:53:41,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:41,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:53:41,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:53:41,832 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:53:41,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-13 18:53:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:41,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-13 18:53:41,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:53:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-13 18:53:42,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 18:53:42,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113923635] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:42,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 18:53:42,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-11-13 18:53:42,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158263860] [2021-11-13 18:53:42,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:42,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 18:53:42,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:42,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 18:53:42,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-13 18:53:42,316 INFO L87 Difference]: Start difference. First operand 11283 states and 13655 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-11-13 18:53:43,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:43,378 INFO L93 Difference]: Finished difference Result 11938 states and 14483 transitions. [2021-11-13 18:53:43,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 18:53:43,378 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-11-13 18:53:43,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:43,400 INFO L225 Difference]: With dead ends: 11938 [2021-11-13 18:53:43,400 INFO L226 Difference]: Without dead ends: 11283 [2021-11-13 18:53:43,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-13 18:53:43,406 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 298 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 184.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.62ms SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 226.43ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:43,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 476 Invalid, 235 Unknown, 0 Unchecked, 3.62ms Time], IncrementalHoareTripleChecker [40 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 226.43ms Time] [2021-11-13 18:53:43,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11283 states. [2021-11-13 18:53:44,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11283 to 11283. [2021-11-13 18:53:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11283 states, 8728 states have (on average 1.190307057745188) internal successors, (10389), 8871 states have internal predecessors, (10389), 1251 states have call successors, (1251), 1050 states have call predecessors, (1251), 1302 states have return successors, (2001), 1371 states have call predecessors, (2001), 1250 states have call successors, (2001) [2021-11-13 18:53:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11283 states to 11283 states and 13641 transitions. [2021-11-13 18:53:44,224 INFO L78 Accepts]: Start accepts. Automaton has 11283 states and 13641 transitions. Word has length 136 [2021-11-13 18:53:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:44,225 INFO L470 AbstractCegarLoop]: Abstraction has 11283 states and 13641 transitions. [2021-11-13 18:53:44,225 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-11-13 18:53:44,225 INFO L276 IsEmpty]: Start isEmpty. Operand 11283 states and 13641 transitions. [2021-11-13 18:53:44,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-13 18:53:44,239 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:44,239 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-11-13 18:53:44,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-13 18:53:44,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-13 18:53:44,440 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:44,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:44,441 INFO L85 PathProgramCache]: Analyzing trace with hash 78962637, now seen corresponding path program 1 times [2021-11-13 18:53:44,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:44,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103037418] [2021-11-13 18:53:44,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:44,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:44,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:44,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 18:53:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:44,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 18:53:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:44,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 18:53:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:44,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 18:53:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:44,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-13 18:53:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:44,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-13 18:53:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:44,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 18:53:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:44,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-13 18:53:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:44,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 18:53:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:44,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-13 18:53:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-11-13 18:53:44,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:44,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103037418] [2021-11-13 18:53:44,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103037418] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:53:44,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863320117] [2021-11-13 18:53:44,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:44,565 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:53:44,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:53:44,566 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:53:44,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-13 18:53:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:44,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-13 18:53:44,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:53:44,995 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-13 18:53:44,996 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 18:53:44,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863320117] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:44,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 18:53:44,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-11-13 18:53:44,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117498961] [2021-11-13 18:53:44,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:44,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 18:53:44,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:44,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 18:53:44,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-11-13 18:53:44,998 INFO L87 Difference]: Start difference. First operand 11283 states and 13641 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-11-13 18:53:46,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:46,008 INFO L93 Difference]: Finished difference Result 11812 states and 14293 transitions. [2021-11-13 18:53:46,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 18:53:46,009 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-11-13 18:53:46,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:46,035 INFO L225 Difference]: With dead ends: 11812 [2021-11-13 18:53:46,035 INFO L226 Difference]: Without dead ends: 11157 [2021-11-13 18:53:46,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-13 18:53:46,042 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 319 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 212.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.08ms SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 262.41ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:46,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 486 Invalid, 286 Unknown, 0 Unchecked, 3.08ms Time], IncrementalHoareTripleChecker [45 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 262.41ms Time] [2021-11-13 18:53:46,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11157 states. [2021-11-13 18:53:46,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11157 to 11146. [2021-11-13 18:53:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11146 states, 8620 states have (on average 1.1875870069605567) internal successors, (10237), 8762 states have internal predecessors, (10237), 1231 states have call successors, (1231), 1039 states have call predecessors, (1231), 1293 states have return successors, (1975), 1354 states have call predecessors, (1975), 1230 states have call successors, (1975) [2021-11-13 18:53:46,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11146 states to 11146 states and 13443 transitions. [2021-11-13 18:53:46,994 INFO L78 Accepts]: Start accepts. Automaton has 11146 states and 13443 transitions. Word has length 136 [2021-11-13 18:53:46,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:46,995 INFO L470 AbstractCegarLoop]: Abstraction has 11146 states and 13443 transitions. [2021-11-13 18:53:46,995 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-11-13 18:53:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 11146 states and 13443 transitions. [2021-11-13 18:53:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-13 18:53:47,005 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:47,005 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-11-13 18:53:47,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-11-13 18:53:47,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-13 18:53:47,206 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:47,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:47,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1976459403, now seen corresponding path program 1 times [2021-11-13 18:53:47,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:47,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198298643] [2021-11-13 18:53:47,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:47,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:47,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:47,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 18:53:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:47,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 18:53:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:47,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 18:53:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:47,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 18:53:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:47,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-13 18:53:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:47,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-13 18:53:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:47,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 18:53:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:47,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-13 18:53:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:47,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 18:53:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:47,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-13 18:53:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-11-13 18:53:47,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:47,324 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198298643] [2021-11-13 18:53:47,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198298643] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:53:47,324 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042175818] [2021-11-13 18:53:47,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:47,325 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:53:47,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:53:47,326 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:53:47,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-13 18:53:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:47,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-13 18:53:47,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:53:47,699 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-11-13 18:53:47,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 18:53:47,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042175818] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:47,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 18:53:47,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-11-13 18:53:47,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518177973] [2021-11-13 18:53:47,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:47,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 18:53:47,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:47,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 18:53:47,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-13 18:53:47,702 INFO L87 Difference]: Start difference. First operand 11146 states and 13443 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-11-13 18:53:48,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:48,688 INFO L93 Difference]: Finished difference Result 11679 states and 14104 transitions. [2021-11-13 18:53:48,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 18:53:48,688 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-11-13 18:53:48,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:48,710 INFO L225 Difference]: With dead ends: 11679 [2021-11-13 18:53:48,711 INFO L226 Difference]: Without dead ends: 11160 [2021-11-13 18:53:48,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-13 18:53:48,715 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 10 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.30ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.75ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:48,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 1039 Invalid, 14 Unknown, 0 Unchecked, 2.30ms Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 11.75ms Time] [2021-11-13 18:53:48,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11160 states. [2021-11-13 18:53:49,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11160 to 11152. [2021-11-13 18:53:49,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11152 states, 8626 states have (on average 1.1862972408996058) internal successors, (10233), 8768 states have internal predecessors, (10233), 1231 states have call successors, (1231), 1039 states have call predecessors, (1231), 1293 states have return successors, (1975), 1354 states have call predecessors, (1975), 1230 states have call successors, (1975) [2021-11-13 18:53:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11152 states to 11152 states and 13439 transitions. [2021-11-13 18:53:49,509 INFO L78 Accepts]: Start accepts. Automaton has 11152 states and 13439 transitions. Word has length 136 [2021-11-13 18:53:49,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:49,510 INFO L470 AbstractCegarLoop]: Abstraction has 11152 states and 13439 transitions. [2021-11-13 18:53:49,510 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-11-13 18:53:49,510 INFO L276 IsEmpty]: Start isEmpty. Operand 11152 states and 13439 transitions. [2021-11-13 18:53:49,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-13 18:53:49,519 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:49,520 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-11-13 18:53:49,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-13 18:53:49,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-13 18:53:49,720 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:49,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:49,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1219164295, now seen corresponding path program 1 times [2021-11-13 18:53:49,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:49,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090811081] [2021-11-13 18:53:49,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:49,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:49,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:49,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 18:53:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:49,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 18:53:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:49,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 18:53:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:49,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 18:53:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:49,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-13 18:53:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:49,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-13 18:53:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:49,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 18:53:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:49,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-13 18:53:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:49,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 18:53:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:49,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-13 18:53:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-11-13 18:53:49,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:49,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090811081] [2021-11-13 18:53:49,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090811081] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:49,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:53:49,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 18:53:49,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356969005] [2021-11-13 18:53:49,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:49,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 18:53:49,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:49,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 18:53:49,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-13 18:53:49,839 INFO L87 Difference]: Start difference. First operand 11152 states and 13439 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-11-13 18:53:51,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:51,237 INFO L93 Difference]: Finished difference Result 11663 states and 14017 transitions. [2021-11-13 18:53:51,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-13 18:53:51,237 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-11-13 18:53:51,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:51,264 INFO L225 Difference]: With dead ends: 11663 [2021-11-13 18:53:51,264 INFO L226 Difference]: Without dead ends: 11661 [2021-11-13 18:53:51,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-11-13 18:53:51,270 INFO L933 BasicCegarLoop]: 332 mSDtfsCounter, 670 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 395.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.04ms SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 497.77ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:51,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [702 Valid, 788 Invalid, 520 Unknown, 0 Unchecked, 7.04ms Time], IncrementalHoareTripleChecker [116 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 497.77ms Time] [2021-11-13 18:53:51,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11661 states. [2021-11-13 18:53:52,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11661 to 11502. [2021-11-13 18:53:52,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11502 states, 8914 states have (on average 1.1844289881085932) internal successors, (10558), 9057 states have internal predecessors, (10558), 1267 states have call successors, (1267), 1063 states have call predecessors, (1267), 1319 states have return successors, (2015), 1391 states have call predecessors, (2015), 1266 states have call successors, (2015) [2021-11-13 18:53:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11502 states to 11502 states and 13840 transitions. [2021-11-13 18:53:52,091 INFO L78 Accepts]: Start accepts. Automaton has 11502 states and 13840 transitions. Word has length 136 [2021-11-13 18:53:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:52,093 INFO L470 AbstractCegarLoop]: Abstraction has 11502 states and 13840 transitions. [2021-11-13 18:53:52,093 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-11-13 18:53:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 11502 states and 13840 transitions. [2021-11-13 18:53:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-11-13 18:53:52,104 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:52,104 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-11-13 18:53:52,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-13 18:53:52,105 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:52,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:52,105 INFO L85 PathProgramCache]: Analyzing trace with hash 114815496, now seen corresponding path program 1 times [2021-11-13 18:53:52,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:52,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956404013] [2021-11-13 18:53:52,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:52,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:52,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:52,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-13 18:53:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:52,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-13 18:53:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:52,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:52,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-13 18:53:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:52,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-13 18:53:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:52,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-13 18:53:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:52,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-13 18:53:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:52,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-13 18:53:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:52,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-13 18:53:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:52,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:52,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:52,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-11-13 18:53:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:52,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-13 18:53:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:52,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2021-11-13 18:53:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-11-13 18:53:52,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:52,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956404013] [2021-11-13 18:53:52,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956404013] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:53:52,259 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036334324] [2021-11-13 18:53:52,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:52,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:53:52,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:53:52,261 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:53:52,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-13 18:53:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:52,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-13 18:53:52,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:53:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-13 18:53:52,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 18:53:52,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036334324] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:52,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 18:53:52,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2021-11-13 18:53:52,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662821989] [2021-11-13 18:53:52,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:52,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 18:53:52,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:52,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 18:53:52,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-11-13 18:53:52,660 INFO L87 Difference]: Start difference. First operand 11502 states and 13840 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-11-13 18:53:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:53,220 INFO L93 Difference]: Finished difference Result 16650 states and 20060 transitions. [2021-11-13 18:53:53,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 18:53:53,220 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-11-13 18:53:53,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:53,235 INFO L225 Difference]: With dead ends: 16650 [2021-11-13 18:53:53,235 INFO L226 Difference]: Without dead ends: 6068 [2021-11-13 18:53:53,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-13 18:53:53,256 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 34 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.44ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.13ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:53,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 1278 Invalid, 25 Unknown, 0 Unchecked, 2.44ms Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 15.13ms Time] [2021-11-13 18:53:53,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6068 states. [2021-11-13 18:53:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6068 to 5626. [2021-11-13 18:53:53,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5626 states, 4479 states have (on average 1.166331770484483) internal successors, (5224), 4520 states have internal predecessors, (5224), 569 states have call successors, (569), 457 states have call predecessors, (569), 576 states have return successors, (855), 649 states have call predecessors, (855), 568 states have call successors, (855) [2021-11-13 18:53:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5626 states to 5626 states and 6648 transitions. [2021-11-13 18:53:53,712 INFO L78 Accepts]: Start accepts. Automaton has 5626 states and 6648 transitions. Word has length 145 [2021-11-13 18:53:53,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:53,713 INFO L470 AbstractCegarLoop]: Abstraction has 5626 states and 6648 transitions. [2021-11-13 18:53:53,713 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-11-13 18:53:53,713 INFO L276 IsEmpty]: Start isEmpty. Operand 5626 states and 6648 transitions. [2021-11-13 18:53:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-11-13 18:53:53,721 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:53,721 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-11-13 18:53:53,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-13 18:53:53,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-13 18:53:53,922 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:53,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:53,922 INFO L85 PathProgramCache]: Analyzing trace with hash 62040612, now seen corresponding path program 1 times [2021-11-13 18:53:53,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:53,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751650835] [2021-11-13 18:53:53,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:53,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:53,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:53,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-13 18:53:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:53,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-13 18:53:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:53,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:53,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:53,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-13 18:53:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:53,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-13 18:53:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:53,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-13 18:53:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:53,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-11-13 18:53:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:53,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-13 18:53:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:53,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-11-13 18:53:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:54,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:54,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:54,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-13 18:53:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:54,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-13 18:53:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:54,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-13 18:53:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:54,019 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-11-13 18:53:54,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:54,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751650835] [2021-11-13 18:53:54,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751650835] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:54,020 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:53:54,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 18:53:54,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501952652] [2021-11-13 18:53:54,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:54,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 18:53:54,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:54,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 18:53:54,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-13 18:53:54,022 INFO L87 Difference]: Start difference. First operand 5626 states and 6648 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-11-13 18:53:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:54,786 INFO L93 Difference]: Finished difference Result 6174 states and 7266 transitions. [2021-11-13 18:53:54,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 18:53:54,787 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-11-13 18:53:54,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:54,798 INFO L225 Difference]: With dead ends: 6174 [2021-11-13 18:53:54,798 INFO L226 Difference]: Without dead ends: 5425 [2021-11-13 18:53:54,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-13 18:53:54,802 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 385 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 207.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.26ms SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 250.69ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:54,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 550 Invalid, 259 Unknown, 0 Unchecked, 4.26ms Time], IncrementalHoareTripleChecker [107 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 250.69ms Time] [2021-11-13 18:53:54,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5425 states. [2021-11-13 18:53:55,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5425 to 5201. [2021-11-13 18:53:55,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5201 states, 4150 states have (on average 1.1672289156626505) internal successors, (4844), 4188 states have internal predecessors, (4844), 523 states have call successors, (523), 417 states have call predecessors, (523), 526 states have return successors, (791), 596 states have call predecessors, (791), 522 states have call successors, (791) [2021-11-13 18:53:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5201 states to 5201 states and 6158 transitions. [2021-11-13 18:53:55,207 INFO L78 Accepts]: Start accepts. Automaton has 5201 states and 6158 transitions. Word has length 147 [2021-11-13 18:53:55,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:55,208 INFO L470 AbstractCegarLoop]: Abstraction has 5201 states and 6158 transitions. [2021-11-13 18:53:55,208 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-11-13 18:53:55,208 INFO L276 IsEmpty]: Start isEmpty. Operand 5201 states and 6158 transitions. [2021-11-13 18:53:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-11-13 18:53:55,220 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:55,220 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-11-13 18:53:55,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-13 18:53:55,221 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:55,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:55,221 INFO L85 PathProgramCache]: Analyzing trace with hash -818503781, now seen corresponding path program 1 times [2021-11-13 18:53:55,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:55,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434226978] [2021-11-13 18:53:55,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:55,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:55,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:55,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-13 18:53:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:55,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-13 18:53:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:55,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:55,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:55,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 18:53:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:55,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-13 18:53:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:55,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-11-13 18:53:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:55,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-11-13 18:53:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:55,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-13 18:53:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:55,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-13 18:53:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:55,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:55,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:55,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2021-11-13 18:53:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:55,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-13 18:53:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:55,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2021-11-13 18:53:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2021-11-13 18:53:55,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:55,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434226978] [2021-11-13 18:53:55,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434226978] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:53:55,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494655153] [2021-11-13 18:53:55,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:55,333 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:53:55,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:53:55,341 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:53:55,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-13 18:53:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:55,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-13 18:53:55,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:53:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-11-13 18:53:55,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 18:53:55,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494655153] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:55,863 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 18:53:55,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-11-13 18:53:55,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456308270] [2021-11-13 18:53:55,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:55,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 18:53:55,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:55,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 18:53:55,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-13 18:53:55,865 INFO L87 Difference]: Start difference. First operand 5201 states and 6158 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-11-13 18:53:56,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:56,224 INFO L93 Difference]: Finished difference Result 7037 states and 8318 transitions. [2021-11-13 18:53:56,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 18:53:56,224 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-11-13 18:53:56,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:56,232 INFO L225 Difference]: With dead ends: 7037 [2021-11-13 18:53:56,232 INFO L226 Difference]: Without dead ends: 2997 [2021-11-13 18:53:56,237 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-11-13 18:53:56,238 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 170 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.62ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.25ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:56,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 371 Invalid, 10 Unknown, 0 Unchecked, 1.62ms Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 11.25ms Time] [2021-11-13 18:53:56,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2021-11-13 18:53:56,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 2997. [2021-11-13 18:53:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2997 states, 2416 states have (on average 1.1527317880794703) internal successors, (2785), 2438 states have internal predecessors, (2785), 294 states have call successors, (294), 229 states have call predecessors, (294), 285 states have return successors, (409), 330 states have call predecessors, (409), 293 states have call successors, (409) [2021-11-13 18:53:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2997 states to 2997 states and 3488 transitions. [2021-11-13 18:53:56,462 INFO L78 Accepts]: Start accepts. Automaton has 2997 states and 3488 transitions. Word has length 158 [2021-11-13 18:53:56,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:56,462 INFO L470 AbstractCegarLoop]: Abstraction has 2997 states and 3488 transitions. [2021-11-13 18:53:56,463 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-11-13 18:53:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2997 states and 3488 transitions. [2021-11-13 18:53:56,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-13 18:53:56,468 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:56,469 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-11-13 18:53:56,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-13 18:53:56,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:53:56,673 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:56,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:56,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1011844634, now seen corresponding path program 1 times [2021-11-13 18:53:56,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:56,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505227772] [2021-11-13 18:53:56,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:56,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:56,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:56,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-13 18:53:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:56,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-13 18:53:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:56,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:56,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:56,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-13 18:53:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:56,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-13 18:53:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:56,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-13 18:53:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:56,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-13 18:53:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:56,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-11-13 18:53:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:56,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-13 18:53:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:56,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:56,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:56,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-11-13 18:53:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:56,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-13 18:53:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:56,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-13 18:53:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:56,834 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-13 18:53:56,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:56,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505227772] [2021-11-13 18:53:56,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505227772] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:53:56,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:53:56,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 18:53:56,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943908718] [2021-11-13 18:53:56,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:53:56,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 18:53:56,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:56,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 18:53:56,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-13 18:53:56,839 INFO L87 Difference]: Start difference. First operand 2997 states and 3488 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-11-13 18:53:57,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:53:57,565 INFO L93 Difference]: Finished difference Result 4861 states and 5698 transitions. [2021-11-13 18:53:57,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 18:53:57,565 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-11-13 18:53:57,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:53:57,572 INFO L225 Difference]: With dead ends: 4861 [2021-11-13 18:53:57,572 INFO L226 Difference]: Without dead ends: 3100 [2021-11-13 18:53:57,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-11-13 18:53:57,576 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 221 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 341.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.03ms SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 408.64ms IncrementalHoareTripleChecker+Time [2021-11-13 18:53:57,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 960 Invalid, 493 Unknown, 0 Unchecked, 6.03ms Time], IncrementalHoareTripleChecker [70 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 408.64ms Time] [2021-11-13 18:53:57,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2021-11-13 18:53:57,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2556. [2021-11-13 18:53:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2556 states, 2067 states have (on average 1.1552975326560233) internal successors, (2388), 2088 states have internal predecessors, (2388), 250 states have call successors, (250), 193 states have call predecessors, (250), 237 states have return successors, (341), 275 states have call predecessors, (341), 249 states have call successors, (341) [2021-11-13 18:53:57,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 2979 transitions. [2021-11-13 18:53:57,766 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 2979 transitions. Word has length 159 [2021-11-13 18:53:57,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:53:57,767 INFO L470 AbstractCegarLoop]: Abstraction has 2556 states and 2979 transitions. [2021-11-13 18:53:57,767 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-11-13 18:53:57,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 2979 transitions. [2021-11-13 18:53:57,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2021-11-13 18:53:57,770 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:53:57,771 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-11-13 18:53:57,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-13 18:53:57,771 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:53:57,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:53:57,771 INFO L85 PathProgramCache]: Analyzing trace with hash 978764957, now seen corresponding path program 1 times [2021-11-13 18:53:57,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:53:57,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833701892] [2021-11-13 18:53:57,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:57,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:53:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:57,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:53:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:57,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-13 18:53:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:57,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-13 18:53:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:57,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:57,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:57,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-13 18:53:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:57,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-13 18:53:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:57,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-13 18:53:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:57,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-13 18:53:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:57,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-13 18:53:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:57,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-13 18:53:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:57,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:53:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:57,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:53:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:57,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-13 18:53:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:57,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2021-11-13 18:53:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:57,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2021-11-13 18:53:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:57,911 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-11-13 18:53:57,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:53:57,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833701892] [2021-11-13 18:53:57,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833701892] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:53:57,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54358595] [2021-11-13 18:53:57,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:53:57,912 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:53:57,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:53:57,917 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:53:57,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-13 18:53:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:53:58,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-13 18:53:58,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:53:58,428 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-13 18:53:58,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 18:53:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2021-11-13 18:53:59,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54358595] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 18:53:59,027 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 18:53:59,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2021-11-13 18:53:59,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415579848] [2021-11-13 18:53:59,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 18:53:59,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-13 18:53:59,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:53:59,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-13 18:53:59,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2021-11-13 18:53:59,030 INFO L87 Difference]: Start difference. First operand 2556 states and 2979 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-11-13 18:54:00,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:54:00,590 INFO L93 Difference]: Finished difference Result 4591 states and 5457 transitions. [2021-11-13 18:54:00,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-13 18:54:00,591 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-11-13 18:54:00,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:54:00,599 INFO L225 Difference]: With dead ends: 4591 [2021-11-13 18:54:00,599 INFO L226 Difference]: Without dead ends: 2843 [2021-11-13 18:54:00,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2021-11-13 18:54:00,605 INFO L933 BasicCegarLoop]: 220 mSDtfsCounter, 1292 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 774.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.82ms SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 929.63ms IncrementalHoareTripleChecker+Time [2021-11-13 18:54:00,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1313 Valid, 1043 Invalid, 1400 Unknown, 0 Unchecked, 11.82ms Time], IncrementalHoareTripleChecker [417 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 929.63ms Time] [2021-11-13 18:54:00,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2021-11-13 18:54:00,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2643. [2021-11-13 18:54:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2643 states, 2112 states have (on average 1.137310606060606) internal successors, (2402), 2138 states have internal predecessors, (2402), 272 states have call successors, (272), 217 states have call predecessors, (272), 257 states have return successors, (392), 288 states have call predecessors, (392), 271 states have call successors, (392) [2021-11-13 18:54:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 3066 transitions. [2021-11-13 18:54:00,894 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 3066 transitions. Word has length 162 [2021-11-13 18:54:00,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:54:00,894 INFO L470 AbstractCegarLoop]: Abstraction has 2643 states and 3066 transitions. [2021-11-13 18:54:00,895 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-11-13 18:54:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 3066 transitions. [2021-11-13 18:54:00,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-13 18:54:00,898 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:54:00,898 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-11-13 18:54:00,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-13 18:54:01,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:54:01,099 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:54:01,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:54:01,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1575925759, now seen corresponding path program 2 times [2021-11-13 18:54:01,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:54:01,100 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518305704] [2021-11-13 18:54:01,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:54:01,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:54:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:01,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:54:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:01,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 18:54:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:01,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 18:54:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:01,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 18:54:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:01,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 18:54:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:01,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-13 18:54:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:01,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-13 18:54:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:01,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 18:54:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:01,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-13 18:54:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:01,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 18:54:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:01,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-13 18:54:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:01,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-13 18:54:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:01,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 18:54:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:01,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-13 18:54:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:01,202 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-11-13 18:54:01,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:54:01,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518305704] [2021-11-13 18:54:01,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518305704] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:54:01,203 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:54:01,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 18:54:01,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073699672] [2021-11-13 18:54:01,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:54:01,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 18:54:01,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:54:01,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 18:54:01,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 18:54:01,206 INFO L87 Difference]: Start difference. First operand 2643 states and 3066 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 4 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2021-11-13 18:54:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:54:01,889 INFO L93 Difference]: Finished difference Result 3541 states and 4102 transitions. [2021-11-13 18:54:01,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-13 18:54:01,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 4 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 175 [2021-11-13 18:54:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:54:01,895 INFO L225 Difference]: With dead ends: 3541 [2021-11-13 18:54:01,896 INFO L226 Difference]: Without dead ends: 1760 [2021-11-13 18:54:01,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-13 18:54:01,900 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 283 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 320.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.93ms SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 384.22ms IncrementalHoareTripleChecker+Time [2021-11-13 18:54:01,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 650 Invalid, 385 Unknown, 0 Unchecked, 4.93ms Time], IncrementalHoareTripleChecker [82 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 384.22ms Time] [2021-11-13 18:54:01,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2021-11-13 18:54:02,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1760. [2021-11-13 18:54:02,106 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-11-13 18:54:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2046 transitions. [2021-11-13 18:54:02,110 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2046 transitions. Word has length 175 [2021-11-13 18:54:02,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:54:02,111 INFO L470 AbstractCegarLoop]: Abstraction has 1760 states and 2046 transitions. [2021-11-13 18:54:02,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 3 states have internal predecessors, (92), 4 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2021-11-13 18:54:02,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2046 transitions. [2021-11-13 18:54:02,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-11-13 18:54:02,114 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:54:02,115 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-11-13 18:54:02,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-13 18:54:02,115 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:54:02,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:54:02,116 INFO L85 PathProgramCache]: Analyzing trace with hash -61354190, now seen corresponding path program 1 times [2021-11-13 18:54:02,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:54:02,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415128637] [2021-11-13 18:54:02,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:54:02,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:54:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:02,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:54:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:02,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-13 18:54:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:02,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-13 18:54:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:02,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:54:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:02,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:54:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:02,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 18:54:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:02,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-13 18:54:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:02,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-13 18:54:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:02,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-11-13 18:54:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:02,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-13 18:54:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:02,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-11-13 18:54:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:02,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-11-13 18:54:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:02,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:54:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:02,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:54:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:02,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2021-11-13 18:54:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:02,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-11-13 18:54:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:02,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-11-13 18:54:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:02,249 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-11-13 18:54:02,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:54:02,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415128637] [2021-11-13 18:54:02,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415128637] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:54:02,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255898789] [2021-11-13 18:54:02,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:54:02,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:54:02,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:54:02,253 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:54:02,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-13 18:54:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:02,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-13 18:54:02,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:54:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-11-13 18:54:02,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 18:54:02,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255898789] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:54:02,789 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 18:54:02,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-11-13 18:54:02,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454146136] [2021-11-13 18:54:02,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:54:02,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 18:54:02,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:54:02,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 18:54:02,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-13 18:54:02,791 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-11-13 18:54:03,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:54:03,097 INFO L93 Difference]: Finished difference Result 3405 states and 3969 transitions. [2021-11-13 18:54:03,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 18:54:03,097 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-11-13 18:54:03,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:54:03,100 INFO L225 Difference]: With dead ends: 3405 [2021-11-13 18:54:03,100 INFO L226 Difference]: Without dead ends: 1477 [2021-11-13 18:54:03,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-11-13 18:54:03,103 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 151 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 100.99ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.65ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 126.75ms IncrementalHoareTripleChecker+Time [2021-11-13 18:54:03,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 276 Invalid, 140 Unknown, 0 Unchecked, 1.65ms Time], IncrementalHoareTripleChecker [25 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 126.75ms Time] [2021-11-13 18:54:03,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2021-11-13 18:54:03,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1440. [2021-11-13 18:54:03,218 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-11-13 18:54:03,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 1649 transitions. [2021-11-13 18:54:03,220 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 1649 transitions. Word has length 179 [2021-11-13 18:54:03,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:54:03,220 INFO L470 AbstractCegarLoop]: Abstraction has 1440 states and 1649 transitions. [2021-11-13 18:54:03,221 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-11-13 18:54:03,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1649 transitions. [2021-11-13 18:54:03,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2021-11-13 18:54:03,222 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 18:54:03,223 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-11-13 18:54:03,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-13 18:54:03,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-11-13 18:54:03,423 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 18:54:03,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:54:03,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1658574142, now seen corresponding path program 1 times [2021-11-13 18:54:03,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:54:03,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122546636] [2021-11-13 18:54:03,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:54:03,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:54:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 18:54:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-13 18:54:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-13 18:54:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:54:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:54:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-11-13 18:54:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-11-13 18:54:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-11-13 18:54:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-13 18:54:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-11-13 18:54:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-13 18:54:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:54:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:54:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-11-13 18:54:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-13 18:54:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-11-13 18:54:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-13 18:54:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-11-13 18:54:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2021-11-13 18:54:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2021-11-13 18:54:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-13 18:54:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 18:54:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2021-11-13 18:54:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2021-11-13 18:54:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2021-11-13 18:54:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,631 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2021-11-13 18:54:03,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:54:03,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122546636] [2021-11-13 18:54:03,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122546636] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:54:03,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327052152] [2021-11-13 18:54:03,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:54:03,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:54:03,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:54:03,637 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:54:03,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-13 18:54:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:54:03,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-13 18:54:03,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:54:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 256 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-11-13 18:54:04,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 18:54:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-11-13 18:54:05,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327052152] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 18:54:05,015 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 18:54:05,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2021-11-13 18:54:05,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931303438] [2021-11-13 18:54:05,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 18:54:05,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-13 18:54:05,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:54:05,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-13 18:54:05,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-11-13 18:54:05,018 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-11-13 18:54:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 18:54:05,742 INFO L93 Difference]: Finished difference Result 1743 states and 1984 transitions. [2021-11-13 18:54:05,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-13 18:54:05,743 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-11-13 18:54:05,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 18:54:05,744 INFO L225 Difference]: With dead ends: 1743 [2021-11-13 18:54:05,744 INFO L226 Difference]: Without dead ends: 0 [2021-11-13 18:54:05,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 551 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2021-11-13 18:54:05,748 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 428 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 410.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.97ms SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 493.13ms IncrementalHoareTripleChecker+Time [2021-11-13 18:54:05,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 458 Invalid, 706 Unknown, 0 Unchecked, 5.97ms Time], IncrementalHoareTripleChecker [155 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 493.13ms Time] [2021-11-13 18:54:05,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-13 18:54:05,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-13 18:54:05,749 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-11-13 18:54:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-13 18:54:05,749 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 253 [2021-11-13 18:54:05,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 18:54:05,750 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-13 18:54:05,750 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-11-13 18:54:05,750 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-13 18:54:05,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-13 18:54:05,753 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-11-13 18:54:05,754 INFO L764 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-11-13 18:54:05,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-13 18:54:05,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-11-13 18:54:05,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-13 18:55:23,595 INFO L858 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 812 822) no Hoare annotation was computed. [2021-11-13 18:55:23,596 INFO L854 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 812 822) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse9 (not (<= 2 ~E_M~0))) (.cse14 (not (= ~token~0 ~local~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse16 (not (<= 2 |old(~m_st~0)|))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse15 (and (= |old(~t1_st~0)| ~t1_st~0) .cse10)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse17 (= ~E_M~0 0)) (.cse7 (not (= ~c_num_read~0 0))) (.cse8 (not (= ~q_free~0 0))) (.cse11 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse12 (= ~M_E~0 0)) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 (= 2 ~t1_st~0)) .cse11 (not (= |old(~t1_st~0)| 2)) .cse12 .cse13 .cse14) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse15 .cse4 (not (<= ~t1_pc~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) (or .cse1 (and (not (< 0 ~m_pc~0)) (not (<= 1 ~t1_pc~0))) .cse16 .cse15 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 (and (or (not (< 1 ~m_pc~0)) (not (<= ~t1_pc~0 1))) (not (<= ~m_pc~0 0))) .cse11 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0))) .cse12 .cse13 (= ~T1_E~0 0)) (or .cse0 .cse1 .cse16 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 (not (< ~local~0 ~token~0)) .cse11 .cse12 .cse13 (not (<= 2 ~E_1~0)) (not (<= ~token~0 (+ ~local~0 1))))))) [2021-11-13 18:55:23,596 INFO L858 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 812 822) no Hoare annotation was computed. [2021-11-13 18:55:23,596 INFO L858 garLoopResultBuilder]: For program point update_channels1EXIT(lines 226 240) no Hoare annotation was computed. [2021-11-13 18:55:23,597 INFO L854 garLoopResultBuilder]: At program point update_channels1ENTRY(lines 226 240) the Hoare annotation is: (let ((.cse34 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse32 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse33 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse35 (= ~q_req_up~0 |old(~q_req_up~0)|))) (let ((.cse23 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse24 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse19 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse7 (not (= ~q_free~0 0))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse31 (and .cse32 .cse33 .cse35 (= ~q_read_ev~0 2))) (.cse29 (not (= ~p_num_write~0 0))) (.cse30 (not (= ~c_num_read~0 0))) (.cse27 (not (= |old(~q_read_ev~0)| 2))) (.cse28 (not (= |old(~q_req_up~0)| 1))) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (and .cse32 .cse33 .cse34 .cse35)) (.cse4 (not (<= 2 ~T1_E~0))) (.cse15 (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))) (.cse16 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse17 (not (<= ~c_dr_pc~0 1))) (.cse25 (not (<= |old(~q_req_up~0)| 0))) (.cse9 (= ~p_dw_st~0 0)) (.cse26 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse10 (not (= ~m_st~0 0))) (.cse18 (not (<= 2 |old(~q_write_ev~0)|))) (.cse20 (not (<= 1 ~c_dr_pc~0))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse21 (not (= ~q_free~0 1))) (.cse12 (= ~M_E~0 0)) (.cse22 (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 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse16 .cse8 .cse17 .cse9 .cse10 .cse18 .cse19 .cse20 .cse11 .cse21 .cse12 .cse22 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse23 .cse5 .cse24 .cse6 .cse7 .cse8 .cse17 .cse25 .cse9 .cse26 .cse10 .cse27 .cse11 (= |old(~q_write_ev~0)| 0) .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse28 .cse3 .cse4 .cse23 .cse5 .cse24 .cse6 .cse7 .cse8 .cse17 .cse9 .cse26 .cse10 .cse18 .cse27 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse29 .cse6 (= ~E_M~0 0) .cse30 .cse9 .cse26 .cse19 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse21 .cse12 .cse22 (= ~T1_E~0 0)) (or .cse0 .cse2 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse17 .cse25 .cse9 .cse26 .cse10 .cse18 .cse27 .cse11 .cse12 .cse13 .cse14) (or .cse1 .cse2 (not .cse9) .cse4 .cse31 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse5 .cse29 .cse6 .cse30 .cse8 .cse25 .cse26 .cse10 .cse27 .cse11 .cse21 .cse12 .cse22 .cse13 .cse14) (or .cse0 .cse2 (not (<= 1 |old(~q_read_ev~0)|)) .cse28 .cse4 .cse15 .cse5 (and (= ~q_req_up~0 1) .cse32 .cse33 .cse34) .cse6 .cse16 .cse8 .cse17 .cse9 .cse26 .cse10 .cse18 .cse20 .cse11 .cse21 .cse12 .cse22 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse16 .cse8 .cse17 .cse25 .cse9 .cse26 .cse10 .cse18 .cse20 .cse11 .cse21 .cse12 .cse22 .cse13 .cse14)))) [2021-11-13 18:55:23,598 INFO L854 garLoopResultBuilder]: At program point L56(lines 39 58) the Hoare annotation is: (let ((.cse24 (<= ~q_req_up~0 0)) (.cse20 (not (= |old(~q_req_up~0)| 1))) (.cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse5 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse25 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse28 (not (<= ~c_dr_pc~0 0))) (.cse21 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse22 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse26 (not (= ~q_free~0 1))) (.cse27 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (= ~q_free~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (<= ~c_dr_pc~0 1))) (.cse10 (not (<= |old(~q_req_up~0)| 0))) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse13 (not (= ~m_st~0 0))) (.cse23 (not (<= 2 |old(~q_write_ev~0)|))) (.cse14 (not (= |old(~q_read_ev~0)| 2))) (.cse15 (not (<= 1 ~c_dr_pc~0))) (.cse16 (not (= ~p_dw_i~0 1))) (.cse17 (= ~M_E~0 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 .cse14 .cse15 .cse16 (= |old(~q_write_ev~0)| 0) .cse17 .cse18 .cse19) (or .cse0 .cse1 (not (<= 1 |old(~q_read_ev~0)|)) .cse20 .cse2 .cse21 .cse4 .cse6 .cse22 .cse8 .cse9 .cse11 .cse13 .cse23 (and .cse24 .cse25) .cse15 .cse16 .cse26 .cse17 .cse27 .cse18 .cse19) (or .cse0 (and .cse24 (= ~q_read_ev~0 2)) .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse23 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse21 .cse4 .cse6 .cse22 .cse8 .cse9 .cse25 .cse11 .cse13 .cse23 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0))) .cse15 .cse16 .cse26 .cse17 .cse27 .cse18 .cse19) (or .cse0 .cse28 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse11 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse13 .cse16 .cse17 .cse18 .cse19) (or .cse28 .cse1 (not .cse11) .cse2 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse4 (not (= ~p_num_write~0 0)) .cse6 (not (= ~c_num_read~0 0)) .cse8 .cse10 .cse12 .cse13 .cse14 .cse16 .cse26 .cse17 .cse27 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse21 .cse4 .cse6 .cse22 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse23 .cse15 .cse16 .cse26 .cse17 .cse27 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse23 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2021-11-13 18:55:23,598 INFO L858 garLoopResultBuilder]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2021-11-13 18:55:23,598 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2021-11-13 18:55:23,598 INFO L858 garLoopResultBuilder]: For program point L43-2(lines 42 57) no Hoare annotation was computed. [2021-11-13 18:55:23,599 INFO L858 garLoopResultBuilder]: For program point L230-1(lines 226 240) no Hoare annotation was computed. [2021-11-13 18:55:23,599 INFO L858 garLoopResultBuilder]: For program point L803-2(lines 787 811) no Hoare annotation was computed. [2021-11-13 18:55:23,599 INFO L854 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 787 811) the Hoare annotation is: (let ((.cse23 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse11 (and .cse23 (= 2 ~t1_st~0))) (.cse13 (not (= |old(~t1_st~0)| 2))) (.cse4 (not (= ~t1_pc~0 1))) (.cse19 (= ~E_M~0 0)) (.cse21 (not (< ~local~0 ~token~0))) (.cse22 (not (<= ~token~0 (+ ~local~0 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))) (.cse17 (and (= |old(~t1_st~0)| ~t1_st~0) .cse23)) (.cse5 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse20 (not (<= ~t1_pc~0 0))) (.cse6 (not (= ~p_num_write~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse9 (not (= ~q_free~0 0))) (.cse10 (not (<= 2 ~E_M~0))) (.cse12 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (= ~M_E~0 0)) (.cse15 (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) (or .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse18) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18) (or .cse1 .cse2 .cse17 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse12 (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 .cse15 (= ~T1_E~0 0)) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse3 .cse17 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse18) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse21 .cse12 (not (= |old(~m_st~0)| 0)) .cse13 .cse14 .cse15 .cse16 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse21 .cse12 .cse14 .cse15 .cse16 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse17 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse18)))) [2021-11-13 18:55:23,599 INFO L858 garLoopResultBuilder]: For program point L795(lines 795 799) no Hoare annotation was computed. [2021-11-13 18:55:23,600 INFO L858 garLoopResultBuilder]: For program point L601(lines 601 606) no Hoare annotation was computed. [2021-11-13 18:55:23,600 INFO L858 garLoopResultBuilder]: For program point L795-2(lines 795 799) no Hoare annotation was computed. [2021-11-13 18:55:23,601 INFO L854 garLoopResultBuilder]: At program point L630(lines 618 632) the Hoare annotation is: (let ((.cse17 (= ~M_E~0 0)) (.cse8 (= ~E_M~0 0)) (.cse31 (= ~T1_E~0 0))) (let ((.cse33 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse15 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse36 (= ~c_num_read~0 0)) (.cse37 (= ~p_last_write~0 ~q_buf_0~0)) (.cse41 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse45 (= ~p_dw_st~0 0)) (.cse34 (= ~p_num_write~0 0)) (.cse35 (not .cse31)) (.cse40 (= |old(~t1_st~0)| ~t1_st~0)) (.cse26 (= ~m_st~0 |old(~m_st~0)|)) (.cse42 (= ~q_free~0 0)) (.cse43 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse29 (<= ~p_dw_pc~0 0)) (.cse30 (< 1 ~p_dw_pc~0)) (.cse44 (not .cse8)) (.cse46 (not .cse17)) (.cse39 (< 1 ~m_pc~0)) (.cse38 (<= ~m_pc~0 0))) (let ((.cse24 (and (not .cse39) (not .cse38))) (.cse27 (= 2 ~t1_st~0)) (.cse11 (not (< ~local~0 ~token~0))) (.cse22 (not (= |old(~m_st~0)| 0))) (.cse20 (not (<= ~token~0 (+ ~local~0 1)))) (.cse28 (and .cse34 .cse35 (or .cse39 .cse38) .cse40 .cse26 .cse42 .cse43 (or .cse29 .cse30) .cse44 .cse46)) (.cse32 (not (<= ~t1_pc~0 0))) (.cse23 (not (= |old(~t1_st~0)| 2))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse45)) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not .cse41)) (.cse6 (not .cse34)) (.cse7 (not .cse37)) (.cse9 (not .cse36)) (.cse10 (not .cse42)) (.cse21 (not (<= 2 ~E_M~0))) (.cse12 (not .cse43)) (.cse13 (and .cse40 .cse26 .cse14 .cse15)) (.cse16 (and .cse34 .cse35 .cse36 .cse37 (or .cse38 (and (<= ~t1_pc~0 1) .cse39)) .cse40 .cse41 .cse26 .cse42 (<= 2 ~m_st~0) .cse43 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse44 .cse45 .cse46 .cse33)) (.cse18 (not .cse33)) (.cse19 (not (<= 2 ~E_1~0))) (.cse25 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and (= ~m_st~0 0) .cse14 (<= ~E_M~0 1) .cse15) .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse21 (and .cse14 .cse15) .cse12 .cse22 .cse23 .cse24 .cse17 .cse18 .cse19 .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse21 (and .cse26 .cse27) .cse12 .cse23 .cse17 .cse18 .cse25) (or .cse1 .cse2 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (and (not .cse29) (not .cse30)) .cse24 .cse17 .cse18 .cse31) (or (and .cse26 .cse27 .cse14 .cse15) .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse21 .cse11 .cse12 .cse22 .cse23 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse28 .cse5 .cse32 .cse6 .cse7 .cse9 .cse10 .cse21 .cse12 .cse13 .cse17 .cse18 .cse19 .cse25) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse3 .cse5 .cse32 .cse6 .cse7 .cse9 .cse10 .cse21 .cse12 .cse13 .cse17 .cse18 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse21 .cse12 .cse13 .cse23 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse21 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse25))))) [2021-11-13 18:55:23,601 INFO L858 garLoopResultBuilder]: For program point L620(lines 620 625) no Hoare annotation was computed. [2021-11-13 18:55:23,601 INFO L854 garLoopResultBuilder]: At program point L612(lines 596 614) the Hoare annotation is: (let ((.cse25 (<= |activate_threads2_is_master_triggered_#res#1| 0)) (.cse23 (= |old(~t1_st~0)| ~t1_st~0)) (.cse26 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse24 (= ~m_st~0 |old(~m_st~0)|)) (.cse27 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0)) (.cse28 (<= 0 |activate_threads2_is_master_triggered_#res#1|))) (let ((.cse20 (not (<= ~t1_pc~0 0))) (.cse22 (= ~E_M~0 0)) (.cse11 (not (< ~local~0 ~token~0))) (.cse17 (not (<= ~token~0 (+ ~local~0 1)))) (.cse18 (and .cse25 .cse23 .cse26 .cse24 .cse27 .cse28)) (.cse19 (not (<= 2 |old(~m_st~0)|))) (.cse16 (not (<= 2 ~E_1~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (= ~c_num_read~0 0))) (.cse8 (not (= ~q_free~0 0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse10 (and .cse25 .cse26 .cse24 (= 2 ~t1_st~0) .cse27 .cse28)) (.cse12 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse13 (not (= |old(~t1_st~0)| 2))) (.cse14 (= ~M_E~0 0)) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse21 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= |old(~m_st~0)| 0)) .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse19 .cse2 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse14 .cse15 .cse16 .cse21) (or .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse14 .cse15 .cse16 .cse21) (or .cse18 .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse14 .cse15 .cse21) (or .cse18 .cse1 .cse19 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse12 (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 .cse15 (= ~T1_E~0 0)) (or .cse18 .cse0 .cse1 (and .cse23 .cse24 (<= ~E_M~0 1)) .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse21)))) [2021-11-13 18:55:23,601 INFO L858 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 787 811) no Hoare annotation was computed. [2021-11-13 18:55:23,602 INFO L858 garLoopResultBuilder]: For program point L600(lines 600 609) no Hoare annotation was computed. [2021-11-13 18:55:23,602 INFO L854 garLoopResultBuilder]: At program point L631(lines 615 633) the Hoare annotation is: (let ((.cse14 (= ~M_E~0 0)) (.cse29 (= ~E_M~0 0)) (.cse32 (= ~T1_E~0 0))) (let ((.cse21 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse22 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse23 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse24 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse30 (<= ~p_dw_pc~0 0)) (.cse31 (< 1 ~p_dw_pc~0)) (.cse41 (= ~p_num_write~0 0)) (.cse43 (not .cse32)) (.cse39 (= ~c_num_read~0 0)) (.cse40 (= ~p_last_write~0 ~q_buf_0~0)) (.cse36 (= |old(~t1_st~0)| ~t1_st~0)) (.cse42 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse26 (= ~m_st~0 |old(~m_st~0)|)) (.cse38 (= ~q_free~0 0)) (.cse37 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse46 (not .cse29)) (.cse48 (= ~p_dw_st~0 0)) (.cse47 (not .cse14)) (.cse35 (= ~c_last_read~0 ~p_last_write~0)) (.cse44 (< 1 ~m_pc~0)) (.cse45 (<= ~m_pc~0 0))) (let ((.cse20 (and (not .cse44) (not .cse45))) (.cse13 (and .cse41 .cse43 .cse39 .cse40 (or .cse45 (and (<= ~t1_pc~0 1) .cse44)) .cse36 .cse42 .cse26 .cse38 (<= 2 ~m_st~0) .cse37 (or (<= 1 ~t1_pc~0) (< 0 ~m_pc~0)) .cse46 .cse48 .cse47 .cse35)) (.cse4 (not (= ~t1_pc~0 1))) (.cse33 (not (< ~local~0 ~token~0))) (.cse27 (= 2 ~t1_st~0)) (.cse18 (not (= |old(~m_st~0)| 0))) (.cse19 (not (= |old(~t1_st~0)| 2))) (.cse34 (not (<= ~token~0 (+ ~local~0 1)))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse48)) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse28 (and .cse41 .cse43 (or .cse44 .cse45) .cse36 .cse26 .cse38 .cse37 (or .cse30 .cse31) .cse46 .cse47)) (.cse5 (not .cse42)) (.cse25 (not (<= ~t1_pc~0 0))) (.cse6 (not .cse41)) (.cse7 (not .cse40)) (.cse8 (not .cse39)) (.cse9 (not .cse38)) (.cse10 (not (<= 2 ~E_M~0))) (.cse11 (not .cse37)) (.cse12 (and .cse36 .cse26 .cse21 .cse22 .cse23 .cse24)) (.cse15 (not .cse35)) (.cse16 (not (<= 2 ~E_1~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 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse19 .cse20 .cse14 .cse15 .cse16 (and .cse21 .cse22 .cse23 .cse24) .cse17) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse3 .cse5 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse26 .cse27) .cse11 .cse19 .cse14 .cse15 .cse17) (or .cse1 .cse2 .cse28 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse11 (and (not .cse30) (not .cse31)) .cse20 .cse14 .cse15 .cse32) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and (= ~m_st~0 0) .cse21 (<= ~E_M~0 1) .cse22 .cse23 .cse24) .cse6 .cse7 .cse29 .cse8 .cse9 .cse33 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse34) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse33 .cse11 (and .cse26 .cse27 .cse21 .cse22 .cse23 .cse24) .cse18 .cse19 .cse14 .cse15 .cse16 .cse34) (or .cse0 .cse1 .cse2 .cse3 .cse28 .cse5 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17))))) [2021-11-13 18:55:23,602 INFO L858 garLoopResultBuilder]: For program point L600-2(lines 600 609) no Hoare annotation was computed. [2021-11-13 18:55:23,603 INFO L858 garLoopResultBuilder]: For program point L619(lines 619 628) no Hoare annotation was computed. [2021-11-13 18:55:23,603 INFO L858 garLoopResultBuilder]: For program point L619-2(lines 619 628) no Hoare annotation was computed. [2021-11-13 18:55:23,603 INFO L854 garLoopResultBuilder]: At program point L611(lines 599 613) the Hoare annotation is: (let ((.cse21 (= |old(~t1_st~0)| ~t1_st~0)) (.cse25 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse22 (= ~m_st~0 |old(~m_st~0)|)) (.cse26 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))) (let ((.cse20 (= ~E_M~0 0)) (.cse0 (and .cse25 .cse22 (= 2 ~t1_st~0) .cse26)) (.cse23 (not (< ~local~0 ~token~0))) (.cse12 (not (= |old(~t1_st~0)| 2))) (.cse24 (not (<= ~token~0 (+ ~local~0 1)))) (.cse17 (not (<= 2 |old(~m_st~0)|))) (.cse4 (not (= ~t1_pc~0 1))) (.cse19 (not (<= 2 ~E_1~0))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse16 (and .cse21 .cse25 .cse22 .cse26)) (.cse3 (not (<= 2 ~T1_E~0))) (.cse5 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse18 (not (<= ~t1_pc~0 0))) (.cse6 (not (= ~p_num_write~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse9 (not (= ~q_free~0 0))) (.cse10 (not (<= 2 ~E_M~0))) (.cse11 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse13 (= ~M_E~0 0)) (.cse14 (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 .cse12 .cse13 .cse14 .cse15) (or .cse1 .cse2 .cse16 .cse17 .cse3 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse19 .cse15) (or .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19) (or .cse2 .cse16 .cse17 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse11 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0))) (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse13 .cse14 (= ~T1_E~0 0)) (or .cse1 .cse2 .cse16 (and .cse21 .cse22 (<= ~E_M~0 1)) .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse23 .cse11 .cse13 .cse14 .cse19 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 (not (= |old(~m_st~0)| 0)) .cse12 .cse13 .cse14 .cse19 .cse24) (or .cse1 .cse2 .cse16 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse19 .cse15) (or .cse1 (not (= ~m_pc~0 ~t1_pc~0)) .cse2 .cse16 .cse3 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15)))) [2021-11-13 18:55:23,603 INFO L858 garLoopResultBuilder]: For program point L803(lines 803 807) no Hoare annotation was computed. [2021-11-13 18:55:23,604 INFO L854 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (let ((.cse20 (= |old(~p_dw_st~0)| 0)) (.cse30 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse0 (not (<= ~c_dr_pc~0 0))) (.cse10 (and .cse30 (= ~p_dw_st~0 0))) (.cse14 (not .cse20)) (.cse24 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse25 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse29 (not (<= 1 ~c_dr_pc~0))) (.cse28 (not (<= 2 ~q_write_ev~0))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (not (<= ~t1_pc~0 0))) (.cse22 (not (= ~q_free~0 0))) (.cse7 (not (<= 2 ~E_M~0))) (.cse26 (not (<= ~c_dr_pc~0 1))) (.cse9 (not (= ~m_st~0 0))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse15 (not (<= ~q_req_up~0 0))) (.cse16 (not (= ~q_read_ev~0 2))) (.cse18 (not (<= 2 ~E_1~0))) (.cse19 (not (= ~token~0 ~local~0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse21 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse30)) (.cse4 (not (= ~p_num_write~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= ~c_num_read~0 0))) (.cse8 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse27 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse12 (not (= ~q_free~0 1))) (.cse23 (= |old(~c_dr_st~0)| 0)) (.cse13 (= ~M_E~0 0)) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse20 .cse2 .cse21 .cse3 .cse5 .cse22 .cse7 .cse9 .cse11 .cse23 .cse13 .cse18 .cse19) (or .cse1 .cse20 .cse2 .cse21 .cse24 .cse3 .cse5 .cse25 .cse7 .cse26 .cse9 .cse27 .cse28 .cse29 .cse11 .cse12 .cse23 .cse13 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse17 .cse18 .cse19) (or .cse1 .cse20 .cse2 .cse21 .cse24 .cse3 .cse5 .cse25 .cse7 .cse26 .cse9 .cse28 .cse29 .cse11 .cse12 .cse23 .cse13 .cse15 .cse17 .cse18 .cse19) (or .cse1 .cse20 .cse2 .cse21 .cse3 .cse5 .cse22 .cse7 .cse26 .cse8 .cse9 .cse28 .cse11 .cse23 .cse13 .cse15 .cse16 .cse18 .cse19) (or .cse1 .cse20 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse21 .cse3 (not (< ~c_num_read~0 ~p_num_write~0)) .cse5 .cse22 .cse7 .cse26 .cse8 .cse9 (= ~q_write_ev~0 0) .cse11 .cse23 .cse13 .cse15 .cse16 .cse18 .cse19) (or .cse1 .cse20 .cse21 .cse4 .cse5 (= ~E_M~0 0) .cse6 .cse8 .cse27 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse12 .cse23 .cse13 .cse17 (= ~T1_E~0 0))))) [2021-11-13 18:55:23,604 INFO L854 garLoopResultBuilder]: At program point L323-2(lines 323 327) the Hoare annotation is: (let ((.cse26 (= ~p_dw_st~0 0)) (.cse41 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse25 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse33 (<= activate_threads1_~tmp~1 0)) (.cse34 (< 0 (+ activate_threads1_~tmp~1 1))) (.cse1 (= |old(~p_dw_st~0)| 0))) (let ((.cse4 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse7 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse13 (not (<= 1 ~c_dr_pc~0))) (.cse27 (not .cse1)) (.cse12 (not (<= 2 ~q_write_ev~0))) (.cse40 (and .cse41 .cse25 .cse33 .cse34)) (.cse9 (not (<= ~c_dr_pc~0 1))) (.cse29 (not (<= ~q_req_up~0 0))) (.cse37 (= ~E_M~0 0)) (.cse38 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0)))) (.cse39 (= ~T1_E~0 0)) (.cse35 (not (= ~c_dr_st~0 0))) (.cse3 (and .cse41 .cse25)) (.cse32 (not .cse26)) (.cse31 (not (= ~q_free~0 0))) (.cse11 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse21 (not (<= ~c_dr_pc~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse36 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse22 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse23 (not (= ~c_num_read~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse24 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse10 (not (= ~m_st~0 0))) (.cse28 (and .cse33 .cse34)) (.cse14 (not (= ~p_dw_i~0 1))) (.cse15 (not (= ~q_free~0 1))) (.cse16 (= |old(~c_dr_st~0)| 0)) (.cse17 (= ~M_E~0 0)) (.cse30 (not (= ~q_read_ev~0 2))) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse19 (not (<= 2 ~E_1~0))) (.cse20 (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 .cse19 .cse20) (or .cse21 .cse0 .cse2 .cse5 .cse22 .cse6 .cse23 .cse8 .cse24 .cse10 (and .cse25 .cse26) .cse14 .cse15 .cse16 .cse17 .cse27 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20) (or .cse21 .cse0 .cse1 .cse2 .cse5 .cse6 .cse31 .cse8 .cse10 (and .cse32 .cse33 .cse34) .cse14 .cse16 .cse17 .cse30 .cse19 .cse20) (or .cse0 (and (= ~q_read_ev~0 1) .cse35 .cse26) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse20) (or .cse21 .cse0 .cse2 .cse36 .cse5 .cse22 .cse6 .cse23 .cse8 .cse24 .cse10 .cse14 .cse15 .cse17 .cse27 .cse29 .cse30 .cse18 .cse19 (and .cse25 .cse33 .cse26 .cse34) .cse20) (or .cse0 .cse1 .cse3 .cse22 .cse6 .cse37 .cse23 .cse24 .cse11 .cse38 .cse15 .cse16 .cse17 .cse18 .cse39) (or .cse0 .cse1 .cse2 .cse40 .cse5 .cse6 .cse31 .cse8 .cse9 .cse24 .cse10 .cse12 .cse14 .cse16 .cse17 .cse29 .cse30 .cse19 .cse20) (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse40 .cse5 (not (< ~c_num_read~0 ~p_num_write~0)) .cse6 .cse31 .cse8 .cse9 .cse24 .cse10 (= ~q_write_ev~0 0) .cse14 .cse16 .cse17 .cse29 .cse30 .cse19 .cse20) (or .cse0 .cse1 .cse22 .cse6 .cse37 .cse23 .cse24 .cse11 .cse38 .cse28 .cse15 .cse16 .cse17 .cse30 .cse18 .cse39) (or .cse21 .cse0 (and .cse35 .cse26) .cse1 .cse2 .cse3 .cse5 .cse6 .cse31 .cse8 .cse10 .cse14 .cse16 .cse17 .cse19 .cse20) (or .cse21 .cse0 .cse32 .cse1 .cse2 .cse5 .cse6 .cse31 .cse8 .cse10 .cse11 .cse14 .cse16 .cse17 .cse19 .cse20) (or .cse21 .cse0 .cse2 .cse36 .cse5 .cse22 .cse6 .cse23 .cse8 .cse24 .cse10 .cse28 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20)))) [2021-11-13 18:55:23,605 INFO L858 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2021-11-13 18:55:23,605 INFO L854 garLoopResultBuilder]: At program point activate_threads1ENTRY(lines 315 339) the Hoare annotation is: (let ((.cse20 (= |old(~p_dw_st~0)| 0)) (.cse30 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse0 (not (<= ~c_dr_pc~0 0))) (.cse10 (and .cse30 (= ~p_dw_st~0 0))) (.cse14 (not .cse20)) (.cse24 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse25 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse29 (not (<= 1 ~c_dr_pc~0))) (.cse28 (not (<= 2 ~q_write_ev~0))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (not (<= ~t1_pc~0 0))) (.cse22 (not (= ~q_free~0 0))) (.cse7 (not (<= 2 ~E_M~0))) (.cse26 (not (<= ~c_dr_pc~0 1))) (.cse9 (not (= ~m_st~0 0))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse15 (not (<= ~q_req_up~0 0))) (.cse16 (not (= ~q_read_ev~0 2))) (.cse18 (not (<= 2 ~E_1~0))) (.cse19 (not (= ~token~0 ~local~0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse21 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse30)) (.cse4 (not (= ~p_num_write~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= ~c_num_read~0 0))) (.cse8 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse27 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse12 (not (= ~q_free~0 1))) (.cse23 (= |old(~c_dr_st~0)| 0)) (.cse13 (= ~M_E~0 0)) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse20 .cse2 .cse21 .cse3 .cse5 .cse22 .cse7 .cse9 .cse11 .cse23 .cse13 .cse18 .cse19) (or .cse1 .cse20 .cse2 .cse21 .cse24 .cse3 .cse5 .cse25 .cse7 .cse26 .cse9 .cse27 .cse28 .cse29 .cse11 .cse12 .cse23 .cse13 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse17 .cse18 .cse19) (or .cse1 .cse20 .cse2 .cse21 .cse24 .cse3 .cse5 .cse25 .cse7 .cse26 .cse9 .cse28 .cse29 .cse11 .cse12 .cse23 .cse13 .cse15 .cse17 .cse18 .cse19) (or .cse1 .cse20 .cse2 .cse21 .cse3 .cse5 .cse22 .cse7 .cse26 .cse8 .cse9 .cse28 .cse11 .cse23 .cse13 .cse15 .cse16 .cse18 .cse19) (or .cse1 .cse20 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse21 .cse3 (not (< ~c_num_read~0 ~p_num_write~0)) .cse5 .cse22 .cse7 .cse26 .cse8 .cse9 (= ~q_write_ev~0 0) .cse11 .cse23 .cse13 .cse15 .cse16 .cse18 .cse19) (or .cse1 .cse20 .cse21 .cse4 .cse5 (= ~E_M~0 0) .cse6 .cse8 .cse27 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse12 .cse23 .cse13 .cse17 (= ~T1_E~0 0))))) [2021-11-13 18:55:23,605 INFO L858 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 315 339) no Hoare annotation was computed. [2021-11-13 18:55:23,606 INFO L858 garLoopResultBuilder]: For program point L331(lines 331 335) no Hoare annotation was computed. [2021-11-13 18:55:23,606 INFO L858 garLoopResultBuilder]: For program point L329(line 329) no Hoare annotation was computed. [2021-11-13 18:55:23,606 INFO L858 garLoopResultBuilder]: For program point L331-2(lines 315 339) no Hoare annotation was computed. [2021-11-13 18:55:23,606 INFO L858 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2021-11-13 18:55:23,606 INFO L858 garLoopResultBuilder]: For program point update_channels2EXIT(lines 634 641) no Hoare annotation was computed. [2021-11-13 18:55:23,606 INFO L861 garLoopResultBuilder]: At program point update_channels2FINAL(lines 634 641) the Hoare annotation is: true [2021-11-13 18:55:23,606 INFO L858 garLoopResultBuilder]: For program point L735-1(lines 734 757) no Hoare annotation was computed. [2021-11-13 18:55:23,607 INFO L854 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 731 758) the Hoare annotation is: (let ((.cse3 (not (= ~t1_pc~0 1))) (.cse17 (not (= 2 ~t1_st~0))) (.cse19 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0)))) (.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse20 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (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))) (.cse18 (not (= ~m_st~0 0))) (.cse14 (= |old(~M_E~0)| 0)) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 (not (< ~local~0 ~token~0)) .cse12 .cse13 .cse18 .cse14 .cse15 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse2 (= |old(~E_M~0)| 0) .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 (= |old(~T1_E~0)| 0) .cse13 .cse14 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0))) .cse19 .cse15) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 .cse19 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 (not (= ~m_pc~0 ~t1_pc~0)) .cse2 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15 .cse16))) [2021-11-13 18:55:23,607 INFO L858 garLoopResultBuilder]: For program point L750-1(lines 731 758) no Hoare annotation was computed. [2021-11-13 18:55:23,607 INFO L858 garLoopResultBuilder]: For program point L745-1(lines 734 757) no Hoare annotation was computed. [2021-11-13 18:55:23,607 INFO L858 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 731 758) no Hoare annotation was computed. [2021-11-13 18:55:23,608 INFO L858 garLoopResultBuilder]: For program point L740-1(lines 734 757) no Hoare annotation was computed. [2021-11-13 18:55:23,608 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 ((.cse23 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse7 (not (= ~q_free~0 0))) (.cse18 (not (= |old(~q_read_ev~0)| 2))) (.cse22 (and .cse29 (= ~q_read_ev~0 2))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse15 (not (= ~p_num_write~0 0))) (.cse16 (not (= ~c_num_read~0 0))) (.cse17 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse25 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse26 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse6 (and .cse29 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse24 (not (<= ~c_dr_pc~0 1))) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (not (= ~m_st~0 0))) (.cse27 (not (<= 2 |old(~q_write_ev~0)|))) (.cse28 (not (<= 1 ~c_dr_pc~0))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse19 (not (= ~q_free~0 1))) (.cse12 (= ~M_E~0 0)) (.cse20 (not (<= ~q_req_up~0 0))) (.cse21 (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 .cse1 .cse2 (not .cse9) .cse3 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse4 .cse15 .cse5 .cse16 .cse8 .cse17 .cse10 .cse18 .cse11 .cse19 .cse12 .cse20 .cse21 .cse13 .cse22 .cse14) (or .cse0 .cse2 .cse15 .cse5 (= ~E_M~0 0) .cse6 .cse16 .cse9 .cse17 .cse23 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse19 .cse12 .cse21 (= ~T1_E~0 0)) (or .cse0 .cse2 .cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse4 (not (< ~c_num_read~0 ~p_num_write~0)) .cse5 .cse6 .cse7 .cse8 .cse24 .cse9 .cse17 .cse10 .cse18 .cse11 .cse12 .cse20 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse25 .cse4 .cse5 .cse26 .cse6 .cse8 .cse24 .cse9 .cse10 .cse27 .cse23 .cse28 .cse11 .cse19 .cse12 .cse21 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse24 .cse9 .cse17 .cse10 .cse27 .cse18 .cse11 .cse12 .cse20 .cse13 .cse22 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse16 .cse8 .cse17 .cse10 .cse11 .cse19 .cse12 .cse21 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse25 .cse4 .cse5 .cse26 .cse6 .cse8 .cse24 .cse9 .cse10 .cse27 .cse28 .cse11 .cse19 .cse12 .cse20 .cse21 .cse13 .cse14)))) [2021-11-13 18:55:23,608 INFO L858 garLoopResultBuilder]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2021-11-13 18:55:23,608 INFO L858 garLoopResultBuilder]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2021-11-13 18:55:23,609 INFO L858 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 279 296) no Hoare annotation was computed. [2021-11-13 18:55:23,609 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2021-11-13 18:55:23,609 INFO L861 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 88 106) the Hoare annotation is: true [2021-11-13 18:55:23,609 INFO L858 garLoopResultBuilder]: For program point L92(lines 92 101) no Hoare annotation was computed. [2021-11-13 18:55:23,609 INFO L858 garLoopResultBuilder]: For program point L92-2(lines 92 101) no Hoare annotation was computed. [2021-11-13 18:55:23,609 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 88 106) no Hoare annotation was computed. [2021-11-13 18:55:23,610 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 88 106) no Hoare annotation was computed. [2021-11-13 18:55:23,610 INFO L854 garLoopResultBuilder]: At program point L103(lines 91 105) the Hoare annotation is: (let ((.cse30 (= ~T1_E~0 0)) (.cse32 (< 1 ~m_pc~0)) (.cse33 (<= ~m_pc~0 0)) (.cse37 (= ~m_pc~0 ~t1_pc~0)) (.cse38 (<= 1 ~c_dr_pc~0)) (.cse39 (<= ~c_dr_pc~0 1)) (.cse34 (<= is_do_read_c_triggered_~__retres1~1 0)) (.cse36 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse24 (= ~E_M~0 0)) (.cse13 (= ~M_E~0 0)) (.cse35 (<= 0 is_do_read_c_triggered_~__retres1~1))) (let ((.cse29 (and (not .cse30) (or .cse32 .cse33) .cse37 .cse38 .cse39 .cse34 .cse36 (not .cse24) (not .cse13) .cse35)) (.cse14 (not (<= ~q_req_up~0 0))) (.cse15 (not (= ~q_read_ev~0 2))) (.cse23 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse25 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse7 (not .cse39)) (.cse26 (not (<= 2 ~q_write_ev~0))) (.cse27 (not .cse38)) (.cse18 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~q_free~0 0))) (.cse6 (not (<= 2 ~E_M~0))) (.cse10 (not (= ~m_st~0 0))) (.cse12 (not (= ~p_dw_i~0 1))) (.cse16 (not (<= 2 ~E_1~0))) (.cse17 (not (= ~token~0 ~local~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not .cse37)) (.cse19 (not (= ~p_num_write~0 0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse20 (not (= ~c_num_read~0 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not .cse36)) (.cse31 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse11 (and .cse34 .cse35)) (.cse28 (and (not .cse32) (not .cse33))) (.cse21 (not (= ~q_free~0 1))) (.cse22 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse3 (< 0 ~q_write_ev~0) (not (< ~c_num_read~0 ~p_num_write~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~q_write_ev~0 0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse1 (not .cse8) .cse2 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse3 .cse19 .cse4 .cse20 .cse6 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse22 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse24 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse27 .cse28 .cse12 .cse21 .cse13 .cse14 .cse29 .cse22 .cse16 .cse30 .cse17) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse19 .cse4 .cse24 .cse20 .cse6 .cse9 .cse10 .cse11 .cse28 .cse12 .cse21 .cse13 .cse22 .cse16 .cse30 .cse17) (or .cse0 .cse1 (not (= ~q_read_ev~0 1)) .cse2 .cse23 .cse3 .cse4 .cse24 .cse25 .cse6 .cse7 .cse9 .cse10 .cse26 .cse27 .cse28 .cse12 .cse21 .cse13 .cse14 .cse29 .cse22 .cse16 .cse30 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse24 .cse25 .cse6 .cse7 .cse8 .cse10 .cse31 .cse11 .cse26 .cse27 .cse28 .cse12 .cse21 .cse13 .cse22 .cse16 .cse30 .cse17) (or .cse0 .cse18 .cse1 .cse2 .cse3 .cse4 .cse24 .cse5 .cse6 .cse10 .cse11 .cse28 .cse12 .cse13 .cse16 .cse30 .cse17) (or .cse0 .cse1 .cse19 .cse4 .cse24 .cse20 .cse8 .cse9 .cse31 .cse11 .cse28 .cse21 .cse13 .cse22 .cse30)))) [2021-11-13 18:55:23,610 INFO L858 garLoopResultBuilder]: For program point L960(lines 960 966) no Hoare annotation was computed. [2021-11-13 18:55:23,610 INFO L854 garLoopResultBuilder]: At program point L927(line 927) the Hoare annotation is: (let ((.cse9 (<= ~t1_pc~0 0)) (.cse16 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse15 (= ~token~0 ~local~0)) (.cse17 (= ~m_st~0 0)) (.cse18 (= ~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)) (.cse19 (= 2 ~t1_st~0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 (not (= ~T1_E~0 0)) .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-11-13 18:55:23,610 INFO L858 garLoopResultBuilder]: For program point L927-1(line 927) no Hoare annotation was computed. [2021-11-13 18:55:23,610 INFO L854 garLoopResultBuilder]: At program point L250-1(lines 241 258) the Hoare annotation is: (let ((.cse6 (not (= ~c_dr_st~0 0))) (.cse10 (<= 2 ~E_1~0)) (.cse0 (= ~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)) (.cse11 (<= 2 ~E_M~0)) (.cse12 (= ~m_st~0 0)) (.cse5 (= ~q_free~0 1)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse13 (<= ~t1_pc~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse8 (not (= ~M_E~0 0))) (.cse15 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 (not (= ~T1_E~0 0)) (not .cse1) .cse2 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse8 .cse9) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7 .cse13 .cse14 .cse8 .cse15 .cse9 .cse16 .cse17) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse11 (= ~q_write_ev~0 ~q_read_ev~0) .cse12 .cse5 .cse7 .cse13 .cse14 (<= ~q_req_up~0 0) .cse1 .cse8 (= ~q_read_ev~0 2) .cse15 .cse9 .cse16 .cse17))) [2021-11-13 18:55:23,610 INFO L858 garLoopResultBuilder]: For program point L696(lines 686 724) no Hoare annotation was computed. [2021-11-13 18:55:23,611 INFO L858 garLoopResultBuilder]: For program point L564(lines 564 572) no Hoare annotation was computed. [2021-11-13 18:55:23,611 INFO L858 garLoopResultBuilder]: For program point L878(lines 878 883) no Hoare annotation was computed. [2021-11-13 18:55:23,611 INFO L858 garLoopResultBuilder]: For program point L713(lines 713 720) no Hoare annotation was computed. [2021-11-13 18:55:23,611 INFO L854 garLoopResultBuilder]: At program point L482(lines 473 484) the Hoare annotation is: (not (= ~M_E~0 0)) [2021-11-13 18:55:23,611 INFO L858 garLoopResultBuilder]: For program point L350(line 350) no Hoare annotation was computed. [2021-11-13 18:55:23,611 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-13 18:55:23,611 INFO L854 garLoopResultBuilder]: At program point L829(lines 823 831) the Hoare annotation is: (let ((.cse9 (<= ~t1_pc~0 0)) (.cse16 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse15 (= ~token~0 ~local~0)) (.cse17 (= ~m_st~0 0)) (.cse18 (= ~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)) (.cse19 (= 2 ~t1_st~0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 (not (= ~T1_E~0 0)) .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-11-13 18:55:23,611 INFO L858 garLoopResultBuilder]: For program point L532(line 532) no Hoare annotation was computed. [2021-11-13 18:55:23,611 INFO L854 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse7 (= ~q_free~0 1)) (.cse14 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse24 (< ~c_num_read~0 ~p_num_write~0)) (.cse5 (<= 1 ~c_dr_pc~0)) (.cse25 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse0 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse9 (<= ~c_dr_pc~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse21 (= ~q_free~0 0)) (.cse22 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse20 (<= ~q_req_up~0 0)) (.cse15 (not (= ~M_E~0 0))) (.cse23 (= ~q_read_ev~0 2)) (.cse16 (= ~p_dw_i~0 1)) (.cse18 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse10 .cse21 .cse11 .cse13 .cse15 .cse16 (<= ~c_dr_pc~0 0) .cse18) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse20 .cse15 .cse23 .cse16 .cse17 .cse18 .cse19) (and (= ~p_num_write~0 0) (not (= ~T1_E~0 0)) .cse1 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse2 .cse3 .cse7 .cse10 .cse22 .cse14 (not (= ~E_M~0 0)) .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse24 .cse4 .cse6 .cse9 .cse10 .cse21 .cse22 .cse11 .cse13 .cse20 .cse15 .cse23 .cse16 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse21 .cse22 .cse11 .cse13 .cse20 .cse15 .cse23 .cse16 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse21 .cse22 .cse11 .cse13 .cse20 .cse15 .cse23 .cse16 .cse18))) [2021-11-13 18:55:23,612 INFO L854 garLoopResultBuilder]: At program point L912(line 912) the Hoare annotation is: (let ((.cse9 (<= ~t1_pc~0 0)) (.cse16 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse15 (= ~token~0 ~local~0)) (.cse17 (= ~m_st~0 0)) (.cse18 (= ~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)) (.cse19 (= 2 ~t1_st~0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 (not (= ~T1_E~0 0)) .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-11-13 18:55:23,612 INFO L858 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2021-11-13 18:55:23,612 INFO L858 garLoopResultBuilder]: For program point L912-1(line 912) no Hoare annotation was computed. [2021-11-13 18:55:23,612 INFO L858 garLoopResultBuilder]: For program point L846-1(lines 835 858) no Hoare annotation was computed. [2021-11-13 18:55:23,612 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2021-11-13 18:55:23,612 INFO L858 garLoopResultBuilder]: For program point L962(lines 962 965) no Hoare annotation was computed. [2021-11-13 18:55:23,612 INFO L854 garLoopResultBuilder]: At program point L450(lines 413 455) the Hoare annotation is: (not (= ~M_E~0 0)) [2021-11-13 18:55:23,612 INFO L854 garLoopResultBuilder]: At program point L897(line 897) the Hoare annotation is: (and (<= 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) (<= 2 ~E_M~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) (<= 2 ~T1_E~0) (= ~p_dw_st~0 0) (not (= ~M_E~0 0)) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0)) [2021-11-13 18:55:23,612 INFO L858 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2021-11-13 18:55:23,613 INFO L858 garLoopResultBuilder]: For program point L897-1(line 897) no Hoare annotation was computed. [2021-11-13 18:55:23,613 INFO L858 garLoopResultBuilder]: For program point L352-1(lines 347 387) no Hoare annotation was computed. [2021-11-13 18:55:23,613 INFO L854 garLoopResultBuilder]: At program point L220(lines 173 225) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 1 ~c_dr_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 (<= ~c_dr_pc~0 1)) (.cse11 (not (= ~c_dr_st~0 0))) (.cse12 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse14 (not (= ~M_E~0 0))) (.cse15 (= ~p_dw_i~0 1)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~token~0 ~local~0))) (or (and (= ~q_req_up~0 1) .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~p_num_write~0 ~c_num_read~0) .cse13 .cse14 (<= 1 ~q_read_ev~0) .cse15 .cse16 .cse17 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse0 (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (<= ~q_req_up~0 0) .cse1 .cse14 (= ~q_read_ev~0 2) .cse15 .cse16 .cse17))) [2021-11-13 18:55:23,613 INFO L858 garLoopResultBuilder]: For program point L699(lines 699 706) no Hoare annotation was computed. [2021-11-13 18:55:23,613 INFO L858 garLoopResultBuilder]: For program point L567(lines 567 571) no Hoare annotation was computed. [2021-11-13 18:55:23,614 INFO L854 garLoopResultBuilder]: At program point L435(line 435) the Hoare annotation is: (let ((.cse14 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse20 (not (= ~T1_E~0 0))) (.cse21 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse5 (<= 1 ~c_dr_pc~0)) (.cse7 (= ~q_free~0 1)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse26 (<= ~q_req_up~0 0)) (.cse23 (not (= ~E_M~0 0))) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse29 (= ~q_req_up~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse24 (< ~c_num_read~0 ~p_num_write~0)) (.cse4 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse9 (<= ~c_dr_pc~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse25 (= ~q_free~0 0)) (.cse22 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse15 (not (= ~M_E~0 0))) (.cse27 (= ~q_read_ev~0 2)) (.cse16 (= ~p_dw_i~0 1)) (.cse18 (= ~token~0 ~local~0)) (.cse28 (<= ~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 .cse18 .cse19) (and (= ~p_num_write~0 0) .cse20 .cse1 (= ~c_num_read~0 0) .cse21 .cse2 .cse3 .cse7 .cse10 .cse22 .cse14 .cse23 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse24 .cse4 .cse6 .cse9 .cse10 .cse25 .cse22 .cse11 .cse13 .cse26 .cse15 .cse27 .cse16 .cse18 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse10 .cse25 .cse11 .cse13 .cse15 .cse16 (<= ~c_dr_pc~0 0) .cse18) (and .cse29 .cse0 .cse20 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse23 .cse15 (<= 1 ~q_read_ev~0) .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse25 .cse22 .cse11 .cse13 .cse26 .cse15 .cse27 .cse16 .cse18) (and .cse0 .cse20 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse26 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse29 .cse0 .cse1 .cse2 .cse3 .cse24 .cse4 .cse6 .cse8 .cse9 .cse10 .cse25 .cse22 .cse11 .cse13 .cse15 .cse27 .cse16 .cse18 .cse28))) [2021-11-13 18:55:23,614 INFO L858 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2021-11-13 18:55:23,614 INFO L858 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2021-11-13 18:55:23,614 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 (not (= ~M_E~0 0))) (.cse9 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 (not (= ~T1_E~0 0)) .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)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (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 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0)))) [2021-11-13 18:55:23,614 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2021-11-13 18:55:23,615 INFO L854 garLoopResultBuilder]: At program point L651-1(lines 642 659) 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 (= ~m_pc~0 ~t1_pc~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 (= ~p_dw_st~0 0)) (.cse8 (not (= ~M_E~0 0))) (.cse9 (= ~c_last_read~0 ~p_last_write~0))) (or (and (<= 2 ~E_1~0) .cse0 .cse1 .cse2 .cse3 (<= 2 ~E_M~0) .cse4 (= ~m_st~0 0) .cse5 .cse6 (<= ~t1_pc~0 0) (<= 2 ~T1_E~0) .cse7 .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0)) (and .cse0 (not (= ~T1_E~0 0)) .cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse2 .cse3 .cse4 .cse5 (<= 2 ~m_st~0) .cse6 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9))) [2021-11-13 18:55:23,615 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 (not (= ~E_M~0 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= ~M_E~0 0))) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 (not (= ~T1_E~0 0)) .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 .cse9 .cse10) (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 .cse9 .cse10 (<= ~c_dr_pc~0 0) (< ~local~0 ~token~0)))) [2021-11-13 18:55:23,615 INFO L858 garLoopResultBuilder]: For program point L585-1(line 585) no Hoare annotation was computed. [2021-11-13 18:55:23,615 INFO L854 garLoopResultBuilder]: At program point L420(line 420) the Hoare annotation is: (and (<= 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) (<= 2 ~E_M~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) (<= 2 ~T1_E~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (not (= ~M_E~0 0)) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0)) [2021-11-13 18:55:23,616 INFO L858 garLoopResultBuilder]: For program point L420-1(line 420) no Hoare annotation was computed. [2021-11-13 18:55:23,616 INFO L854 garLoopResultBuilder]: At program point L899(line 899) 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 (= ~m_pc~0 ~t1_pc~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 (= ~p_dw_st~0 0)) (.cse8 (not (= ~M_E~0 0))) (.cse9 (= ~c_last_read~0 ~p_last_write~0))) (or (and (<= 2 ~E_1~0) .cse0 .cse1 .cse2 .cse3 (<= 2 ~E_M~0) .cse4 (= ~m_st~0 0) .cse5 .cse6 (<= ~t1_pc~0 0) (<= 2 ~T1_E~0) .cse7 .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0)) (and .cse0 (not (= ~T1_E~0 0)) .cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse2 .cse3 .cse4 .cse5 (<= 2 ~m_st~0) .cse6 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9))) [2021-11-13 18:55:23,616 INFO L854 garLoopResultBuilder]: At program point L899-1(line 899) 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 (= ~m_pc~0 ~t1_pc~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 (= ~p_dw_st~0 0)) (.cse8 (not (= ~M_E~0 0))) (.cse9 (= ~c_last_read~0 ~p_last_write~0))) (or (and (<= 2 ~E_1~0) .cse0 .cse1 .cse2 .cse3 (<= 2 ~E_M~0) .cse4 (= ~m_st~0 0) .cse5 .cse6 (<= ~t1_pc~0 0) (<= 2 ~T1_E~0) .cse7 .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0)) (and .cse0 (not (= ~T1_E~0 0)) .cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse2 .cse3 .cse4 .cse5 (<= 2 ~m_st~0) .cse6 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9))) [2021-11-13 18:55:23,616 INFO L858 garLoopResultBuilder]: For program point L189(lines 188 219) no Hoare annotation was computed. [2021-11-13 18:55:23,617 INFO L854 garLoopResultBuilder]: At program point L470(lines 456 472) the Hoare annotation is: (and (<= 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) (<= 2 ~E_M~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) (<= 2 ~T1_E~0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (not (= ~M_E~0 0)) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0)) [2021-11-13 18:55:23,617 INFO L854 garLoopResultBuilder]: At program point L916(line 916) the Hoare annotation is: (let ((.cse9 (<= ~t1_pc~0 0)) (.cse16 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse15 (= ~token~0 ~local~0)) (.cse17 (= ~m_st~0 0)) (.cse18 (= ~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)) (.cse19 (= 2 ~t1_st~0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 (not (= ~T1_E~0 0)) .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-11-13 18:55:23,617 INFO L854 garLoopResultBuilder]: At program point L916-1(line 916) the Hoare annotation is: (let ((.cse9 (<= ~t1_pc~0 0)) (.cse16 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse15 (= ~token~0 ~local~0)) (.cse17 (= ~m_st~0 0)) (.cse18 (= ~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)) (.cse19 (= 2 ~t1_st~0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 (not (= ~T1_E~0 0)) .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-11-13 18:55:23,617 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2021-11-13 18:55:23,618 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 (not (= ~M_E~0 0))) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse14 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~t1_pc~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-11-13 18:55:23,618 INFO L858 garLoopResultBuilder]: For program point L520(lines 520 528) no Hoare annotation was computed. [2021-11-13 18:55:23,618 INFO L854 garLoopResultBuilder]: At program point L388(lines 340 393) the Hoare annotation is: (let ((.cse14 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse20 (not (= ~T1_E~0 0))) (.cse21 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse5 (<= 1 ~c_dr_pc~0)) (.cse7 (= ~q_free~0 1)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse26 (<= ~q_req_up~0 0)) (.cse23 (not (= ~E_M~0 0))) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse29 (= ~q_req_up~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse24 (< ~c_num_read~0 ~p_num_write~0)) (.cse4 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse9 (<= ~c_dr_pc~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse25 (= ~q_free~0 0)) (.cse22 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse15 (not (= ~M_E~0 0))) (.cse27 (= ~q_read_ev~0 2)) (.cse16 (= ~p_dw_i~0 1)) (.cse18 (= ~token~0 ~local~0)) (.cse28 (<= ~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 .cse18 .cse19) (and (= ~p_num_write~0 0) .cse20 .cse1 (= ~c_num_read~0 0) .cse21 .cse2 .cse3 .cse7 .cse10 .cse22 .cse14 .cse23 .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse24 .cse4 .cse6 .cse9 .cse10 .cse25 .cse22 .cse11 .cse13 .cse26 .cse15 .cse27 .cse16 .cse18 .cse28) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse10 .cse25 .cse11 .cse13 .cse15 .cse16 (<= ~c_dr_pc~0 0) .cse18) (and .cse29 .cse0 .cse20 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse23 .cse15 (<= 1 ~q_read_ev~0) .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse25 .cse22 .cse11 .cse13 .cse26 .cse15 .cse27 .cse16 .cse18) (and .cse0 .cse20 .cse1 .cse21 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse26 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse29 .cse0 .cse1 .cse2 .cse3 .cse24 .cse4 .cse6 .cse8 .cse9 .cse10 .cse25 .cse22 .cse11 .cse13 .cse15 .cse27 .cse16 .cse18 .cse28))) [2021-11-13 18:55:23,619 INFO L854 garLoopResultBuilder]: At program point L900(line 900) 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 (= ~m_pc~0 ~t1_pc~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 (= ~p_dw_st~0 0)) (.cse8 (not (= ~M_E~0 0))) (.cse9 (= ~c_last_read~0 ~p_last_write~0))) (or (and (<= 2 ~E_1~0) .cse0 .cse1 .cse2 .cse3 (<= 2 ~E_M~0) .cse4 (= ~m_st~0 0) .cse5 .cse6 (<= ~t1_pc~0 0) (<= 2 ~T1_E~0) .cse7 .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0)) (and .cse0 (not (= ~T1_E~0 0)) .cse1 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse2 .cse3 .cse4 .cse5 (<= 2 ~m_st~0) .cse6 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9))) [2021-11-13 18:55:23,619 INFO L854 garLoopResultBuilder]: At program point L867(lines 860 869) the Hoare annotation is: (and (<= 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) (<= 2 ~E_M~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) (<= 2 ~T1_E~0) (= ~p_dw_st~0 0) (not (= ~M_E~0 0)) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0)) [2021-11-13 18:55:23,619 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-13 18:55:23,619 INFO L858 garLoopResultBuilder]: For program point L190-1(lines 190 200) no Hoare annotation was computed. [2021-11-13 18:55:23,619 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 (not (= ~M_E~0 0))) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (<= ~c_dr_pc~0 0)) (.cse12 (= ~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 .cse12) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 2 ~t1_st~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2021-11-13 18:55:23,620 INFO L858 garLoopResultBuilder]: For program point L537-1(line 537) no Hoare annotation was computed. [2021-11-13 18:55:23,620 INFO L854 garLoopResultBuilder]: At program point L917(line 917) the Hoare annotation is: (let ((.cse9 (<= ~t1_pc~0 0)) (.cse16 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse15 (= ~token~0 ~local~0)) (.cse17 (= ~m_st~0 0)) (.cse18 (= ~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)) (.cse19 (= 2 ~t1_st~0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 (not (= ~T1_E~0 0)) .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-11-13 18:55:23,620 INFO L854 garLoopResultBuilder]: At program point L372(lines 347 387) the Hoare annotation is: (let ((.cse29 (= ~p_dw_st~0 0))) (let ((.cse21 (<= 1 ~q_read_ev~0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse14 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse26 (<= ~c_dr_pc~0 0)) (.cse27 (= ~p_num_write~0 0)) (.cse23 (= ~c_num_read~0 0)) (.cse24 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse7 (= ~q_free~0 1)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (= ~q_req_up~0 1)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (not .cse29)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse31 (< ~c_num_read~0 ~p_num_write~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 1 ~c_dr_pc~0)) (.cse6 (= ~m_st~0 0)) (.cse9 (<= ~c_dr_pc~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse25 (= ~q_free~0 0)) (.cse28 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse22 (<= ~q_req_up~0 0)) (.cse15 (not (= ~M_E~0 0))) (.cse30 (= ~q_read_ev~0 2)) (.cse16 (= ~p_dw_i~0 1)) (.cse18 (= ~token~0 ~local~0)) (.cse32 (<= ~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 .cse18 .cse19) (and .cse20 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse20 .cse0 .cse1 .cse23 .cse2 .cse3 .cse4 .cse24 .cse6 .cse8 .cse25 .cse11 .cse13 (<= ~p_num_write~0 1) .cse15 .cse21 .cse16 .cse26 (<= 1 ~p_num_write~0) .cse18) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse10 .cse25 .cse11 .cse13 .cse15 .cse16 .cse26 .cse18) (and .cse0 .cse27 .cse23 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse28 .cse11 .cse13 .cse22 .cse29 .cse15 .cse30 .cse16 .cse17 .cse26 .cse18) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse28 .cse11 .cse12 .cse13 .cse22 .cse15 .cse30 .cse16 .cse17 .cse18 .cse19) (and .cse27 (not (= ~T1_E~0 0)) .cse1 .cse23 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse2 .cse3 .cse7 .cse10 .cse28 .cse14 (not (= ~E_M~0 0)) .cse15 .cse17) (and .cse0 .cse27 .cse23 .cse2 .cse3 .cse4 .cse6 .cse7 .cse10 .cse28 .cse11 .cse13 .cse15 .cse16 .cse17 .cse26 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse31 .cse4 .cse5 .cse6 .cse8 .cse9 .cse25 .cse28 .cse11 .cse13 .cse22 .cse15 .cse30 .cse16 .cse18 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse25 .cse28 .cse11 .cse13 .cse22 .cse15 .cse30 .cse16 .cse18) (and .cse0 .cse27 .cse23 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse22 .cse15 .cse30 .cse16 .cse17 .cse18) (and .cse20 .cse0 .cse1 .cse2 .cse3 .cse31 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse25 .cse28 .cse11 .cse13 .cse15 .cse30 .cse16 .cse18 .cse32) (and .cse0 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse31 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse28 .cse11 .cse13 .cse22 .cse15 .cse30 .cse16 .cse18 .cse32)))) [2021-11-13 18:55:23,621 INFO L854 garLoopResultBuilder]: At program point L851-1(lines 832 859) the Hoare annotation is: (let ((.cse9 (<= ~t1_pc~0 0)) (.cse16 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse15 (= ~token~0 ~local~0)) (.cse17 (= ~m_st~0 0)) (.cse18 (= ~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)) (.cse19 (= 2 ~t1_st~0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 (not (= ~T1_E~0 0)) .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-11-13 18:55:23,621 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2021-11-13 18:55:23,621 INFO L854 garLoopResultBuilder]: At program point L422(line 422) the Hoare annotation is: (let ((.cse6 (not (= ~c_dr_st~0 0))) (.cse10 (<= 2 ~E_1~0)) (.cse0 (= ~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)) (.cse11 (<= 2 ~E_M~0)) (.cse12 (= ~m_st~0 0)) (.cse5 (= ~q_free~0 1)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse13 (<= ~t1_pc~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse8 (not (= ~M_E~0 0))) (.cse15 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 (not (= ~T1_E~0 0)) (not .cse1) .cse2 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse8 .cse9) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7 .cse13 .cse14 .cse8 .cse15 .cse9 .cse16 .cse17) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse11 (= ~q_write_ev~0 ~q_read_ev~0) .cse12 .cse5 .cse7 .cse13 .cse14 (<= ~q_req_up~0 0) .cse1 .cse8 (= ~q_read_ev~0 2) .cse15 .cse9 .cse16 .cse17))) [2021-11-13 18:55:23,622 INFO L854 garLoopResultBuilder]: At program point L422-1(line 422) the Hoare annotation is: (let ((.cse6 (not (= ~c_dr_st~0 0))) (.cse10 (<= 2 ~E_1~0)) (.cse0 (= ~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)) (.cse11 (<= 2 ~E_M~0)) (.cse12 (= ~m_st~0 0)) (.cse5 (= ~q_free~0 1)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse13 (<= ~t1_pc~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse8 (not (= ~M_E~0 0))) (.cse15 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 (not (= ~T1_E~0 0)) (not .cse1) .cse2 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse8 .cse9) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7 .cse13 .cse14 .cse8 .cse15 .cse9 .cse16 .cse17) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse11 (= ~q_write_ev~0 ~q_read_ev~0) .cse12 .cse5 .cse7 .cse13 .cse14 (<= ~q_req_up~0 0) .cse1 .cse8 (= ~q_read_ev~0 2) .cse15 .cse9 .cse16 .cse17))) [2021-11-13 18:55:23,622 INFO L854 garLoopResultBuilder]: At program point L439(line 439) the Hoare annotation is: (let ((.cse5 (<= 1 ~c_dr_pc~0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse7 (= ~q_free~0 1)) (.cse14 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse9 (<= ~c_dr_pc~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse22 (= ~q_free~0 0)) (.cse21 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse20 (<= ~q_req_up~0 0)) (.cse15 (not (= ~M_E~0 0))) (.cse23 (= ~q_read_ev~0 2)) (.cse16 (= ~p_dw_i~0 1)) (.cse18 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse15 .cse16 .cse17 .cse18 .cse19) (and (= ~p_num_write~0 0) (not (= ~T1_E~0 0)) .cse1 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse2 .cse3 .cse7 .cse10 .cse21 .cse14 (not (= ~E_M~0 0)) .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 (< ~c_num_read~0 ~p_num_write~0) .cse4 .cse6 .cse9 .cse10 .cse22 .cse21 .cse11 .cse13 .cse20 .cse15 .cse23 .cse16 .cse18 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse10 .cse22 .cse11 .cse13 .cse15 .cse16 (<= ~c_dr_pc~0 0) .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse22 .cse21 .cse11 .cse13 .cse20 .cse15 .cse23 .cse16 .cse18))) [2021-11-13 18:55:23,622 INFO L854 garLoopResultBuilder]: At program point L439-1(line 439) the Hoare annotation is: (let ((.cse5 (<= 1 ~c_dr_pc~0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse7 (= ~q_free~0 1)) (.cse14 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse9 (<= ~c_dr_pc~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse22 (= ~q_free~0 0)) (.cse21 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse20 (<= ~q_req_up~0 0)) (.cse15 (not (= ~M_E~0 0))) (.cse23 (= ~q_read_ev~0 2)) (.cse16 (= ~p_dw_i~0 1)) (.cse18 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse15 .cse16 .cse17 .cse18 .cse19) (and (= ~p_num_write~0 0) (not (= ~T1_E~0 0)) .cse1 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse2 .cse3 .cse7 .cse10 .cse21 .cse14 (not (= ~E_M~0 0)) .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) (< ~c_num_read~0 ~p_num_write~0) .cse4 .cse6 .cse9 .cse10 .cse22 .cse21 .cse11 .cse13 .cse20 .cse15 .cse23 .cse16 .cse18 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse10 .cse22 .cse11 .cse13 .cse15 .cse16 (<= ~c_dr_pc~0 0) .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse22 .cse21 .cse11 .cse13 .cse20 .cse15 .cse23 .cse16 .cse18))) [2021-11-13 18:55:23,623 INFO L854 garLoopResultBuilder]: At program point L918(line 918) the Hoare annotation is: (let ((.cse9 (<= ~t1_pc~0 0)) (.cse16 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse15 (= ~token~0 ~local~0)) (.cse17 (= ~m_st~0 0)) (.cse18 (= ~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)) (.cse19 (= 2 ~t1_st~0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 (not (= ~T1_E~0 0)) .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-11-13 18:55:23,623 INFO L854 garLoopResultBuilder]: At program point L885(lines 874 887) the Hoare annotation is: (let ((.cse9 (<= ~t1_pc~0 0)) (.cse16 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse15 (= ~token~0 ~local~0)) (.cse17 (= ~m_st~0 0)) (.cse18 (= ~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)) (.cse19 (= 2 ~t1_st~0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 (not (= ~T1_E~0 0)) .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-11-13 18:55:23,623 INFO L854 garLoopResultBuilder]: At program point L687(line 687) the Hoare annotation is: (let ((.cse9 (<= ~t1_pc~0 0)) (.cse16 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse15 (= ~token~0 ~local~0)) (.cse17 (= ~m_st~0 0)) (.cse18 (= ~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)) (.cse19 (= 2 ~t1_st~0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 (not (= ~T1_E~0 0)) .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-11-13 18:55:23,624 INFO L854 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse6 (not (= ~c_dr_st~0 0))) (.cse10 (<= 2 ~E_1~0)) (.cse0 (= ~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)) (.cse11 (<= 2 ~E_M~0)) (.cse12 (= ~m_st~0 0)) (.cse5 (= ~q_free~0 1)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse13 (<= ~t1_pc~0 0)) (.cse14 (<= 2 ~T1_E~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse8 (not (= ~M_E~0 0))) (.cse15 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 (not (= ~T1_E~0 0)) (not .cse1) .cse2 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse8 .cse9) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse11 .cse12 .cse5 .cse6 .cse7 .cse13 .cse14 .cse8 .cse15 .cse9 .cse16 .cse17) (and .cse10 .cse0 .cse2 .cse3 .cse4 .cse11 (= ~q_write_ev~0 ~q_read_ev~0) .cse12 .cse5 .cse7 .cse13 .cse14 (<= ~q_req_up~0 0) .cse1 .cse8 (= ~q_read_ev~0 2) .cse15 .cse9 .cse16 .cse17))) [2021-11-13 18:55:23,624 INFO L858 garLoopResultBuilder]: For program point L357(lines 347 387) no Hoare annotation was computed. [2021-11-13 18:55:23,624 INFO L858 garLoopResultBuilder]: For program point L836(lines 836 840) no Hoare annotation was computed. [2021-11-13 18:55:23,624 INFO L858 garLoopResultBuilder]: For program point L836-2(lines 835 858) no Hoare annotation was computed. [2021-11-13 18:55:23,624 INFO L854 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse8 (<= 2 ~q_write_ev~0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse5 (<= 1 ~c_dr_pc~0)) (.cse7 (= ~q_free~0 1)) (.cse14 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse24 (< 0 ~q_write_ev~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse23 (< ~c_num_read~0 ~p_num_write~0)) (.cse4 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse9 (<= ~c_dr_pc~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse22 (= ~q_free~0 0)) (.cse20 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse21 (<= ~q_req_up~0 0)) (.cse15 (not (= ~M_E~0 0))) (.cse25 (= ~q_read_ev~0 2)) (.cse16 (= ~p_dw_i~0 1)) (.cse18 (= ~token~0 ~local~0)) (.cse26 (<= ~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 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~q_read_ev~0 1) .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse21 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse10 .cse22 .cse11 .cse13 .cse15 .cse16 (<= ~c_dr_pc~0 0) .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse9 .cse22 .cse20 .cse11 .cse24 .cse13 .cse21 .cse15 .cse25 .cse16 .cse18 .cse26) (and (= ~p_num_write~0 0) (not (= ~T1_E~0 0)) .cse1 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse2 .cse3 .cse7 .cse10 .cse20 .cse14 (not (= ~E_M~0 0)) .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse10 .cse22 .cse20 .cse11 .cse24 .cse13 .cse21 .cse15 .cse25 .cse16 .cse18) (and .cse0 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse23 .cse4 .cse6 .cse9 .cse10 .cse22 .cse20 .cse11 .cse13 .cse21 .cse15 .cse25 .cse16 .cse18 .cse26))) [2021-11-13 18:55:23,625 INFO L854 garLoopResultBuilder]: At program point L886(lines 870 888) the Hoare annotation is: (let ((.cse9 (<= ~t1_pc~0 0)) (.cse16 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse15 (= ~token~0 ~local~0)) (.cse17 (= ~m_st~0 0)) (.cse18 (= ~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)) (.cse19 (= 2 ~t1_st~0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 (not (= ~T1_E~0 0)) .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-11-13 18:55:23,625 INFO L854 garLoopResultBuilder]: At program point L589(lines 560 595) the Hoare annotation is: (let ((.cse3 (or (<= ~m_pc~0 0) (and (<= ~t1_pc~0 1) (< 1 ~m_pc~0)))) (.cse14 (= ~m_st~0 0)) (.cse11 (= ~t1_pc~0 1)) (.cse12 (<= 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)) (.cse13 (<= 2 ~E_M~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (= ~q_free~0 0)) (.cse15 (= 2 ~t1_st~0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (not (= ~M_E~0 0))) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (<= ~c_dr_pc~0 0))) (or (and .cse0 (not (= ~T1_E~0 0)) .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)) (not (= ~E_M~0 0)) .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse14 .cse5 .cse15 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17 (= ~token~0 ~local~0)) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse13 .cse4 .cse14 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse15 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17 (< ~local~0 ~token~0)) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse13 .cse4 .cse5 .cse15 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse17))) [2021-11-13 18:55:23,625 INFO L858 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2021-11-13 18:55:23,626 INFO L858 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2021-11-13 18:55:23,626 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-13 18:55:23,626 INFO L858 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2021-11-13 18:55:23,626 INFO L858 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2021-11-13 18:55:23,626 INFO L858 garLoopResultBuilder]: For program point L689(line 689) no Hoare annotation was computed. [2021-11-13 18:55:23,626 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) (= 2 ~t1_st~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= 2 ~T1_E~0) (= ~p_dw_st~0 0) (not (= ~M_E~0 0)) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (< ~local~0 ~token~0)) [2021-11-13 18:55:23,627 INFO L854 garLoopResultBuilder]: At program point L904-1(lines 901 941) the Hoare annotation is: (let ((.cse9 (<= ~t1_pc~0 0)) (.cse16 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse15 (= ~token~0 ~local~0)) (.cse17 (= ~m_st~0 0)) (.cse18 (= ~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)) (.cse19 (= 2 ~t1_st~0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 (not (= ~T1_E~0 0)) .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-11-13 18:55:23,627 INFO L854 garLoopResultBuilder]: At program point L409(lines 398 411) the Hoare annotation is: (let ((.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse7 (= ~q_free~0 1)) (.cse14 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse24 (< ~c_num_read~0 ~p_num_write~0)) (.cse5 (<= 1 ~c_dr_pc~0)) (.cse25 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse0 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse9 (<= ~c_dr_pc~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse21 (= ~q_free~0 0)) (.cse22 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse20 (<= ~q_req_up~0 0)) (.cse15 (not (= ~M_E~0 0))) (.cse23 (= ~q_read_ev~0 2)) (.cse16 (= ~p_dw_i~0 1)) (.cse18 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse10 .cse21 .cse11 .cse13 .cse15 .cse16 (<= ~c_dr_pc~0 0) .cse18) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse20 .cse15 .cse23 .cse16 .cse17 .cse18 .cse19) (and (= ~p_num_write~0 0) (not (= ~T1_E~0 0)) .cse1 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse2 .cse3 .cse7 .cse10 .cse22 .cse14 (not (= ~E_M~0 0)) .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse24 .cse4 .cse6 .cse9 .cse10 .cse21 .cse22 .cse11 .cse13 .cse20 .cse15 .cse23 .cse16 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse21 .cse22 .cse11 .cse13 .cse20 .cse15 .cse23 .cse16 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse21 .cse22 .cse11 .cse13 .cse20 .cse15 .cse23 .cse16 .cse18))) [2021-11-13 18:55:23,627 INFO L858 garLoopResultBuilder]: For program point L921(line 921) no Hoare annotation was computed. [2021-11-13 18:55:23,628 INFO L858 garLoopResultBuilder]: For program point L376(lines 376 383) no Hoare annotation was computed. [2021-11-13 18:55:23,628 INFO L854 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: false [2021-11-13 18:55:23,628 INFO L858 garLoopResultBuilder]: For program point L905(line 905) no Hoare annotation was computed. [2021-11-13 18:55:23,628 INFO L854 garLoopResultBuilder]: At program point L575-1(lines 563 594) the Hoare annotation is: (let ((.cse14 (not (= ~T1_E~0 0))) (.cse15 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse7 (<= 2 ~m_st~0)) (.cse17 (not (= ~E_M~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)) (.cse16 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= 2 ~T1_E~0)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (not (= ~M_E~0 0))) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse15 .cse3 .cse4 .cse5 .cse16 .cse6 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 (= ~token~0 ~local~0)) (and .cse1 .cse14 .cse2 .cse15 .cse3 .cse5 .cse6 .cse7 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) .cse17 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (< ~local~0 ~token~0)))) [2021-11-13 18:55:23,629 INFO L854 garLoopResultBuilder]: At program point L410(lines 394 412) the Hoare annotation is: (let ((.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse7 (= ~q_free~0 1)) (.cse14 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse24 (< ~c_num_read~0 ~p_num_write~0)) (.cse5 (<= 1 ~c_dr_pc~0)) (.cse25 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse0 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse9 (<= ~c_dr_pc~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse21 (= ~q_free~0 0)) (.cse22 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse20 (<= ~q_req_up~0 0)) (.cse15 (not (= ~M_E~0 0))) (.cse23 (= ~q_read_ev~0 2)) (.cse16 (= ~p_dw_i~0 1)) (.cse18 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse10 .cse21 .cse11 .cse13 .cse15 .cse16 (<= ~c_dr_pc~0 0) .cse18) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12 .cse13 .cse20 .cse15 .cse23 .cse16 .cse17 .cse18 .cse19) (and (= ~p_num_write~0 0) (not (= ~T1_E~0 0)) .cse1 (= ~c_num_read~0 0) (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse2 .cse3 .cse7 .cse10 .cse22 .cse14 (not (= ~E_M~0 0)) .cse15 .cse17) (and .cse0 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse24 .cse4 .cse6 .cse9 .cse10 .cse21 .cse22 .cse11 .cse13 .cse20 .cse15 .cse23 .cse16 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse21 .cse22 .cse11 .cse13 .cse20 .cse15 .cse23 .cse16 .cse18 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse21 .cse22 .cse11 .cse13 .cse20 .cse15 .cse23 .cse16 .cse18))) [2021-11-13 18:55:23,629 INFO L858 garLoopResultBuilder]: For program point L245(lines 245 249) no Hoare annotation was computed. [2021-11-13 18:55:23,629 INFO L858 garLoopResultBuilder]: For program point L245-2(lines 244 257) no Hoare annotation was computed. [2021-11-13 18:55:23,629 INFO L858 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2021-11-13 18:55:23,629 INFO L858 garLoopResultBuilder]: For program point L691-1(lines 686 724) no Hoare annotation was computed. [2021-11-13 18:55:23,630 INFO L854 garLoopResultBuilder]: At program point L427-1(lines 424 449) the Hoare annotation is: (let ((.cse26 (= ~p_dw_st~0 0))) (let ((.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse14 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse23 (= ~p_num_write~0 0)) (.cse24 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse22 (<= ~c_dr_pc~0 0)) (.cse28 (< ~c_num_read~0 ~p_num_write~0)) (.cse5 (<= 1 ~c_dr_pc~0)) (.cse29 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse0 (<= 2 ~E_1~0)) (.cse1 (not .cse26)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse9 (<= ~c_dr_pc~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse21 (= ~q_free~0 0)) (.cse25 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse20 (<= ~q_req_up~0 0)) (.cse15 (not (= ~M_E~0 0))) (.cse27 (= ~q_read_ev~0 2)) (.cse16 (= ~p_dw_i~0 1)) (.cse18 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse10 .cse21 .cse11 .cse13 .cse15 .cse16 .cse22 .cse18) (and .cse0 .cse23 .cse24 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse25 .cse11 .cse13 .cse20 .cse26 .cse15 .cse27 .cse16 .cse17 .cse22 .cse18) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse20 .cse15 .cse27 .cse16 .cse17 .cse18 .cse19) (and .cse23 (not (= ~T1_E~0 0)) .cse1 .cse24 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse2 .cse3 .cse7 .cse10 .cse25 .cse14 (not (= ~E_M~0 0)) .cse15 .cse17) (and .cse0 .cse23 .cse24 .cse2 .cse3 .cse4 .cse6 .cse7 .cse10 .cse25 .cse11 .cse13 .cse15 .cse16 .cse17 .cse22 .cse18) (and .cse0 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse28 .cse4 .cse6 .cse9 .cse10 .cse21 .cse25 .cse11 .cse13 .cse20 .cse15 .cse27 .cse16 .cse18 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse8 .cse9 .cse21 .cse25 .cse11 .cse13 .cse20 .cse15 .cse27 .cse16 .cse18 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse21 .cse25 .cse11 .cse13 .cse20 .cse15 .cse27 .cse16 .cse18)))) [2021-11-13 18:55:23,630 INFO L858 garLoopResultBuilder]: For program point L361(lines 361 368) no Hoare annotation was computed. [2021-11-13 18:55:23,630 INFO L858 garLoopResultBuilder]: For program point L576(line 576) no Hoare annotation was computed. [2021-11-13 18:55:23,630 INFO L858 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2021-11-13 18:55:23,630 INFO L858 garLoopResultBuilder]: For program point L923(lines 923 932) no Hoare annotation was computed. [2021-11-13 18:55:23,630 INFO L858 garLoopResultBuilder]: For program point L923-2(lines 923 932) no Hoare annotation was computed. [2021-11-13 18:55:23,631 INFO L854 garLoopResultBuilder]: At program point L725(lines 680 730) the Hoare annotation is: (let ((.cse9 (<= ~t1_pc~0 0)) (.cse16 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse15 (= ~token~0 ~local~0)) (.cse17 (= ~m_st~0 0)) (.cse18 (= ~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)) (.cse19 (= 2 ~t1_st~0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 (not (= ~T1_E~0 0)) .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-11-13 18:55:23,631 INFO L858 garLoopResultBuilder]: For program point L180(lines 180 184) no Hoare annotation was computed. [2021-11-13 18:55:23,631 INFO L854 garLoopResultBuilder]: At program point L147-1(lines 135 170) the Hoare annotation is: (let ((.cse2 (not (= ~T1_E~0 0))) (.cse4 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse8 (<= 1 ~c_dr_pc~0)) (.cse12 (<= ~c_dr_pc~0 1)) (.cse25 (<= ~q_req_up~0 0)) (.cse19 (= ~q_read_ev~0 2)) (.cse0 (= ~q_req_up~0 1)) (.cse11 (<= 2 ~q_write_ev~0)) (.cse26 (<= 1 ~q_read_ev~0)) (.cse22 (= ~p_num_write~0 0)) (.cse23 (= ~c_num_read~0 0)) (.cse24 (= ~q_free~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 2 ~E_M~0)) (.cse9 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse10 (= ~m_st~0 0)) (.cse13 (not (= ~c_dr_st~0 0))) (.cse14 (= ~q_free~0 0)) (.cse15 (<= ~t1_pc~0 0)) (.cse16 (<= 2 ~T1_E~0)) (.cse17 (not (= ~E_M~0 0))) (.cse18 (not (= ~M_E~0 0))) (.cse20 (= ~p_dw_i~0 1)) (.cse27 (<= ~c_dr_pc~0 0)) (.cse21 (= ~token~0 ~local~0))) (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 .cse20 .cse21 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse1 .cse22 .cse3 .cse23 .cse5 .cse6 .cse7 .cse9 .cse10 .cse24 .cse11 .cse15 .cse16 .cse25 .cse17 .cse18 .cse26 .cse20 .cse27 .cse21) (and .cse1 .cse22 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse3 .cse23 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 (<= ~p_num_write~0 1) .cse17 .cse18 .cse26 .cse20 .cse27 (<= 1 ~p_num_write~0) .cse21) (and .cse1 .cse22 .cse3 .cse23 .cse5 .cse6 .cse7 .cse9 .cse10 .cse24 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse27 .cse21) (and .cse1 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse27 .cse21))) [2021-11-13 18:55:23,632 INFO L858 garLoopResultBuilder]: For program point L428(line 428) no Hoare annotation was computed. [2021-11-13 18:55:23,632 INFO L858 garLoopResultBuilder]: For program point L841-1(lines 835 858) no Hoare annotation was computed. [2021-11-13 18:55:23,632 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-13 18:55:23,632 INFO L854 garLoopResultBuilder]: At program point L957(lines 948 959) the Hoare annotation is: (not (= ~M_E~0 0)) [2021-11-13 18:55:23,632 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2021-11-13 18:55:23,633 INFO L854 garLoopResultBuilder]: At program point L181(lines 176 224) the Hoare annotation is: (and (<= 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) (<= 2 ~E_M~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) (<= 2 ~T1_E~0) (<= ~q_req_up~0 0) (not (= ~M_E~0 0)) (<= 1 ~q_read_ev~0) (= ~p_dw_i~0 1) (= ~token~0 ~local~0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2021-11-13 18:55:23,633 INFO L858 garLoopResultBuilder]: For program point L148(lines 147 165) no Hoare annotation was computed. [2021-11-13 18:55:23,633 INFO L854 garLoopResultBuilder]: At program point L710(lines 686 724) the Hoare annotation is: (let ((.cse9 (<= ~t1_pc~0 0)) (.cse16 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse15 (= ~token~0 ~local~0)) (.cse17 (= ~m_st~0 0)) (.cse18 (= ~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)) (.cse19 (= 2 ~t1_st~0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 (not (= ~T1_E~0 0)) .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-11-13 18:55:23,633 INFO L854 garLoopResultBuilder]: At program point L545-1(lines 519 558) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.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)) (.cse7 (= ~q_free~0 0)) (.cse8 (= 2 ~t1_st~0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 ~t1_pc~0) .cse5 .cse6 .cse7 .cse9 (<= ~t1_pc~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)))) [2021-11-13 18:55:23,634 INFO L854 garLoopResultBuilder]: At program point L149(lines 135 170) the Hoare annotation is: (let ((.cse11 (not (= ~c_dr_st~0 0))) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (not (= ~T1_E~0 0))) (.cse3 (not (= ~p_dw_st~0 0))) (.cse4 (= ~c_num_read~0 0)) (.cse5 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~m_pc~0 ~t1_pc~0)) (.cse8 (<= 2 ~E_M~0)) (.cse9 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse10 (= ~m_st~0 0)) (.cse19 (<= 2 ~q_write_ev~0)) (.cse12 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse14 (not (= ~E_M~0 0))) (.cse15 (not (= ~M_E~0 0))) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse18 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse3 .cse6 .cse7 .cse8 (<= 1 ~c_dr_pc~0) .cse9 .cse10 .cse19 (<= ~c_dr_pc~0 1) .cse11 .cse12 (<= ~p_num_write~0 ~c_num_read~0) .cse13 .cse15 (= ~q_read_ev~0 2) .cse16 .cse18 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~q_free~0 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 .cse12 .cse13 (<= ~q_req_up~0 0) .cse14 .cse15 (<= 1 ~q_read_ev~0) .cse16 .cse17 .cse18))) [2021-11-13 18:55:23,634 INFO L858 garLoopResultBuilder]: For program point L496(line 496) no Hoare annotation was computed. [2021-11-13 18:55:23,634 INFO L854 garLoopResultBuilder]: At program point L942(lines 889 947) the Hoare annotation is: (not (= ~M_E~0 0)) [2021-11-13 18:55:23,634 INFO L854 garLoopResultBuilder]: At program point L876(line 876) the Hoare annotation is: (let ((.cse9 (<= ~t1_pc~0 0)) (.cse16 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse15 (= ~token~0 ~local~0)) (.cse17 (= ~m_st~0 0)) (.cse18 (= ~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)) (.cse19 (= 2 ~t1_st~0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (<= 2 ~T1_E~0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 (not (= ~T1_E~0 0)) .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0)) (not (= ~E_M~0 0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse19 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~local~0 ~token~0)) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14))) [2021-11-13 18:55:23,635 INFO L858 garLoopResultBuilder]: For program point L876-1(line 876) no Hoare annotation was computed. [2021-11-13 18:55:23,635 INFO L854 garLoopResultBuilder]: At program point L166(lines 132 171) the Hoare annotation is: (let ((.cse0 (= ~q_req_up~0 1)) (.cse8 (<= 2 ~q_write_ev~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 (<= 2 ~E_M~0)) (.cse6 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse7 (= ~m_st~0 0)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse10 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (<= 2 ~T1_E~0)) (.cse13 (not (= ~M_E~0 0))) (.cse14 (= ~p_dw_i~0 1)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse15 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (< ~c_num_read~0 ~p_num_write~0) .cse5 .cse6 .cse7 .cse8 (<= ~c_dr_pc~0 1) .cse9 .cse10 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse11 .cse12 .cse13 (= ~q_read_ev~0 2) .cse14 .cse15 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 (= ~c_num_read~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 (<= ~p_num_write~0 1) .cse13 (<= 1 ~q_read_ev~0) .cse14 .cse16 (<= 1 ~p_num_write~0) .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse15))) [2021-11-13 18:55:23,635 INFO L854 garLoopResultBuilder]: At program point L348(line 348) the Hoare annotation is: (let ((.cse29 (= ~p_dw_st~0 0))) (let ((.cse21 (<= 1 ~q_read_ev~0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse14 (or (<= ~p_dw_pc~0 0) (< 1 ~p_dw_pc~0))) (.cse26 (<= ~c_dr_pc~0 0)) (.cse27 (= ~p_num_write~0 0)) (.cse23 (= ~c_num_read~0 0)) (.cse24 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse7 (= ~q_free~0 1)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (= ~q_req_up~0 1)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (not .cse29)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse31 (< ~c_num_read~0 ~p_num_write~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 1 ~c_dr_pc~0)) (.cse6 (= ~m_st~0 0)) (.cse9 (<= ~c_dr_pc~0 1)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse25 (= ~q_free~0 0)) (.cse28 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse11 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse22 (<= ~q_req_up~0 0)) (.cse15 (not (= ~M_E~0 0))) (.cse30 (= ~q_read_ev~0 2)) (.cse16 (= ~p_dw_i~0 1)) (.cse18 (= ~token~0 ~local~0)) (.cse32 (<= ~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 .cse18 .cse19) (and .cse20 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse21 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse22 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse20 .cse0 .cse1 .cse23 .cse2 .cse3 .cse4 .cse24 .cse6 .cse8 .cse25 .cse11 .cse13 (<= ~p_num_write~0 1) .cse15 .cse21 .cse16 .cse26 (<= 1 ~p_num_write~0) .cse18) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse10 .cse25 .cse11 .cse13 .cse15 .cse16 .cse26 .cse18) (and .cse0 .cse27 .cse23 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse28 .cse11 .cse13 .cse22 .cse29 .cse15 .cse30 .cse16 .cse17 .cse26 .cse18) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse28 .cse11 .cse12 .cse13 .cse22 .cse15 .cse30 .cse16 .cse17 .cse18 .cse19) (and .cse27 (not (= ~T1_E~0 0)) .cse1 .cse23 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0)) .cse2 .cse3 .cse7 .cse10 .cse28 .cse14 (not (= ~E_M~0 0)) .cse15 .cse17) (and .cse0 .cse27 .cse23 .cse2 .cse3 .cse4 .cse6 .cse7 .cse10 .cse28 .cse11 .cse13 .cse15 .cse16 .cse17 .cse26 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse31 .cse4 .cse5 .cse6 .cse8 .cse9 .cse25 .cse28 .cse11 .cse13 .cse22 .cse15 .cse30 .cse16 .cse18 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse25 .cse28 .cse11 .cse13 .cse22 .cse15 .cse30 .cse16 .cse18) (and .cse0 .cse27 .cse23 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse22 .cse15 .cse30 .cse16 .cse17 .cse18) (and .cse20 .cse0 .cse1 .cse2 .cse3 .cse31 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse25 .cse28 .cse11 .cse13 .cse15 .cse30 .cse16 .cse18 .cse32) (and .cse0 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse31 .cse4 .cse5 .cse6 .cse9 .cse10 .cse25 .cse28 .cse11 .cse13 .cse22 .cse15 .cse30 .cse16 .cse18 .cse32)))) [2021-11-13 18:55:23,636 INFO L854 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2021-11-13 18:55:23,636 INFO L854 garLoopResultBuilder]: At program point L216-1(lines 176 224) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 0))) (let ((.cse7 (= ~q_free~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~q_req_up~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse22 (not (= ~T1_E~0 0))) (.cse19 (not .cse12)) (.cse1 (= ~c_num_read~0 0)) (.cse23 (or (< 1 ~m_pc~0) (<= ~m_pc~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse6 (= ~m_st~0 0)) (.cse8 (<= 2 ~q_write_ev~0)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse10 (<= ~t1_pc~0 0)) (.cse11 (<= 2 ~T1_E~0)) (.cse24 (not (= ~E_M~0 0))) (.cse13 (not (= ~M_E~0 0))) (.cse25 (<= 1 ~q_read_ev~0)) (.cse14 (= ~p_dw_i~0 1)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 .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 .cse13 (= ~q_read_ev~0 2) .cse14 .cse15 .cse16 .cse17) (and (let ((.cse20 (<= ~p_num_write~0 ~c_num_read~0)) (.cse21 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse18 .cse0 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~c_dr_pc~0 1) .cse9 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse10 .cse20 .cse11 .cse13 .cse14 .cse15 .cse17 .cse21) (and .cse18 .cse0 .cse22 .cse19 .cse23 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse21))) .cse25) (and .cse18 .cse0 .cse22 .cse19 .cse1 .cse23 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 (= ~q_free~0 0) .cse10 .cse11 (<= ~p_num_write~0 1) .cse24 .cse13 .cse25 .cse14 .cse16 (<= 1 ~p_num_write~0) .cse17)))) [2021-11-13 18:55:23,636 INFO L854 garLoopResultBuilder]: At program point L497(lines 492 499) the Hoare annotation is: false [2021-11-13 18:55:23,636 INFO L858 garLoopResultBuilder]: For program point L646(lines 646 650) no Hoare annotation was computed. [2021-11-13 18:55:23,636 INFO L858 garLoopResultBuilder]: For program point L646-2(lines 645 658) no Hoare annotation was computed. [2021-11-13 18:55:23,637 INFO L854 garLoopResultBuilder]: At program point L84(lines 72 86) the Hoare annotation is: (let ((.cse28 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse29 (<= is_do_write_p_triggered_~__retres1~0 0)) (.cse30 (<= 0 is_do_write_p_triggered_~__retres1~0))) (let ((.cse22 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse25 (not (= ~q_free~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse18 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse19 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse20 (not (<= ~c_dr_pc~0 1))) (.cse23 (not (<= 2 ~q_write_ev~0))) (.cse24 (not (<= 1 ~c_dr_pc~0))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse21 (= ~p_dw_st~0 0)) (.cse3 (not (<= 2 ~T1_E~0))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (and .cse29 .cse30)) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse10 (not .cse28)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (not (= ~p_dw_i~0 1))) (.cse13 (not (= ~q_free~0 1))) (.cse14 (= ~M_E~0 0)) (.cse26 (not (<= ~q_req_up~0 0))) (.cse27 (not (= ~q_read_ev~0 2))) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (not (<= 2 ~E_1~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 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse19 .cse9 .cse20 .cse21 .cse11 .cse22 .cse23 .cse24 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse25 .cse9 .cse20 .cse21 .cse10 .cse11 .cse23 .cse12 .cse14 .cse26 .cse27 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse25 .cse9 .cse21 .cse11 .cse22 .cse12 .cse14 .cse16 .cse17) (or .cse0 .cse2 .cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse4 .cse6 (not (< ~c_num_read~0 ~p_num_write~0)) .cse7 .cse25 .cse9 .cse20 .cse21 .cse10 .cse11 (= ~q_write_ev~0 0) .cse12 .cse14 .cse26 .cse27 .cse16 .cse17) (or .cse0 .cse2 .cse5 .cse6 .cse7 (= ~E_M~0 0) .cse8 .cse21 .cse10 .cse22 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse13 .cse14 .cse15 (= ~T1_E~0 0)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse25 .cse9 .cse21 .cse11 .cse12 .cse14 .cse27 .cse16 .cse17) (or .cse0 .cse2 .cse3 .cse18 .cse4 (and (= ~q_read_ev~0 1) .cse28) .cse7 .cse19 (and .cse28 .cse29 .cse30) .cse9 .cse20 .cse21 .cse11 .cse23 .cse24 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse17) (or .cse1 .cse2 (not .cse21) .cse3 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse27 .cse15 .cse16 .cse17)))) [2021-11-13 18:55:23,637 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 69 87) no Hoare annotation was computed. [2021-11-13 18:55:23,637 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 69 87) no Hoare annotation was computed. [2021-11-13 18:55:23,637 INFO L858 garLoopResultBuilder]: For program point L74(lines 74 79) no Hoare annotation was computed. [2021-11-13 18:55:23,638 INFO L858 garLoopResultBuilder]: For program point L73(lines 73 82) no Hoare annotation was computed. [2021-11-13 18:55:23,638 INFO L858 garLoopResultBuilder]: For program point L73-2(lines 73 82) no Hoare annotation was computed. [2021-11-13 18:55:23,638 INFO L861 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 69 87) the Hoare annotation is: true [2021-11-13 18:55:23,638 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 259 278) no Hoare annotation was computed. [2021-11-13 18:55:23,639 INFO L854 garLoopResultBuilder]: At program point L275(lines 262 277) the Hoare annotation is: (let ((.cse24 (= ~p_dw_st~0 0)) (.cse27 (= ~q_read_ev~0 2)) (.cse0 (= ~c_dr_st~0 0))) (let ((.cse15 (not (<= ~c_dr_pc~0 1))) (.cse18 (not (<= 1 ~c_dr_pc~0))) (.cse7 (not (= ~q_free~0 0))) (.cse23 (not .cse0)) (.cse17 (not (<= 2 ~q_write_ev~0))) (.cse20 (not (<= ~q_req_up~0 0))) (.cse21 (not .cse27)) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (not .cse24)) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse25 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse26 (not (= ~c_num_read~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse16 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~m_st~0 0))) (.cse10 (not (= ~p_dw_i~0 1))) (.cse19 (not (= ~q_free~0 1))) (.cse11 (<= 1 exists_runnable_thread1_~__retres1~2)) (.cse12 (= ~M_E~0 0)) (.cse22 (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 .cse2 .cse3 .cse4 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse5 .cse6 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse8 .cse15 .cse16 .cse9 .cse17 .cse18 .cse10 .cse19 .cse11 .cse12 .cse20 .cse21 .cse22 .cse13 .cse14) (or .cse2 .cse4 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse23 .cse5 (not (< ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 .cse8 .cse15 .cse24 .cse16 .cse9 .cse17 .cse18 .cse10 .cse11 .cse12 .cse20 .cse21 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse25 .cse6 .cse26 .cse8 .cse15 .cse9 .cse17 .cse18 .cse10 .cse19 .cse11 .cse12 .cse20 .cse21 .cse22 .cse13 .cse14) (or .cse1 .cse2 (not (= ~q_req_up~0 1)) .cse4 .cse5 .cse6 .cse26 .cse7 .cse8 .cse24 .cse9 .cse17 .cse10 .cse11 .cse12 (not (<= 1 ~p_num_write~0)) (not (<= 1 ~q_read_ev~0)) (and .cse23 .cse27) .cse13 (not (<= ~p_num_write~0 1)) .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse6 .cse26 .cse8 .cse16 .cse9 .cse17 .cse10 .cse19 .cse11 .cse12 .cse20 .cse21 .cse22 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse6 .cse26 .cse8 .cse16 .cse9 .cse10 .cse19 .cse11 .cse12 .cse22 .cse13 .cse14)))) [2021-11-13 18:55:23,639 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 259 278) the Hoare annotation is: true [2021-11-13 18:55:23,639 INFO L858 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2021-11-13 18:55:23,639 INFO L858 garLoopResultBuilder]: For program point L263(lines 263 273) no Hoare annotation was computed. [2021-11-13 18:55:23,639 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 259 278) no Hoare annotation was computed. [2021-11-13 18:55:23,639 INFO L861 garLoopResultBuilder]: At program point error1ENTRY(lines 24 31) the Hoare annotation is: true [2021-11-13 18:55:23,640 INFO L858 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 28) no Hoare annotation was computed. [2021-11-13 18:55:23,640 INFO L858 garLoopResultBuilder]: For program point error1FINAL(lines 24 31) no Hoare annotation was computed. [2021-11-13 18:55:23,640 INFO L858 garLoopResultBuilder]: For program point error1EXIT(lines 24 31) no Hoare annotation was computed. [2021-11-13 18:55:23,640 INFO L858 garLoopResultBuilder]: For program point L668(lines 668 673) no Hoare annotation was computed. [2021-11-13 18:55:23,640 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 660 679) no Hoare annotation was computed. [2021-11-13 18:55:23,640 INFO L858 garLoopResultBuilder]: For program point L664(lines 664 674) no Hoare annotation was computed. [2021-11-13 18:55:23,640 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 660 679) the Hoare annotation is: true [2021-11-13 18:55:23,640 INFO L861 garLoopResultBuilder]: At program point L676(lines 663 678) the Hoare annotation is: true [2021-11-13 18:55:23,640 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 660 679) no Hoare annotation was computed. [2021-11-13 18:55:23,640 INFO L858 garLoopResultBuilder]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2021-11-13 18:55:23,641 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 ((.cse26 (and .cse32 (= ~q_read_ev~0 2))) (.cse3 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse6 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse12 (not (<= 2 |old(~q_write_ev~0)|))) (.cse29 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0)))) (.cse23 (not (= ~p_num_write~0 0))) (.cse24 (not (= ~c_num_read~0 0))) (.cse15 (not (= ~q_free~0 1))) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse22 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse30 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse31 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (and .cse32 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse27 (not (= ~q_free~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (<= ~c_dr_pc~0 1))) (.cse21 (= ~p_dw_st~0 0)) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~m_st~0 0))) (.cse25 (not (= |old(~q_read_ev~0)| 2))) (.cse28 (not (< 0 |old(~q_write_ev~0)|))) (.cse13 (not (<= 1 ~c_dr_pc~0))) (.cse14 (not (= ~p_dw_i~0 1))) (.cse16 (= ~M_E~0 0)) (.cse17 (not (<= ~q_req_up~0 0))) (.cse19 (not (<= 2 ~E_1~0))) (.cse20 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= |old(~q_read_ev~0)| 1)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse22 .cse1 (not .cse21) .cse2 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse4 .cse23 .cse5 .cse24 .cse8 .cse10 .cse11 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse26 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse27 .cse8 .cse9 .cse21 .cse10 .cse11 .cse25 .cse28 .cse14 .cse16 .cse17 .cse19 .cse26 .cse20) (or .cse0 .cse1 .cse23 .cse5 (= ~E_M~0 0) .cse7 .cse24 .cse21 .cse10 .cse29 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0))) .cse15 .cse16 .cse18 (= ~T1_E~0 0)) (or .cse0 .cse1 .cse2 .cse30 .cse4 .cse31 .cse5 .cse7 .cse27 .cse8 .cse9 .cse21 .cse10 .cse11 .cse25 .cse14 (= |old(~q_write_ev~0)| 0) .cse16 .cse17 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse29 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20) (or .cse0 .cse22 .cse1 .cse2 .cse4 .cse23 .cse5 .cse7 .cse24 .cse8 .cse10 .cse11 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20) (or .cse0 .cse22 .cse1 .cse2 .cse4 .cse5 .cse7 .cse27 .cse8 .cse11 .cse14 .cse16 .cse19 .cse20) (or .cse1 .cse2 .cse30 .cse4 .cse31 .cse5 .cse7 .cse27 .cse8 .cse9 .cse21 .cse10 .cse11 .cse25 .cse28 .cse13 .cse14 .cse16 .cse17 .cse19 .cse20)))) [2021-11-13 18:55:23,641 INFO L858 garLoopResultBuilder]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2021-11-13 18:55:23,641 INFO L858 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 297 314) no Hoare annotation was computed. [2021-11-13 18:55:23,641 INFO L858 garLoopResultBuilder]: For program point L768-1(lines 762 785) no Hoare annotation was computed. [2021-11-13 18:55:23,642 INFO L858 garLoopResultBuilder]: For program point L763-1(lines 762 785) no Hoare annotation was computed. [2021-11-13 18:55:23,642 INFO L858 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 759 786) no Hoare annotation was computed. [2021-11-13 18:55:23,642 INFO L854 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 759 786) the Hoare annotation is: (let ((.cse3 (not (= ~t1_pc~0 1))) (.cse17 (not (= 2 ~t1_st~0))) (.cse19 (and (not (< 1 ~m_pc~0)) (not (<= ~m_pc~0 0)))) (.cse0 (not (<= 2 ~m_st~0))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse20 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (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))) (.cse18 (not (= ~m_st~0 0))) (.cse14 (= |old(~M_E~0)| 0)) (.cse15 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 (not (< ~local~0 ~token~0)) .cse12 .cse13 .cse18 .cse14 .cse15 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse2 (= |old(~E_M~0)| 0) .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 (= |old(~T1_E~0)| 0) .cse13 .cse14 (and (not (<= ~p_dw_pc~0 0)) (not (< 1 ~p_dw_pc~0))) .cse19 .cse15) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 .cse19 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 (not (= ~m_pc~0 ~t1_pc~0)) .cse2 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse14 .cse15 .cse16))) [2021-11-13 18:55:23,642 INFO L858 garLoopResultBuilder]: For program point L778-1(lines 759 786) no Hoare annotation was computed. [2021-11-13 18:55:23,642 INFO L858 garLoopResultBuilder]: For program point L773-1(lines 762 785) no Hoare annotation was computed. [2021-11-13 18:55:23,646 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-11-13 18:55:23,648 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-13 18:55:23,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 06:55:23 BoogieIcfgContainer [2021-11-13 18:55:23,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-13 18:55:23,844 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-13 18:55:23,844 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-13 18:55:23,844 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-13 18:55:23,845 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:52:51" (3/4) ... [2021-11-13 18:55:23,848 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-13 18:55:23,857 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2021-11-13 18:55:23,857 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2021-11-13 18:55:23,857 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2021-11-13 18:55:23,857 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2021-11-13 18:55:23,858 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2021-11-13 18:55:23,858 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2021-11-13 18:55:23,858 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2021-11-13 18:55:23,858 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2021-11-13 18:55:23,859 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2021-11-13 18:55:23,859 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2021-11-13 18:55:23,859 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2021-11-13 18:55:23,859 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2021-11-13 18:55:23,859 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2021-11-13 18:55:23,859 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2021-11-13 18:55:23,873 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2021-11-13 18:55:23,875 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-13 18:55:23,876 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-13 18:55:23,878 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-13 18:55:23,910 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(2 <= T1_E)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || M_E == 0) || !(2 <= E_1)) || !(token == local)) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(2 <= T1_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(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)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(m_pc == t1_pc)) || !(\old(q_req_up) == 1)) || !(2 <= T1_E)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || M_E == 0) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(2 <= T1_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || !(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)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(m_st == 0)) || !(p_dw_i == 1)) || M_E == 0) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(2 <= T1_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || M_E == 0) || !(2 <= E_1)) || !(token == local)) [2021-11-13 18:55:23,911 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((0 <= __retres1 && m_st == \old(m_st)) && 2 == t1_st) && __retres1 <= 0) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(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) == 2)) || M_E == 0) || !(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)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((0 <= __retres1 && m_st == \old(m_st)) && 2 == t1_st) && __retres1 <= 0) || !(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)) || !(\old(t1_st) == 2)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((!(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)) || E_M == 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))) || M_E == 0) || !(c_last_read == p_last_write)) || T1_E == 0)) && ((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && E_M <= 1)) || !(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)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((((((((0 <= __retres1 && m_st == \old(m_st)) && 2 == t1_st) && __retres1 <= 0) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(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)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || M_E == 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 <= \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)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((!(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)) || M_E == 0) || !(c_last_read == p_last_write)) || !(token == local)) [2021-11-13 18:55:23,911 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(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)) || (((((\result <= 0 && 0 <= __retres1) && m_st == \old(m_st)) && 2 == t1_st) && __retres1 <= 0) && 0 <= \result)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || M_E == 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)) || !(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)) || M_E == 0) || !(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 <= \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)) || M_E == 0) || !(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)) || !(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)) || M_E == 0) || !(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)) || E_M == 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))) || M_E == 0) || !(c_last_read == p_last_write)) || T1_E == 0)) && (((((((((((((((((((((((\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)) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && E_M <= 1)) || !(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)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || M_E == 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)) || !(\old(t1_st) == 2)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_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)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((((\result <= 0 && 0 <= __retres1) && m_st == \old(m_st)) && 2 == t1_st) && __retres1 <= 0) && 0 <= \result)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || M_E == 0) || !(c_last_read == p_last_write)) || !(token == local)) [2021-11-13 18:55:23,915 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)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 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)) || (((m_st == 0 && __retres1 <= 0) && E_M <= 1) && 0 <= __retres1)) || (((((((((((((((p_num_write == 0 && !(T1_E == 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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write)) || M_E == 0) || !(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)) || !(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)) || !(\old(t1_st) == 2)) || (!(1 < m_pc) && !(m_pc <= 0))) || M_E == 0) || !(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)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (m_st == \old(m_st) && 2 == t1_st)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || M_E == 0) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || (((((((((p_num_write == 0 && !(T1_E == 0)) && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && !(E_M == 0)) && !(M_E == 0))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 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))) || M_E == 0) || !(c_last_read == p_last_write)) || T1_E == 0)) && (((((((((((((((((((((m_st == \old(m_st) && 2 == t1_st) && __retres1 <= 0) && 0 <= __retres1) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(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)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (((((((((p_num_write == 0 && !(T1_E == 0)) && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && !(E_M == 0)) && !(M_E == 0))) || !(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)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((!(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)) || M_E == 0) || !(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)) || !(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)) || !(\old(t1_st) == 2)) || (((((((((((((((p_num_write == 0 && !(T1_E == 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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((!(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)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || (((((((((((((((p_num_write == 0 && !(T1_E == 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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) [2021-11-13 18:55:23,915 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)) || !(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)) || (((((((((((((((p_num_write == 0 && !(T1_E == 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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write)) || M_E == 0) || !(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)) || !(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)) || !(\old(t1_st) == 2)) || (!(1 < m_pc) && !(m_pc <= 0))) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local))) && (((((((((((((((!(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)) || M_E == 0) || !(c_last_read == p_last_write)) || !(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)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (m_st == \old(m_st) && 2 == t1_st)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || M_E == 0) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || (((((((((p_num_write == 0 && !(T1_E == 0)) && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && !(E_M == 0)) && !(M_E == 0))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 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))) || M_E == 0) || !(c_last_read == p_last_write)) || T1_E == 0)) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || (((((m_st == 0 && __retres1 <= 0) && E_M <= 1) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 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) && \result <= 0) && 0 <= \result)) || (((((((((((((((p_num_write == 0 && !(T1_E == 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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((((!(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)) || !(\old(t1_st) == 2)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || (((((((((((((((p_num_write == 0 && !(T1_E == 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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_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)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((((m_st == \old(m_st) && 2 == t1_st) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (((((((((p_num_write == 0 && !(T1_E == 0)) && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && !(E_M == 0)) && !(M_E == 0))) || !(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)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) [2021-11-13 18:55:24,063 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/witness.graphml [2021-11-13 18:55:24,063 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-13 18:55:24,068 INFO L158 Benchmark]: Toolchain (without parser) took 154023.01ms. Allocated memory was 100.7MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 70.0MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2021-11-13 18:55:24,069 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 100.7MB. Free memory was 54.4MB in the beginning and 54.4MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 18:55:24,075 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.63ms. Allocated memory is still 100.7MB. Free memory was 69.7MB in the beginning and 71.1MB in the end (delta: -1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-13 18:55:24,075 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.95ms. Allocated memory is still 100.7MB. Free memory was 71.1MB in the beginning and 68.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-13 18:55:24,075 INFO L158 Benchmark]: Boogie Preprocessor took 48.70ms. Allocated memory is still 100.7MB. Free memory was 68.5MB in the beginning and 66.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-13 18:55:24,076 INFO L158 Benchmark]: RCFGBuilder took 903.58ms. Allocated memory is still 100.7MB. Free memory was 66.4MB in the beginning and 43.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-11-13 18:55:24,078 INFO L158 Benchmark]: TraceAbstraction took 152256.83ms. Allocated memory was 100.7MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 42.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2021-11-13 18:55:24,079 INFO L158 Benchmark]: Witness Printer took 219.50ms. Allocated memory is still 3.7GB. Free memory was 1.4GB in the beginning and 1.3GB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-11-13 18:55:24,081 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.40ms. Allocated memory is still 100.7MB. Free memory was 54.4MB in the beginning and 54.4MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 473.63ms. Allocated memory is still 100.7MB. Free memory was 69.7MB in the beginning and 71.1MB in the end (delta: -1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.95ms. Allocated memory is still 100.7MB. Free memory was 71.1MB in the beginning and 68.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.70ms. Allocated memory is still 100.7MB. Free memory was 68.5MB in the beginning and 66.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 903.58ms. Allocated memory is still 100.7MB. Free memory was 66.4MB in the beginning and 43.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 152256.83ms. Allocated memory was 100.7MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 42.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 219.50ms. Allocated memory is still 3.7GB. Free memory was 1.4GB in the beginning and 1.3GB in the end (delta: 22.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: 152.0s, OverallIterations: 35, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 38.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 77.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17068 SdHoareTripleChecker+Valid, 16188.89ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16627 mSDsluCounter, 28135 SdHoareTripleChecker+Invalid, 13372.35ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18173 mSDsCounter, 4237 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14294 IncrementalHoareTripleChecker+Invalid, 18531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4237 mSolverCounterUnsat, 9962 mSDtfsCounter, 14294 mSolverCounterSat, 334.03ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3726 GetRequests, 3273 SyntacticMatches, 9 SemanticMatches, 444 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1342 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13469occurred in iteration=18, InterpolantAutomatonStates: 383, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.9s AutomataMinimizationTime, 35 MinimizatonAttempts, 8663 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 13866 PreInvPairs, 15146 NumberOfFragments, 28475 HoareAnnotationTreeSize, 13866 FomulaSimplifications, 14133 FormulaSimplificationTreeSizeReduction, 14.0s HoareSimplificationTime, 84 FomulaSimplificationsInter, 802191 FormulaSimplificationTreeSizeReductionInter, 63.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 5734 NumberOfCodeBlocks, 5734 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 6171 ConstructedInterpolants, 0 QuantifiedInterpolants, 11532 SizeOfPredicates, 7 NumberOfNonLiveVariables, 6715 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: !(M_E == 0) - InvariantResult [Line: 686]: 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) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || (((((((((((((p_num_write == 0 && !(T1_E == 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)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write)) || ((((((((((((((((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) && !(M_E == 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) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 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) && !(M_E == 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) && m_st == 0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && local < token)) || (((((((((((((((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 == t1_st) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) - InvariantResult [Line: 642]: 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) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || ((((((((((((((p_num_write == 0 && !(T1_E == 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)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) - 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) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) || (((((((((((((((((2 <= E_1 && p_num_write == 0) && !(T1_E == 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) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || (((((((((((((p_num_write == 0 && !(T1_E == 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)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 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) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && local < token) - InvariantResult [Line: 615]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(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)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || (((((((((((((((p_num_write == 0 && !(T1_E == 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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write)) || M_E == 0) || !(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)) || !(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)) || !(\old(t1_st) == 2)) || (!(1 < m_pc) && !(m_pc <= 0))) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local))) && (((((((((((((((!(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)) || M_E == 0) || !(c_last_read == p_last_write)) || !(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)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (m_st == \old(m_st) && 2 == t1_st)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || M_E == 0) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || (((((((((p_num_write == 0 && !(T1_E == 0)) && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && !(E_M == 0)) && !(M_E == 0))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 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))) || M_E == 0) || !(c_last_read == p_last_write)) || T1_E == 0)) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || (((((m_st == 0 && __retres1 <= 0) && E_M <= 1) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 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) && \result <= 0) && 0 <= \result)) || (((((((((((((((p_num_write == 0 && !(T1_E == 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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((((!(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)) || !(\old(t1_st) == 2)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || (((((((((((((((p_num_write == 0 && !(T1_E == 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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_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)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((((m_st == \old(m_st) && 2 == t1_st) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (((((((((p_num_write == 0 && !(T1_E == 0)) && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && !(E_M == 0)) && !(M_E == 0))) || !(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)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 456]: 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) && m_st == 0) && q_free == 1) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && q_req_up <= 0) && p_dw_st == 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local - InvariantResult [Line: 680]: 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) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || (((((((((((((p_num_write == 0 && !(T1_E == 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)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write)) || ((((((((((((((((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) && !(M_E == 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) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 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) && !(M_E == 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) && m_st == 0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && local < token)) || (((((((((((((((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 == t1_st) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) - InvariantResult [Line: 860]: 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) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(2 <= T1_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)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(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)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || M_E == 0) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || !(m_st == 0)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || !(p_dw_i == 1)) || M_E == 0) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(2 <= T1_E)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || q_write_ev == 0) || !(p_dw_i == 1)) || M_E == 0) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (!(1 < m_pc) && !(m_pc <= 0))) || !(q_free == 1)) || M_E == 0) || !(c_last_read == p_last_write)) || T1_E == 0)) && (((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || !(m_st == 0)) || !(p_dw_i == 1)) || M_E == 0) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(2 <= T1_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)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || M_E == 0) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((!(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)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || M_E == 0) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) - 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) && !(M_E == 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) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 823]: 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) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || (((((((((((((p_num_write == 0 && !(T1_E == 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)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write)) || ((((((((((((((((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) && !(M_E == 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) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 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) && !(M_E == 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) && m_st == 0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && local < token)) || (((((((((((((((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 == t1_st) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && !(T1_E == 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)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 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) && (m_pc <= 0 || (t1_pc <= 1 && 1 < m_pc))) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 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) && m_st == 0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && local < token)) || (((((((((((((((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 == t1_st) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(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)) || (((((\result <= 0 && 0 <= __retres1) && m_st == \old(m_st)) && 2 == t1_st) && __retres1 <= 0) && 0 <= \result)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || M_E == 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)) || !(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)) || M_E == 0) || !(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 <= \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)) || M_E == 0) || !(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)) || !(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)) || M_E == 0) || !(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)) || E_M == 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))) || M_E == 0) || !(c_last_read == p_last_write)) || T1_E == 0)) && (((((((((((((((((((((((\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)) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && E_M <= 1)) || !(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)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || M_E == 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)) || !(\old(t1_st) == 2)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_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)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((((\result <= 0 && 0 <= __retres1) && m_st == \old(m_st)) && 2 == t1_st) && __retres1 <= 0) && 0 <= \result)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || M_E == 0) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 663]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(2 <= T1_E)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || 0 < q_write_ev) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || q_write_ev == 0) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || M_E == 0) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((((!(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)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_free == 1)) || M_E == 0) || !(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)) || !(2 <= T1_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(p_dw_i == 1)) || !(q_free == 1)) || M_E == 0) || !(q_req_up <= 0)) || (((((((((!(T1_E == 0) && (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) && !(E_M == 0)) && !(M_E == 0)) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || T1_E == 0) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(p_dw_i == 1)) || !(q_free == 1)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || T1_E == 0) || !(token == local))) && ((((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(q_read_ev == 1)) || !(2 <= T1_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(p_dw_i == 1)) || !(q_free == 1)) || M_E == 0) || !(q_req_up <= 0)) || (((((((((!(T1_E == 0) && (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) && !(E_M == 0)) && !(M_E == 0)) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || T1_E == 0) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || M_E == 0) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(2 <= T1_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(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)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || T1_E == 0) || !(token == local))) && ((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(q_free == 0)) || !(2 <= E_M)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(p_dw_i == 1)) || M_E == 0) || !(2 <= E_1)) || T1_E == 0) || !(token == local))) && ((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && !(1 < p_dw_pc))) || (__retres1 <= 0 && 0 <= __retres1)) || (!(1 < m_pc) && !(m_pc <= 0))) || !(q_free == 1)) || M_E == 0) || !(c_last_read == p_last_write)) || T1_E == 0) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && !(M_E == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && c_num_read < p_num_write + 1) || (((((((((((((p_num_write == 0 && !(T1_E == 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)) && !(E_M == 0)) && !(M_E == 0)) && c_last_read == p_last_write)) || (((((((((((((((((((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) && 2 <= E_M) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && p_num_write <= c_num_read + 1)) || (((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && 2 <= T1_E) && !(M_E == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((((((((((q_req_up == 1 && 2 <= E_1) && !(T1_E == 0)) && !(p_dw_st == 0)) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && !(E_M == 0)) && !(M_E == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && c_num_read < p_num_write + 1)) || (((((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local)) || (((((((((((((((((((((((2 <= E_1 && !(T1_E == 0)) && !(p_dw_st == 0)) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(E_M == 0)) && !(M_E == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && c_num_read < p_num_write + 1)) || (((((((((((((((((((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) && 2 <= E_M) && 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) && 2 <= T1_E) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 874]: 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) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || (((((((((((((p_num_write == 0 && !(T1_E == 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)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write)) || ((((((((((((((((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) && !(M_E == 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) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 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) && !(M_E == 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) && m_st == 0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && local < token)) || (((((((((((((((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 == t1_st) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) - InvariantResult [Line: 832]: 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) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || (((((((((((((p_num_write == 0 && !(T1_E == 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)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write)) || ((((((((((((((((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) && !(M_E == 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) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 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) && !(M_E == 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) && m_st == 0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && local < token)) || (((((((((((((((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 == t1_st) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && !(M_E == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && c_num_read < p_num_write + 1) || (((((((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && c_num_read < p_num_write + 1)) || ((((((((((((2 <= E_1 && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && 2 <= T1_E) && !(M_E == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((((((2 <= E_1 && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && c_num_read < p_num_write + 1)) || (((((((((((((p_num_write == 0 && !(T1_E == 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)) && !(E_M == 0)) && !(M_E == 0)) && c_last_read == p_last_write)) || (((((((((((((((((((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) && 2 <= E_M) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && p_num_write <= c_num_read + 1)) || (((((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(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)) || E_M == 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)) || (((m_st == 0 && __retres1 <= 0) && E_M <= 1) && 0 <= __retres1)) || (((((((((((((((p_num_write == 0 && !(T1_E == 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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write)) || M_E == 0) || !(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)) || !(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)) || !(\old(t1_st) == 2)) || (!(1 < m_pc) && !(m_pc <= 0))) || M_E == 0) || !(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)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (m_st == \old(m_st) && 2 == t1_st)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || M_E == 0) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((!(p_dw_st == 0) || !(2 <= \old(m_st))) || (((((((((p_num_write == 0 && !(T1_E == 0)) && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && !(E_M == 0)) && !(M_E == 0))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 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))) || M_E == 0) || !(c_last_read == p_last_write)) || T1_E == 0)) && (((((((((((((((((((((m_st == \old(m_st) && 2 == t1_st) && __retres1 <= 0) && 0 <= __retres1) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(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)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (((((((((p_num_write == 0 && !(T1_E == 0)) && (1 < m_pc || m_pc <= 0)) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && c_dr_pc == p_dw_pc) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && !(E_M == 0)) && !(M_E == 0))) || !(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)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((!(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)) || M_E == 0) || !(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)) || !(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)) || !(\old(t1_st) == 2)) || (((((((((((((((p_num_write == 0 && !(T1_E == 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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((!(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)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || (((((((((((((((p_num_write == 0 && !(T1_E == 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) && (1 <= t1_pc || 0 < m_pc)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((((((((((((((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) && 2 <= E_M) && 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) && 2 <= T1_E) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && p_num_write <= c_num_read + 1) || (((((((((((((((((((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) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && 2 <= T1_E) && p_num_write <= 1) && !(M_E == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local)) || ((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && 2 <= T1_E) && !(M_E == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= E_1 && p_num_write == 0) && !(T1_E == 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) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && t1_pc <= 0) && 2 <= T1_E) && !(E_M == 0)) && !(M_E == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) || ((((((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && c_num_read < p_num_write + 1)) || (((((((((((((((((2 <= E_1 && !(T1_E == 0)) && !(p_dw_st == 0)) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && 2 <= T1_E) && !(E_M == 0)) && !(M_E == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((((((2 <= E_1 && p_num_write == 0) && !(T1_E == 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) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && t1_pc <= 0) && 2 <= T1_E) && q_req_up <= 0) && !(E_M == 0)) && !(M_E == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: !(M_E == 0) - 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) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && local < token - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: ((((((((((((((p_num_write == 0 && !(T1_E == 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)) && !(E_M == 0)) && !(M_E == 0)) && c_last_read == p_last_write) || ((((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && !(M_E == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || (((((((((((((((((((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 == 1) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && q_req_up <= 0) && p_dw_st == 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 901]: 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) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || (((((((((((((p_num_write == 0 && !(T1_E == 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)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write)) || ((((((((((((((((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) && !(M_E == 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) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 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) && !(M_E == 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) && m_st == 0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && local < token)) || (((((((((((((((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 == t1_st) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(2 <= T1_E)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || M_E == 0) || !(2 <= E_1)) || !(token == local)) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(2 <= T1_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(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)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(m_pc == t1_pc)) || !(\old(q_req_up) == 1)) || !(2 <= T1_E)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || M_E == 0) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(2 <= T1_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || !(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)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(m_st == 0)) || !(p_dw_i == 1)) || M_E == 0) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(2 <= T1_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || M_E == 0) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 176]: 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) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && t1_pc <= 0) && 2 <= T1_E) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && q_req_up <= 0) && p_dw_st == 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || ((((((((((((((((((((((q_req_up == 1 && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && !(M_E == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && c_num_read < p_num_write + 1) || ((((((((((((((((((((((q_req_up == 1 && 2 <= E_1) && !(T1_E == 0)) && !(p_dw_st == 0)) && (1 < m_pc || m_pc <= 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && !(E_M == 0)) && !(M_E == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && c_num_read < p_num_write + 1)) && 1 <= q_read_ev)) || (((((((((((((((((((((((q_req_up == 1 && 2 <= E_1) && !(T1_E == 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) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && 2 <= T1_E) && p_num_write <= 1) && !(E_M == 0)) && !(M_E == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && token == local) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 473]: Loop Invariant Derived loop invariant: !(M_E == 0) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((q_req_up == 1 && 2 <= E_1) && !(T1_E == 0)) && !(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) && 2 <= E_M) && 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) && 2 <= T1_E) && !(E_M == 0)) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && p_num_write <= c_num_read + 1) || (((((((((((((((((((2 <= E_1 && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && t1_pc <= 0) && 2 <= T1_E) && q_req_up <= 0) && !(E_M == 0)) && !(M_E == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && token == local)) || (((((((((((((((((((((((2 <= E_1 && p_num_write == 0) && !(T1_E == 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) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(E_M == 0)) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local)) || ((((((((((((((((((((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) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && 2 <= T1_E) && p_num_write <= 1) && !(E_M == 0)) && !(M_E == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local)) || (((((((((((((((((2 <= E_1 && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && t1_pc <= 0) && 2 <= T1_E) && !(E_M == 0)) && !(M_E == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local)) || (((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && 2 <= T1_E) && !(E_M == 0)) && !(M_E == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: ((((((((((((((((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) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) || (((((((((((((((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) && !(M_E == 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) && token <= local + 1) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && local < token) - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((0 <= __retres1 && m_st == \old(m_st)) && 2 == t1_st) && __retres1 <= 0) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(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) == 2)) || M_E == 0) || !(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)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((0 <= __retres1 && m_st == \old(m_st)) && 2 == t1_st) && __retres1 <= 0) || !(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)) || !(\old(t1_st) == 2)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((!(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)) || E_M == 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))) || M_E == 0) || !(c_last_read == p_last_write)) || T1_E == 0)) && ((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && E_M <= 1)) || !(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)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((((((((0 <= __retres1 && m_st == \old(m_st)) && 2 == t1_st) && __retres1 <= 0) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(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)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || M_E == 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 <= \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)) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((!(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)) || M_E == 0) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 948]: Loop Invariant Derived loop invariant: !(M_E == 0) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && !(M_E == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && c_num_read < p_num_write + 1) || (((((((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && c_num_read < p_num_write + 1)) || ((((((((((((2 <= E_1 && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && 2 <= T1_E) && !(M_E == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((((((2 <= E_1 && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && c_num_read < p_num_write + 1)) || (((((((((((((p_num_write == 0 && !(T1_E == 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)) && !(E_M == 0)) && !(M_E == 0)) && c_last_read == p_last_write)) || (((((((((((((((((((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) && 2 <= E_M) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && p_num_write <= c_num_read + 1)) || (((((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (((((((((((((((((((((q_req_up == 1 && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && !(M_E == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && c_num_read < p_num_write + 1) || ((((((((((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && q_req_up <= 0) && p_dw_st == 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) - InvariantResult [Line: 870]: 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) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || (((((((((((((p_num_write == 0 && !(T1_E == 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)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write)) || ((((((((((((((((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) && !(M_E == 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) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 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) && !(M_E == 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) && m_st == 0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && local < token)) || (((((((((((((((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 == t1_st) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(m_st == 0)) || !(p_dw_i == 1)) || 1 <= __retres1) || M_E == 0) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || M_E == 0) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((!(m_pc == t1_pc) || !(2 <= T1_E)) || !(p_num_write <= c_num_read + 1)) || !(c_dr_st == 0)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || 1 <= __retres1) || M_E == 0) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || M_E == 0) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(q_req_up == 1)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || 1 <= __retres1) || M_E == 0) || !(1 <= p_num_write)) || !(1 <= q_read_ev)) || (!(c_dr_st == 0) && q_read_ev == 2)) || !(2 <= E_1)) || !(p_num_write <= 1)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || M_E == 0) || !(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)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || M_E == 0) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && !(M_E == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && c_num_read < p_num_write + 1) || (((((((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && c_num_read < p_num_write + 1)) || ((((((((((((2 <= E_1 && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && 2 <= T1_E) && !(M_E == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local)) || (((((((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && q_req_up <= 0) && p_dw_st == 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((((((2 <= E_1 && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && c_num_read < p_num_write + 1)) || (((((((((((((p_num_write == 0 && !(T1_E == 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)) && !(E_M == 0)) && !(M_E == 0)) && c_last_read == p_last_write)) || ((((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && !(M_E == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || (((((((((((((((((((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) && 2 <= E_M) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && p_num_write <= c_num_read + 1)) || (((((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && (p_dw_pc <= 0 || 1 < p_dw_pc)) && !(M_E == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && c_num_read < p_num_write + 1) || ((((((((((((((((((((q_req_up == 1 && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && !(M_E == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && c_num_read < p_num_write + 1)) || (((((((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && c_num_read < p_num_write + 1)) || (((((((((((((((((((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) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && 2 <= T1_E) && p_num_write <= 1) && !(M_E == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local)) || ((((((((((((2 <= E_1 && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && 2 <= T1_E) && !(M_E == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local)) || (((((((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && q_req_up <= 0) && p_dw_st == 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((((((2 <= E_1 && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && c_num_read < p_num_write + 1)) || (((((((((((((p_num_write == 0 && !(T1_E == 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)) && !(E_M == 0)) && !(M_E == 0)) && c_last_read == p_last_write)) || ((((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && !(M_E == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || (((((((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && p_num_write <= c_num_read + 1)) || (((((((((((((((((2 <= E_1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local)) || ((((((((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local)) || ((((((((((((((((((((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) && 2 <= E_M) && 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) && 2 <= T1_E) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((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) && 2 <= E_M) && 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) && 2 <= T1_E) && q_req_up <= 0) && !(M_E == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: ((((((((((((((p_num_write == 0 && !(T1_E == 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)) && !(E_M == 0)) && p_dw_st == 0) && !(M_E == 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) && !(M_E == 0)) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) RESULT: Ultimate proved your program to be correct! [2021-11-13 18:55:24,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e287c0ae-3c7a-4307-b187-05416632f434/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE