./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+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_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/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_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/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_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/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 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-13 17:30:59,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 17:30:59,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 17:30:59,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 17:30:59,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 17:30:59,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 17:30:59,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 17:30:59,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 17:30:59,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 17:30:59,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 17:30:59,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 17:30:59,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 17:30:59,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 17:30:59,564 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 17:30:59,566 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 17:30:59,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 17:30:59,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 17:30:59,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 17:30:59,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 17:30:59,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 17:30:59,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 17:30:59,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 17:30:59,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 17:30:59,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 17:30:59,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 17:30:59,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 17:30:59,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 17:30:59,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 17:30:59,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 17:30:59,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 17:30:59,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 17:30:59,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 17:30:59,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 17:30:59,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 17:30:59,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 17:30:59,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 17:30:59,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 17:30:59,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 17:30:59,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 17:30:59,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 17:30:59,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 17:30:59,617 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-13 17:30:59,657 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 17:30:59,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 17:30:59,658 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-13 17:30:59,658 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-13 17:30:59,659 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-13 17:30:59,659 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-13 17:30:59,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-13 17:30:59,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-13 17:30:59,660 INFO L138 SettingsManager]: * Use SBE=true [2021-11-13 17:30:59,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 17:30:59,662 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 17:30:59,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-13 17:30:59,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 17:30:59,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 17:30:59,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-13 17:30:59,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-13 17:30:59,663 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-13 17:30:59,663 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 17:30:59,664 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-13 17:30:59,664 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 17:30:59,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-13 17:30:59,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 17:30:59,664 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-13 17:30:59,665 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-13 17:30:59,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 17:30:59,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 17:30:59,665 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-13 17:30:59,666 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-13 17:30:59,666 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-13 17:30:59,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-13 17:30:59,668 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-13 17:30:59,668 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-13 17:30:59,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-13 17:30:59,668 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-13 17:30:59,668 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_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/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_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/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 -> 1bc25ea26c5b0a3f713e59ee991d97185223a272bca137eca8d49c3babbebcf9 [2021-11-13 17:30:59,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 17:31:00,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 17:31:00,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 17:31:00,032 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 17:31:00,033 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 17:31:00,035 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2021-11-13 17:31:00,122 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/data/a23c19722/b2af2b55e4bc42a4964cfcd6a90ff43d/FLAGe597adda8 [2021-11-13 17:31:00,691 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 17:31:00,692 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2021-11-13 17:31:00,713 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/data/a23c19722/b2af2b55e4bc42a4964cfcd6a90ff43d/FLAGe597adda8 [2021-11-13 17:31:00,984 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/data/a23c19722/b2af2b55e4bc42a4964cfcd6a90ff43d [2021-11-13 17:31:00,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 17:31:00,987 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-13 17:31:00,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 17:31:00,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 17:31:00,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 17:31:00,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 05:31:00" (1/1) ... [2021-11-13 17:31:00,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464a7595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:00, skipping insertion in model container [2021-11-13 17:31:00,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 05:31:00" (1/1) ... [2021-11-13 17:31:01,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 17:31:01,039 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 17:31:01,206 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_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2021-11-13 17:31:01,248 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_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2021-11-13 17:31:01,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 17:31:01,291 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 17:31:01,303 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_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[913,926] [2021-11-13 17:31:01,322 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_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-1.c[5977,5990] [2021-11-13 17:31:01,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 17:31:01,363 INFO L208 MainTranslator]: Completed translation [2021-11-13 17:31:01,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01 WrapperNode [2021-11-13 17:31:01,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 17:31:01,366 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-13 17:31:01,366 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-13 17:31:01,366 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-13 17:31:01,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-13 17:31:01,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 17:31:01,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 17:31:01,421 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 17:31:01,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,435 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 17:31:01,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 17:31:01,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 17:31:01,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 17:31:01,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (1/1) ... [2021-11-13 17:31:01,473 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 17:31:01,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:31:01,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-13 17:31:01,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-13 17:31:01,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 17:31:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-11-13 17:31:01,556 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-11-13 17:31:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2021-11-13 17:31:01,556 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2021-11-13 17:31:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-11-13 17:31:01,557 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-11-13 17:31:01,557 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-11-13 17:31:01,557 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-11-13 17:31:01,557 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-11-13 17:31:01,557 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-11-13 17:31:01,557 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-11-13 17:31:01,558 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-11-13 17:31:01,558 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-11-13 17:31:01,558 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-11-13 17:31:01,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-13 17:31:01,558 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-11-13 17:31:01,559 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-11-13 17:31:01,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 17:31:01,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 17:31:01,559 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-11-13 17:31:01,559 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-11-13 17:31:02,287 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 17:31:02,290 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-11-13 17:31:02,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:31:02 BoogieIcfgContainer [2021-11-13 17:31:02,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 17:31:02,296 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-13 17:31:02,296 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-13 17:31:02,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-13 17:31:02,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 05:31:00" (1/3) ... [2021-11-13 17:31:02,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc7157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 05:31:02, skipping insertion in model container [2021-11-13 17:31:02,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:31:01" (2/3) ... [2021-11-13 17:31:02,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc7157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 05:31:02, skipping insertion in model container [2021-11-13 17:31:02,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:31:02" (3/3) ... [2021-11-13 17:31:02,303 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-1.c [2021-11-13 17:31:02,309 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-13 17:31:02,310 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-13 17:31:02,380 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-13 17:31:02,389 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 17:31:02,389 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-13 17:31:02,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 146 states have (on average 1.5410958904109588) internal successors, (225), 151 states have internal predecessors, (225), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2021-11-13 17:31:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-13 17:31:02,447 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:02,448 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] [2021-11-13 17:31:02,449 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:02,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:02,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1946471914, now seen corresponding path program 1 times [2021-11-13 17:31:02,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:02,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309217818] [2021-11-13 17:31:02,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:02,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:02,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 17:31:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:02,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-13 17:31:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:02,816 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 17:31:02,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:02,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309217818] [2021-11-13 17:31:02,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309217818] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:02,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:02,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:31:02,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785816102] [2021-11-13 17:31:02,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:02,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:31:02,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:02,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:31:02,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:31:02,858 INFO L87 Difference]: Start difference. First operand has 179 states, 146 states have (on average 1.5410958904109588) internal successors, (225), 151 states have internal predecessors, (225), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-13 17:31:03,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:03,218 INFO L93 Difference]: Finished difference Result 414 states and 624 transitions. [2021-11-13 17:31:03,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 17:31:03,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2021-11-13 17:31:03,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:03,236 INFO L225 Difference]: With dead ends: 414 [2021-11-13 17:31:03,236 INFO L226 Difference]: Without dead ends: 239 [2021-11-13 17:31:03,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-13 17:31:03,245 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 284 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 142.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.22ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 203.63ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:03,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 471 Invalid, 120 Unknown, 0 Unchecked, 18.22ms Time], IncrementalHoareTripleChecker [37 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 203.63ms Time] [2021-11-13 17:31:03,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-11-13 17:31:03,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2021-11-13 17:31:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 195 states have (on average 1.405128205128205) internal successors, (274), 199 states have internal predecessors, (274), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (29), 23 states have call predecessors, (29), 23 states have call successors, (29) [2021-11-13 17:31:03,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 328 transitions. [2021-11-13 17:31:03,322 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 328 transitions. Word has length 44 [2021-11-13 17:31:03,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:03,323 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 328 transitions. [2021-11-13 17:31:03,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-13 17:31:03,325 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 328 transitions. [2021-11-13 17:31:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-13 17:31:03,330 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:03,330 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] [2021-11-13 17:31:03,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-13 17:31:03,331 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:03,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:03,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1644174286, now seen corresponding path program 1 times [2021-11-13 17:31:03,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:03,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309559231] [2021-11-13 17:31:03,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:03,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:03,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 17:31:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:03,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-13 17:31:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:03,479 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 17:31:03,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:03,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309559231] [2021-11-13 17:31:03,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309559231] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:03,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:03,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:31:03,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864515494] [2021-11-13 17:31:03,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:03,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:31:03,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:03,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:31:03,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:31:03,484 INFO L87 Difference]: Start difference. First operand 233 states and 328 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-13 17:31:03,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:03,731 INFO L93 Difference]: Finished difference Result 481 states and 668 transitions. [2021-11-13 17:31:03,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 17:31:03,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2021-11-13 17:31:03,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:03,736 INFO L225 Difference]: With dead ends: 481 [2021-11-13 17:31:03,736 INFO L226 Difference]: Without dead ends: 357 [2021-11-13 17:31:03,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-13 17:31:03,739 INFO L933 BasicCegarLoop]: 283 mSDtfsCounter, 148 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 150.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.54ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 188.75ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:03,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 585 Invalid, 135 Unknown, 0 Unchecked, 6.54ms Time], IncrementalHoareTripleChecker [27 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 188.75ms Time] [2021-11-13 17:31:03,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-11-13 17:31:03,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 300. [2021-11-13 17:31:03,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 256 states have (on average 1.3984375) internal successors, (358), 260 states have internal predecessors, (358), 28 states have call successors, (28), 14 states have call predecessors, (28), 14 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2021-11-13 17:31:03,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 418 transitions. [2021-11-13 17:31:03,782 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 418 transitions. Word has length 45 [2021-11-13 17:31:03,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:03,782 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 418 transitions. [2021-11-13 17:31:03,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-13 17:31:03,783 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 418 transitions. [2021-11-13 17:31:03,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-13 17:31:03,786 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:03,786 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] [2021-11-13 17:31:03,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-13 17:31:03,786 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:03,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:03,787 INFO L85 PathProgramCache]: Analyzing trace with hash 359816825, now seen corresponding path program 1 times [2021-11-13 17:31:03,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:03,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699067708] [2021-11-13 17:31:03,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:03,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:03,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 17:31:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:03,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-13 17:31:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:03,868 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 17:31:03,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:03,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699067708] [2021-11-13 17:31:03,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699067708] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:03,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:03,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:31:03,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083993725] [2021-11-13 17:31:03,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:03,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:31:03,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:03,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:31:03,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:31:03,872 INFO L87 Difference]: Start difference. First operand 300 states and 418 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-13 17:31:04,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:04,067 INFO L93 Difference]: Finished difference Result 708 states and 977 transitions. [2021-11-13 17:31:04,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 17:31:04,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2021-11-13 17:31:04,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:04,076 INFO L225 Difference]: With dead ends: 708 [2021-11-13 17:31:04,076 INFO L226 Difference]: Without dead ends: 517 [2021-11-13 17:31:04,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-13 17:31:04,088 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 293 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 110.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.68ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 140.64ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:04,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 464 Invalid, 94 Unknown, 0 Unchecked, 5.68ms Time], IncrementalHoareTripleChecker [30 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 140.64ms Time] [2021-11-13 17:31:04,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2021-11-13 17:31:04,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 465. [2021-11-13 17:31:04,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 402 states have (on average 1.36318407960199) internal successors, (548), 409 states have internal predecessors, (548), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2021-11-13 17:31:04,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 636 transitions. [2021-11-13 17:31:04,135 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 636 transitions. Word has length 45 [2021-11-13 17:31:04,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:04,135 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 636 transitions. [2021-11-13 17:31:04,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-13 17:31:04,136 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 636 transitions. [2021-11-13 17:31:04,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-13 17:31:04,139 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:04,140 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 17:31:04,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-13 17:31:04,140 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:04,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:04,142 INFO L85 PathProgramCache]: Analyzing trace with hash -443803124, now seen corresponding path program 1 times [2021-11-13 17:31:04,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:04,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897328284] [2021-11-13 17:31:04,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:04,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:04,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 17:31:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:04,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 17:31:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:04,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 17:31:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:04,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 17:31:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:04,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:04,285 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 17:31:04,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:04,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897328284] [2021-11-13 17:31:04,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897328284] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:04,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:04,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 17:31:04,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870940477] [2021-11-13 17:31:04,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:04,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 17:31:04,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:04,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 17:31:04,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 17:31:04,298 INFO L87 Difference]: Start difference. First operand 465 states and 636 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-13 17:31:04,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:04,672 INFO L93 Difference]: Finished difference Result 582 states and 808 transitions. [2021-11-13 17:31:04,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 17:31:04,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-11-13 17:31:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:04,680 INFO L225 Difference]: With dead ends: 582 [2021-11-13 17:31:04,681 INFO L226 Difference]: Without dead ends: 486 [2021-11-13 17:31:04,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-13 17:31:04,693 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 263 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 216.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.78ms SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 271.91ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:04,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 527 Invalid, 218 Unknown, 0 Unchecked, 8.78ms Time], IncrementalHoareTripleChecker [50 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 271.91ms Time] [2021-11-13 17:31:04,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-11-13 17:31:04,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 465. [2021-11-13 17:31:04,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 402 states have (on average 1.3606965174129353) internal successors, (547), 409 states have internal predecessors, (547), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2021-11-13 17:31:04,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 635 transitions. [2021-11-13 17:31:04,768 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 635 transitions. Word has length 57 [2021-11-13 17:31:04,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:04,769 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 635 transitions. [2021-11-13 17:31:04,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-13 17:31:04,769 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 635 transitions. [2021-11-13 17:31:04,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-13 17:31:04,773 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:04,773 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 17:31:04,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-13 17:31:04,779 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:04,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:04,782 INFO L85 PathProgramCache]: Analyzing trace with hash -428284406, now seen corresponding path program 1 times [2021-11-13 17:31:04,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:04,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715487721] [2021-11-13 17:31:04,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:04,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:04,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 17:31:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:04,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 17:31:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:04,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 17:31:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:04,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 17:31:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:04,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:04,907 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 17:31:04,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:04,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715487721] [2021-11-13 17:31:04,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715487721] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:04,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:04,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 17:31:04,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099872290] [2021-11-13 17:31:04,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:04,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 17:31:04,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:04,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 17:31:04,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-13 17:31:04,911 INFO L87 Difference]: Start difference. First operand 465 states and 635 transitions. 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 17:31:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:05,412 INFO L93 Difference]: Finished difference Result 578 states and 802 transitions. [2021-11-13 17:31:05,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 17:31:05,413 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 17:31:05,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:05,418 INFO L225 Difference]: With dead ends: 578 [2021-11-13 17:31:05,418 INFO L226 Difference]: Without dead ends: 485 [2021-11-13 17:31:05,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-11-13 17:31:05,421 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 344 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 319.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.13ms SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 397.22ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:05,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 548 Invalid, 372 Unknown, 0 Unchecked, 12.13ms Time], IncrementalHoareTripleChecker [56 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 397.22ms Time] [2021-11-13 17:31:05,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2021-11-13 17:31:05,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 465. [2021-11-13 17:31:05,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 402 states have (on average 1.3582089552238805) internal successors, (546), 409 states have internal predecessors, (546), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2021-11-13 17:31:05,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 634 transitions. [2021-11-13 17:31:05,491 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 634 transitions. Word has length 57 [2021-11-13 17:31:05,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:05,492 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 634 transitions. [2021-11-13 17:31:05,492 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 17:31:05,492 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 634 transitions. [2021-11-13 17:31:05,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-13 17:31:05,497 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:05,497 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 17:31:05,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-13 17:31:05,498 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:05,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:05,498 INFO L85 PathProgramCache]: Analyzing trace with hash 465201932, now seen corresponding path program 1 times [2021-11-13 17:31:05,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:05,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273106318] [2021-11-13 17:31:05,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:05,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:05,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 17:31:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:05,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 17:31:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:05,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 17:31:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:05,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 17:31:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:05,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:05,667 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 17:31:05,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:05,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273106318] [2021-11-13 17:31:05,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273106318] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:05,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:05,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 17:31:05,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183260426] [2021-11-13 17:31:05,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:05,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 17:31:05,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:05,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 17:31:05,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:31:05,669 INFO L87 Difference]: Start difference. First operand 465 states and 634 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 17:31:06,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:06,059 INFO L93 Difference]: Finished difference Result 577 states and 800 transitions. [2021-11-13 17:31:06,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 17:31:06,060 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 17:31:06,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:06,066 INFO L225 Difference]: With dead ends: 577 [2021-11-13 17:31:06,066 INFO L226 Difference]: Without dead ends: 484 [2021-11-13 17:31:06,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-13 17:31:06,069 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 352 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 230.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.36ms SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 277.06ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:06,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 650 Invalid, 397 Unknown, 0 Unchecked, 8.36ms Time], IncrementalHoareTripleChecker [62 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 277.06ms Time] [2021-11-13 17:31:06,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-11-13 17:31:06,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 465. [2021-11-13 17:31:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 402 states have (on average 1.3507462686567164) internal successors, (543), 409 states have internal predecessors, (543), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2021-11-13 17:31:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 631 transitions. [2021-11-13 17:31:06,123 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 631 transitions. Word has length 57 [2021-11-13 17:31:06,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:06,125 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 631 transitions. [2021-11-13 17:31:06,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 17:31:06,125 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 631 transitions. [2021-11-13 17:31:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-13 17:31:06,127 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:06,127 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 17:31:06,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-13 17:31:06,128 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:06,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:06,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1365331192, now seen corresponding path program 1 times [2021-11-13 17:31:06,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:06,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50379643] [2021-11-13 17:31:06,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:06,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:06,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 17:31:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:06,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 17:31:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:06,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 17:31:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:06,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 17:31:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:06,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:06,263 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 17:31:06,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:06,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50379643] [2021-11-13 17:31:06,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50379643] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:06,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:06,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 17:31:06,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745221650] [2021-11-13 17:31:06,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:06,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 17:31:06,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:06,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 17:31:06,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:31:06,271 INFO L87 Difference]: Start difference. First operand 465 states and 631 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 17:31:06,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:06,652 INFO L93 Difference]: Finished difference Result 579 states and 794 transitions. [2021-11-13 17:31:06,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 17:31:06,652 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 17:31:06,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:06,656 INFO L225 Difference]: With dead ends: 579 [2021-11-13 17:31:06,656 INFO L226 Difference]: Without dead ends: 486 [2021-11-13 17:31:06,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 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 17:31:06,658 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 345 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 240.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.78ms SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 286.46ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:06,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 647 Invalid, 404 Unknown, 0 Unchecked, 7.78ms Time], IncrementalHoareTripleChecker [65 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 286.46ms Time] [2021-11-13 17:31:06,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2021-11-13 17:31:06,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 465. [2021-11-13 17:31:06,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 402 states have (on average 1.3482587064676617) internal successors, (542), 409 states have internal predecessors, (542), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2021-11-13 17:31:06,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 630 transitions. [2021-11-13 17:31:06,702 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 630 transitions. Word has length 57 [2021-11-13 17:31:06,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:06,702 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 630 transitions. [2021-11-13 17:31:06,702 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 17:31:06,702 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 630 transitions. [2021-11-13 17:31:06,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-13 17:31:06,705 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:06,705 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 17:31:06,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-13 17:31:06,705 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:06,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:06,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1117184698, now seen corresponding path program 1 times [2021-11-13 17:31:06,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:06,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874893430] [2021-11-13 17:31:06,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:06,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:06,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 17:31:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:06,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 17:31:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:06,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 17:31:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:06,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 17:31:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:06,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:06,837 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 17:31:06,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:06,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874893430] [2021-11-13 17:31:06,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874893430] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:06,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:06,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 17:31:06,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517604238] [2021-11-13 17:31:06,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:06,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 17:31:06,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:06,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 17:31:06,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:31:06,842 INFO L87 Difference]: Start difference. First operand 465 states and 630 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 17:31:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:07,375 INFO L93 Difference]: Finished difference Result 592 states and 819 transitions. [2021-11-13 17:31:07,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-13 17:31:07,375 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 17:31:07,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:07,380 INFO L225 Difference]: With dead ends: 592 [2021-11-13 17:31:07,380 INFO L226 Difference]: Without dead ends: 500 [2021-11-13 17:31:07,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-11-13 17:31:07,382 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 217 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 284.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.55ms SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 341.09ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:07,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 932 Invalid, 434 Unknown, 0 Unchecked, 11.55ms Time], IncrementalHoareTripleChecker [47 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 341.09ms Time] [2021-11-13 17:31:07,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2021-11-13 17:31:07,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 468. [2021-11-13 17:31:07,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 405 states have (on average 1.345679012345679) internal successors, (545), 412 states have internal predecessors, (545), 39 states have call successors, (39), 21 states have call predecessors, (39), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2021-11-13 17:31:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 633 transitions. [2021-11-13 17:31:07,433 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 633 transitions. Word has length 57 [2021-11-13 17:31:07,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:07,433 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 633 transitions. [2021-11-13 17:31:07,434 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 17:31:07,434 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 633 transitions. [2021-11-13 17:31:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-13 17:31:07,436 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:07,436 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 17:31:07,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-13 17:31:07,436 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:07,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:07,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1189571256, now seen corresponding path program 1 times [2021-11-13 17:31:07,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:07,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355040915] [2021-11-13 17:31:07,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:07,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:07,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 17:31:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:07,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 17:31:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:07,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 17:31:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:07,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 17:31:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:07,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:07,562 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 17:31:07,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:07,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355040915] [2021-11-13 17:31:07,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355040915] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:07,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:07,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 17:31:07,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660753496] [2021-11-13 17:31:07,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:07,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 17:31:07,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:07,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 17:31:07,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-13 17:31:07,565 INFO L87 Difference]: Start difference. First operand 468 states and 633 transitions. 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 17:31:08,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:08,065 INFO L93 Difference]: Finished difference Result 688 states and 935 transitions. [2021-11-13 17:31:08,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:31:08,066 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 17:31:08,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:08,071 INFO L225 Difference]: With dead ends: 688 [2021-11-13 17:31:08,071 INFO L226 Difference]: Without dead ends: 593 [2021-11-13 17:31:08,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-11-13 17:31:08,073 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 539 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 308.24ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.66ms SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 367.83ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:08,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [566 Valid, 775 Invalid, 506 Unknown, 0 Unchecked, 10.66ms Time], IncrementalHoareTripleChecker [82 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 367.83ms Time] [2021-11-13 17:31:08,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2021-11-13 17:31:08,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 552. [2021-11-13 17:31:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 473 states have (on average 1.342494714587738) internal successors, (635), 480 states have internal predecessors, (635), 49 states have call successors, (49), 27 states have call predecessors, (49), 28 states have return successors, (59), 45 states have call predecessors, (59), 47 states have call successors, (59) [2021-11-13 17:31:08,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 743 transitions. [2021-11-13 17:31:08,122 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 743 transitions. Word has length 57 [2021-11-13 17:31:08,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:08,122 INFO L470 AbstractCegarLoop]: Abstraction has 552 states and 743 transitions. [2021-11-13 17:31:08,122 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 17:31:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 743 transitions. [2021-11-13 17:31:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-13 17:31:08,125 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:08,125 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 17:31:08,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-13 17:31:08,125 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:08,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:08,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1333925065, now seen corresponding path program 1 times [2021-11-13 17:31:08,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:08,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532768887] [2021-11-13 17:31:08,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:08,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:08,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 17:31:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:08,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 17:31:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:08,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 17:31:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:08,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 17:31:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:08,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:08,215 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 17:31:08,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:08,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532768887] [2021-11-13 17:31:08,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532768887] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:08,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:08,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 17:31:08,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875088168] [2021-11-13 17:31:08,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:08,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 17:31:08,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:08,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 17:31:08,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:31:08,218 INFO L87 Difference]: Start difference. First operand 552 states and 743 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 17:31:08,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:08,760 INFO L93 Difference]: Finished difference Result 780 states and 1063 transitions. [2021-11-13 17:31:08,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-13 17:31:08,760 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 17:31:08,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:08,765 INFO L225 Difference]: With dead ends: 780 [2021-11-13 17:31:08,765 INFO L226 Difference]: Without dead ends: 601 [2021-11-13 17:31:08,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-11-13 17:31:08,767 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 182 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 283.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.75ms SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 334.71ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:08,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 934 Invalid, 420 Unknown, 0 Unchecked, 8.75ms Time], IncrementalHoareTripleChecker [46 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 334.71ms Time] [2021-11-13 17:31:08,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2021-11-13 17:31:08,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 555. [2021-11-13 17:31:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 476 states have (on average 1.338235294117647) internal successors, (637), 483 states have internal predecessors, (637), 49 states have call successors, (49), 27 states have call predecessors, (49), 28 states have return successors, (59), 45 states have call predecessors, (59), 47 states have call successors, (59) [2021-11-13 17:31:08,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 745 transitions. [2021-11-13 17:31:08,809 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 745 transitions. Word has length 57 [2021-11-13 17:31:08,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:08,810 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 745 transitions. [2021-11-13 17:31:08,810 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 17:31:08,810 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 745 transitions. [2021-11-13 17:31:08,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-13 17:31:08,812 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:08,812 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 17:31:08,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-13 17:31:08,812 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:08,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:08,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1037814197, now seen corresponding path program 1 times [2021-11-13 17:31:08,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:08,813 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170484019] [2021-11-13 17:31:08,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:08,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:08,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 17:31:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:08,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 17:31:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:08,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 17:31:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:08,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 17:31:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:08,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:08,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:08,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:08,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170484019] [2021-11-13 17:31:08,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170484019] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:08,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:08,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 17:31:08,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880757] [2021-11-13 17:31:08,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:08,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 17:31:08,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:08,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 17:31:08,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:31:08,929 INFO L87 Difference]: Start difference. First operand 555 states and 745 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-13 17:31:09,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:09,273 INFO L93 Difference]: Finished difference Result 832 states and 1102 transitions. [2021-11-13 17:31:09,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-13 17:31:09,275 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-11-13 17:31:09,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:09,280 INFO L225 Difference]: With dead ends: 832 [2021-11-13 17:31:09,280 INFO L226 Difference]: Without dead ends: 651 [2021-11-13 17:31:09,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 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 17:31:09,282 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 514 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 204.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.50ms SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 244.44ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:09,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [525 Valid, 542 Invalid, 352 Unknown, 0 Unchecked, 6.50ms Time], IncrementalHoareTripleChecker [78 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 244.44ms Time] [2021-11-13 17:31:09,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2021-11-13 17:31:09,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 595. [2021-11-13 17:31:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 514 states have (on average 1.3268482490272373) internal successors, (682), 521 states have internal predecessors, (682), 49 states have call successors, (49), 29 states have call predecessors, (49), 30 states have return successors, (59), 45 states have call predecessors, (59), 47 states have call successors, (59) [2021-11-13 17:31:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 790 transitions. [2021-11-13 17:31:09,338 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 790 transitions. Word has length 57 [2021-11-13 17:31:09,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:09,339 INFO L470 AbstractCegarLoop]: Abstraction has 595 states and 790 transitions. [2021-11-13 17:31:09,339 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-13 17:31:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 790 transitions. [2021-11-13 17:31:09,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-13 17:31:09,341 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:09,341 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 17:31:09,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-13 17:31:09,341 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:09,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:09,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1451714765, now seen corresponding path program 1 times [2021-11-13 17:31:09,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:09,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458181284] [2021-11-13 17:31:09,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:09,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:09,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 17:31:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:09,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 17:31:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:09,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 17:31:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:09,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 17:31:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:09,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:09,419 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 17:31:09,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:09,419 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458181284] [2021-11-13 17:31:09,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458181284] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:09,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:09,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 17:31:09,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087462439] [2021-11-13 17:31:09,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:09,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 17:31:09,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:09,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 17:31:09,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:31:09,422 INFO L87 Difference]: Start difference. First operand 595 states and 790 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-13 17:31:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:09,950 INFO L93 Difference]: Finished difference Result 931 states and 1239 transitions. [2021-11-13 17:31:09,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-13 17:31:09,950 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-11-13 17:31:09,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:09,955 INFO L225 Difference]: With dead ends: 931 [2021-11-13 17:31:09,956 INFO L226 Difference]: Without dead ends: 709 [2021-11-13 17:31:09,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-11-13 17:31:09,958 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 414 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 320.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.74ms SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 379.59ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:09,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 717 Invalid, 521 Unknown, 0 Unchecked, 9.74ms Time], IncrementalHoareTripleChecker [82 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 379.59ms Time] [2021-11-13 17:31:09,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-11-13 17:31:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 650. [2021-11-13 17:31:10,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 555 states have (on average 1.3045045045045045) internal successors, (724), 564 states have internal predecessors, (724), 56 states have call successors, (56), 34 states have call predecessors, (56), 37 states have return successors, (77), 52 states have call predecessors, (77), 54 states have call successors, (77) [2021-11-13 17:31:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 857 transitions. [2021-11-13 17:31:10,022 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 857 transitions. Word has length 57 [2021-11-13 17:31:10,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:10,022 INFO L470 AbstractCegarLoop]: Abstraction has 650 states and 857 transitions. [2021-11-13 17:31:10,023 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-13 17:31:10,023 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 857 transitions. [2021-11-13 17:31:10,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-13 17:31:10,024 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:10,025 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 17:31:10,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-13 17:31:10,025 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:10,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:10,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1874416591, now seen corresponding path program 1 times [2021-11-13 17:31:10,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:10,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763613806] [2021-11-13 17:31:10,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:10,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:10,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 17:31:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:10,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 17:31:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:10,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 17:31:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:10,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 17:31:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:10,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:10,097 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 17:31:10,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:10,097 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763613806] [2021-11-13 17:31:10,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763613806] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:10,097 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:10,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 17:31:10,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766292002] [2021-11-13 17:31:10,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:10,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 17:31:10,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:10,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 17:31:10,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:31:10,099 INFO L87 Difference]: Start difference. First operand 650 states and 857 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-13 17:31:10,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:10,497 INFO L93 Difference]: Finished difference Result 979 states and 1276 transitions. [2021-11-13 17:31:10,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:31:10,498 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2021-11-13 17:31:10,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:10,503 INFO L225 Difference]: With dead ends: 979 [2021-11-13 17:31:10,503 INFO L226 Difference]: Without dead ends: 705 [2021-11-13 17:31:10,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-11-13 17:31:10,505 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 483 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 219.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.16ms SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 267.34ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:10,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [496 Valid, 541 Invalid, 369 Unknown, 0 Unchecked, 6.16ms Time], IncrementalHoareTripleChecker [96 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 267.34ms Time] [2021-11-13 17:31:10,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2021-11-13 17:31:10,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 677. [2021-11-13 17:31:10,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 579 states have (on average 1.2797927461139897) internal successors, (741), 588 states have internal predecessors, (741), 56 states have call successors, (56), 36 states have call predecessors, (56), 40 states have return successors, (79), 53 states have call predecessors, (79), 54 states have call successors, (79) [2021-11-13 17:31:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 876 transitions. [2021-11-13 17:31:10,564 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 876 transitions. Word has length 57 [2021-11-13 17:31:10,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:10,564 INFO L470 AbstractCegarLoop]: Abstraction has 677 states and 876 transitions. [2021-11-13 17:31:10,565 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), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-13 17:31:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 876 transitions. [2021-11-13 17:31:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-13 17:31:10,567 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:10,567 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 17:31:10,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-13 17:31:10,567 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:10,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:10,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1056768141, now seen corresponding path program 1 times [2021-11-13 17:31:10,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:10,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197638185] [2021-11-13 17:31:10,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:10,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:10,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 17:31:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:10,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 17:31:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:10,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 17:31:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:10,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 17:31:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:10,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:10,633 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 17:31:10,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:10,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197638185] [2021-11-13 17:31:10,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197638185] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:10,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:10,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 17:31:10,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6668356] [2021-11-13 17:31:10,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:10,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 17:31:10,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:10,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 17:31:10,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 17:31:10,637 INFO L87 Difference]: Start difference. First operand 677 states and 876 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-13 17:31:11,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:11,029 INFO L93 Difference]: Finished difference Result 1286 states and 1619 transitions. [2021-11-13 17:31:11,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:31:11,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2021-11-13 17:31:11,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:11,037 INFO L225 Difference]: With dead ends: 1286 [2021-11-13 17:31:11,037 INFO L226 Difference]: Without dead ends: 983 [2021-11-13 17:31:11,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-13 17:31:11,040 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 411 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 220.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.84ms SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 260.67ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:11,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 545 Invalid, 246 Unknown, 0 Unchecked, 5.84ms Time], IncrementalHoareTripleChecker [70 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 260.67ms Time] [2021-11-13 17:31:11,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2021-11-13 17:31:11,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 952. [2021-11-13 17:31:11,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 805 states have (on average 1.2397515527950311) internal successors, (998), 818 states have internal predecessors, (998), 82 states have call successors, (82), 57 states have call predecessors, (82), 63 states have return successors, (109), 77 states have call predecessors, (109), 80 states have call successors, (109) [2021-11-13 17:31:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1189 transitions. [2021-11-13 17:31:11,126 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1189 transitions. Word has length 57 [2021-11-13 17:31:11,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:11,127 INFO L470 AbstractCegarLoop]: Abstraction has 952 states and 1189 transitions. [2021-11-13 17:31:11,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-13 17:31:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1189 transitions. [2021-11-13 17:31:11,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-13 17:31:11,130 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:11,131 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] [2021-11-13 17:31:11,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-13 17:31:11,131 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:11,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:11,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2041766118, now seen corresponding path program 1 times [2021-11-13 17:31:11,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:11,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029000641] [2021-11-13 17:31:11,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:11,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:11,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 17:31:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:11,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-11-13 17:31:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:11,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:11,184 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 17:31:11,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:11,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029000641] [2021-11-13 17:31:11,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029000641] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:11,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:11,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:31:11,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042151887] [2021-11-13 17:31:11,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:11,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:31:11,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:11,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:31:11,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:31:11,187 INFO L87 Difference]: Start difference. First operand 952 states and 1189 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-13 17:31:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:11,442 INFO L93 Difference]: Finished difference Result 1536 states and 1974 transitions. [2021-11-13 17:31:11,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 17:31:11,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2021-11-13 17:31:11,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:11,450 INFO L225 Difference]: With dead ends: 1536 [2021-11-13 17:31:11,451 INFO L226 Difference]: Without dead ends: 1180 [2021-11-13 17:31:11,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-13 17:31:11,457 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 126 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 119.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.10ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 146.89ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:11,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 605 Invalid, 160 Unknown, 0 Unchecked, 4.10ms Time], IncrementalHoareTripleChecker [23 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 146.89ms Time] [2021-11-13 17:31:11,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2021-11-13 17:31:11,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1142. [2021-11-13 17:31:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 971 states have (on average 1.2337796086508754) internal successors, (1198), 986 states have internal predecessors, (1198), 96 states have call successors, (96), 65 states have call predecessors, (96), 73 states have return successors, (133), 91 states have call predecessors, (133), 94 states have call successors, (133) [2021-11-13 17:31:11,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1427 transitions. [2021-11-13 17:31:11,559 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1427 transitions. Word has length 62 [2021-11-13 17:31:11,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:11,560 INFO L470 AbstractCegarLoop]: Abstraction has 1142 states and 1427 transitions. [2021-11-13 17:31:11,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-13 17:31:11,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1427 transitions. [2021-11-13 17:31:11,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-13 17:31:11,563 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:11,563 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] [2021-11-13 17:31:11,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-13 17:31:11,564 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:11,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:11,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2064164623, now seen corresponding path program 1 times [2021-11-13 17:31:11,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:11,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286438495] [2021-11-13 17:31:11,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:11,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:11,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 17:31:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:11,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-11-13 17:31:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:11,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-13 17:31:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:11,626 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-13 17:31:11,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:11,626 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286438495] [2021-11-13 17:31:11,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286438495] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:11,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:11,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:31:11,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235063039] [2021-11-13 17:31:11,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:11,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:31:11,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:11,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:31:11,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:31:11,631 INFO L87 Difference]: Start difference. First operand 1142 states and 1427 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-13 17:31:11,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:11,852 INFO L93 Difference]: Finished difference Result 1795 states and 2280 transitions. [2021-11-13 17:31:11,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 17:31:11,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2021-11-13 17:31:11,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:11,861 INFO L225 Difference]: With dead ends: 1795 [2021-11-13 17:31:11,862 INFO L226 Difference]: Without dead ends: 1341 [2021-11-13 17:31:11,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-13 17:31:11,864 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 264 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.25ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 110.90ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:11,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 447 Invalid, 89 Unknown, 0 Unchecked, 3.25ms Time], IncrementalHoareTripleChecker [30 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 110.90ms Time] [2021-11-13 17:31:11,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2021-11-13 17:31:11,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1286. [2021-11-13 17:31:11,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1099 states have (on average 1.2274795268425842) internal successors, (1349), 1116 states have internal predecessors, (1349), 104 states have call successors, (104), 71 states have call predecessors, (104), 81 states have return successors, (147), 99 states have call predecessors, (147), 102 states have call successors, (147) [2021-11-13 17:31:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1600 transitions. [2021-11-13 17:31:11,997 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1600 transitions. Word has length 67 [2021-11-13 17:31:11,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:11,997 INFO L470 AbstractCegarLoop]: Abstraction has 1286 states and 1600 transitions. [2021-11-13 17:31:11,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-13 17:31:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1600 transitions. [2021-11-13 17:31:12,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-13 17:31:12,001 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:12,001 INFO L514 BasicCegarLoop]: trace histogram [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 17:31:12,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-13 17:31:12,001 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:12,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:12,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1473250423, now seen corresponding path program 1 times [2021-11-13 17:31:12,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:12,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838155654] [2021-11-13 17:31:12,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:12,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:12,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 17:31:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:12,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-13 17:31:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:12,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-13 17:31:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-13 17:31:12,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:12,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838155654] [2021-11-13 17:31:12,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838155654] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:31:12,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156453724] [2021-11-13 17:31:12,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:12,080 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:31:12,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:31:12,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:31:12,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-13 17:31:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:12,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-13 17:31:12,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:31:12,451 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:12,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:31:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-13 17:31:12,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156453724] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-13 17:31:12,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-13 17:31:12,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2021-11-13 17:31:12,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761124567] [2021-11-13 17:31:12,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:12,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:31:12,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:12,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:31:12,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-13 17:31:12,589 INFO L87 Difference]: Start difference. First operand 1286 states and 1600 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-13 17:31:12,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:12,782 INFO L93 Difference]: Finished difference Result 1342 states and 1668 transitions. [2021-11-13 17:31:12,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:31:12,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2021-11-13 17:31:12,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:12,792 INFO L225 Difference]: With dead ends: 1342 [2021-11-13 17:31:12,792 INFO L226 Difference]: Without dead ends: 1339 [2021-11-13 17:31:12,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-13 17:31:12,793 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 381 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.09ms SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.15ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:12,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 319 Invalid, 84 Unknown, 0 Unchecked, 2.09ms Time], IncrementalHoareTripleChecker [75 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 66.15ms Time] [2021-11-13 17:31:12,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2021-11-13 17:31:12,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1285. [2021-11-13 17:31:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1099 states have (on average 1.2256596906278434) internal successors, (1347), 1115 states have internal predecessors, (1347), 103 states have call successors, (103), 71 states have call predecessors, (103), 81 states have return successors, (147), 99 states have call predecessors, (147), 102 states have call successors, (147) [2021-11-13 17:31:12,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1597 transitions. [2021-11-13 17:31:12,907 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1597 transitions. Word has length 68 [2021-11-13 17:31:12,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:12,908 INFO L470 AbstractCegarLoop]: Abstraction has 1285 states and 1597 transitions. [2021-11-13 17:31:12,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-13 17:31:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1597 transitions. [2021-11-13 17:31:12,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-13 17:31:12,911 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:12,911 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-13 17:31:12,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-13 17:31:13,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-13 17:31:13,126 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:13,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:13,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1574463180, now seen corresponding path program 1 times [2021-11-13 17:31:13,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:13,127 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637058415] [2021-11-13 17:31:13,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:13,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:13,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 17:31:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:13,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-13 17:31:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:13,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-11-13 17:31:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-13 17:31:13,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:13,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637058415] [2021-11-13 17:31:13,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637058415] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:31:13,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529449632] [2021-11-13 17:31:13,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:13,203 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:31:13,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:31:13,204 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:31:13,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-13 17:31:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:13,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-13 17:31:13,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:31:13,698 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:31:13,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:31:13,845 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-13 17:31:13,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529449632] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:31:13,846 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:31:13,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2021-11-13 17:31:13,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266528576] [2021-11-13 17:31:13,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:31:13,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-13 17:31:13,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:13,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-13 17:31:13,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-11-13 17:31:13,848 INFO L87 Difference]: Start difference. First operand 1285 states and 1597 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2021-11-13 17:31:14,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:14,977 INFO L93 Difference]: Finished difference Result 2985 states and 3817 transitions. [2021-11-13 17:31:14,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-13 17:31:14,978 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2021-11-13 17:31:14,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:14,994 INFO L225 Difference]: With dead ends: 2985 [2021-11-13 17:31:14,994 INFO L226 Difference]: Without dead ends: 2441 [2021-11-13 17:31:14,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2021-11-13 17:31:14,999 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 589 mSDsluCounter, 2018 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 382.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 14.04ms SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 460.18ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:14,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [611 Valid, 2375 Invalid, 831 Unknown, 0 Unchecked, 14.04ms Time], IncrementalHoareTripleChecker [34 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 460.18ms Time] [2021-11-13 17:31:15,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2441 states. [2021-11-13 17:31:15,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2441 to 1674. [2021-11-13 17:31:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1449 states have (on average 1.2291235334713595) internal successors, (1781), 1473 states have internal predecessors, (1781), 123 states have call successors, (123), 85 states have call predecessors, (123), 100 states have return successors, (181), 116 states have call predecessors, (181), 122 states have call successors, (181) [2021-11-13 17:31:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2085 transitions. [2021-11-13 17:31:15,198 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2085 transitions. Word has length 69 [2021-11-13 17:31:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:15,198 INFO L470 AbstractCegarLoop]: Abstraction has 1674 states and 2085 transitions. [2021-11-13 17:31:15,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2021-11-13 17:31:15,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2085 transitions. [2021-11-13 17:31:15,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-13 17:31:15,204 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:15,204 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-11-13 17:31:15,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-13 17:31:15,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-13 17:31:15,418 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:15,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:15,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1815627380, now seen corresponding path program 1 times [2021-11-13 17:31:15,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:15,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345473237] [2021-11-13 17:31:15,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:15,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:15,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 17:31:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:15,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-13 17:31:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:15,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:15,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-13 17:31:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-13 17:31:15,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:15,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345473237] [2021-11-13 17:31:15,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345473237] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:31:15,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647555173] [2021-11-13 17:31:15,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:15,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:31:15,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:31:15,506 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:31:15,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-13 17:31:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:15,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-13 17:31:15,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:31:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-13 17:31:15,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 17:31:15,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647555173] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:15,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 17:31:15,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-11-13 17:31:15,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847583884] [2021-11-13 17:31:15,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:15,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 17:31:15,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:15,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 17:31:15,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:31:15,843 INFO L87 Difference]: Start difference. First operand 1674 states and 2085 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-13 17:31:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:16,055 INFO L93 Difference]: Finished difference Result 2397 states and 3023 transitions. [2021-11-13 17:31:16,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:31:16,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2021-11-13 17:31:16,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:16,066 INFO L225 Difference]: With dead ends: 2397 [2021-11-13 17:31:16,066 INFO L226 Difference]: Without dead ends: 1552 [2021-11-13 17:31:16,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:31:16,070 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 187 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.52ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.22ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:16,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 333 Invalid, 8 Unknown, 0 Unchecked, 1.52ms Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 33.22ms Time] [2021-11-13 17:31:16,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2021-11-13 17:31:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1537. [2021-11-13 17:31:16,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1328 states have (on average 1.2221385542168675) internal successors, (1623), 1351 states have internal predecessors, (1623), 115 states have call successors, (115), 79 states have call predecessors, (115), 92 states have return successors, (167), 107 states have call predecessors, (167), 114 states have call successors, (167) [2021-11-13 17:31:16,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 1905 transitions. [2021-11-13 17:31:16,238 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 1905 transitions. Word has length 88 [2021-11-13 17:31:16,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:16,239 INFO L470 AbstractCegarLoop]: Abstraction has 1537 states and 1905 transitions. [2021-11-13 17:31:16,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-13 17:31:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1905 transitions. [2021-11-13 17:31:16,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-13 17:31:16,244 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:16,244 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 17:31:16,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-13 17:31:16,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:31:16,465 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:16,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:16,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1196332864, now seen corresponding path program 1 times [2021-11-13 17:31:16,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:16,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495694469] [2021-11-13 17:31:16,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:16,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:16,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 17:31:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:16,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 17:31:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:16,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 17:31:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:16,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 17:31:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:16,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:16,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-13 17:31:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:16,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:16,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-13 17:31:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-13 17:31:16,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:16,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495694469] [2021-11-13 17:31:16,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495694469] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:16,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:16,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 17:31:16,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008832652] [2021-11-13 17:31:16,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:16,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 17:31:16,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:16,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 17:31:16,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:31:16,603 INFO L87 Difference]: Start difference. First operand 1537 states and 1905 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-13 17:31:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:17,188 INFO L93 Difference]: Finished difference Result 2711 states and 3301 transitions. [2021-11-13 17:31:17,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:31:17,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2021-11-13 17:31:17,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:17,202 INFO L225 Difference]: With dead ends: 2711 [2021-11-13 17:31:17,202 INFO L226 Difference]: Without dead ends: 2135 [2021-11-13 17:31:17,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-11-13 17:31:17,206 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 429 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 252.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.96ms SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 303.67ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:17,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [440 Valid, 665 Invalid, 389 Unknown, 0 Unchecked, 6.96ms Time], IncrementalHoareTripleChecker [97 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 303.67ms Time] [2021-11-13 17:31:17,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2021-11-13 17:31:17,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 2095. [2021-11-13 17:31:17,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2095 states, 1785 states have (on average 1.2022408963585434) internal successors, (2146), 1817 states have internal predecessors, (2146), 168 states have call successors, (168), 119 states have call predecessors, (168), 140 states have return successors, (250), 160 states have call predecessors, (250), 167 states have call successors, (250) [2021-11-13 17:31:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 2564 transitions. [2021-11-13 17:31:17,450 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 2564 transitions. Word has length 92 [2021-11-13 17:31:17,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:17,450 INFO L470 AbstractCegarLoop]: Abstraction has 2095 states and 2564 transitions. [2021-11-13 17:31:17,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-13 17:31:17,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 2564 transitions. [2021-11-13 17:31:17,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-13 17:31:17,456 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:17,457 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 17:31:17,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-13 17:31:17,457 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:17,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:17,458 INFO L85 PathProgramCache]: Analyzing trace with hash 128523330, now seen corresponding path program 1 times [2021-11-13 17:31:17,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:17,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433270529] [2021-11-13 17:31:17,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:17,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:17,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 17:31:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:17,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 17:31:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:17,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 17:31:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:17,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 17:31:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:17,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:17,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-13 17:31:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:17,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:17,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-13 17:31:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-13 17:31:17,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:17,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433270529] [2021-11-13 17:31:17,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433270529] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:17,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:17,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 17:31:17,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046276449] [2021-11-13 17:31:17,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:17,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 17:31:17,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:17,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 17:31:17,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 17:31:17,545 INFO L87 Difference]: Start difference. First operand 2095 states and 2564 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-13 17:31:17,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:17,926 INFO L93 Difference]: Finished difference Result 2994 states and 3615 transitions. [2021-11-13 17:31:17,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 17:31:17,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 92 [2021-11-13 17:31:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:17,940 INFO L225 Difference]: With dead ends: 2994 [2021-11-13 17:31:17,941 INFO L226 Difference]: Without dead ends: 1860 [2021-11-13 17:31:17,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-13 17:31:17,945 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 274 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 141.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.22ms SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 170.08ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:17,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 473 Invalid, 178 Unknown, 0 Unchecked, 4.22ms Time], IncrementalHoareTripleChecker [49 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 170.08ms Time] [2021-11-13 17:31:17,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2021-11-13 17:31:18,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1824. [2021-11-13 17:31:18,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1565 states have (on average 1.2102236421725239) internal successors, (1894), 1593 states have internal predecessors, (1894), 139 states have call successors, (139), 99 states have call predecessors, (139), 118 states have return successors, (208), 132 states have call predecessors, (208), 138 states have call successors, (208) [2021-11-13 17:31:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2241 transitions. [2021-11-13 17:31:18,162 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2241 transitions. Word has length 92 [2021-11-13 17:31:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:18,163 INFO L470 AbstractCegarLoop]: Abstraction has 1824 states and 2241 transitions. [2021-11-13 17:31:18,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-13 17:31:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2241 transitions. [2021-11-13 17:31:18,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-13 17:31:18,168 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:18,168 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, 1] [2021-11-13 17:31:18,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-13 17:31:18,170 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:18,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:18,170 INFO L85 PathProgramCache]: Analyzing trace with hash 172011463, now seen corresponding path program 1 times [2021-11-13 17:31:18,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:18,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357647109] [2021-11-13 17:31:18,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:18,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:18,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 17:31:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:18,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 17:31:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:18,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 17:31:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:18,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 17:31:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:18,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:18,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-13 17:31:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:18,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:18,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-13 17:31:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-13 17:31:18,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:18,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357647109] [2021-11-13 17:31:18,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357647109] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:18,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:18,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 17:31:18,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363811100] [2021-11-13 17:31:18,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:18,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 17:31:18,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:18,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 17:31:18,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:31:18,263 INFO L87 Difference]: Start difference. First operand 1824 states and 2241 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-13 17:31:19,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:19,011 INFO L93 Difference]: Finished difference Result 3084 states and 3743 transitions. [2021-11-13 17:31:19,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:31:19,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 93 [2021-11-13 17:31:19,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:19,026 INFO L225 Difference]: With dead ends: 3084 [2021-11-13 17:31:19,026 INFO L226 Difference]: Without dead ends: 2221 [2021-11-13 17:31:19,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-11-13 17:31:19,032 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 754 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 373.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.24ms SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 446.83ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:19,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [754 Valid, 668 Invalid, 589 Unknown, 0 Unchecked, 7.24ms Time], IncrementalHoareTripleChecker [221 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 446.83ms Time] [2021-11-13 17:31:19,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2021-11-13 17:31:19,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 2199. [2021-11-13 17:31:19,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2199 states, 1876 states have (on average 1.1924307036247335) internal successors, (2237), 1910 states have internal predecessors, (2237), 171 states have call successors, (171), 124 states have call predecessors, (171), 150 states have return successors, (250), 165 states have call predecessors, (250), 170 states have call successors, (250) [2021-11-13 17:31:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2199 states to 2199 states and 2658 transitions. [2021-11-13 17:31:19,270 INFO L78 Accepts]: Start accepts. Automaton has 2199 states and 2658 transitions. Word has length 93 [2021-11-13 17:31:19,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:19,271 INFO L470 AbstractCegarLoop]: Abstraction has 2199 states and 2658 transitions. [2021-11-13 17:31:19,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-13 17:31:19,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2199 states and 2658 transitions. [2021-11-13 17:31:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-13 17:31:19,276 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:19,277 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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 17:31:19,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-13 17:31:19,277 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:19,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:19,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1890951514, now seen corresponding path program 1 times [2021-11-13 17:31:19,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:19,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491543443] [2021-11-13 17:31:19,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:19,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:19,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-13 17:31:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:19,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-11-13 17:31:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:19,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-13 17:31:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:19,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-13 17:31:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:19,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-13 17:31:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-13 17:31:19,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:19,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491543443] [2021-11-13 17:31:19,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491543443] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:31:19,378 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186219] [2021-11-13 17:31:19,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:19,378 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:31:19,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:31:19,382 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:31:19,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-13 17:31:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:19,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-13 17:31:19,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:31:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-13 17:31:19,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 17:31:19,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186219] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:19,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 17:31:19,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-11-13 17:31:19,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763531203] [2021-11-13 17:31:19,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:19,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 17:31:19,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:19,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 17:31:19,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:31:19,688 INFO L87 Difference]: Start difference. First operand 2199 states and 2658 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-13 17:31:19,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:19,876 INFO L93 Difference]: Finished difference Result 2578 states and 3126 transitions. [2021-11-13 17:31:19,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:31:19,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2021-11-13 17:31:19,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:19,886 INFO L225 Difference]: With dead ends: 2578 [2021-11-13 17:31:19,886 INFO L226 Difference]: Without dead ends: 1252 [2021-11-13 17:31:19,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:31:19,890 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 62 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.25ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.87ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:19,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 472 Invalid, 10 Unknown, 0 Unchecked, 3.25ms Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 10.87ms Time] [2021-11-13 17:31:19,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2021-11-13 17:31:20,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2021-11-13 17:31:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1032 states have (on average 1.1424418604651163) internal successors, (1179), 1050 states have internal predecessors, (1179), 114 states have call successors, (114), 87 states have call predecessors, (114), 105 states have return successors, (158), 115 states have call predecessors, (158), 114 states have call successors, (158) [2021-11-13 17:31:20,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1451 transitions. [2021-11-13 17:31:20,059 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1451 transitions. Word has length 103 [2021-11-13 17:31:20,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:20,060 INFO L470 AbstractCegarLoop]: Abstraction has 1252 states and 1451 transitions. [2021-11-13 17:31:20,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-13 17:31:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1451 transitions. [2021-11-13 17:31:20,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-13 17:31:20,064 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:20,065 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] [2021-11-13 17:31:20,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-11-13 17:31:20,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:31:20,278 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:20,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:20,279 INFO L85 PathProgramCache]: Analyzing trace with hash -242597663, now seen corresponding path program 1 times [2021-11-13 17:31:20,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:20,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030076028] [2021-11-13 17:31:20,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:20,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:20,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 17:31:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:20,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 17:31:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:20,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 17:31:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:20,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 17:31:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:20,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:20,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-13 17:31:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:20,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-13 17:31:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:20,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:20,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-13 17:31:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:20,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:20,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-11-13 17:31:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:20,391 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 36 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-11-13 17:31:20,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:20,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030076028] [2021-11-13 17:31:20,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030076028] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:31:20,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345600562] [2021-11-13 17:31:20,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:20,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:31:20,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:31:20,394 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:31:20,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-13 17:31:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:20,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-13 17:31:20,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:31:20,824 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 17:31:20,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 17:31:20,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345600562] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:20,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 17:31:20,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2021-11-13 17:31:20,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157148757] [2021-11-13 17:31:20,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:20,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 17:31:20,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:20,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 17:31:20,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-13 17:31:20,827 INFO L87 Difference]: Start difference. First operand 1252 states and 1451 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 17:31:20,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:20,962 INFO L93 Difference]: Finished difference Result 2102 states and 2486 transitions. [2021-11-13 17:31:20,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:31:20,972 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 17:31:20,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:20,980 INFO L225 Difference]: With dead ends: 2102 [2021-11-13 17:31:20,980 INFO L226 Difference]: Without dead ends: 1252 [2021-11-13 17:31:20,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-13 17:31:20,985 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 70 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.32ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.84ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:20,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 333 Invalid, 7 Unknown, 0 Unchecked, 1.32ms Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 7.84ms Time] [2021-11-13 17:31:20,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2021-11-13 17:31:21,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1244. [2021-11-13 17:31:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 1024 states have (on average 1.1171875) internal successors, (1144), 1042 states have internal predecessors, (1144), 114 states have call successors, (114), 87 states have call predecessors, (114), 105 states have return successors, (158), 115 states have call predecessors, (158), 114 states have call successors, (158) [2021-11-13 17:31:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1416 transitions. [2021-11-13 17:31:21,123 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1416 transitions. Word has length 135 [2021-11-13 17:31:21,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:21,123 INFO L470 AbstractCegarLoop]: Abstraction has 1244 states and 1416 transitions. [2021-11-13 17:31:21,124 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 17:31:21,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1416 transitions. [2021-11-13 17:31:21,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2021-11-13 17:31:21,129 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:21,129 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 17:31:21,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-13 17:31:21,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-11-13 17:31:21,346 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:21,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:21,347 INFO L85 PathProgramCache]: Analyzing trace with hash 652625369, now seen corresponding path program 1 times [2021-11-13 17:31:21,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:21,347 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20034627] [2021-11-13 17:31:21,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:21,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:21,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 17:31:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:21,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 17:31:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:21,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 17:31:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:21,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 17:31:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:21,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:21,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-13 17:31:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:21,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-13 17:31:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:21,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:21,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-13 17:31:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:21,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:21,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-13 17:31:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:21,493 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 17:31:21,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:21,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20034627] [2021-11-13 17:31:21,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20034627] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:21,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:31:21,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 17:31:21,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497783816] [2021-11-13 17:31:21,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:21,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 17:31:21,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:21,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 17:31:21,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-13 17:31:21,496 INFO L87 Difference]: Start difference. First operand 1244 states and 1416 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 17:31:22,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:22,295 INFO L93 Difference]: Finished difference Result 3687 states and 4191 transitions. [2021-11-13 17:31:22,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-13 17:31:22,295 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 17:31:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:22,332 INFO L225 Difference]: With dead ends: 3687 [2021-11-13 17:31:22,332 INFO L226 Difference]: Without dead ends: 2795 [2021-11-13 17:31:22,336 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 17:31:22,336 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 475 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 338.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.14ms SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 403.62ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:22,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [502 Valid, 506 Invalid, 413 Unknown, 0 Unchecked, 7.14ms Time], IncrementalHoareTripleChecker [88 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 403.62ms Time] [2021-11-13 17:31:22,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2795 states. [2021-11-13 17:31:22,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2795 to 2345. [2021-11-13 17:31:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 1944 states have (on average 1.1219135802469136) internal successors, (2181), 1975 states have internal predecessors, (2181), 208 states have call successors, (208), 161 states have call predecessors, (208), 192 states have return successors, (290), 209 states have call predecessors, (290), 208 states have call successors, (290) [2021-11-13 17:31:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 2679 transitions. [2021-11-13 17:31:22,650 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 2679 transitions. Word has length 136 [2021-11-13 17:31:22,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:22,651 INFO L470 AbstractCegarLoop]: Abstraction has 2345 states and 2679 transitions. [2021-11-13 17:31:22,651 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 17:31:22,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 2679 transitions. [2021-11-13 17:31:22,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-13 17:31:22,658 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:22,659 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:31:22,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-13 17:31:22,659 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:22,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:22,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1954098622, now seen corresponding path program 1 times [2021-11-13 17:31:22,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:22,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284052068] [2021-11-13 17:31:22,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:22,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:22,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 17:31:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:22,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 17:31:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:22,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 17:31:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:22,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 17:31:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:22,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:22,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-13 17:31:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:22,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:22,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-11-13 17:31:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:22,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-11-13 17:31:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:22,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-13 17:31:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:22,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-11-13 17:31:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:22,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2021-11-13 17:31:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:22,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-13 17:31:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:22,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-13 17:31:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:22,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-11-13 17:31:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2021-11-13 17:31:22,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:22,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284052068] [2021-11-13 17:31:22,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284052068] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:31:22,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198935245] [2021-11-13 17:31:22,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:22,808 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:31:22,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:31:22,809 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:31:22,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-13 17:31:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:22,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-13 17:31:22,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:31:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-13 17:31:23,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 17:31:23,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198935245] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:23,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 17:31:23,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2021-11-13 17:31:23,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452325005] [2021-11-13 17:31:23,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:23,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 17:31:23,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:23,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 17:31:23,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-13 17:31:23,257 INFO L87 Difference]: Start difference. First operand 2345 states and 2679 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, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-13 17:31:23,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:23,424 INFO L93 Difference]: Finished difference Result 3543 states and 4063 transitions. [2021-11-13 17:31:23,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 17:31:23,425 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, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 159 [2021-11-13 17:31:23,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:23,432 INFO L225 Difference]: With dead ends: 3543 [2021-11-13 17:31:23,432 INFO L226 Difference]: Without dead ends: 1212 [2021-11-13 17:31:23,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-13 17:31:23,439 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 31 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.15ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.59ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:23,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 644 Invalid, 25 Unknown, 0 Unchecked, 2.15ms Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 16.59ms Time] [2021-11-13 17:31:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2021-11-13 17:31:23,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1102. [2021-11-13 17:31:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 931 states have (on average 1.128893662728249) internal successors, (1051), 936 states have internal predecessors, (1051), 87 states have call successors, (87), 70 states have call predecessors, (87), 83 states have return successors, (121), 95 states have call predecessors, (121), 87 states have call successors, (121) [2021-11-13 17:31:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1259 transitions. [2021-11-13 17:31:23,599 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1259 transitions. Word has length 159 [2021-11-13 17:31:23,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:23,599 INFO L470 AbstractCegarLoop]: Abstraction has 1102 states and 1259 transitions. [2021-11-13 17:31:23,599 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, (14), 2 states have call predecessors, (14), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-13 17:31:23,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1259 transitions. [2021-11-13 17:31:23,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-11-13 17:31:23,604 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:23,604 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:31:23,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-13 17:31:23,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-13 17:31:23,819 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:23,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:23,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1415226387, now seen corresponding path program 1 times [2021-11-13 17:31:23,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:23,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325261844] [2021-11-13 17:31:23,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:23,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:23,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 17:31:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:23,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 17:31:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:23,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 17:31:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:23,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 17:31:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:23,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:23,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-13 17:31:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:23,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:23,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-11-13 17:31:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:23,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-13 17:31:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:23,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-11-13 17:31:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:23,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2021-11-13 17:31:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:23,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-13 17:31:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:23,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-13 17:31:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:23,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-11-13 17:31:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:23,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-11-13 17:31:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:23,959 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2021-11-13 17:31:23,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:23,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325261844] [2021-11-13 17:31:23,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325261844] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:31:23,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649296501] [2021-11-13 17:31:23,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:23,962 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:31:23,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:31:23,966 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:31:23,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-13 17:31:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:24,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-13 17:31:24,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:31:24,545 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 75 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-11-13 17:31:24,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:31:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2021-11-13 17:31:24,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649296501] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:31:24,973 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:31:24,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 12 [2021-11-13 17:31:24,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106274870] [2021-11-13 17:31:24,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:31:24,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-13 17:31:24,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:24,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-13 17:31:24,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-11-13 17:31:24,976 INFO L87 Difference]: Start difference. First operand 1102 states and 1259 transitions. Second operand has 12 states, 12 states have (on average 18.5) internal successors, (222), 10 states have internal predecessors, (222), 6 states have call successors, (39), 7 states have call predecessors, (39), 9 states have return successors, (37), 5 states have call predecessors, (37), 6 states have call successors, (37) [2021-11-13 17:31:25,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:25,397 INFO L93 Difference]: Finished difference Result 1937 states and 2202 transitions. [2021-11-13 17:31:25,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-13 17:31:25,397 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 18.5) internal successors, (222), 10 states have internal predecessors, (222), 6 states have call successors, (39), 7 states have call predecessors, (39), 9 states have return successors, (37), 5 states have call predecessors, (37), 6 states have call successors, (37) Word has length 164 [2021-11-13 17:31:25,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:25,403 INFO L225 Difference]: With dead ends: 1937 [2021-11-13 17:31:25,403 INFO L226 Difference]: Without dead ends: 872 [2021-11-13 17:31:25,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-11-13 17:31:25,407 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 484 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 207.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.57ms SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 255.89ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:25,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [490 Valid, 330 Invalid, 407 Unknown, 0 Unchecked, 4.57ms Time], IncrementalHoareTripleChecker [136 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 255.89ms Time] [2021-11-13 17:31:25,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2021-11-13 17:31:25,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 831. [2021-11-13 17:31:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 705 states have (on average 1.1177304964539008) internal successors, (788), 707 states have internal predecessors, (788), 63 states have call successors, (63), 54 states have call predecessors, (63), 62 states have return successors, (83), 69 states have call predecessors, (83), 63 states have call successors, (83) [2021-11-13 17:31:25,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 934 transitions. [2021-11-13 17:31:25,517 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 934 transitions. Word has length 164 [2021-11-13 17:31:25,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:25,518 INFO L470 AbstractCegarLoop]: Abstraction has 831 states and 934 transitions. [2021-11-13 17:31:25,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.5) internal successors, (222), 10 states have internal predecessors, (222), 6 states have call successors, (39), 7 states have call predecessors, (39), 9 states have return successors, (37), 5 states have call predecessors, (37), 6 states have call successors, (37) [2021-11-13 17:31:25,518 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 934 transitions. [2021-11-13 17:31:25,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-13 17:31:25,522 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:31:25,523 INFO L514 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 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] [2021-11-13 17:31:25,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-13 17:31:25,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-13 17:31:25,738 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:31:25,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:31:25,739 INFO L85 PathProgramCache]: Analyzing trace with hash 239124213, now seen corresponding path program 1 times [2021-11-13 17:31:25,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:31:25,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985733330] [2021-11-13 17:31:25,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:25,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:31:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:25,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-13 17:31:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:25,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-11-13 17:31:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:25,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-13 17:31:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:25,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-13 17:31:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:25,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-13 17:31:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:25,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-13 17:31:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:25,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-13 17:31:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:25,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:25,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-13 17:31:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:25,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:25,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-11-13 17:31:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:25,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-13 17:31:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:25,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-13 17:31:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:25,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-11-13 17:31:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:25,867 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 67 proven. 14 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-11-13 17:31:25,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:31:25,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985733330] [2021-11-13 17:31:25,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985733330] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:31:25,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544833584] [2021-11-13 17:31:25,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:31:25,869 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:31:25,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:31:25,870 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:31:25,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-13 17:31:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:31:26,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-13 17:31:26,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:31:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-11-13 17:31:26,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 17:31:26,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544833584] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:31:26,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 17:31:26,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-11-13 17:31:26,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612066709] [2021-11-13 17:31:26,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:31:26,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 17:31:26,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:31:26,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 17:31:26,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:31:26,426 INFO L87 Difference]: Start difference. First operand 831 states and 934 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2021-11-13 17:31:26,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:31:26,495 INFO L93 Difference]: Finished difference Result 1158 states and 1303 transitions. [2021-11-13 17:31:26,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:31:26,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 175 [2021-11-13 17:31:26,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:31:26,497 INFO L225 Difference]: With dead ends: 1158 [2021-11-13 17:31:26,497 INFO L226 Difference]: Without dead ends: 0 [2021-11-13 17:31:26,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-13 17:31:26,500 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 91 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.10ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.17ms IncrementalHoareTripleChecker+Time [2021-11-13 17:31:26,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 261 Invalid, 9 Unknown, 0 Unchecked, 1.10ms Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 11.17ms Time] [2021-11-13 17:31:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-13 17:31:26,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-13 17:31:26,502 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 17:31:26,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-13 17:31:26,502 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2021-11-13 17:31:26,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:31:26,503 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-13 17:31:26,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2021-11-13 17:31:26,503 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-13 17:31:26,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-13 17:31:26,506 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-11-13 17:31:26,507 INFO L764 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-11-13 17:31:26,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-13 17:31:26,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-13 17:31:26,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-13 17:31:45,714 WARN L227 SmtUtils]: Spent 16.80s on a formula simplification. DAG size of input: 129 DAG size of output: 127 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-13 17:32:04,404 WARN L227 SmtUtils]: Spent 16.87s on a formula simplification. DAG size of input: 132 DAG size of output: 130 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-13 17:32:23,666 INFO L858 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 706 716) no Hoare annotation was computed. [2021-11-13 17:32:23,666 INFO L854 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 706 716) the Hoare annotation is: (let ((.cse1 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse12 (not (<= 2 ~E_M~0))) (.cse17 (not (= ~token~0 ~local~0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse3 (= |old(~m_st~0)| 0)) (.cse4 (not (= ~m_i~0 1))) (.cse18 (and (= |old(~t1_st~0)| ~t1_st~0) .cse1)) (.cse19 (not (= ~t1_pc~0 1))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~T1_E~0 2))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse13 (= ~E_1~0 0)) (.cse14 (= ~M_E~0 0)) (.cse15 (= ~M_E~0 1)) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (and .cse1 (= ~t1_st~0 0)) .cse2 .cse3 .cse4 (not (= ~m_pc~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ~t1_pc~0 0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse2 .cse3 (not (<= 2 |old(~t1_st~0)|)) .cse4 .cse18 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse2 .cse3 .cse4 .cse18 (= ~E_1~0 1) .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (< ~local~0 ~token~0)) (not (< 0 ~E_M~0)) .cse13 .cse14 .cse15 .cse16 (not (<= ~token~0 (+ ~local~0 1))))))) [2021-11-13 17:32:23,667 INFO L858 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 706 716) no Hoare annotation was computed. [2021-11-13 17:32:23,667 INFO L854 garLoopResultBuilder]: At program point L62(lines 46 64) the Hoare annotation is: (let ((.cse20 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse21 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse0 (not (= 2 |old(~c_dr_st~0)|))) (.cse10 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse2 (and .cse20 .cse21)) (.cse1 (= ~E_1~0 1)) (.cse3 (not (= ~m_pc~0 0))) (.cse4 (not (= ~T1_E~0 2))) (.cse19 (not (= ~p_dw_pc~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse15 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse16 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse17 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse18 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse6 (not (= ~t1_pc~0 0))) (.cse7 (not (= ~q_free~0 0))) (.cse8 (not (= ~m_st~0 0))) (.cse9 (not (= ~t1_st~0 0))) (.cse11 (= ~E_1~0 0)) (.cse12 (= ~M_E~0 0)) (.cse13 (= ~M_E~0 1)) (.cse14 (= ~E_M~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 (and .cse15 .cse16 .cse17 .cse18) .cse1 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or (not (<= 2 |old(~p_dw_st~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~c_num_read~0 ~p_num_write~0)) .cse8 .cse9 (not (= ~q_free~0 1)) .cse11 .cse12 .cse13 (not (= ~c_last_read~0 ~p_last_write~0)) .cse14) (or (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse1 .cse3 .cse4 .cse19 .cse5 (and .cse20 .cse15 .cse21 .cse16 .cse17 .cse18) .cse6 (not (= ~c_num_read~0 0)) .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14)))) [2021-11-13 17:32:23,668 INFO L854 garLoopResultBuilder]: At program point immediate_notify_threadsENTRY(lines 84 108) the Hoare annotation is: (let ((.cse6 (not (= ~q_free~0 0))) (.cse0 (= ~E_1~0 1)) (.cse1 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (.cse2 (not (= ~m_pc~0 0))) (.cse3 (not (= ~T1_E~0 2))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (= ~t1_pc~0 0))) (.cse7 (not (= ~m_st~0 0))) (.cse8 (not (= ~t1_st~0 0))) (.cse9 (= ~E_1~0 0)) (.cse10 (= ~M_E~0 0)) (.cse11 (= ~M_E~0 1)) (.cse12 (= ~E_M~0 1))) (and (or (not (= 2 |old(~c_dr_st~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse9 .cse10 .cse11 .cse12) (or (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse0 .cse1 .cse2 .cse3 (not (= ~p_dw_pc~0 0)) .cse4 .cse5 (not (= ~c_num_read~0 0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (not (<= 2 |old(~p_dw_st~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse7 .cse8 (not (= ~q_free~0 1)) .cse9 .cse10 .cse11 (not (= ~c_last_read~0 ~p_last_write~0)) .cse12))) [2021-11-13 17:32:23,669 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2021-11-13 17:32:23,669 INFO L854 garLoopResultBuilder]: At program point L81(lines 65 83) the Hoare annotation is: (let ((.cse3 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse1 (<= |immediate_notify_threads_~tmp~0#1| 0)) (.cse2 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse4 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse5 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse6 (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1))) (.cse7 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse22 (not (= 2 |old(~c_dr_st~0)|))) (.cse8 (= ~E_1~0 1)) (.cse9 (not (= ~m_pc~0 0))) (.cse10 (not (= ~T1_E~0 2))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~t1_pc~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse15 (not (= ~m_st~0 0))) (.cse0 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse21 (= ~p_dw_st~0 0)) (.cse16 (not (= ~t1_st~0 0))) (.cse23 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse17 (= ~E_1~0 0)) (.cse18 (= ~M_E~0 0)) (.cse19 (= ~M_E~0 1)) (.cse20 (= ~E_M~0 1))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ~c_num_read~0 0)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or (not (<= 2 |old(~p_dw_st~0)|)) .cse8 .cse9 .cse10 .cse12 .cse13 (not (= ~c_num_read~0 ~p_num_write~0)) .cse21 (and .cse0 .cse1 .cse3 .cse6) .cse15 .cse16 (not (= ~q_free~0 1)) .cse17 .cse18 .cse19 (not (= ~c_last_read~0 ~p_last_write~0)) .cse20) (or .cse22 (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse23 .cse17 .cse18 .cse19 .cse20) (or .cse22 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 (and (= ~c_dr_st~0 2) (or .cse0 .cse21)) .cse16 .cse23 .cse17 .cse18 .cse19 .cse20))) [2021-11-13 17:32:23,669 INFO L858 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2021-11-13 17:32:23,669 INFO L858 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 84 108) no Hoare annotation was computed. [2021-11-13 17:32:23,669 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2021-11-13 17:32:23,669 INFO L858 garLoopResultBuilder]: For program point L100(lines 100 104) no Hoare annotation was computed. [2021-11-13 17:32:23,669 INFO L858 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2021-11-13 17:32:23,670 INFO L858 garLoopResultBuilder]: For program point L100-2(lines 84 108) no Hoare annotation was computed. [2021-11-13 17:32:23,670 INFO L854 garLoopResultBuilder]: At program point L61(lines 49 63) the Hoare annotation is: (let ((.cse7 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse9 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse3 (not (= ~p_dw_pc~0 0))) (.cse8 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse10 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse17 (not (= 2 |old(~c_dr_st~0)|))) (.cse6 (not (= ~q_free~0 0))) (.cse18 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse0 (= ~E_1~0 1)) (.cse19 (and .cse7 .cse9)) (.cse1 (not (= ~m_pc~0 0))) (.cse2 (not (= ~T1_E~0 2))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (= ~t1_pc~0 0))) (.cse11 (not (= ~m_st~0 0))) (.cse12 (not (= ~t1_st~0 0))) (.cse13 (= ~E_1~0 0)) (.cse14 (= ~M_E~0 0)) (.cse15 (= ~M_E~0 1)) (.cse16 (= ~E_M~0 1))) (and (or (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_num_read~0 0)) .cse6 (and .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse8 .cse10) .cse5 .cse6 .cse11 .cse12 .cse18 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse19 .cse1 .cse2 .cse4 .cse5 .cse6 .cse11 .cse12 .cse18 .cse13 .cse14 .cse15 .cse16) (or (not (<= 2 |old(~p_dw_st~0)|)) .cse0 .cse19 .cse1 .cse2 .cse4 .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse11 .cse12 (not (= ~q_free~0 1)) .cse13 .cse14 .cse15 (not (= ~c_last_read~0 ~p_last_write~0)) .cse16)))) [2021-11-13 17:32:23,670 INFO L858 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2021-11-13 17:32:23,670 INFO L858 garLoopResultBuilder]: For program point L92-2(lines 92 96) no Hoare annotation was computed. [2021-11-13 17:32:23,670 INFO L858 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2021-11-13 17:32:23,670 INFO L854 garLoopResultBuilder]: At program point L80(lines 68 82) the Hoare annotation is: (let ((.cse3 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse1 (<= |immediate_notify_threads_~tmp~0#1| 0)) (.cse2 (<= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0)) (.cse4 (<= |immediate_notify_threads_is_do_write_p_triggered_#res#1| 0)) (.cse5 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_#res#1|)) (.cse6 (< 0 (+ |immediate_notify_threads_~tmp~0#1| 1))) (.cse7 (<= 0 |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|)) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse22 (not (= 2 |old(~c_dr_st~0)|))) (.cse8 (= ~E_1~0 1)) (.cse9 (not (= ~m_pc~0 0))) (.cse10 (not (= ~T1_E~0 2))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~t1_pc~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse15 (not (= ~m_st~0 0))) (.cse0 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse21 (= ~p_dw_st~0 0)) (.cse16 (not (= ~t1_st~0 0))) (.cse23 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse17 (= ~E_1~0 0)) (.cse18 (= ~M_E~0 0)) (.cse19 (= ~M_E~0 1)) (.cse20 (= ~E_M~0 1))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= ~p_num_write~0 1)) (not (= ~c_dr_pc~0 0)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ~c_num_read~0 0)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or (not (<= 2 |old(~p_dw_st~0)|)) .cse8 .cse9 .cse10 .cse12 .cse13 (not (= ~c_num_read~0 ~p_num_write~0)) .cse21 (and .cse0 .cse1 .cse3 .cse6) .cse15 .cse16 (not (= ~q_free~0 1)) .cse17 .cse18 .cse19 (not (= ~c_last_read~0 ~p_last_write~0)) .cse20) (or .cse22 (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse23 .cse17 .cse18 .cse19 .cse20) (or .cse22 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 (and (= ~c_dr_st~0 2) (or .cse0 .cse21)) .cse16 .cse23 .cse17 .cse18 .cse19 .cse20))) [2021-11-13 17:32:23,670 INFO L858 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2021-11-13 17:32:23,671 INFO L858 garLoopResultBuilder]: For program point L639-1(lines 628 651) no Hoare annotation was computed. [2021-11-13 17:32:23,671 INFO L858 garLoopResultBuilder]: For program point L634-1(lines 628 651) no Hoare annotation was computed. [2021-11-13 17:32:23,671 INFO L858 garLoopResultBuilder]: For program point L629-1(lines 628 651) no Hoare annotation was computed. [2021-11-13 17:32:23,671 INFO L854 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 625 652) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (and (= ~M_E~0 |old(~M_E~0)|) (= ~T1_E~0 2) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse19 (not (<= 2 ~t1_st~0))) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse3 (not (= ~m_i~0 1))) (.cse13 (= ~m_st~0 0)) (.cse4 (not (= |old(~T1_E~0)| 2))) (.cse20 (not (= ~t1_pc~0 1))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse10 (not (= ~q_free~0 0))) (.cse11 (not (<= 2 |old(~E_M~0)|))) (.cse12 (= |old(~M_E~0)| 1)) (.cse14 (= |old(~E_1~0)| 1)) (.cse15 (= |old(~M_E~0)| 0)) (.cse16 (= |old(~E_1~0)| 0)) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse18 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~m_pc~0 0)) .cse5 .cse6 .cse7 .cse8 (not (= ~t1_pc~0 0)) .cse9 .cse10 .cse11 .cse12 (not .cse13) .cse14 .cse15 (not (= ~t1_st~0 0)) .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse19 .cse2 .cse3 .cse13 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (< ~local~0 ~token~0)) .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse19 .cse2 .cse3 .cse13 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-13 17:32:23,671 INFO L858 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 625 652) no Hoare annotation was computed. [2021-11-13 17:32:23,672 INFO L858 garLoopResultBuilder]: For program point L644-1(lines 625 652) no Hoare annotation was computed. [2021-11-13 17:32:23,672 INFO L854 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 681 705) the Hoare annotation is: (let ((.cse27 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse25 (not (< ~local~0 ~token~0))) (.cse26 (not (<= ~token~0 (+ ~local~0 1)))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse2 (and .cse27 (= ~t1_st~0 0))) (.cse6 (not (= ~m_pc~0 0))) (.cse12 (not (= ~t1_pc~0 0))) (.cse18 (= ~M_E~0 1)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse4 (= |old(~m_st~0)| 0)) (.cse21 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (= ~m_i~0 1))) (.cse22 (and (= |old(~t1_st~0)| ~t1_st~0) .cse27)) (.cse24 (= ~E_1~0 1)) (.cse23 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~T1_E~0 2))) (.cse10 (not (= ~p_dw_pc~0 0))) (.cse11 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~c_num_read~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse15 (not (<= 2 ~E_M~0))) (.cse16 (= ~E_1~0 0)) (.cse17 (= ~M_E~0 0)) (.cse19 (not (= ~c_last_read~0 ~p_last_write~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 .cse1 .cse3 .cse4 .cse21 .cse5 .cse22 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse1 .cse3 .cse4 .cse21 .cse5 .cse22 .cse24 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17 .cse19 .cse26) (or .cse1 .cse3 .cse4 .cse5 .cse22 .cse24 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse25 (not (< 0 ~E_M~0)) .cse16 .cse17 .cse18 .cse19 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse1 .cse3 .cse4 .cse21 .cse5 .cse22 .cse24 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20)))) [2021-11-13 17:32:23,672 INFO L854 garLoopResultBuilder]: At program point L506(lines 490 508) the Hoare annotation is: (let ((.cse27 (= |old(~t1_st~0)| ~t1_st~0)) (.cse29 (<= |activate_threads2_is_master_triggered_#res#1| 0)) (.cse30 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse28 (= ~m_st~0 |old(~m_st~0)|)) (.cse31 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0)) (.cse32 (<= 0 |activate_threads2_is_master_triggered_#res#1|))) (let ((.cse25 (not (< ~local~0 ~token~0))) (.cse26 (not (<= ~token~0 (+ ~local~0 1)))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse5 (not (= ~m_pc~0 0))) (.cse11 (not (= ~t1_pc~0 0))) (.cse15 (and .cse29 .cse30 .cse28 (= ~t1_st~0 0) .cse31 .cse32)) (.cse18 (= ~M_E~0 1)) (.cse21 (and .cse29 .cse27 .cse30 .cse28 .cse31 .cse32)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse22 (= |old(~m_st~0)| 0)) (.cse23 (not (<= 2 |old(~t1_st~0)|))) (.cse3 (not (= ~m_i~0 1))) (.cse4 (= ~E_1~0 1)) (.cse24 (not (= ~t1_pc~0 1))) (.cse6 (not (= ~p_num_write~0 0))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~T1_E~0 2))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse12 (not (= ~c_num_read~0 0))) (.cse13 (not (= ~q_free~0 0))) (.cse14 (not (<= 2 ~E_M~0))) (.cse16 (= ~E_1~0 0)) (.cse17 (= ~M_E~0 0)) (.cse19 (not (= ~c_last_read~0 ~p_last_write~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 .cse1 .cse2 .cse22 .cse23 .cse3 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse1 .cse2 .cse22 .cse23 .cse3 .cse4 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse25 .cse16 .cse17 .cse19 .cse26) (or .cse21 .cse1 .cse2 .cse22 .cse3 .cse4 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse25 (and .cse27 .cse28 (= ~E_M~0 1)) (not (< 0 ~E_M~0)) .cse16 .cse17 .cse18 .cse19 .cse26) (or .cse0 .cse1 .cse2 .cse22 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse1 .cse2 .cse22 .cse23 .cse3 .cse4 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse19 .cse20)))) [2021-11-13 17:32:23,673 INFO L858 garLoopResultBuilder]: For program point L494(lines 494 503) no Hoare annotation was computed. [2021-11-13 17:32:23,673 INFO L854 garLoopResultBuilder]: At program point L525(lines 509 527) the Hoare annotation is: (let ((.cse16 (= ~M_E~0 0))) (let ((.cse34 (= ~c_last_read~0 ~p_last_write~0)) (.cse32 (= ~q_free~0 0)) (.cse29 (= ~p_dw_pc~0 0)) (.cse31 (= ~t1_i~0 1)) (.cse30 (= ~p_num_write~0 0)) (.cse35 (<= 1 ~t1_pc~0)) (.cse27 (= |old(~t1_st~0)| ~t1_st~0)) (.cse36 (= ~T1_E~0 2)) (.cse28 (= ~m_st~0 |old(~m_st~0)|)) (.cse37 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse38 (= ~m_i~0 1)) (.cse39 (not .cse16)) (.cse40 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse42 (= ~c_dr_pc~0 0)) (.cse43 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse44 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|))) (let ((.cse22 (not (<= 2 |old(~t1_st~0)|))) (.cse23 (and .cse35 .cse27 .cse36 .cse28 .cse37 .cse38 .cse39 .cse40 .cse42 .cse43 .cse44)) (.cse4 (= ~E_1~0 1)) (.cse24 (not (= ~t1_pc~0 1))) (.cse25 (not (< ~local~0 ~token~0))) (.cse26 (not (<= ~token~0 (+ ~local~0 1)))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not .cse42)) (.cse21 (= |old(~m_st~0)| 0)) (.cse3 (not .cse38)) (.cse5 (not (= ~m_pc~0 0))) (.cse6 (not .cse30)) (.cse7 (not .cse31)) (.cse8 (not .cse36)) (.cse9 (not .cse29)) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= ~t1_pc~0 0))) (.cse12 (not (= ~c_num_read~0 0))) (.cse13 (not .cse32)) (.cse14 (not (<= 2 ~E_M~0))) (.cse15 (= ~E_1~0 0)) (.cse17 (= ~M_E~0 1)) (.cse18 (not .cse34)) (.cse19 (and .cse36 .cse28 .cse37 (= ~t1_st~0 0) .cse38 .cse39 .cse40 .cse42 .cse43 .cse44)) (.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 .cse1 .cse2 .cse21 .cse22 .cse3 .cse4 .cse23 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse18 .cse26) (or .cse1 .cse2 .cse21 .cse22 .cse3 (and .cse27 .cse28) .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20) (or .cse1 .cse2 .cse21 .cse22 .cse3 .cse4 .cse23 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse20) (let ((.cse33 (let ((.cse41 (not .cse17))) (or (and .cse35 .cse36 .cse28 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44) (and .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 (= ~E_M~0 1)))))) (or .cse1 (and .cse29 .cse30 .cse31 .cse27 (= ~m_st~0 0) .cse32 .cse33 .cse34) .cse2 .cse21 .cse3 .cse4 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse25 (and .cse29 .cse30 .cse31 .cse27 .cse28 .cse32 .cse33 .cse34) (not (< 0 ~E_M~0)) .cse15 .cse16 .cse17 .cse18 .cse26)) (or .cse0 .cse1 .cse2 .cse21 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))))) [2021-11-13 17:32:23,673 INFO L858 garLoopResultBuilder]: For program point L494-2(lines 494 503) no Hoare annotation was computed. [2021-11-13 17:32:23,673 INFO L858 garLoopResultBuilder]: For program point L513(lines 513 522) no Hoare annotation was computed. [2021-11-13 17:32:23,674 INFO L858 garLoopResultBuilder]: For program point L513-2(lines 513 522) no Hoare annotation was computed. [2021-11-13 17:32:23,674 INFO L858 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 681 705) no Hoare annotation was computed. [2021-11-13 17:32:23,674 INFO L854 garLoopResultBuilder]: At program point L505(lines 493 507) the Hoare annotation is: (let ((.cse27 (= |old(~t1_st~0)| ~t1_st~0)) (.cse29 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse28 (= ~m_st~0 |old(~m_st~0)|)) (.cse30 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))) (let ((.cse21 (not (= |old(~t1_st~0)| 0))) (.cse22 (not (= ~m_pc~0 0))) (.cse23 (not (= ~t1_pc~0 0))) (.cse25 (and .cse29 .cse28 (= ~t1_st~0 0) .cse30)) (.cse16 (not (< ~local~0 ~token~0))) (.cse20 (not (<= ~token~0 (+ ~local~0 1)))) (.cse6 (= ~E_1~0 1)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (and .cse27 .cse29 .cse28 .cse30)) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse3 (= |old(~m_st~0)| 0)) (.cse4 (not (<= 2 |old(~t1_st~0)|))) (.cse5 (not (= ~m_i~0 1))) (.cse7 (not (= ~t1_pc~0 1))) (.cse8 (not (= ~p_num_write~0 0))) (.cse9 (not (= ~t1_i~0 1))) (.cse10 (not (= ~T1_E~0 2))) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~c_num_read~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse15 (not (<= 2 ~E_M~0))) (.cse17 (= ~E_1~0 0)) (.cse18 (= ~M_E~0 0)) (.cse24 (= ~M_E~0 1)) (.cse19 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse26 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse0 .cse2 .cse5 .cse6 .cse22 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse15 .cse17 .cse18 .cse24 .cse19 .cse25 .cse26) (or .cse21 .cse0 .cse2 .cse3 .cse5 .cse22 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse15 .cse17 .cse18 .cse24 .cse19 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 (and .cse27 .cse28 (= ~E_M~0 1)) (not (< 0 ~E_M~0)) .cse17 .cse18 .cse24 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse26) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse24 .cse19 .cse26)))) [2021-11-13 17:32:23,674 INFO L858 garLoopResultBuilder]: For program point L697(lines 697 701) no Hoare annotation was computed. [2021-11-13 17:32:23,675 INFO L858 garLoopResultBuilder]: For program point L697-2(lines 681 705) no Hoare annotation was computed. [2021-11-13 17:32:23,675 INFO L858 garLoopResultBuilder]: For program point L689(lines 689 693) no Hoare annotation was computed. [2021-11-13 17:32:23,675 INFO L858 garLoopResultBuilder]: For program point L495(lines 495 500) no Hoare annotation was computed. [2021-11-13 17:32:23,675 INFO L858 garLoopResultBuilder]: For program point L689-2(lines 689 693) no Hoare annotation was computed. [2021-11-13 17:32:23,676 INFO L854 garLoopResultBuilder]: At program point L524(lines 512 526) the Hoare annotation is: (let ((.cse17 (= ~M_E~0 0))) (let ((.cse35 (= ~c_last_read~0 ~p_last_write~0)) (.cse33 (= ~q_free~0 0)) (.cse31 (= ~c_num_read~0 0)) (.cse29 (= ~p_dw_pc~0 0)) (.cse32 (= ~t1_i~0 1)) (.cse30 (= ~p_num_write~0 0)) (.cse37 (<= 1 ~t1_pc~0)) (.cse22 (= |old(~t1_st~0)| ~t1_st~0)) (.cse38 (= ~T1_E~0 2)) (.cse23 (= ~m_st~0 |old(~m_st~0)|)) (.cse39 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse40 (= ~m_i~0 1)) (.cse41 (not .cse17)) (.cse42 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse44 (= ~c_dr_pc~0 0))) (let ((.cse27 (not (< ~local~0 ~token~0))) (.cse28 (not (<= ~token~0 (+ ~local~0 1)))) (.cse3 (= |old(~m_st~0)| 0)) (.cse21 (not (<= 2 |old(~t1_st~0)|))) (.cse24 (not (= ~t1_pc~0 1))) (.cse26 (and .cse37 .cse22 .cse38 .cse23 .cse39 .cse40 .cse41 .cse42 .cse44)) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not .cse44)) (.cse4 (not .cse40)) (.cse25 (= ~E_1~0 1)) (.cse5 (not (= ~m_pc~0 0))) (.cse6 (not .cse30)) (.cse7 (not .cse32)) (.cse8 (not .cse38)) (.cse9 (not .cse29)) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= ~t1_pc~0 0))) (.cse12 (not .cse31)) (.cse13 (not .cse33)) (.cse14 (not (<= 2 ~E_M~0))) (.cse15 (and .cse38 .cse23 .cse39 (= ~t1_st~0 0) .cse40 .cse41 .cse42 .cse44)) (.cse16 (= ~E_1~0 0)) (.cse18 (= ~M_E~0 1)) (.cse19 (not .cse35)) (.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 .cse1 .cse2 .cse3 .cse21 .cse4 (and .cse22 .cse23) .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse1 .cse2 .cse3 .cse21 .cse4 .cse25 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse26 .cse27 .cse16 .cse17 .cse19 .cse28) (let ((.cse34 (not .cse25)) (.cse36 (let ((.cse43 (not .cse18))) (or (and .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 (= ~E_M~0 1)) (and .cse37 .cse38 .cse23 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44))))) (or .cse1 .cse2 .cse3 (and .cse29 .cse30 .cse31 .cse32 .cse22 (= ~m_st~0 0) .cse33 .cse34 .cse35 .cse36) .cse4 .cse25 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse27 (and .cse29 .cse30 .cse31 .cse32 .cse22 .cse23 .cse33 .cse34 .cse35 .cse36) (not (< 0 ~E_M~0)) .cse16 .cse17 .cse18 .cse19 .cse28)) (or .cse1 .cse2 .cse3 .cse21 .cse4 .cse25 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse26 .cse16 .cse17 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))))) [2021-11-13 17:32:23,676 INFO L858 garLoopResultBuilder]: For program point L514(lines 514 519) no Hoare annotation was computed. [2021-11-13 17:32:23,676 INFO L858 garLoopResultBuilder]: For program point update_channels2EXIT(lines 528 535) no Hoare annotation was computed. [2021-11-13 17:32:23,676 INFO L861 garLoopResultBuilder]: At program point update_channels2FINAL(lines 528 535) the Hoare annotation is: true [2021-11-13 17:32:23,676 INFO L854 garLoopResultBuilder]: At program point L812(line 812) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (not (= ~E_1~0 0))) (.cse16 (not (= ~M_E~0 1))) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~token~0 ~local~0)))) [2021-11-13 17:32:23,677 INFO L854 garLoopResultBuilder]: At program point L779(lines 768 781) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (not (= ~E_1~0 0))) (.cse16 (not (= ~M_E~0 1))) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~token~0 ~local~0)))) [2021-11-13 17:32:23,677 INFO L854 garLoopResultBuilder]: At program point L581(line 581) the Hoare annotation is: (let ((.cse21 (= ~m_st~0 0))) (let ((.cse22 (= ~m_pc~0 0)) (.cse20 (= ~t1_pc~0 0)) (.cse9 (= ~t1_st~0 0)) (.cse24 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse0 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~t1_st~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ~T1_E~0 2)) (.cse8 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (not .cse21)) (.cse14 (not (= ~E_1~0 1))) (.cse15 (not (= ~E_1~0 0))) (.cse16 (not (= ~M_E~0 1))) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= ~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 .cse1 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse22 .cse18 .cse19) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse10 .cse24 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse22 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 (+ ~local~0 1)) .cse8 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2021-11-13 17:32:23,677 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-13 17:32:23,678 INFO L854 garLoopResultBuilder]: At program point L317(lines 306 319) the Hoare annotation is: (let ((.cse14 (= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 0)) (.cse16 (= ~p_dw_st~0 0)) (.cse17 (= ~p_dw_pc~0 0)) (.cse18 (= ~p_num_write~0 0)) (.cse19 (= ~c_num_read~0 0)) (.cse1 (= ~t1_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (= ~m_st~0 0)) (.cse15 (= ~q_free~0 1)) (.cse6 (= ~t1_st~0 0)) (.cse7 (not (= ~M_E~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse10 (not (= ~M_E~0 1))) (.cse20 (= ~c_dr_pc~0 0)) (.cse11 (= ~m_pc~0 0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= 2 ~p_dw_st~0)) (.cse13 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse1 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse17 .cse18 .cse19 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse21 .cse13) (and .cse17 .cse18 .cse19 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse21 .cse12 .cse13))) [2021-11-13 17:32:23,678 INFO L858 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2021-11-13 17:32:23,678 INFO L858 garLoopResultBuilder]: For program point L730(lines 730 734) no Hoare annotation was computed. [2021-11-13 17:32:23,678 INFO L858 garLoopResultBuilder]: For program point L730-2(lines 729 752) no Hoare annotation was computed. [2021-11-13 17:32:23,678 INFO L854 garLoopResultBuilder]: At program point L780(lines 764 782) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (not (= ~E_1~0 0))) (.cse16 (not (= ~M_E~0 1))) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~token~0 ~local~0)))) [2021-11-13 17:32:23,679 INFO L858 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2021-11-13 17:32:23,679 INFO L854 garLoopResultBuilder]: At program point L483(lines 454 489) the Hoare annotation is: (let ((.cse12 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~T1_E~0 2)) (.cse10 (= ~q_free~0 0)) (.cse11 (= ~m_i~0 1)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (not (= ~M_E~0 0))) (.cse15 (not (= ~E_1~0 1))) (.cse16 (not (= ~E_1~0 0))) (.cse17 (not (= ~M_E~0 1))) (.cse18 (= ~c_dr_pc~0 0)) (.cse19 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~m_pc~0 0) .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 (not .cse9) .cse15 .cse16 .cse17 .cse18 .cse19 (= ~token~0 ~local~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 (+ ~local~0 1)) .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (< ~local~0 ~token~0)))) [2021-11-13 17:32:23,679 INFO L858 garLoopResultBuilder]: For program point L417(lines 417 421) no Hoare annotation was computed. [2021-11-13 17:32:23,679 INFO L854 garLoopResultBuilder]: At program point L318(lines 302 320) the Hoare annotation is: (let ((.cse14 (= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 0)) (.cse16 (= ~p_dw_st~0 0)) (.cse17 (= ~p_dw_pc~0 0)) (.cse18 (= ~p_num_write~0 0)) (.cse19 (= ~c_num_read~0 0)) (.cse1 (= ~t1_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (= ~m_st~0 0)) (.cse15 (= ~q_free~0 1)) (.cse6 (= ~t1_st~0 0)) (.cse7 (not (= ~M_E~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse10 (not (= ~M_E~0 1))) (.cse20 (= ~c_dr_pc~0 0)) (.cse11 (= ~m_pc~0 0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= 2 ~p_dw_st~0)) (.cse13 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse1 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse17 .cse18 .cse19 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse21 .cse13) (and .cse17 .cse18 .cse19 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse21 .cse12 .cse13))) [2021-11-13 17:32:23,680 INFO L858 garLoopResultBuilder]: For program point L830(lines 830 834) no Hoare annotation was computed. [2021-11-13 17:32:23,680 INFO L854 garLoopResultBuilder]: At program point L219-1(lines 210 227) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_pc~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~T1_E~0 2)) (.cse6 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse9 (not (= ~M_E~0 0))) (.cse10 (not (= ~E_1~0 1))) (.cse11 (not (= ~E_1~0 0))) (.cse12 (not (= ~M_E~0 1))) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~p_dw_st~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 2 ~p_dw_st~0) .cse16))) [2021-11-13 17:32:23,680 INFO L858 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2021-11-13 17:32:23,680 INFO L858 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2021-11-13 17:32:23,680 INFO L858 garLoopResultBuilder]: For program point L583(line 583) no Hoare annotation was computed. [2021-11-13 17:32:23,681 INFO L854 garLoopResultBuilder]: At program point L418(lines 413 452) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~T1_E~0 2) (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) (= ~m_i~0 1) (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|) (= ~p_dw_st~0 0) (not (= ~M_E~0 0)) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (not (= ~M_E~0 1)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (< ~local~0 ~token~0)) [2021-11-13 17:32:23,681 INFO L854 garLoopResultBuilder]: At program point L798-1(lines 795 835) the Hoare annotation is: (let ((.cse7 (= ~m_st~0 0))) (let ((.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~t1_st~0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~T1_E~0 2)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~m_i~0 1)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (not (= ~M_E~0 0))) (.cse20 (not .cse7)) (.cse12 (not (= ~E_1~0 1))) (.cse13 (not (= ~E_1~0 0))) (.cse14 (not (= ~M_E~0 1))) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 (= ~t1_pc~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~t1_st~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~m_pc~0 0) .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 (+ ~local~0 1)) .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 (< ~local~0 ~token~0)) (and .cse18 .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)))) [2021-11-13 17:32:23,681 INFO L854 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: (and (= ~c_num_read~0 ~p_num_write~0) (= ~t1_pc~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (= ~t1_st~0 0) (not (= ~M_E~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (not (= ~M_E~0 1)) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= 2 ~p_dw_st~0) (not (= ~E_M~0 1))) [2021-11-13 17:32:23,681 INFO L858 garLoopResultBuilder]: For program point L187-1(line 187) no Hoare annotation was computed. [2021-11-13 17:32:23,682 INFO L858 garLoopResultBuilder]: For program point L815(line 815) no Hoare annotation was computed. [2021-11-13 17:32:23,682 INFO L854 garLoopResultBuilder]: At program point L204(lines 153 209) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ~c_dr_st~0 2)) (.cse2 (= ~t1_pc~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~T1_E~0 2)) (.cse5 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse7 (= ~t1_st~0 0)) (.cse8 (not (= ~M_E~0 0))) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~E_1~0 0))) (.cse11 (not (= ~M_E~0 1))) (.cse12 (= ~m_pc~0 0)) (.cse13 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= 2 ~p_dw_st~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~p_dw_st~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-11-13 17:32:23,682 INFO L858 garLoopResultBuilder]: For program point L799(line 799) no Hoare annotation was computed. [2021-11-13 17:32:23,682 INFO L854 garLoopResultBuilder]: At program point L469-1(lines 457 488) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse6 (= ~m_st~0 0)) (.cse9 (not (= ~E_1~0 1))) (.cse10 (not (= ~M_E~0 1))) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (let ((.cse13 (= ~T1_E~0 2)) (.cse14 (= ~m_i~0 1)) (.cse15 (= ~p_dw_st~0 0)) (.cse16 (not (= ~M_E~0 0))) (.cse17 (not (= ~E_1~0 0))) (.cse18 (= ~c_dr_pc~0 0))) (or (and (= ~t1_pc~0 0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and (<= 1 ~t1_pc~0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse9 .cse10 .cse11 (< ~local~0 ~token~0) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (not .cse6) .cse9 .cse10 .cse11 (= ~token~0 ~local~0) .cse12))) [2021-11-13 17:32:23,683 INFO L858 garLoopResultBuilder]: For program point L585(lines 585 589) no Hoare annotation was computed. [2021-11-13 17:32:23,683 INFO L858 garLoopResultBuilder]: For program point L585-1(lines 580 618) no Hoare annotation was computed. [2021-11-13 17:32:23,683 INFO L858 garLoopResultBuilder]: For program point L470(line 470) no Hoare annotation was computed. [2021-11-13 17:32:23,683 INFO L858 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2021-11-13 17:32:23,683 INFO L858 garLoopResultBuilder]: For program point L817(lines 817 826) no Hoare annotation was computed. [2021-11-13 17:32:23,683 INFO L858 garLoopResultBuilder]: For program point L817-2(lines 817 826) no Hoare annotation was computed. [2021-11-13 17:32:23,684 INFO L854 garLoopResultBuilder]: At program point L619(lines 574 624) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (not (= ~E_1~0 0))) (.cse16 (not (= ~M_E~0 1))) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~token~0 ~local~0)))) [2021-11-13 17:32:23,684 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-13 17:32:23,684 INFO L854 garLoopResultBuilder]: At program point L256(line 256) the Hoare annotation is: (let ((.cse14 (= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 0)) (.cse16 (= ~p_dw_st~0 0)) (.cse17 (= ~p_dw_pc~0 0)) (.cse18 (= ~p_num_write~0 0)) (.cse19 (= ~c_num_read~0 0)) (.cse1 (= ~t1_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (= ~m_st~0 0)) (.cse15 (= ~q_free~0 1)) (.cse6 (= ~t1_st~0 0)) (.cse7 (not (= ~M_E~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse10 (not (= ~M_E~0 1))) (.cse20 (= ~c_dr_pc~0 0)) (.cse11 (= ~m_pc~0 0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= 2 ~p_dw_st~0)) (.cse13 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse1 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse17 .cse18 .cse19 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse21 .cse13) (and .cse17 .cse18 .cse19 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse21 .cse12 .cse13))) [2021-11-13 17:32:23,684 INFO L858 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2021-11-13 17:32:23,685 INFO L858 garLoopResultBuilder]: For program point L735-1(lines 729 752) no Hoare annotation was computed. [2021-11-13 17:32:23,685 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2021-11-13 17:32:23,685 INFO L854 garLoopResultBuilder]: At program point L851(lines 842 853) the Hoare annotation is: (= ~p_dw_st~0 0) [2021-11-13 17:32:23,685 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2021-11-13 17:32:23,685 INFO L854 garLoopResultBuilder]: At program point L125-1(lines 113 150) the Hoare annotation is: (let ((.cse13 (= ~q_free~0 0)) (.cse12 (= ~c_dr_st~0 2)) (.cse0 (= ~t1_pc~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 1)) (.cse5 (= ~t1_st~0 0)) (.cse6 (not (= ~M_E~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (not (= ~M_E~0 1))) (.cse10 (= ~m_pc~0 0)) (.cse11 (not (= ~E_M~0 1)))) (or (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~c_dr_pc~0 0) .cse10 (= ~c_last_read~0 ~p_last_write~0) .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (= ~c_num_read~0 ~p_num_write~0) .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) [2021-11-13 17:32:23,686 INFO L854 garLoopResultBuilder]: At program point L604(lines 580 618) the Hoare annotation is: (let ((.cse21 (= ~m_st~0 0))) (let ((.cse22 (= ~m_pc~0 0)) (.cse20 (= ~t1_pc~0 0)) (.cse9 (= ~t1_st~0 0)) (.cse24 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse0 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~t1_st~0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ~T1_E~0 2)) (.cse8 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (not .cse21)) (.cse14 (not (= ~E_1~0 1))) (.cse15 (not (= ~E_1~0 0))) (.cse16 (not (= ~M_E~0 1))) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= ~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 .cse1 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse22 .cse18 .cse19) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse21 .cse8 .cse10 .cse24 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse22 .cse18) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 (+ ~local~0 1)) .cse8 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~local~0 ~token~0)) (and .cse1 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) [2021-11-13 17:32:23,686 INFO L854 garLoopResultBuilder]: At program point L439-1(lines 413 452) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~T1_E~0 2)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~m_i~0 1)) (.cse9 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (not (= ~M_E~0 0))) (.cse12 (not (= ~m_st~0 0))) (.cse13 (not (= ~E_1~0 1))) (.cse14 (not (= ~E_1~0 0))) (.cse15 (not (= ~M_E~0 1))) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 (= ~t1_pc~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 (= ~t1_st~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~m_pc~0 0) .cse17 (= ~token~0 ~local~0)) (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-11-13 17:32:23,686 INFO L854 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (not (= ~M_E~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (not (= ~M_E~0 1))) (.cse10 (= ~m_pc~0 0)) (.cse11 (not (= ~E_M~0 1)))) (or (and (= ~c_dr_st~0 2) .cse0 .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (= ~p_dw_pc~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~c_dr_pc~0 0) .cse10 (= ~p_num_write~0 1) .cse11))) [2021-11-13 17:32:23,686 INFO L858 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2021-11-13 17:32:23,687 INFO L858 garLoopResultBuilder]: For program point L390(line 390) no Hoare annotation was computed. [2021-11-13 17:32:23,687 INFO L854 garLoopResultBuilder]: At program point L836(lines 783 841) the Hoare annotation is: (= ~p_dw_st~0 0) [2021-11-13 17:32:23,687 INFO L858 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2021-11-13 17:32:23,687 INFO L854 garLoopResultBuilder]: At program point L770(line 770) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (not (= ~E_1~0 0))) (.cse16 (not (= ~M_E~0 1))) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~token~0 ~local~0)))) [2021-11-13 17:32:23,687 INFO L858 garLoopResultBuilder]: For program point L770-1(line 770) no Hoare annotation was computed. [2021-11-13 17:32:23,687 INFO L858 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2021-11-13 17:32:23,688 INFO L854 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: (let ((.cse14 (= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 0)) (.cse16 (= ~p_dw_st~0 0)) (.cse17 (= ~p_dw_pc~0 0)) (.cse18 (= ~p_num_write~0 0)) (.cse19 (= ~c_num_read~0 0)) (.cse1 (= ~t1_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (= ~m_st~0 0)) (.cse15 (= ~q_free~0 1)) (.cse6 (= ~t1_st~0 0)) (.cse7 (not (= ~M_E~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse10 (not (= ~M_E~0 1))) (.cse20 (= ~c_dr_pc~0 0)) (.cse11 (= ~m_pc~0 0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= 2 ~p_dw_st~0)) (.cse13 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse1 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse17 .cse18 .cse19 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse21 .cse13) (and .cse17 .cse18 .cse19 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse21 .cse12 .cse13))) [2021-11-13 17:32:23,688 INFO L858 garLoopResultBuilder]: For program point L308-1(line 308) no Hoare annotation was computed. [2021-11-13 17:32:23,688 INFO L854 garLoopResultBuilder]: At program point L391(lines 386 393) the Hoare annotation is: false [2021-11-13 17:32:23,688 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 164) no Hoare annotation was computed. [2021-11-13 17:32:23,689 INFO L854 garLoopResultBuilder]: At program point L127(lines 113 150) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (= ~m_st~0 0)) (.cse4 (= ~t1_st~0 0)) (.cse5 (not (= ~M_E~0 0))) (.cse6 (not (= ~E_1~0 1))) (.cse7 (not (= ~E_1~0 0))) (.cse8 (not (= ~M_E~0 1))) (.cse9 (= ~m_pc~0 0)) (.cse10 (not (= ~E_M~0 1)))) (or (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~c_dr_pc~0 0) .cse9 .cse10) (and (= ~c_num_read~0 ~p_num_write~0) (= ~c_dr_st~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2021-11-13 17:32:23,689 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-13 17:32:23,689 INFO L858 garLoopResultBuilder]: For program point L540(lines 540 544) no Hoare annotation was computed. [2021-11-13 17:32:23,689 INFO L858 garLoopResultBuilder]: For program point L540-2(lines 539 552) no Hoare annotation was computed. [2021-11-13 17:32:23,689 INFO L858 garLoopResultBuilder]: For program point L854(lines 854 860) no Hoare annotation was computed. [2021-11-13 17:32:23,689 INFO L854 garLoopResultBuilder]: At program point L821(line 821) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (not (= ~E_1~0 0))) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~token~0 ~local~0)))) [2021-11-13 17:32:23,690 INFO L858 garLoopResultBuilder]: For program point L821-1(line 821) no Hoare annotation was computed. [2021-11-13 17:32:23,690 INFO L858 garLoopResultBuilder]: For program point L590(lines 580 618) no Hoare annotation was computed. [2021-11-13 17:32:23,690 INFO L858 garLoopResultBuilder]: For program point L458(lines 458 466) no Hoare annotation was computed. [2021-11-13 17:32:23,690 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2021-11-13 17:32:23,690 INFO L858 garLoopResultBuilder]: For program point L772(lines 772 777) no Hoare annotation was computed. [2021-11-13 17:32:23,690 INFO L858 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2021-11-13 17:32:23,691 INFO L854 garLoopResultBuilder]: At program point L161(lines 156 208) the Hoare annotation is: (and (= ~t1_pc~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (not (= ~M_E~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (not (= ~M_E~0 1)) (= ~m_pc~0 0) (<= 2 ~p_dw_st~0) (not (= ~E_M~0 1))) [2021-11-13 17:32:23,691 INFO L858 garLoopResultBuilder]: For program point L607(lines 607 614) no Hoare annotation was computed. [2021-11-13 17:32:23,691 INFO L861 garLoopResultBuilder]: At program point L376(lines 367 378) the Hoare annotation is: true [2021-11-13 17:32:23,691 INFO L858 garLoopResultBuilder]: For program point L310(lines 310 315) no Hoare annotation was computed. [2021-11-13 17:32:23,691 INFO L854 garLoopResultBuilder]: At program point L723(lines 717 725) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (not (= ~E_1~0 0))) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~token~0 ~local~0)))) [2021-11-13 17:32:23,692 INFO L858 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2021-11-13 17:32:23,692 INFO L854 garLoopResultBuilder]: At program point L806(line 806) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (not (= ~E_1~0 0))) (.cse16 (not (= ~M_E~0 1))) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~token~0 ~local~0)))) [2021-11-13 17:32:23,692 INFO L858 garLoopResultBuilder]: For program point L806-1(line 806) no Hoare annotation was computed. [2021-11-13 17:32:23,692 INFO L854 garLoopResultBuilder]: At program point L195(line 195) the Hoare annotation is: false [2021-11-13 17:32:23,692 INFO L858 garLoopResultBuilder]: For program point L740-1(lines 729 752) no Hoare annotation was computed. [2021-11-13 17:32:23,692 INFO L858 garLoopResultBuilder]: For program point L856(lines 856 859) no Hoare annotation was computed. [2021-11-13 17:32:23,693 INFO L861 garLoopResultBuilder]: At program point L344(lines 321 349) the Hoare annotation is: true [2021-11-13 17:32:23,693 INFO L854 garLoopResultBuilder]: At program point L146(lines 109 151) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~T1_E~0 2)) (.cse3 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse5 (= ~t1_st~0 0)) (.cse6 (not (= ~M_E~0 0))) (.cse7 (not (= ~E_1~0 1))) (.cse8 (not (= ~E_1~0 0))) (.cse9 (not (= ~M_E~0 1))) (.cse10 (= ~m_pc~0 0)) (.cse11 (<= 2 ~p_dw_st~0)) (.cse12 (not (= ~E_M~0 1)))) (or (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2021-11-13 17:32:23,693 INFO L854 garLoopResultBuilder]: At program point L791(line 791) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~M_E~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (not (= ~M_E~0 1)) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~token~0 ~local~0)) [2021-11-13 17:32:23,693 INFO L858 garLoopResultBuilder]: For program point L791-1(line 791) no Hoare annotation was computed. [2021-11-13 17:32:23,693 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2021-11-13 17:32:23,694 INFO L858 garLoopResultBuilder]: For program point L593(lines 593 600) no Hoare annotation was computed. [2021-11-13 17:32:23,694 INFO L858 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2021-11-13 17:32:23,694 INFO L854 garLoopResultBuilder]: At program point L296(lines 248 301) the Hoare annotation is: (let ((.cse14 (= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 0)) (.cse16 (= ~p_dw_st~0 0)) (.cse17 (= ~p_dw_pc~0 0)) (.cse18 (= ~p_num_write~0 0)) (.cse19 (= ~c_num_read~0 0)) (.cse1 (= ~t1_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (= ~m_st~0 0)) (.cse15 (= ~q_free~0 1)) (.cse6 (= ~t1_st~0 0)) (.cse7 (not (= ~M_E~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse10 (not (= ~M_E~0 1))) (.cse20 (= ~c_dr_pc~0 0)) (.cse11 (= ~m_pc~0 0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= 2 ~p_dw_st~0)) (.cse13 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse1 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse17 .cse18 .cse19 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse21 .cse13) (and .cse17 .cse18 .cse19 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse21 .cse12 .cse13))) [2021-11-13 17:32:23,694 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-13 17:32:23,695 INFO L854 garLoopResultBuilder]: At program point L280(lines 255 295) the Hoare annotation is: (let ((.cse14 (= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 0)) (.cse16 (= ~p_dw_st~0 0)) (.cse17 (= ~p_dw_pc~0 0)) (.cse18 (= ~p_num_write~0 0)) (.cse19 (= ~c_num_read~0 0)) (.cse1 (= ~t1_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (= ~m_st~0 0)) (.cse15 (= ~q_free~0 1)) (.cse6 (= ~t1_st~0 0)) (.cse7 (not (= ~M_E~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse10 (not (= ~M_E~0 1))) (.cse20 (= ~c_dr_pc~0 0)) (.cse11 (= ~m_pc~0 0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= 2 ~p_dw_st~0)) (.cse13 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse1 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse17 .cse18 .cse19 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse21 .cse13) (and .cse17 .cse18 .cse19 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse21 .cse12 .cse13))) [2021-11-13 17:32:23,695 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2021-11-13 17:32:23,695 INFO L858 garLoopResultBuilder]: For program point L214(lines 214 218) no Hoare annotation was computed. [2021-11-13 17:32:23,695 INFO L858 garLoopResultBuilder]: For program point L214-2(lines 213 226) no Hoare annotation was computed. [2021-11-13 17:32:23,695 INFO L854 garLoopResultBuilder]: At program point L462(lines 457 488) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~T1_E~0 2) (= ~q_free~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~M_E~0 0)) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (not (= ~M_E~0 1)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~token~0 ~local~0)) [2021-11-13 17:32:23,696 INFO L854 garLoopResultBuilder]: At program point L545-1(lines 536 553) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~M_E~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (not (= ~M_E~0 1)) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~token~0 ~local~0)) [2021-11-13 17:32:23,696 INFO L854 garLoopResultBuilder]: At program point L479(line 479) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) (= ~m_i~0 1) (< 0 ~E_M~0) (= ~p_dw_st~0 0) (not (= ~M_E~0 0)) (not (= ~m_st~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (not (= ~M_E~0 1)) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (< ~local~0 ~token~0)) [2021-11-13 17:32:23,696 INFO L858 garLoopResultBuilder]: For program point L479-1(line 479) no Hoare annotation was computed. [2021-11-13 17:32:23,696 INFO L854 garLoopResultBuilder]: At program point L793(line 793) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~M_E~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (not (= ~M_E~0 1)) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~token~0 ~local~0)) [2021-11-13 17:32:23,697 INFO L854 garLoopResultBuilder]: At program point L793-1(line 793) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~M_E~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (not (= ~M_E~0 1)) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~token~0 ~local~0)) [2021-11-13 17:32:23,697 INFO L854 garLoopResultBuilder]: At program point L364(lines 350 366) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (= ~t1_st~0 0) (= ~p_dw_st~0 0) (not (= ~M_E~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (not (= ~M_E~0 1)) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~E_M~0 1))) [2021-11-13 17:32:23,697 INFO L854 garLoopResultBuilder]: At program point L810(line 810) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (not (= ~E_1~0 0))) (.cse16 (not (= ~M_E~0 1))) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~token~0 ~local~0)))) [2021-11-13 17:32:23,697 INFO L858 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2021-11-13 17:32:23,698 INFO L854 garLoopResultBuilder]: At program point L331-2(lines 331 343) the Hoare annotation is: (let ((.cse14 (= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 0)) (.cse16 (= ~p_dw_st~0 0)) (.cse17 (= ~p_dw_pc~0 0)) (.cse18 (= ~p_num_write~0 0)) (.cse19 (= ~c_num_read~0 0)) (.cse1 (= ~t1_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (= ~m_st~0 0)) (.cse15 (= ~q_free~0 1)) (.cse6 (= ~t1_st~0 0)) (.cse7 (not (= ~M_E~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse10 (not (= ~M_E~0 1))) (.cse20 (= ~c_dr_pc~0 0)) (.cse11 (= ~m_pc~0 0)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= 2 ~p_dw_st~0)) (.cse13 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13) (and .cse1 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse17 .cse18 .cse19 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse21 .cse13) (and .cse17 .cse18 .cse19 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse21 .cse12 .cse13))) [2021-11-13 17:32:23,698 INFO L854 garLoopResultBuilder]: At program point L810-1(line 810) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (not (= ~E_1~0 0))) (.cse16 (not (= ~M_E~0 1))) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~token~0 ~local~0)))) [2021-11-13 17:32:23,698 INFO L854 garLoopResultBuilder]: At program point L447(lines 410 453) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (= ~T1_E~0 2)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~t1_st~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (not (= ~M_E~0 0))) (.cse14 (not (= ~m_st~0 0))) (.cse15 (not (= ~E_1~0 1))) (.cse16 (not (= ~E_1~0 0))) (.cse17 (not (= ~M_E~0 1))) (.cse18 (= ~c_dr_pc~0 0)) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (= ~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 .cse20) (and .cse0 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse3 (= ~t1_pc~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) [2021-11-13 17:32:23,698 INFO L858 garLoopResultBuilder]: For program point L414(lines 414 422) no Hoare annotation was computed. [2021-11-13 17:32:23,699 INFO L854 garLoopResultBuilder]: At program point L794(line 794) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~M_E~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (not (= ~M_E~0 1)) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~token~0 ~local~0)) [2021-11-13 17:32:23,699 INFO L854 garLoopResultBuilder]: At program point L761(lines 754 763) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (not (= ~M_E~0 0)) (not (= ~E_1~0 1)) (not (= ~E_1~0 0)) (not (= ~M_E~0 1)) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~token~0 ~local~0)) [2021-11-13 17:32:23,699 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2021-11-13 17:32:23,699 INFO L854 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~T1_E~0 2)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~m_i~0 1)) (.cse9 (<= 1 |ULTIMATE.start_eval2_~tmp~4#1|)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (not (= ~M_E~0 0))) (.cse12 (not (= ~m_st~0 0))) (.cse13 (not (= ~E_1~0 0))) (.cse14 (not (= ~M_E~0 1))) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 (= ~t1_pc~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 (= ~t1_st~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~m_pc~0 0) .cse16 .cse17) (and (= ~t1_pc~0 1) (<= 2 ~t1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2021-11-13 17:32:23,699 INFO L858 garLoopResultBuilder]: For program point L431-1(line 431) no Hoare annotation was computed. [2021-11-13 17:32:23,699 INFO L858 garLoopResultBuilder]: For program point L332(line 332) no Hoare annotation was computed. [2021-11-13 17:32:23,700 INFO L854 garLoopResultBuilder]: At program point L811(line 811) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (not (= ~E_1~0 0))) (.cse16 (not (= ~M_E~0 1))) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~token~0 ~local~0)))) [2021-11-13 17:32:23,700 INFO L854 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2021-11-13 17:32:23,700 INFO L854 garLoopResultBuilder]: At program point L745-1(lines 726 753) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~t1_st~0)) (.cse2 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (= ~T1_E~0 2)) (.cse9 (= ~q_free~0 0)) (.cse10 (= ~m_i~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~M_E~0 0))) (.cse13 (not (= ~m_st~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (not (= ~E_1~0 0))) (.cse16 (not (= ~M_E~0 1))) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~token~0 (+ ~local~0 1)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~token~0 ~local~0)))) [2021-11-13 17:32:23,700 INFO L854 garLoopResultBuilder]: At program point L200-1(lines 156 208) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 ~p_num_write~0)) (.cse5 (= ~q_free~0 1)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse1 (= ~t1_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~T1_E~0 2)) (.cse4 (= ~m_st~0 0)) (.cse6 (= ~t1_st~0 0)) (.cse7 (not (= ~M_E~0 0))) (.cse8 (not (= ~E_1~0 1))) (.cse9 (not (= ~E_1~0 0))) (.cse10 (not (= ~M_E~0 1))) (.cse11 (= ~m_pc~0 0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse14 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~p_dw_st~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse1 .cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse3 .cse4 (= ~q_free~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14))) [2021-11-13 17:32:23,701 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 228 247) no Hoare annotation was computed. [2021-11-13 17:32:23,701 INFO L861 garLoopResultBuilder]: At program point L244(lines 231 246) the Hoare annotation is: true [2021-11-13 17:32:23,701 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 228 247) the Hoare annotation is: true [2021-11-13 17:32:23,701 INFO L858 garLoopResultBuilder]: For program point L236(lines 236 241) no Hoare annotation was computed. [2021-11-13 17:32:23,701 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 242) no Hoare annotation was computed. [2021-11-13 17:32:23,701 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 228 247) no Hoare annotation was computed. [2021-11-13 17:32:23,702 INFO L861 garLoopResultBuilder]: At program point error1ENTRY(lines 23 30) the Hoare annotation is: true [2021-11-13 17:32:23,702 INFO L858 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2021-11-13 17:32:23,702 INFO L858 garLoopResultBuilder]: For program point error1FINAL(lines 23 30) no Hoare annotation was computed. [2021-11-13 17:32:23,702 INFO L858 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2021-11-13 17:32:23,703 INFO L854 garLoopResultBuilder]: At program point L570(lines 557 572) the Hoare annotation is: (let ((.cse21 (= ~m_st~0 0))) (let ((.cse6 (not (= ~m_pc~0 0))) (.cse22 (not (= ~t1_pc~0 0))) (.cse1 (not (<= 2 ~t1_st~0))) (.cse15 (not .cse21)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse3 (not (= ~m_i~0 1))) (.cse4 (= ~E_1~0 1)) (.cse5 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~T1_E~0 2))) (.cse10 (not (= ~p_dw_pc~0 0))) (.cse11 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse12 (not (= ~c_num_read~0 0))) (.cse13 (not (= ~q_free~0 0))) (.cse14 (not (<= 2 ~E_M~0))) (.cse16 (<= 1 exists_runnable_thread2_~__retres1~6)) (.cse23 (not (= ~t1_st~0 0))) (.cse17 (= ~E_1~0 0)) (.cse18 (= ~M_E~0 0)) (.cse19 (= ~M_E~0 1)) (.cse20 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse24 (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 .cse0 .cse2 .cse3 .cse21 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse16 .cse23 .cse17 .cse18 .cse19 .cse20 .cse24) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse13 .cse14 .cse16 .cse23 .cse17 .cse18 .cse19 .cse20 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (< ~local~0 ~token~0)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse2 .cse3 .cse21 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse23 .cse17 .cse18 .cse19 .cse20 .cse24)))) [2021-11-13 17:32:23,703 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 554 573) no Hoare annotation was computed. [2021-11-13 17:32:23,703 INFO L858 garLoopResultBuilder]: For program point L562(lines 562 567) no Hoare annotation was computed. [2021-11-13 17:32:23,703 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 554 573) the Hoare annotation is: true [2021-11-13 17:32:23,703 INFO L858 garLoopResultBuilder]: For program point L558(lines 558 568) no Hoare annotation was computed. [2021-11-13 17:32:23,703 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 554 573) no Hoare annotation was computed. [2021-11-13 17:32:23,704 INFO L858 garLoopResultBuilder]: For program point L672-1(lines 653 680) no Hoare annotation was computed. [2021-11-13 17:32:23,704 INFO L858 garLoopResultBuilder]: For program point L667-1(lines 656 679) no Hoare annotation was computed. [2021-11-13 17:32:23,704 INFO L858 garLoopResultBuilder]: For program point L662-1(lines 656 679) no Hoare annotation was computed. [2021-11-13 17:32:23,704 INFO L858 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 653 680) no Hoare annotation was computed. [2021-11-13 17:32:23,704 INFO L854 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 653 680) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (and (= ~M_E~0 |old(~M_E~0)|) (= ~T1_E~0 2) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse19 (not (<= 2 ~t1_st~0))) (.cse2 (not (= ~c_dr_pc~0 0))) (.cse3 (not (= ~m_i~0 1))) (.cse13 (= ~m_st~0 0)) (.cse4 (not (= |old(~T1_E~0)| 2))) (.cse20 (not (= ~t1_pc~0 1))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~t1_i~0 1))) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (= ~c_num_read~0 0))) (.cse10 (not (= ~q_free~0 0))) (.cse11 (not (<= 2 |old(~E_M~0)|))) (.cse12 (= |old(~M_E~0)| 1)) (.cse14 (= |old(~E_1~0)| 1)) (.cse15 (= |old(~M_E~0)| 0)) (.cse16 (= |old(~E_1~0)| 0)) (.cse17 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse18 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~m_pc~0 0)) .cse5 .cse6 .cse7 .cse8 (not (= ~t1_pc~0 0)) .cse9 .cse10 .cse11 .cse12 (not .cse13) .cse14 .cse15 (not (= ~t1_st~0 0)) .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse19 .cse2 .cse3 .cse13 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (< ~local~0 ~token~0)) .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse19 .cse2 .cse3 .cse13 .cse4 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18))) [2021-11-13 17:32:23,705 INFO L858 garLoopResultBuilder]: For program point L657-1(lines 656 679) no Hoare annotation was computed. [2021-11-13 17:32:23,708 INFO L732 BasicCegarLoop]: Path program 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] [2021-11-13 17:32:23,710 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-13 17:32:23,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 05:32:23 BoogieIcfgContainer [2021-11-13 17:32:23,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-13 17:32:23,819 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-13 17:32:23,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-13 17:32:23,819 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-13 17:32:23,820 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:31:02" (3/4) ... [2021-11-13 17:32:23,823 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-13 17:32:23,830 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2021-11-13 17:32:23,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2021-11-13 17:32:23,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2021-11-13 17:32:23,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2021-11-13 17:32:23,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2021-11-13 17:32:23,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2021-11-13 17:32:23,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2021-11-13 17:32:23,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2021-11-13 17:32:23,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2021-11-13 17:32:23,845 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2021-11-13 17:32:23,846 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-13 17:32:23,847 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-13 17:32:23,848 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-13 17:32:23,876 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || E_1 == 0) || M_E == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1)) && ((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || !(m_i == 1)) || E_1 == 1) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || (((0 <= __retres1 && m_st == \old(m_st)) && t1_st == 0) && __retres1 <= 0)) || !(token == local))) && ((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || (((0 <= __retres1 && m_st == \old(m_st)) && t1_st == 0) && __retres1 <= 0)) || !(token == local))) && (((((((((((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && E_M == 1)) || !(0 < E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token == local)) [2021-11-13 17:32:23,877 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || !(m_i == 1)) || E_1 == 1) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((((\result <= 0 && 0 <= __retres1) && m_st == \old(m_st)) && t1_st == 0) && __retres1 <= 0) && 0 <= \result)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(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)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(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)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || E_1 == 0) || M_E == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && ((((((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && E_M == 1)) || !(0 < E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && ((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((((\result <= 0 && 0 <= __retres1) && m_st == \old(m_st)) && t1_st == 0) && __retres1 <= 0) && 0 <= \result)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(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)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || !(c_last_read == p_last_write)) || !(token == local)) [2021-11-13 17:32:23,879 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((((((T1_E == 2 && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && c_dr_pc == 0)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token == local)) && (((((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || ((((((((1 <= t1_pc && \old(t1_st) == t1_st) && T1_E == 2) && m_st == \old(m_st)) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && c_dr_pc == 0)) || !(local < token)) || E_1 == 0) || M_E == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || (((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && !(E_1 == 1)) && c_last_read == p_last_write) && (((((((((1 <= t1_pc && T1_E == 2) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && !(M_E == 1)) && c_dr_pc == 0) && E_M == 1) || ((((((((1 <= t1_pc && T1_E == 2) && m_st == \old(m_st)) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && !(M_E == 1)) && c_dr_pc == 0)))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && !(E_1 == 1)) && c_last_read == p_last_write) && (((((((((1 <= t1_pc && T1_E == 2) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && !(M_E == 1)) && c_dr_pc == 0) && E_M == 1) || ((((((((1 <= t1_pc && T1_E == 2) && m_st == \old(m_st)) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && !(M_E == 1)) && c_dr_pc == 0)))) || !(0 < E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || ((((((((1 <= t1_pc && \old(t1_st) == t1_st) && T1_E == 2) && m_st == \old(m_st)) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && c_dr_pc == 0)) || E_1 == 0) || M_E == 0) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || !(m_i == 1)) || E_1 == 1) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((((((T1_E == 2 && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && c_dr_pc == 0)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token == local)) [2021-11-13 17:32:23,879 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || !(m_i == 1)) || E_1 == 1) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || (((((((((T1_E == 2 && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && c_dr_pc == 0) && \result <= 0) && 0 <= \result)) || !(token == local)) && ((((((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || ((((((((((1 <= t1_pc && \old(t1_st) == t1_st) && T1_E == 2) && m_st == \old(m_st)) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && c_dr_pc == 0) && \result <= 0) && 0 <= \result)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || E_1 == 0) || M_E == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || ((((((((((1 <= t1_pc && \old(t1_st) == t1_st) && T1_E == 2) && m_st == \old(m_st)) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && c_dr_pc == 0) && \result <= 0) && 0 <= \result)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((((!(p_dw_st == 0) || (((((((p_dw_pc == 0 && p_num_write == 0) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && (((((((((((1 <= t1_pc && T1_E == 2) && m_st == \old(m_st)) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && !(M_E == 1)) && c_dr_pc == 0) && \result <= 0) && 0 <= \result) || ((((((((((1 <= t1_pc && T1_E == 2) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && !(M_E == 1)) && c_dr_pc == 0) && \result <= 0) && 0 <= \result) && E_M == 1))) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((((p_dw_pc == 0 && p_num_write == 0) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && (((((((((((1 <= t1_pc && T1_E == 2) && m_st == \old(m_st)) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && !(M_E == 1)) && c_dr_pc == 0) && \result <= 0) && 0 <= \result) || ((((((((((1 <= t1_pc && T1_E == 2) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && !(M_E == 1)) && c_dr_pc == 0) && \result <= 0) && 0 <= \result) && E_M == 1))) && c_last_read == p_last_write)) || !(0 < E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && ((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || (((((((((T1_E == 2 && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && c_dr_pc == 0) && \result <= 0) && 0 <= \result)) || !(token == local)) [2021-11-13 17:32:23,881 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(p_num_write == 1) || !(c_dr_pc == 0)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((\old(p_dw_st) == p_dw_st && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= __retres1)) || !(m_st == 0)) || !(t1_st == 0)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1) && (((((((((((((((!(2 == \old(c_dr_st)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(t1_pc == 0)) || !(q_free == 0)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1)) && ((((((((((((((!(2 == \old(c_dr_st)) || E_1 == 1) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1)) && (((((((((((((((!(2 <= \old(p_dw_st)) || E_1 == 1) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || E_M == 1) [2021-11-13 17:32:23,882 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(2 == \old(c_dr_st)) || E_1 == 1) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1) && (((((((((((((((!(2 == \old(c_dr_st)) || (((__retres1 <= 0 && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1)) && (((((((((((((((!(2 <= \old(p_dw_st)) || E_1 == 1) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || E_M == 1)) && ((((((((((((((((!(p_num_write == 1) || !(c_dr_pc == 0)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((\old(p_dw_st) == p_dw_st && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(m_st == 0)) || !(t1_st == 0)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1) [2021-11-13 17:32:23,882 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(m_st == 0)) || !(t1_st == 0)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1) && ((((((((((((((((!(2 <= \old(p_dw_st)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || p_dw_st == 0) || (((\old(p_dw_st) == p_dw_st && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || E_M == 1)) && (((((((((((((((!(2 == \old(c_dr_st)) || ((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1)) && ((((((((((((((!(2 == \old(c_dr_st)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(m_st == 0)) || (c_dr_st == 2 && (\old(p_dw_st) == p_dw_st || p_dw_st == 0))) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1) [2021-11-13 17:32:23,882 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(m_st == 0)) || !(t1_st == 0)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1) && ((((((((((((((((!(2 <= \old(p_dw_st)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || p_dw_st == 0) || (((\old(p_dw_st) == p_dw_st && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || E_M == 1)) && (((((((((((((((!(2 == \old(c_dr_st)) || ((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1)) && ((((((((((((((!(2 == \old(c_dr_st)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(m_st == 0)) || (c_dr_st == 2 && (\old(p_dw_st) == p_dw_st || p_dw_st == 0))) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1) [2021-11-13 17:32:23,954 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/bin/uautomizer-YU5uOKAj3y/witness.graphml [2021-11-13 17:32:23,954 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-13 17:32:23,955 INFO L158 Benchmark]: Toolchain (without parser) took 82967.81ms. Allocated memory was 132.1MB in the beginning and 589.3MB in the end (delta: 457.2MB). Free memory was 95.2MB in the beginning and 538.3MB in the end (delta: -443.2MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2021-11-13 17:32:23,955 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 132.1MB. Free memory was 103.0MB in the beginning and 103.0MB in the end (delta: 28.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 17:32:23,956 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.13ms. Allocated memory is still 132.1MB. Free memory was 94.8MB in the beginning and 100.7MB in the end (delta: -5.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-13 17:32:23,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.19ms. Allocated memory is still 132.1MB. Free memory was 100.7MB in the beginning and 98.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-13 17:32:23,957 INFO L158 Benchmark]: Boogie Preprocessor took 41.85ms. Allocated memory is still 132.1MB. Free memory was 98.6MB in the beginning and 96.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-13 17:32:23,957 INFO L158 Benchmark]: RCFGBuilder took 830.94ms. Allocated memory is still 132.1MB. Free memory was 96.5MB in the beginning and 74.2MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-11-13 17:32:23,957 INFO L158 Benchmark]: TraceAbstraction took 81522.68ms. Allocated memory was 132.1MB in the beginning and 589.3MB in the end (delta: 457.2MB). Free memory was 74.2MB in the beginning and 553.0MB in the end (delta: -478.8MB). Peak memory consumption was 332.8MB. Max. memory is 16.1GB. [2021-11-13 17:32:23,958 INFO L158 Benchmark]: Witness Printer took 135.74ms. Allocated memory is still 589.3MB. Free memory was 553.0MB in the beginning and 538.3MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-13 17:32:23,960 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.36ms. Allocated memory is still 132.1MB. Free memory was 103.0MB in the beginning and 103.0MB in the end (delta: 28.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.13ms. Allocated memory is still 132.1MB. Free memory was 94.8MB in the beginning and 100.7MB in the end (delta: -5.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.19ms. Allocated memory is still 132.1MB. Free memory was 100.7MB in the beginning and 98.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.85ms. Allocated memory is still 132.1MB. Free memory was 98.6MB in the beginning and 96.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 830.94ms. Allocated memory is still 132.1MB. Free memory was 96.5MB in the beginning and 74.2MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 81522.68ms. Allocated memory was 132.1MB in the beginning and 589.3MB in the end (delta: 457.2MB). Free memory was 74.2MB in the beginning and 553.0MB in the end (delta: -478.8MB). Peak memory consumption was 332.8MB. Max. memory is 16.1GB. * Witness Printer took 135.74ms. Allocated memory is still 589.3MB. Free memory was 553.0MB in the beginning and 538.3MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. 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: 390]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 27]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 179 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 81.3s, OverallIterations: 28, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 56.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9274 SdHoareTripleChecker+Valid, 6405.23ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9006 mSDsluCounter, 17309 SdHoareTripleChecker+Invalid, 5241.15ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10790 mSDsCounter, 1588 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6199 IncrementalHoareTripleChecker+Invalid, 7787 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1588 mSolverCounterUnsat, 6519 mSDtfsCounter, 6199 mSolverCounterSat, 189.64ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1918 GetRequests, 1663 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2345occurred in iteration=25, InterpolantAutomatonStates: 235, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 28 MinimizatonAttempts, 2125 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 72 LocationsWithAnnotation, 3211 PreInvPairs, 3511 NumberOfFragments, 13262 HoareAnnotationTreeSize, 3211 FomulaSimplifications, 1893 FormulaSimplificationTreeSizeReduction, 38.6s HoareSimplificationTime, 72 FomulaSimplificationsInter, 4328930 FormulaSimplificationTreeSizeReductionInter, 18.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 3225 NumberOfCodeBlocks, 3225 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3487 ConstructedInterpolants, 0 QuantifiedInterpolants, 6665 SizeOfPredicates, 5 NumberOfNonLiveVariables, 3257 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 39 InterpolantComputations, 26 PerfectInterpolantSequences, 1502/1621 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: 454]: Loop Invariant Derived loop invariant: (((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && m_st == 0) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) || ((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local)) || (((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && token <= local + 1) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && local < token) - InvariantResult [Line: 764]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && token <= local + 1) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && local < token) || (((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) - InvariantResult [Line: 306]: Loop Invariant Derived loop invariant: (((((((((((((((((c_dr_st == 2 && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && 2 <= p_dw_st) && !(E_M == 1)) || ((((((((((((((c_num_read == p_num_write && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && 2 <= p_dw_st) && !(E_M == 1))) || ((((((((((((((c_num_read == p_num_write && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && !(E_M == 1))) || (((((((((((((t1_pc == 0 && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && T1_E == 2) && m_st == 0) && q_free == 0) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && 2 <= p_dw_st) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 2 <= p_dw_st) && !(E_M == 1)) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || !(m_i == 1)) || E_1 == 1) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((((\result <= 0 && 0 <= __retres1) && m_st == \old(m_st)) && t1_st == 0) && __retres1 <= 0) && 0 <= \result)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(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)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(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)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || E_1 == 0) || M_E == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && ((((((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && E_M == 1)) || !(0 < E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && ((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((((\result <= 0 && 0 <= __retres1) && m_st == \old(m_st)) && t1_st == 0) && __retres1 <= 0) && 0 <= \result)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(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)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 768]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && token <= local + 1) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && local < token) || (((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((((((((c_num_read == p_num_write && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && 2 <= p_dw_st) && !(E_M == 1)) || ((((((((((((((c_num_read == p_num_write && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && !(E_M == 1)) - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || E_1 == 0) || M_E == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1)) && ((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || !(m_i == 1)) || E_1 == 1) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || (((0 <= __retres1 && m_st == \old(m_st)) && t1_st == 0) && __retres1 <= 0)) || !(token == local))) && ((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || (((0 <= __retres1 && m_st == \old(m_st)) && t1_st == 0) && __retres1 <= 0)) || !(token == local))) && (((((((((((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || ((\old(t1_st) == t1_st && m_st == \old(m_st)) && E_M == 1)) || !(0 < E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && token <= local + 1) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && local < token) || (((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: (((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && q_free == 0) && t1_st == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && token == local) || (((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(m_st == 0)) || !(t1_st == 0)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1) && ((((((((((((((((!(2 <= \old(p_dw_st)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || p_dw_st == 0) || (((\old(p_dw_st) == p_dw_st && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || E_M == 1)) && (((((((((((((((!(2 == \old(c_dr_st)) || ((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1)) && ((((((((((((((!(2 == \old(c_dr_st)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(m_st == 0)) || (c_dr_st == 2 && (\old(p_dw_st) == p_dw_st || p_dw_st == 0))) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 0 && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && T1_E == 2) && m_st == 0) && q_free == 0) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && 2 <= p_dw_st) && !(E_M == 1) - InvariantResult [Line: 842]: Loop Invariant Derived loop invariant: p_dw_st == 0 - InvariantResult [Line: 783]: Loop Invariant Derived loop invariant: p_dw_st == 0 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && m_st == 0) && q_free == 0) && 1 <= tmp) && !(E_1 == 1)) && !(M_E == 1)) && m_pc == 0) && c_last_read == p_last_write) && (((((((t1_pc == 0 && T1_E == 2) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 0)) && c_dr_pc == 0) || ((((((1 <= t1_pc && T1_E == 2) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 0)) && c_dr_pc == 0))) || ((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && token <= local + 1) && q_free == 0) && !(E_1 == 1)) && !(M_E == 1)) && c_last_read == p_last_write) && local < token) && (((((((t1_pc == 0 && T1_E == 2) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 0)) && c_dr_pc == 0) || ((((((1 <= t1_pc && T1_E == 2) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 0)) && c_dr_pc == 0)))) || (((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && q_free == 0) && 1 <= tmp) && !(m_st == 0)) && !(E_1 == 1)) && !(M_E == 1)) && c_last_read == p_last_write) && token == local) && (((((((t1_pc == 0 && T1_E == 2) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 0)) && c_dr_pc == 0) || ((((((1 <= t1_pc && T1_E == 2) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 0)) && c_dr_pc == 0))) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && q_free == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) || ((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && m_st == 0) && q_free == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && token == local)) || ((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && m_st == 0) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write)) || (((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && token <= local + 1) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && local < token)) || ((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && q_free == 0) && t1_st == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local)) || (((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(p_num_write == 1) || !(c_dr_pc == 0)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((\old(p_dw_st) == p_dw_st && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && 0 <= __retres1)) || !(m_st == 0)) || !(t1_st == 0)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1) && (((((((((((((((!(2 == \old(c_dr_st)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(t1_pc == 0)) || !(q_free == 0)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1)) && ((((((((((((((!(2 == \old(c_dr_st)) || E_1 == 1) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1)) && (((((((((((((((!(2 <= \old(p_dw_st)) || E_1 == 1) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || E_M == 1) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(E_M == 1)) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 2 <= p_dw_st) && !(E_M == 1)) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && token <= local + 1) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && local < token - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((((((((!(2 == \old(c_dr_st)) || E_1 == 1) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1) && (((((((((((((((!(2 == \old(c_dr_st)) || (((__retres1 <= 0 && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1)) && (((((((((((((((!(2 <= \old(p_dw_st)) || E_1 == 1) || (\old(p_dw_st) == p_dw_st && c_dr_st == \old(c_dr_st))) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || E_M == 1)) && ((((((((((((((((!(p_num_write == 1) || !(c_dr_pc == 0)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || (((((\old(p_dw_st) == p_dw_st && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 <= __retres1)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(m_st == 0)) || !(t1_st == 0)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && c_dr_st == \old(c_dr_st)) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1) || !(p_num_write == 1)) || !(c_dr_pc == 0)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(m_st == 0)) || !(t1_st == 0)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1) && ((((((((((((((((!(2 <= \old(p_dw_st)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == p_num_write)) || p_dw_st == 0) || (((\old(p_dw_st) == p_dw_st && tmp <= 0) && c_dr_st == \old(c_dr_st)) && 0 < tmp + 1)) || !(m_st == 0)) || !(t1_st == 0)) || !(q_free == 1)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || E_M == 1)) && (((((((((((((((!(2 == \old(c_dr_st)) || ((((((\old(p_dw_st) == p_dw_st && tmp <= 0) && __retres1 <= 0) && \result <= 0) && 0 <= \result) && 0 < tmp + 1) && 0 <= __retres1)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(m_st == 0)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1)) && ((((((((((((((!(2 == \old(c_dr_st)) || E_1 == 1) || !(m_pc == 0)) || !(T1_E == 2)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(q_free == 0)) || !(m_st == 0)) || (c_dr_st == 2 && (\old(p_dw_st) == p_dw_st || p_dw_st == 0))) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) || E_1 == 0) || M_E == 0) || M_E == 1) || E_M == 1) - InvariantResult [Line: 512]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((((((T1_E == 2 && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && c_dr_pc == 0)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token == local)) && (((((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || ((((((((1 <= t1_pc && \old(t1_st) == t1_st) && T1_E == 2) && m_st == \old(m_st)) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && c_dr_pc == 0)) || !(local < token)) || E_1 == 0) || M_E == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || (((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && !(E_1 == 1)) && c_last_read == p_last_write) && (((((((((1 <= t1_pc && T1_E == 2) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && !(M_E == 1)) && c_dr_pc == 0) && E_M == 1) || ((((((((1 <= t1_pc && T1_E == 2) && m_st == \old(m_st)) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && !(M_E == 1)) && c_dr_pc == 0)))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && !(E_1 == 1)) && c_last_read == p_last_write) && (((((((((1 <= t1_pc && T1_E == 2) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && !(M_E == 1)) && c_dr_pc == 0) && E_M == 1) || ((((((((1 <= t1_pc && T1_E == 2) && m_st == \old(m_st)) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && !(M_E == 1)) && c_dr_pc == 0)))) || !(0 < E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || ((((((((1 <= t1_pc && \old(t1_st) == t1_st) && T1_E == 2) && m_st == \old(m_st)) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && c_dr_pc == 0)) || E_1 == 0) || M_E == 0) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || !(m_i == 1)) || E_1 == 1) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (((((((T1_E == 2 && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && c_dr_pc == 0)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 726]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && token <= local + 1) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && local < token) || (((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: (((((((((((((((((c_dr_st == 2 && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && 2 <= p_dw_st) && !(E_M == 1)) || ((((((((((((((c_num_read == p_num_write && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && 2 <= p_dw_st) && !(E_M == 1))) || ((((((((((((((c_num_read == p_num_write && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && !(E_M == 1))) || (((((((((((((t1_pc == 0 && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && T1_E == 2) && m_st == 0) && q_free == 0) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && 2 <= p_dw_st) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 2 <= p_dw_st) && !(E_M == 1)) - InvariantResult [Line: 557]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(p_dw_st == 0) || !(2 <= t1_st)) || !(c_dr_pc == 0)) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(m_st == 0)) || 1 <= __retres1) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) && ((((((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || !(m_i == 1)) || m_st == 0) || E_1 == 1) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || 1 <= __retres1) || !(t1_st == 0)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || !(m_i == 1)) || E_1 == 1) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || 1 <= __retres1) || !(t1_st == 0)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((((!(p_dw_st == 0) || !(2 <= t1_st)) || !(c_dr_pc == 0)) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(m_st == 0)) || 1 <= __retres1) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && ((((((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || !(m_i == 1)) || m_st == 0) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || 1 <= __retres1) || !(t1_st == 0)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((((((((((c_num_read == p_num_write && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && c_last_read == p_last_write) && 2 <= p_dw_st) && !(E_M == 1)) || ((((((((((((((c_num_read == p_num_write && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((t1_pc == 0 && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && T1_E == 2) && m_st == 0) && q_free == 0) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && 2 <= p_dw_st) && !(E_M == 1)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((((c_dr_st == 2 && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && 2 <= p_dw_st) && !(E_M == 1)) || (((((((((((((t1_pc == 0 && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && T1_E == 2) && m_st == 0) && q_free == 0) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && 2 <= p_dw_st) && !(E_M == 1)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && !(E_M == 1)) || ((((((((((((c_num_read == p_num_write && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && !(E_M == 1)) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((((((((((c_dr_st == 2 && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && 2 <= p_dw_st) && !(E_M == 1)) || ((((((((((((((c_num_read == p_num_write && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && 2 <= p_dw_st) && !(E_M == 1))) || ((((((((((((((c_num_read == p_num_write && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && !(E_M == 1))) || (((((((((((((t1_pc == 0 && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && T1_E == 2) && m_st == 0) && q_free == 0) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && 2 <= p_dw_st) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 2 <= p_dw_st) && !(E_M == 1)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(E_M == 1)) || ((((((((((((c_dr_st == 2 && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && !(E_M == 1))) || ((((((((((((t1_pc == 0 && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && T1_E == 2) && m_st == 0) && q_free == 0) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && !(E_M == 1))) || (((((((((((((c_num_read == p_num_write && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && !(E_M == 1)) - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: (((((((((((((((((c_dr_st == 2 && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && 2 <= p_dw_st) && !(E_M == 1)) || ((((((((((((((c_num_read == p_num_write && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && 2 <= p_dw_st) && !(E_M == 1))) || ((((((((((((((c_num_read == p_num_write && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && !(E_M == 1))) || (((((((((((((t1_pc == 0 && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && T1_E == 2) && m_st == 0) && q_free == 0) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && 2 <= p_dw_st) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 2 <= p_dw_st) && !(E_M == 1)) - InvariantResult [Line: 754]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && m_st == 0) && q_free == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && token == local - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: (((((((((((((((((c_dr_st == 2 && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 0) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && 2 <= p_dw_st) && !(E_M == 1)) || ((((((((((((((c_num_read == p_num_write && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && 2 <= p_dw_st) && !(E_M == 1))) || ((((((((((((((c_num_read == p_num_write && c_dr_st == 2) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && !(E_M == 1))) || (((((((((((((t1_pc == 0 && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && T1_E == 2) && m_st == 0) && q_free == 0) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && m_pc == 0) && 2 <= p_dw_st) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 2 <= p_dw_st) && !(E_M == 1)) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && q_free == 0) && t1_st == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) || ((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && q_free == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local)) || ((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && q_free == 0) && t1_st == 0) && m_i == 1) && 1 <= tmp) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && t1_st == 0) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(E_M == 1) - InvariantResult [Line: 717]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && token <= local + 1) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && local < token) || ((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) - InvariantResult [Line: 536]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && m_st == 0) && q_free == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && token == local - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || !(m_i == 1)) || E_1 == 1) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || (((((((((T1_E == 2 && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && c_dr_pc == 0) && \result <= 0) && 0 <= \result)) || !(token == local)) && ((((((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || ((((((((((1 <= t1_pc && \old(t1_st) == t1_st) && T1_E == 2) && m_st == \old(m_st)) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && c_dr_pc == 0) && \result <= 0) && 0 <= \result)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || E_1 == 0) || M_E == 0) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && (((((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(p_dw_st == 0) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(2 <= \old(t1_st))) || !(m_i == 1)) || E_1 == 1) || ((((((((((1 <= t1_pc && \old(t1_st) == t1_st) && T1_E == 2) && m_st == \old(m_st)) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && c_dr_pc == 0) && \result <= 0) && 0 <= \result)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((((!(p_dw_st == 0) || (((((((p_dw_pc == 0 && p_num_write == 0) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && (((((((((((1 <= t1_pc && T1_E == 2) && m_st == \old(m_st)) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && !(M_E == 1)) && c_dr_pc == 0) && \result <= 0) && 0 <= \result) || ((((((((((1 <= t1_pc && T1_E == 2) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && !(M_E == 1)) && c_dr_pc == 0) && \result <= 0) && 0 <= \result) && E_M == 1))) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((((p_dw_pc == 0 && p_num_write == 0) && t1_i == 1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && (((((((((((1 <= t1_pc && T1_E == 2) && m_st == \old(m_st)) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && !(M_E == 1)) && c_dr_pc == 0) && \result <= 0) && 0 <= \result) || ((((((((((1 <= t1_pc && T1_E == 2) && __retres1 <= 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && !(M_E == 1)) && c_dr_pc == 0) && \result <= 0) && 0 <= \result) && E_M == 1))) && c_last_read == p_last_write)) || !(0 < E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && ((((((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(m_i == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || E_1 == 0) || M_E == 0) || M_E == 1) || !(c_last_read == p_last_write)) || (((((((((T1_E == 2 && m_st == \old(m_st)) && __retres1 <= 0) && t1_st == 0) && m_i == 1) && !(M_E == 0)) && 0 <= __retres1) && c_dr_pc == 0) && \result <= 0) && 0 <= \result)) || !(token == local)) - InvariantResult [Line: 795]: Loop Invariant Derived loop invariant: (((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && m_st == 0) && q_free == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && token == local) || ((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && token <= local + 1) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && local < token)) || (((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 <= E_M) && T1_E == 2) && q_free == 0) && m_i == 1) && p_dw_st == 0) && !(M_E == 0)) && !(m_st == 0)) && !(E_1 == 1)) && !(E_1 == 0)) && !(M_E == 1)) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) RESULT: Ultimate proved your program to be correct! [2021-11-13 17:32:24,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91936167-bc4c-4c17-8cb5-b48c5c1ae65e/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