./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 09:27:08,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:27:08,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:27:08,213 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:27:08,214 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:27:08,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:27:08,228 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:27:08,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:27:08,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:27:08,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:27:08,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:27:08,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:27:08,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:27:08,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:27:08,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:27:08,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:27:08,246 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:27:08,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:27:08,248 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:27:08,250 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:27:08,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:27:08,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:27:08,260 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:27:08,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:27:08,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:27:08,276 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:27:08,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:27:08,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:27:08,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:27:08,280 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:27:08,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:27:08,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:27:08,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:27:08,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:27:08,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:27:08,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:27:08,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:27:08,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:27:08,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:27:08,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:27:08,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:27:08,292 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 09:27:08,334 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:27:08,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:27:08,335 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:27:08,335 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:27:08,336 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:27:08,337 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:27:08,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:27:08,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:27:08,338 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:27:08,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:27:08,339 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:27:08,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:27:08,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:27:08,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:27:08,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:27:08,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:27:08,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:27:08,340 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:27:08,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:27:08,341 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:27:08,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:27:08,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:27:08,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:27:08,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:27:08,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:08,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:27:08,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:27:08,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:27:08,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:27:08,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:27:08,343 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:27:08,343 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:27:08,344 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:27:08,344 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_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/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_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 [2022-11-20 09:27:08,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:27:08,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:27:08,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:27:08,728 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:27:08,728 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:27:08,730 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-11-20 09:27:11,844 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:27:12,103 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:27:12,104 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-11-20 09:27:12,114 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/data/f7e7703c5/6bf8247a37bf4a199cc365baaf775735/FLAG232154208 [2022-11-20 09:27:12,136 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/data/f7e7703c5/6bf8247a37bf4a199cc365baaf775735 [2022-11-20 09:27:12,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:27:12,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:27:12,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:12,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:27:12,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:27:12,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31fd02b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12, skipping insertion in model container [2022-11-20 09:27:12,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:27:12,208 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:27:12,399 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2022-11-20 09:27:12,468 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2022-11-20 09:27:12,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:12,532 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:27:12,546 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2022-11-20 09:27:12,586 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2022-11-20 09:27:12,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:12,634 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:27:12,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12 WrapperNode [2022-11-20 09:27:12,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:12,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:12,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:27:12,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:27:12,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,736 INFO L138 Inliner]: procedures = 55, calls = 60, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 402 [2022-11-20 09:27:12,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:12,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:27:12,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:27:12,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:27:12,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,803 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:27:12,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:27:12,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:27:12,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:27:12,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:12,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:12,855 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:27:12,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:27:12,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:27:12,904 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-20 09:27:12,904 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-20 09:27:12,904 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-20 09:27:12,905 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-20 09:27:12,905 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-20 09:27:12,905 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-20 09:27:12,905 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-20 09:27:12,905 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-20 09:27:12,906 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-20 09:27:12,906 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-20 09:27:12,906 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-20 09:27:12,906 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-20 09:27:12,906 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-20 09:27:12,907 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-20 09:27:12,907 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-20 09:27:12,907 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-20 09:27:12,907 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-20 09:27:12,907 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-20 09:27:12,907 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-20 09:27:12,908 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-20 09:27:12,908 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-20 09:27:12,908 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-20 09:27:12,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:27:12,908 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-20 09:27:12,909 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-20 09:27:12,909 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-20 09:27:12,909 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-20 09:27:12,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:27:12,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:27:12,910 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-20 09:27:12,910 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-20 09:27:13,066 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:27:13,068 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:27:13,843 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:27:13,854 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:27:13,854 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-20 09:27:13,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:13 BoogieIcfgContainer [2022-11-20 09:27:13,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:27:13,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:27:13,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:27:13,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:27:13,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:27:12" (1/3) ... [2022-11-20 09:27:13,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e560c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:13, skipping insertion in model container [2022-11-20 09:27:13,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (2/3) ... [2022-11-20 09:27:13,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e560c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:13, skipping insertion in model container [2022-11-20 09:27:13,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:13" (3/3) ... [2022-11-20 09:27:13,869 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-11-20 09:27:13,892 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:27:13,892 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 09:27:13,957 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:27:13,965 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@12605e43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:27:13,966 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-20 09:27:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 168 states have internal predecessors, (248), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-11-20 09:27:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 09:27:13,997 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:13,997 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:13,998 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:14,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:14,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1497674214, now seen corresponding path program 1 times [2022-11-20 09:27:14,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:14,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144104543] [2022-11-20 09:27:14,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:14,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:14,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:27:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:14,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 09:27:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:14,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:27:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:14,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 09:27:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:14,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 09:27:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:14,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:14,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:14,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144104543] [2022-11-20 09:27:14,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144104543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:14,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:14,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:27:14,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113401353] [2022-11-20 09:27:14,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:14,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:27:14,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:14,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:27:14,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:27:14,664 INFO L87 Difference]: Start difference. First operand has 208 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 168 states have internal predecessors, (248), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 09:27:15,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:15,813 INFO L93 Difference]: Finished difference Result 530 states and 790 transitions. [2022-11-20 09:27:15,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 09:27:15,815 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 [2022-11-20 09:27:15,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:15,829 INFO L225 Difference]: With dead ends: 530 [2022-11-20 09:27:15,829 INFO L226 Difference]: Without dead ends: 329 [2022-11-20 09:27:15,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-20 09:27:15,837 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 524 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:15,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 641 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 09:27:15,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-11-20 09:27:15,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 288. [2022-11-20 09:27:15,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 227 states have (on average 1.4317180616740088) internal successors, (325), 232 states have internal predecessors, (325), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2022-11-20 09:27:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 404 transitions. [2022-11-20 09:27:15,923 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 404 transitions. Word has length 57 [2022-11-20 09:27:15,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:15,924 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 404 transitions. [2022-11-20 09:27:15,924 INFO L496 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) [2022-11-20 09:27:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 404 transitions. [2022-11-20 09:27:15,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 09:27:15,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:15,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:15,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:27:15,928 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:15,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:15,929 INFO L85 PathProgramCache]: Analyzing trace with hash -604187876, now seen corresponding path program 1 times [2022-11-20 09:27:15,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:15,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209058484] [2022-11-20 09:27:15,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:15,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:16,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:27:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:16,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 09:27:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:16,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:27:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:16,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 09:27:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:16,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 09:27:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:16,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:16,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:16,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209058484] [2022-11-20 09:27:16,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209058484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:16,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:16,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:27:16,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604675612] [2022-11-20 09:27:16,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:16,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:27:16,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:16,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:27:16,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:16,185 INFO L87 Difference]: Start difference. First operand 288 states and 404 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 09:27:17,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:17,184 INFO L93 Difference]: Finished difference Result 620 states and 878 transitions. [2022-11-20 09:27:17,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 09:27:17,185 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 [2022-11-20 09:27:17,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:17,189 INFO L225 Difference]: With dead ends: 620 [2022-11-20 09:27:17,189 INFO L226 Difference]: Without dead ends: 437 [2022-11-20 09:27:17,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-20 09:27:17,192 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 505 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:17,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 910 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 09:27:17,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-11-20 09:27:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 373. [2022-11-20 09:27:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 295 states have (on average 1.423728813559322) internal successors, (420), 301 states have internal predecessors, (420), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-11-20 09:27:17,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 521 transitions. [2022-11-20 09:27:17,310 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 521 transitions. Word has length 57 [2022-11-20 09:27:17,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:17,310 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 521 transitions. [2022-11-20 09:27:17,311 INFO L496 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) [2022-11-20 09:27:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 521 transitions. [2022-11-20 09:27:17,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 09:27:17,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:17,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:17,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:27:17,314 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:17,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:17,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1641391578, now seen corresponding path program 1 times [2022-11-20 09:27:17,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:17,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131902323] [2022-11-20 09:27:17,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:17,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:17,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:27:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:17,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 09:27:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:17,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:27:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:17,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 09:27:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:17,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 09:27:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:17,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:17,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131902323] [2022-11-20 09:27:17,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131902323] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:17,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:17,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:27:17,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757704602] [2022-11-20 09:27:17,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:17,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:27:17,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:17,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:27:17,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:17,462 INFO L87 Difference]: Start difference. First operand 373 states and 521 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-20 09:27:18,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:18,057 INFO L93 Difference]: Finished difference Result 703 states and 997 transitions. [2022-11-20 09:27:18,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:27:18,058 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 [2022-11-20 09:27:18,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:18,062 INFO L225 Difference]: With dead ends: 703 [2022-11-20 09:27:18,062 INFO L226 Difference]: Without dead ends: 435 [2022-11-20 09:27:18,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-20 09:27:18,075 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 452 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:18,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 594 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 09:27:18,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-11-20 09:27:18,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 373. [2022-11-20 09:27:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 295 states have (on average 1.4135593220338982) internal successors, (417), 301 states have internal predecessors, (417), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-11-20 09:27:18,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 518 transitions. [2022-11-20 09:27:18,134 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 518 transitions. Word has length 57 [2022-11-20 09:27:18,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:18,134 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 518 transitions. [2022-11-20 09:27:18,134 INFO L496 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) [2022-11-20 09:27:18,135 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 518 transitions. [2022-11-20 09:27:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 09:27:18,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:18,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:18,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 09:27:18,140 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:18,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:18,140 INFO L85 PathProgramCache]: Analyzing trace with hash 743998300, now seen corresponding path program 1 times [2022-11-20 09:27:18,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:18,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449120863] [2022-11-20 09:27:18,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:18,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:18,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:27:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:18,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 09:27:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:18,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:27:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:18,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 09:27:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:18,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 09:27:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:18,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:18,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:18,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449120863] [2022-11-20 09:27:18,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449120863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:18,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:18,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:27:18,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365425317] [2022-11-20 09:27:18,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:18,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:27:18,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:18,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:27:18,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:18,346 INFO L87 Difference]: Start difference. First operand 373 states and 518 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) [2022-11-20 09:27:19,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:19,165 INFO L93 Difference]: Finished difference Result 739 states and 1054 transitions. [2022-11-20 09:27:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 09:27:19,165 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 [2022-11-20 09:27:19,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:19,168 INFO L225 Difference]: With dead ends: 739 [2022-11-20 09:27:19,168 INFO L226 Difference]: Without dead ends: 472 [2022-11-20 09:27:19,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-20 09:27:19,170 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 272 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:19,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 834 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 09:27:19,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-11-20 09:27:19,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 382. [2022-11-20 09:27:19,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 304 states have (on average 1.4013157894736843) internal successors, (426), 310 states have internal predecessors, (426), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-11-20 09:27:19,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 527 transitions. [2022-11-20 09:27:19,214 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 527 transitions. Word has length 57 [2022-11-20 09:27:19,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:19,214 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 527 transitions. [2022-11-20 09:27:19,214 INFO L496 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) [2022-11-20 09:27:19,215 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 527 transitions. [2022-11-20 09:27:19,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-20 09:27:19,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:19,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:19,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 09:27:19,216 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:19,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:19,217 INFO L85 PathProgramCache]: Analyzing trace with hash 671611742, now seen corresponding path program 1 times [2022-11-20 09:27:19,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:19,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917594613] [2022-11-20 09:27:19,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:19,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:19,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:27:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:19,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 09:27:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:19,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:27:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:19,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 09:27:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:19,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 09:27:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:19,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:19,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917594613] [2022-11-20 09:27:19,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917594613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:19,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:19,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:27:19,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988062242] [2022-11-20 09:27:19,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:19,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:27:19,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:19,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:27:19,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:19,434 INFO L87 Difference]: Start difference. First operand 382 states and 527 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) [2022-11-20 09:27:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:20,908 INFO L93 Difference]: Finished difference Result 1537 states and 2220 transitions. [2022-11-20 09:27:20,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 09:27:20,909 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 [2022-11-20 09:27:20,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:20,919 INFO L225 Difference]: With dead ends: 1537 [2022-11-20 09:27:20,920 INFO L226 Difference]: Without dead ends: 1261 [2022-11-20 09:27:20,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-11-20 09:27:20,922 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 967 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:20,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 800 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 09:27:20,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2022-11-20 09:27:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1090. [2022-11-20 09:27:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 865 states have (on average 1.3734104046242774) internal successors, (1188), 886 states have internal predecessors, (1188), 136 states have call successors, (136), 80 states have call predecessors, (136), 87 states have return successors, (187), 126 states have call predecessors, (187), 134 states have call successors, (187) [2022-11-20 09:27:21,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1511 transitions. [2022-11-20 09:27:21,061 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1511 transitions. Word has length 57 [2022-11-20 09:27:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:21,061 INFO L495 AbstractCegarLoop]: Abstraction has 1090 states and 1511 transitions. [2022-11-20 09:27:21,062 INFO L496 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) [2022-11-20 09:27:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1511 transitions. [2022-11-20 09:27:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 09:27:21,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:21,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:21,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 09:27:21,064 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:21,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:21,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1385451018, now seen corresponding path program 1 times [2022-11-20 09:27:21,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:21,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341642294] [2022-11-20 09:27:21,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:21,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:21,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:27:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:21,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 09:27:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:21,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:21,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:21,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:21,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 09:27:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:21,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 09:27:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:21,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:21,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:21,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341642294] [2022-11-20 09:27:21,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341642294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:21,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:21,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 09:27:21,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423662028] [2022-11-20 09:27:21,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:21,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:27:21,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:21,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:27:21,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:27:21,207 INFO L87 Difference]: Start difference. First operand 1090 states and 1511 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 09:27:22,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:22,130 INFO L93 Difference]: Finished difference Result 1313 states and 1826 transitions. [2022-11-20 09:27:22,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 09:27:22,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-20 09:27:22,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:22,138 INFO L225 Difference]: With dead ends: 1313 [2022-11-20 09:27:22,139 INFO L226 Difference]: Without dead ends: 1225 [2022-11-20 09:27:22,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-20 09:27:22,148 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 545 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:22,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 798 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 09:27:22,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2022-11-20 09:27:22,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1186. [2022-11-20 09:27:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 941 states have (on average 1.3740701381509033) internal successors, (1293), 964 states have internal predecessors, (1293), 147 states have call successors, (147), 87 states have call predecessors, (147), 96 states have return successors, (203), 138 states have call predecessors, (203), 145 states have call successors, (203) [2022-11-20 09:27:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1643 transitions. [2022-11-20 09:27:22,300 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1643 transitions. Word has length 65 [2022-11-20 09:27:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:22,300 INFO L495 AbstractCegarLoop]: Abstraction has 1186 states and 1643 transitions. [2022-11-20 09:27:22,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 09:27:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1643 transitions. [2022-11-20 09:27:22,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 09:27:22,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:22,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:22,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 09:27:22,305 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:22,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:22,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1789236969, now seen corresponding path program 1 times [2022-11-20 09:27:22,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:22,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894361294] [2022-11-20 09:27:22,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:22,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:27:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 09:27:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 09:27:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 09:27:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:22,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:22,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894361294] [2022-11-20 09:27:22,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894361294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:22,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:22,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 09:27:22,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963981592] [2022-11-20 09:27:22,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:22,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:27:22,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:22,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:27:22,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:27:22,504 INFO L87 Difference]: Start difference. First operand 1186 states and 1643 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 09:27:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:23,529 INFO L93 Difference]: Finished difference Result 1533 states and 2120 transitions. [2022-11-20 09:27:23,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 09:27:23,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-20 09:27:23,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:23,536 INFO L225 Difference]: With dead ends: 1533 [2022-11-20 09:27:23,537 INFO L226 Difference]: Without dead ends: 1356 [2022-11-20 09:27:23,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-11-20 09:27:23,541 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 712 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:23,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 929 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 09:27:23,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2022-11-20 09:27:23,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1282. [2022-11-20 09:27:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1017 states have (on average 1.3736479842674534) internal successors, (1397), 1042 states have internal predecessors, (1397), 158 states have call successors, (158), 94 states have call predecessors, (158), 105 states have return successors, (222), 150 states have call predecessors, (222), 156 states have call successors, (222) [2022-11-20 09:27:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1777 transitions. [2022-11-20 09:27:23,677 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1777 transitions. Word has length 65 [2022-11-20 09:27:23,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:23,678 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1777 transitions. [2022-11-20 09:27:23,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 09:27:23,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1777 transitions. [2022-11-20 09:27:23,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 09:27:23,680 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:23,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:23,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 09:27:23,681 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:23,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:23,681 INFO L85 PathProgramCache]: Analyzing trace with hash -239349141, now seen corresponding path program 1 times [2022-11-20 09:27:23,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:23,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133239437] [2022-11-20 09:27:23,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:23,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:27:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 09:27:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 09:27:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 09:27:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:23,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:23,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133239437] [2022-11-20 09:27:23,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133239437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:23,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:23,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 09:27:23,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120315131] [2022-11-20 09:27:23,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:23,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:27:23,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:23,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:27:23,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:27:23,901 INFO L87 Difference]: Start difference. First operand 1282 states and 1777 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-20 09:27:24,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:24,778 INFO L93 Difference]: Finished difference Result 1583 states and 2191 transitions. [2022-11-20 09:27:24,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 09:27:24,779 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-11-20 09:27:24,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:24,785 INFO L225 Difference]: With dead ends: 1583 [2022-11-20 09:27:24,785 INFO L226 Difference]: Without dead ends: 1316 [2022-11-20 09:27:24,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-20 09:27:24,788 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 312 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:24,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 991 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 09:27:24,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2022-11-20 09:27:24,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1287. [2022-11-20 09:27:24,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1021 states have (on average 1.3702252693437806) internal successors, (1399), 1046 states have internal predecessors, (1399), 158 states have call successors, (158), 94 states have call predecessors, (158), 106 states have return successors, (223), 151 states have call predecessors, (223), 156 states have call successors, (223) [2022-11-20 09:27:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1780 transitions. [2022-11-20 09:27:24,985 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1780 transitions. Word has length 65 [2022-11-20 09:27:24,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:24,988 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 1780 transitions. [2022-11-20 09:27:24,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-20 09:27:24,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1780 transitions. [2022-11-20 09:27:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 09:27:24,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:24,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:24,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 09:27:24,994 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:24,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:24,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1268708439, now seen corresponding path program 1 times [2022-11-20 09:27:24,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:24,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169980628] [2022-11-20 09:27:24,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:24,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:25,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:27:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:25,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 09:27:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:25,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:25,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:25,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:25,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 09:27:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:25,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 09:27:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:25,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:25,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:25,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169980628] [2022-11-20 09:27:25,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169980628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:25,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:25,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 09:27:25,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999188022] [2022-11-20 09:27:25,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:25,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:27:25,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:25,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:27:25,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:27:25,196 INFO L87 Difference]: Start difference. First operand 1287 states and 1780 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-20 09:27:27,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:27,634 INFO L93 Difference]: Finished difference Result 2949 states and 4052 transitions. [2022-11-20 09:27:27,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-20 09:27:27,635 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2022-11-20 09:27:27,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:27,648 INFO L225 Difference]: With dead ends: 2949 [2022-11-20 09:27:27,648 INFO L226 Difference]: Without dead ends: 2677 [2022-11-20 09:27:27,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-11-20 09:27:27,653 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 1369 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:27,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1386 Valid, 1305 Invalid, 1791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-20 09:27:27,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2022-11-20 09:27:27,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 2427. [2022-11-20 09:27:27,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 1921 states have (on average 1.3430504945340969) internal successors, (2580), 1966 states have internal predecessors, (2580), 275 states have call successors, (275), 196 states have call predecessors, (275), 229 states have return successors, (409), 269 states have call predecessors, (409), 273 states have call successors, (409) [2022-11-20 09:27:27,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 3264 transitions. [2022-11-20 09:27:27,949 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 3264 transitions. Word has length 65 [2022-11-20 09:27:27,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:27,949 INFO L495 AbstractCegarLoop]: Abstraction has 2427 states and 3264 transitions. [2022-11-20 09:27:27,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-20 09:27:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 3264 transitions. [2022-11-20 09:27:27,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 09:27:27,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:27,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:27,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 09:27:27,952 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:27,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:27,953 INFO L85 PathProgramCache]: Analyzing trace with hash -217259350, now seen corresponding path program 1 times [2022-11-20 09:27:27,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:27,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897463721] [2022-11-20 09:27:27,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:27,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:27,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:27:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:27,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 09:27:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 09:27:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 09:27:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:28,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:28,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897463721] [2022-11-20 09:27:28,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897463721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:28,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:28,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 09:27:28,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026987921] [2022-11-20 09:27:28,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:28,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:27:28,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:28,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:27:28,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:27:28,084 INFO L87 Difference]: Start difference. First operand 2427 states and 3264 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-20 09:27:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:29,112 INFO L93 Difference]: Finished difference Result 4028 states and 5388 transitions. [2022-11-20 09:27:29,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 09:27:29,113 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-11-20 09:27:29,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:29,127 INFO L225 Difference]: With dead ends: 4028 [2022-11-20 09:27:29,127 INFO L226 Difference]: Without dead ends: 2616 [2022-11-20 09:27:29,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-20 09:27:29,132 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 212 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:29,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1107 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 09:27:29,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2022-11-20 09:27:29,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 2472. [2022-11-20 09:27:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 1957 states have (on average 1.3321410321921308) internal successors, (2607), 2002 states have internal predecessors, (2607), 275 states have call successors, (275), 196 states have call predecessors, (275), 238 states have return successors, (421), 278 states have call predecessors, (421), 273 states have call successors, (421) [2022-11-20 09:27:29,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3303 transitions. [2022-11-20 09:27:29,445 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3303 transitions. Word has length 65 [2022-11-20 09:27:29,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:29,445 INFO L495 AbstractCegarLoop]: Abstraction has 2472 states and 3303 transitions. [2022-11-20 09:27:29,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-20 09:27:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3303 transitions. [2022-11-20 09:27:29,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 09:27:29,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:29,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:29,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 09:27:29,448 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:29,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:29,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1168944044, now seen corresponding path program 1 times [2022-11-20 09:27:29,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:29,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477808447] [2022-11-20 09:27:29,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:29,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:29,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:27:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:29,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 09:27:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:29,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:29,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:29,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:29,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 09:27:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:29,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 09:27:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:29,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:29,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477808447] [2022-11-20 09:27:29,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477808447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:29,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:29,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 09:27:29,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261029351] [2022-11-20 09:27:29,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:29,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:27:29,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:29,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:27:29,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:27:29,611 INFO L87 Difference]: Start difference. First operand 2472 states and 3303 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 09:27:30,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:30,707 INFO L93 Difference]: Finished difference Result 3907 states and 5142 transitions. [2022-11-20 09:27:30,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 09:27:30,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-20 09:27:30,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:30,720 INFO L225 Difference]: With dead ends: 3907 [2022-11-20 09:27:30,720 INFO L226 Difference]: Without dead ends: 2670 [2022-11-20 09:27:30,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-11-20 09:27:30,725 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 685 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:30,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 702 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-20 09:27:30,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2022-11-20 09:27:31,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2450. [2022-11-20 09:27:31,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 1943 states have (on average 1.3293875450334534) internal successors, (2583), 1982 states have internal predecessors, (2583), 275 states have call successors, (275), 196 states have call predecessors, (275), 230 states have return successors, (405), 276 states have call predecessors, (405), 273 states have call successors, (405) [2022-11-20 09:27:31,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3263 transitions. [2022-11-20 09:27:31,024 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3263 transitions. Word has length 65 [2022-11-20 09:27:31,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:31,025 INFO L495 AbstractCegarLoop]: Abstraction has 2450 states and 3263 transitions. [2022-11-20 09:27:31,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 09:27:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3263 transitions. [2022-11-20 09:27:31,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-20 09:27:31,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:31,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:31,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 09:27:31,028 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:31,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:31,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1034930538, now seen corresponding path program 1 times [2022-11-20 09:27:31,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:31,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500882374] [2022-11-20 09:27:31,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:31,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:31,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:27:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:31,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 09:27:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:31,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:31,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:31,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:31,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 09:27:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:31,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 09:27:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:31,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:31,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:31,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500882374] [2022-11-20 09:27:31,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500882374] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:31,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:31,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:27:31,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799193528] [2022-11-20 09:27:31,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:31,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:27:31,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:31,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:27:31,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:31,126 INFO L87 Difference]: Start difference. First operand 2450 states and 3263 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 09:27:32,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:32,081 INFO L93 Difference]: Finished difference Result 5525 states and 7242 transitions. [2022-11-20 09:27:32,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 09:27:32,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-20 09:27:32,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:32,101 INFO L225 Difference]: With dead ends: 5525 [2022-11-20 09:27:32,102 INFO L226 Difference]: Without dead ends: 4093 [2022-11-20 09:27:32,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-20 09:27:32,108 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 659 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:32,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 566 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:27:32,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4093 states. [2022-11-20 09:27:32,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4093 to 3821. [2022-11-20 09:27:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3821 states, 3009 states have (on average 1.296111665004985) internal successors, (3900), 3069 states have internal predecessors, (3900), 427 states have call successors, (427), 319 states have call predecessors, (427), 383 states have return successors, (677), 440 states have call predecessors, (677), 425 states have call successors, (677) [2022-11-20 09:27:32,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 5004 transitions. [2022-11-20 09:27:32,580 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 5004 transitions. Word has length 65 [2022-11-20 09:27:32,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:32,581 INFO L495 AbstractCegarLoop]: Abstraction has 3821 states and 5004 transitions. [2022-11-20 09:27:32,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-20 09:27:32,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 5004 transitions. [2022-11-20 09:27:32,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-20 09:27:32,584 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:32,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:32,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 09:27:32,584 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:32,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:32,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1593552473, now seen corresponding path program 1 times [2022-11-20 09:27:32,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:32,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996586134] [2022-11-20 09:27:32,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:32,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:27:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 09:27:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 09:27:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 09:27:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:32,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:32,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996586134] [2022-11-20 09:27:32,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996586134] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:32,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:32,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:27:32,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642589020] [2022-11-20 09:27:32,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:32,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:27:32,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:32,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:27:32,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:27:32,678 INFO L87 Difference]: Start difference. First operand 3821 states and 5004 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-20 09:27:33,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:33,829 INFO L93 Difference]: Finished difference Result 8839 states and 11518 transitions. [2022-11-20 09:27:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 09:27:33,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-11-20 09:27:33,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:33,862 INFO L225 Difference]: With dead ends: 8839 [2022-11-20 09:27:33,862 INFO L226 Difference]: Without dead ends: 6015 [2022-11-20 09:27:33,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-20 09:27:33,871 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 388 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:33,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 678 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 09:27:33,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6015 states. [2022-11-20 09:27:34,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6015 to 5499. [2022-11-20 09:27:34,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5499 states, 4294 states have (on average 1.2808570097810899) internal successors, (5500), 4361 states have internal predecessors, (5500), 621 states have call successors, (621), 493 states have call predecessors, (621), 582 states have return successors, (998), 652 states have call predecessors, (998), 619 states have call successors, (998) [2022-11-20 09:27:34,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5499 states to 5499 states and 7119 transitions. [2022-11-20 09:27:34,639 INFO L78 Accepts]: Start accepts. Automaton has 5499 states and 7119 transitions. Word has length 66 [2022-11-20 09:27:34,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:34,640 INFO L495 AbstractCegarLoop]: Abstraction has 5499 states and 7119 transitions. [2022-11-20 09:27:34,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-20 09:27:34,640 INFO L276 IsEmpty]: Start isEmpty. Operand 5499 states and 7119 transitions. [2022-11-20 09:27:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-20 09:27:34,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:34,643 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:34,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 09:27:34,643 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:34,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:34,644 INFO L85 PathProgramCache]: Analyzing trace with hash -455119352, now seen corresponding path program 1 times [2022-11-20 09:27:34,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:34,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438585776] [2022-11-20 09:27:34,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:34,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:27:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 09:27:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 09:27:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 09:27:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:34,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:34,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438585776] [2022-11-20 09:27:34,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438585776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:34,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:34,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:27:34,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424893632] [2022-11-20 09:27:34,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:34,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:27:34,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:34,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:27:34,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:34,732 INFO L87 Difference]: Start difference. First operand 5499 states and 7119 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-20 09:27:36,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:36,240 INFO L93 Difference]: Finished difference Result 7129 states and 9121 transitions. [2022-11-20 09:27:36,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 09:27:36,241 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2022-11-20 09:27:36,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:36,280 INFO L225 Difference]: With dead ends: 7129 [2022-11-20 09:27:36,280 INFO L226 Difference]: Without dead ends: 7126 [2022-11-20 09:27:36,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-11-20 09:27:36,284 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 932 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:36,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 464 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 09:27:36,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7126 states. [2022-11-20 09:27:37,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7126 to 6553. [2022-11-20 09:27:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6553 states, 5097 states have (on average 1.2693741416519522) internal successors, (6470), 5173 states have internal predecessors, (6470), 747 states have call successors, (747), 607 states have call predecessors, (747), 707 states have return successors, (1191), 780 states have call predecessors, (1191), 746 states have call successors, (1191) [2022-11-20 09:27:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6553 states to 6553 states and 8408 transitions. [2022-11-20 09:27:37,348 INFO L78 Accepts]: Start accepts. Automaton has 6553 states and 8408 transitions. Word has length 73 [2022-11-20 09:27:37,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:37,348 INFO L495 AbstractCegarLoop]: Abstraction has 6553 states and 8408 transitions. [2022-11-20 09:27:37,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-20 09:27:37,350 INFO L276 IsEmpty]: Start isEmpty. Operand 6553 states and 8408 transitions. [2022-11-20 09:27:37,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-20 09:27:37,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:37,353 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:37,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 09:27:37,354 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:37,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:37,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1224424688, now seen corresponding path program 1 times [2022-11-20 09:27:37,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:37,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003235228] [2022-11-20 09:27:37,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:37,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:27:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 09:27:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 09:27:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 09:27:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:37,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:37,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003235228] [2022-11-20 09:27:37,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003235228] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:27:37,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966029480] [2022-11-20 09:27:37,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:37,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:37,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:37,550 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:27:37,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 09:27:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 09:27:37,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:38,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:38,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:27:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:38,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966029480] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:27:38,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:27:38,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-11-20 09:27:38,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418341654] [2022-11-20 09:27:38,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:27:38,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 09:27:38,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:38,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 09:27:38,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:27:38,330 INFO L87 Difference]: Start difference. First operand 6553 states and 8408 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-20 09:27:41,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:41,643 INFO L93 Difference]: Finished difference Result 14199 states and 17936 transitions. [2022-11-20 09:27:41,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-20 09:27:41,671 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-11-20 09:27:41,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:41,744 INFO L225 Difference]: With dead ends: 14199 [2022-11-20 09:27:41,744 INFO L226 Difference]: Without dead ends: 14196 [2022-11-20 09:27:41,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-11-20 09:27:41,750 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 1243 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1301 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:41,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1301 Valid, 1094 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-20 09:27:41,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14196 states. [2022-11-20 09:27:43,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14196 to 11811. [2022-11-20 09:27:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11811 states, 9189 states have (on average 1.2600935901621504) internal successors, (11579), 9317 states have internal predecessors, (11579), 1313 states have call successors, (1313), 1097 states have call predecessors, (1313), 1307 states have return successors, (2130), 1404 states have call predecessors, (2130), 1312 states have call successors, (2130) [2022-11-20 09:27:43,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11811 states to 11811 states and 15022 transitions. [2022-11-20 09:27:43,362 INFO L78 Accepts]: Start accepts. Automaton has 11811 states and 15022 transitions. Word has length 74 [2022-11-20 09:27:43,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:43,367 INFO L495 AbstractCegarLoop]: Abstraction has 11811 states and 15022 transitions. [2022-11-20 09:27:43,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-11-20 09:27:43,367 INFO L276 IsEmpty]: Start isEmpty. Operand 11811 states and 15022 transitions. [2022-11-20 09:27:43,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-20 09:27:43,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:43,375 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:43,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 09:27:43,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 09:27:43,576 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:43,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:43,576 INFO L85 PathProgramCache]: Analyzing trace with hash -499209592, now seen corresponding path program 2 times [2022-11-20 09:27:43,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:43,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492561574] [2022-11-20 09:27:43,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:43,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:43,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:27:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:43,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 09:27:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:43,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:43,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:43,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:43,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 09:27:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:43,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 09:27:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:43,656 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:43,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:43,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492561574] [2022-11-20 09:27:43,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492561574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:43,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:43,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:27:43,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443686716] [2022-11-20 09:27:43,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:43,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:27:43,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:43,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:27:43,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:27:43,659 INFO L87 Difference]: Start difference. First operand 11811 states and 15022 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-20 09:27:45,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:45,258 INFO L93 Difference]: Finished difference Result 18354 states and 23364 transitions. [2022-11-20 09:27:45,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:27:45,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2022-11-20 09:27:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:45,304 INFO L225 Difference]: With dead ends: 18354 [2022-11-20 09:27:45,305 INFO L226 Difference]: Without dead ends: 8416 [2022-11-20 09:27:45,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:27:45,335 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 432 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:45,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 671 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 09:27:45,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8416 states. [2022-11-20 09:27:46,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8416 to 7864. [2022-11-20 09:27:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7864 states, 6136 states have (on average 1.2416883963494132) internal successors, (7619), 6220 states have internal predecessors, (7619), 880 states have call successors, (880), 721 states have call predecessors, (880), 846 states have return successors, (1349), 930 states have call predecessors, (1349), 879 states have call successors, (1349) [2022-11-20 09:27:46,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7864 states to 7864 states and 9848 transitions. [2022-11-20 09:27:46,554 INFO L78 Accepts]: Start accepts. Automaton has 7864 states and 9848 transitions. Word has length 77 [2022-11-20 09:27:46,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:46,554 INFO L495 AbstractCegarLoop]: Abstraction has 7864 states and 9848 transitions. [2022-11-20 09:27:46,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-20 09:27:46,555 INFO L276 IsEmpty]: Start isEmpty. Operand 7864 states and 9848 transitions. [2022-11-20 09:27:46,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-20 09:27:46,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:46,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:46,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 09:27:46,561 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:46,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:46,561 INFO L85 PathProgramCache]: Analyzing trace with hash 867535010, now seen corresponding path program 1 times [2022-11-20 09:27:46,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:46,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077186250] [2022-11-20 09:27:46,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:46,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:46,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:27:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:46,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 09:27:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:46,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:46,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:46,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:46,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 09:27:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:46,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 09:27:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:46,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 09:27:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 09:27:46,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:46,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077186250] [2022-11-20 09:27:46,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077186250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:46,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:46,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 09:27:46,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912728819] [2022-11-20 09:27:46,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:46,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:27:46,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:46,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:27:46,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:27:46,718 INFO L87 Difference]: Start difference. First operand 7864 states and 9848 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-20 09:27:49,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:49,700 INFO L93 Difference]: Finished difference Result 21738 states and 27065 transitions. [2022-11-20 09:27:49,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 09:27:49,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-11-20 09:27:49,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:49,764 INFO L225 Difference]: With dead ends: 21738 [2022-11-20 09:27:49,764 INFO L226 Difference]: Without dead ends: 14895 [2022-11-20 09:27:49,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-11-20 09:27:49,783 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 775 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:49,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 937 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 09:27:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14895 states. [2022-11-20 09:27:52,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14895 to 14036. [2022-11-20 09:27:52,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14036 states, 10812 states have (on average 1.212171661117277) internal successors, (13106), 11002 states have internal predecessors, (13106), 1596 states have call successors, (1596), 1325 states have call predecessors, (1596), 1626 states have return successors, (2752), 1722 states have call predecessors, (2752), 1595 states have call successors, (2752) [2022-11-20 09:27:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14036 states to 14036 states and 17454 transitions. [2022-11-20 09:27:52,139 INFO L78 Accepts]: Start accepts. Automaton has 14036 states and 17454 transitions. Word has length 84 [2022-11-20 09:27:52,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:52,140 INFO L495 AbstractCegarLoop]: Abstraction has 14036 states and 17454 transitions. [2022-11-20 09:27:52,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-20 09:27:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 14036 states and 17454 transitions. [2022-11-20 09:27:52,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-20 09:27:52,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:52,148 INFO L195 NwaCegarLoop]: 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] [2022-11-20 09:27:52,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 09:27:52,148 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:52,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:52,149 INFO L85 PathProgramCache]: Analyzing trace with hash 260386383, now seen corresponding path program 1 times [2022-11-20 09:27:52,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:52,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473597249] [2022-11-20 09:27:52,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:52,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:52,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:27:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:52,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 09:27:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:52,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:27:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:52,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 09:27:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:52,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 09:27:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:52,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 09:27:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:52,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:27:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:52,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 09:27:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-20 09:27:52,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:52,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473597249] [2022-11-20 09:27:52,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473597249] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:27:52,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666512342] [2022-11-20 09:27:52,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:52,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:27:52,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:52,268 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:27:52,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 09:27:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:52,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 09:27:52,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:27:52,393 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 09:27:52,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:27:52,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666512342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:52,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:27:52,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-20 09:27:52,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814935575] [2022-11-20 09:27:52,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:52,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:52,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:52,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:52,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:27:52,396 INFO L87 Difference]: Start difference. First operand 14036 states and 17454 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 09:27:54,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:54,266 INFO L93 Difference]: Finished difference Result 15912 states and 20081 transitions. [2022-11-20 09:27:54,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:54,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2022-11-20 09:27:54,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:54,320 INFO L225 Difference]: With dead ends: 15912 [2022-11-20 09:27:54,321 INFO L226 Difference]: Without dead ends: 14282 [2022-11-20 09:27:54,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:27:54,332 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 113 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:54,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 624 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 09:27:54,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14282 states. [2022-11-20 09:27:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14282 to 14282. [2022-11-20 09:27:55,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14282 states, 11010 states have (on average 1.2143505903723888) internal successors, (13370), 11202 states have internal predecessors, (13370), 1624 states have call successors, (1624), 1343 states have call predecessors, (1624), 1646 states have return successors, (2794), 1750 states have call predecessors, (2794), 1623 states have call successors, (2794) [2022-11-20 09:27:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14282 states to 14282 states and 17788 transitions. [2022-11-20 09:27:55,716 INFO L78 Accepts]: Start accepts. Automaton has 14282 states and 17788 transitions. Word has length 92 [2022-11-20 09:27:55,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:55,716 INFO L495 AbstractCegarLoop]: Abstraction has 14282 states and 17788 transitions. [2022-11-20 09:27:55,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 09:27:55,717 INFO L276 IsEmpty]: Start isEmpty. Operand 14282 states and 17788 transitions. [2022-11-20 09:27:55,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-20 09:27:55,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:55,725 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:55,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 09:27:55,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 09:27:55,930 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:27:55,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:55,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1083636890, now seen corresponding path program 1 times [2022-11-20 09:27:55,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:55,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227259425] [2022-11-20 09:27:55,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:55,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:56,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:27:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:56,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 09:27:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:56,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:27:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:56,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:27:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:56,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:27:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:56,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 09:27:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:56,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 09:27:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:56,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-20 09:27:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:56,085 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 09:27:56,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:56,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227259425] [2022-11-20 09:27:56,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227259425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:56,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:56,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 09:27:56,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864694187] [2022-11-20 09:27:56,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:56,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:27:56,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:56,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:27:56,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:27:56,089 INFO L87 Difference]: Start difference. First operand 14282 states and 17788 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-20 09:27:59,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:59,116 INFO L93 Difference]: Finished difference Result 25156 states and 31107 transitions. [2022-11-20 09:27:59,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 09:27:59,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2022-11-20 09:27:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:59,172 INFO L225 Difference]: With dead ends: 25156 [2022-11-20 09:27:59,173 INFO L226 Difference]: Without dead ends: 12757 [2022-11-20 09:27:59,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-11-20 09:27:59,208 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 1538 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:59,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 805 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 09:27:59,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12757 states. [2022-11-20 09:28:00,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12757 to 11857. [2022-11-20 09:28:00,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11857 states, 9176 states have (on average 1.207606800348736) internal successors, (11081), 9335 states have internal predecessors, (11081), 1325 states have call successors, (1325), 1092 states have call predecessors, (1325), 1354 states have return successors, (2126), 1440 states have call predecessors, (2126), 1324 states have call successors, (2126) [2022-11-20 09:28:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11857 states to 11857 states and 14532 transitions. [2022-11-20 09:28:00,923 INFO L78 Accepts]: Start accepts. Automaton has 11857 states and 14532 transitions. Word has length 93 [2022-11-20 09:28:00,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:00,924 INFO L495 AbstractCegarLoop]: Abstraction has 11857 states and 14532 transitions. [2022-11-20 09:28:00,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-20 09:28:00,924 INFO L276 IsEmpty]: Start isEmpty. Operand 11857 states and 14532 transitions. [2022-11-20 09:28:00,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-20 09:28:00,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:00,935 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-20 09:28:00,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 09:28:00,936 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:00,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:00,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1789084765, now seen corresponding path program 1 times [2022-11-20 09:28:00,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:00,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954748569] [2022-11-20 09:28:00,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:00,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:00,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:28:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:00,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 09:28:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:01,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:28:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:01,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 09:28:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:01,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 09:28:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:01,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 09:28:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:01,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:28:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:01,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-20 09:28:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:01,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:28:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:01,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-20 09:28:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:01,067 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-20 09:28:01,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:01,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954748569] [2022-11-20 09:28:01,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954748569] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:28:01,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220936843] [2022-11-20 09:28:01,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:01,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:01,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:28:01,069 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:28:01,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 09:28:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:01,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 09:28:01,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-20 09:28:01,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:01,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220936843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:01,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:28:01,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-11-20 09:28:01,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131076743] [2022-11-20 09:28:01,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:01,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:28:01,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:01,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:28:01,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:28:01,337 INFO L87 Difference]: Start difference. First operand 11857 states and 14532 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 09:28:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:02,513 INFO L93 Difference]: Finished difference Result 13574 states and 16943 transitions. [2022-11-20 09:28:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:28:02,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 118 [2022-11-20 09:28:02,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:02,557 INFO L225 Difference]: With dead ends: 13574 [2022-11-20 09:28:02,557 INFO L226 Difference]: Without dead ends: 12576 [2022-11-20 09:28:02,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:28:02,565 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 196 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:02,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 406 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 09:28:02,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12576 states. [2022-11-20 09:28:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12576 to 12550. [2022-11-20 09:28:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12550 states, 9734 states have (on average 1.216046846106431) internal successors, (11837), 9902 states have internal predecessors, (11837), 1403 states have call successors, (1403), 1143 states have call predecessors, (1403), 1411 states have return successors, (2230), 1515 states have call predecessors, (2230), 1402 states have call successors, (2230) [2022-11-20 09:28:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12550 states to 12550 states and 15470 transitions. [2022-11-20 09:28:03,996 INFO L78 Accepts]: Start accepts. Automaton has 12550 states and 15470 transitions. Word has length 118 [2022-11-20 09:28:03,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:03,997 INFO L495 AbstractCegarLoop]: Abstraction has 12550 states and 15470 transitions. [2022-11-20 09:28:03,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-20 09:28:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand 12550 states and 15470 transitions. [2022-11-20 09:28:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-20 09:28:04,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:04,012 INFO L195 NwaCegarLoop]: 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] [2022-11-20 09:28:04,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:04,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:04,218 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:04,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:04,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2070810004, now seen corresponding path program 1 times [2022-11-20 09:28:04,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:04,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414606679] [2022-11-20 09:28:04,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:04,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:04,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:28:04,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:04,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 09:28:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:04,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:28:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:04,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 09:28:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:04,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 09:28:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:04,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 09:28:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:04,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 09:28:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:04,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:28:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:04,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 09:28:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:04,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:28:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:04,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-20 09:28:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-11-20 09:28:04,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:04,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414606679] [2022-11-20 09:28:04,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414606679] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:28:04,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242519977] [2022-11-20 09:28:04,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:04,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:04,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:28:04,367 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:28:04,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 09:28:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:04,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 09:28:04,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 09:28:04,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:04,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242519977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:04,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:28:04,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-20 09:28:04,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020559920] [2022-11-20 09:28:04,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:04,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:28:04,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:04,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:28:04,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:28:04,522 INFO L87 Difference]: Start difference. First operand 12550 states and 15470 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 09:28:05,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:05,941 INFO L93 Difference]: Finished difference Result 14780 states and 18580 transitions. [2022-11-20 09:28:05,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:28:05,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 134 [2022-11-20 09:28:05,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:05,977 INFO L225 Difference]: With dead ends: 14780 [2022-11-20 09:28:05,978 INFO L226 Difference]: Without dead ends: 12856 [2022-11-20 09:28:05,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:28:05,987 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 247 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:05,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 294 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 09:28:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12856 states. [2022-11-20 09:28:07,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12856 to 12790. [2022-11-20 09:28:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12790 states, 9953 states have (on average 1.2065708831508088) internal successors, (12009), 10118 states have internal predecessors, (12009), 1403 states have call successors, (1403), 1161 states have call predecessors, (1403), 1432 states have return successors, (2224), 1521 states have call predecessors, (2224), 1402 states have call successors, (2224) [2022-11-20 09:28:07,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12790 states to 12790 states and 15636 transitions. [2022-11-20 09:28:07,669 INFO L78 Accepts]: Start accepts. Automaton has 12790 states and 15636 transitions. Word has length 134 [2022-11-20 09:28:07,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:07,669 INFO L495 AbstractCegarLoop]: Abstraction has 12790 states and 15636 transitions. [2022-11-20 09:28:07,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-20 09:28:07,670 INFO L276 IsEmpty]: Start isEmpty. Operand 12790 states and 15636 transitions. [2022-11-20 09:28:07,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-20 09:28:07,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:07,682 INFO L195 NwaCegarLoop]: 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] [2022-11-20 09:28:07,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-20 09:28:07,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:07,888 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:07,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:07,888 INFO L85 PathProgramCache]: Analyzing trace with hash -931525195, now seen corresponding path program 1 times [2022-11-20 09:28:07,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:07,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097723869] [2022-11-20 09:28:07,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:07,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:07,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:28:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:07,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 09:28:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:07,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:28:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:08,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 09:28:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:08,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 09:28:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:08,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-20 09:28:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:08,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 09:28:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:08,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:28:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:08,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 09:28:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:08,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:28:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:08,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-20 09:28:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:08,044 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-11-20 09:28:08,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:08,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097723869] [2022-11-20 09:28:08,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097723869] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:28:08,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472008533] [2022-11-20 09:28:08,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:08,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:08,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:28:08,047 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:28:08,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 09:28:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:08,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 09:28:08,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-20 09:28:08,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:08,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472008533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:08,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:28:08,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-20 09:28:08,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528709131] [2022-11-20 09:28:08,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:08,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:28:08,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:08,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:28:08,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:28:08,194 INFO L87 Difference]: Start difference. First operand 12790 states and 15636 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-20 09:28:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:10,051 INFO L93 Difference]: Finished difference Result 15003 states and 18535 transitions. [2022-11-20 09:28:10,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:28:10,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 134 [2022-11-20 09:28:10,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:10,088 INFO L225 Difference]: With dead ends: 15003 [2022-11-20 09:28:10,088 INFO L226 Difference]: Without dead ends: 12841 [2022-11-20 09:28:10,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:28:10,098 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 247 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:10,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 405 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 09:28:10,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12841 states. [2022-11-20 09:28:12,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12841 to 12772. [2022-11-20 09:28:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12772 states, 9935 states have (on average 1.2015098137896325) internal successors, (11937), 10100 states have internal predecessors, (11937), 1403 states have call successors, (1403), 1161 states have call predecessors, (1403), 1432 states have return successors, (2224), 1521 states have call predecessors, (2224), 1402 states have call successors, (2224) [2022-11-20 09:28:12,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12772 states to 12772 states and 15564 transitions. [2022-11-20 09:28:12,180 INFO L78 Accepts]: Start accepts. Automaton has 12772 states and 15564 transitions. Word has length 134 [2022-11-20 09:28:12,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:12,180 INFO L495 AbstractCegarLoop]: Abstraction has 12772 states and 15564 transitions. [2022-11-20 09:28:12,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-20 09:28:12,180 INFO L276 IsEmpty]: Start isEmpty. Operand 12772 states and 15564 transitions. [2022-11-20 09:28:12,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-20 09:28:12,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:12,192 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:12,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:12,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-20 09:28:12,399 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:12,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:12,399 INFO L85 PathProgramCache]: Analyzing trace with hash -564892461, now seen corresponding path program 1 times [2022-11-20 09:28:12,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:12,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822893797] [2022-11-20 09:28:12,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:12,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:12,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:28:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:12,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 09:28:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:12,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:28:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:12,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 09:28:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:12,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 09:28:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:12,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 09:28:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:12,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 09:28:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:12,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:28:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:12,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-20 09:28:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:12,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:28:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:12,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-20 09:28:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:12,550 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-20 09:28:12,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:12,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822893797] [2022-11-20 09:28:12,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822893797] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:28:12,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193354233] [2022-11-20 09:28:12,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:12,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:12,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:28:12,556 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:28:12,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 09:28:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:12,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 09:28:12,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-20 09:28:12,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:12,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193354233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:12,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:28:12,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-20 09:28:12,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17435940] [2022-11-20 09:28:12,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:12,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:28:12,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:12,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:28:12,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:28:12,768 INFO L87 Difference]: Start difference. First operand 12772 states and 15564 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) [2022-11-20 09:28:13,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:13,960 INFO L93 Difference]: Finished difference Result 13697 states and 16818 transitions. [2022-11-20 09:28:13,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:28:13,960 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 [2022-11-20 09:28:13,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:13,993 INFO L225 Difference]: With dead ends: 13697 [2022-11-20 09:28:13,993 INFO L226 Difference]: Without dead ends: 12606 [2022-11-20 09:28:14,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:28:14,000 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 75 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:14,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 623 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 09:28:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12606 states. [2022-11-20 09:28:15,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12606 to 12568. [2022-11-20 09:28:15,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12568 states, 9773 states have (on average 1.1971758927657832) internal successors, (11700), 9936 states have internal predecessors, (11700), 1381 states have call successors, (1381), 1146 states have call predecessors, (1381), 1412 states have return successors, (2184), 1496 states have call predecessors, (2184), 1380 states have call successors, (2184) [2022-11-20 09:28:15,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12568 states to 12568 states and 15265 transitions. [2022-11-20 09:28:15,533 INFO L78 Accepts]: Start accepts. Automaton has 12568 states and 15265 transitions. Word has length 135 [2022-11-20 09:28:15,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:15,534 INFO L495 AbstractCegarLoop]: Abstraction has 12568 states and 15265 transitions. [2022-11-20 09:28:15,534 INFO L496 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) [2022-11-20 09:28:15,534 INFO L276 IsEmpty]: Start isEmpty. Operand 12568 states and 15265 transitions. [2022-11-20 09:28:15,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-20 09:28:15,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:15,544 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:15,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:15,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-20 09:28:15,750 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:15,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:15,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1386105035, now seen corresponding path program 1 times [2022-11-20 09:28:15,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:15,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342604821] [2022-11-20 09:28:15,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:15,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:15,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:28:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:15,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 09:28:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:15,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:28:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:15,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 09:28:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:15,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 09:28:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:15,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 09:28:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:15,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 09:28:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:15,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:28:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:15,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-20 09:28:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:15,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:28:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:15,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-20 09:28:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-20 09:28:15,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:15,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342604821] [2022-11-20 09:28:15,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342604821] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:28:15,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294793171] [2022-11-20 09:28:15,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:15,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:15,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:28:15,896 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:28:15,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 09:28:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:16,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 09:28:16,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-20 09:28:16,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:16,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294793171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:16,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:28:16,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-20 09:28:16,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980148366] [2022-11-20 09:28:16,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:16,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:28:16,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:16,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:28:16,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:28:16,111 INFO L87 Difference]: Start difference. First operand 12568 states and 15265 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 09:28:17,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:17,719 INFO L93 Difference]: Finished difference Result 13904 states and 16977 transitions. [2022-11-20 09:28:17,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:28:17,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-11-20 09:28:17,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:17,746 INFO L225 Difference]: With dead ends: 13904 [2022-11-20 09:28:17,746 INFO L226 Difference]: Without dead ends: 12561 [2022-11-20 09:28:17,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-20 09:28:17,753 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 300 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:17,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 394 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:28:17,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12561 states. [2022-11-20 09:28:18,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12561 to 12002. [2022-11-20 09:28:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12002 states, 9315 states have (on average 1.191196994095545) internal successors, (11096), 9468 states have internal predecessors, (11096), 1323 states have call successors, (1323), 1103 states have call predecessors, (1323), 1362 states have return successors, (2092), 1440 states have call predecessors, (2092), 1322 states have call successors, (2092) [2022-11-20 09:28:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12002 states to 12002 states and 14511 transitions. [2022-11-20 09:28:19,028 INFO L78 Accepts]: Start accepts. Automaton has 12002 states and 14511 transitions. Word has length 136 [2022-11-20 09:28:19,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:19,028 INFO L495 AbstractCegarLoop]: Abstraction has 12002 states and 14511 transitions. [2022-11-20 09:28:19,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 09:28:19,029 INFO L276 IsEmpty]: Start isEmpty. Operand 12002 states and 14511 transitions. [2022-11-20 09:28:19,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-20 09:28:19,039 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:19,039 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:19,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:19,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:19,246 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:19,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:19,246 INFO L85 PathProgramCache]: Analyzing trace with hash 78962637, now seen corresponding path program 1 times [2022-11-20 09:28:19,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:19,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554893294] [2022-11-20 09:28:19,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:19,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:19,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:28:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:19,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 09:28:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:19,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:28:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:19,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 09:28:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:19,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 09:28:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:19,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 09:28:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:19,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 09:28:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:19,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:28:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:19,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-20 09:28:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:19,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:28:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:19,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-20 09:28:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:19,387 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-20 09:28:19,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:19,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554893294] [2022-11-20 09:28:19,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554893294] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:28:19,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164822616] [2022-11-20 09:28:19,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:19,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:19,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:28:19,389 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:28:19,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 09:28:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:19,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 09:28:19,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-20 09:28:19,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:19,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164822616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:19,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:28:19,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-20 09:28:19,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702865562] [2022-11-20 09:28:19,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:19,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:28:19,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:19,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:28:19,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:28:19,616 INFO L87 Difference]: Start difference. First operand 12002 states and 14511 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 09:28:21,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:21,102 INFO L93 Difference]: Finished difference Result 13122 states and 15882 transitions. [2022-11-20 09:28:21,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:28:21,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-11-20 09:28:21,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:21,124 INFO L225 Difference]: With dead ends: 13122 [2022-11-20 09:28:21,124 INFO L226 Difference]: Without dead ends: 11748 [2022-11-20 09:28:21,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-20 09:28:21,130 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 322 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:21,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 390 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:28:21,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11748 states. [2022-11-20 09:28:22,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11748 to 11726. [2022-11-20 09:28:22,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11726 states, 9097 states have (on average 1.1854457513465977) internal successors, (10784), 9246 states have internal predecessors, (10784), 1285 states have call successors, (1285), 1081 states have call predecessors, (1285), 1342 states have return successors, (2043), 1408 states have call predecessors, (2043), 1284 states have call successors, (2043) [2022-11-20 09:28:22,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11726 states to 11726 states and 14112 transitions. [2022-11-20 09:28:22,288 INFO L78 Accepts]: Start accepts. Automaton has 11726 states and 14112 transitions. Word has length 136 [2022-11-20 09:28:22,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:22,288 INFO L495 AbstractCegarLoop]: Abstraction has 11726 states and 14112 transitions. [2022-11-20 09:28:22,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 09:28:22,288 INFO L276 IsEmpty]: Start isEmpty. Operand 11726 states and 14112 transitions. [2022-11-20 09:28:22,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-20 09:28:22,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:22,294 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:22,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:22,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-20 09:28:22,495 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:22,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:22,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1976459403, now seen corresponding path program 1 times [2022-11-20 09:28:22,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:22,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126638755] [2022-11-20 09:28:22,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:22,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:22,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:28:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:22,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 09:28:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:22,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:28:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:22,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 09:28:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:22,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 09:28:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:22,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 09:28:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:22,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 09:28:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:22,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:28:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:22,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-20 09:28:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:22,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:28:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:22,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-20 09:28:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:22,623 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-20 09:28:22,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:22,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126638755] [2022-11-20 09:28:22,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126638755] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:28:22,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900723666] [2022-11-20 09:28:22,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:22,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:22,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:28:22,625 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:28:22,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 09:28:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:22,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:28:22,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-20 09:28:22,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:22,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900723666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:22,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:28:22,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-20 09:28:22,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042473089] [2022-11-20 09:28:22,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:22,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:28:22,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:22,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:28:22,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:28:22,798 INFO L87 Difference]: Start difference. First operand 11726 states and 14112 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 09:28:24,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:24,347 INFO L93 Difference]: Finished difference Result 12853 states and 15487 transitions. [2022-11-20 09:28:24,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:28:24,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-11-20 09:28:24,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:24,381 INFO L225 Difference]: With dead ends: 12853 [2022-11-20 09:28:24,381 INFO L226 Difference]: Without dead ends: 11754 [2022-11-20 09:28:24,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-20 09:28:24,389 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 10 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:24,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1043 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 09:28:24,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11754 states. [2022-11-20 09:28:25,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11754 to 11738. [2022-11-20 09:28:25,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11738 states, 9109 states have (on average 1.1828960368865957) internal successors, (10775), 9258 states have internal predecessors, (10775), 1285 states have call successors, (1285), 1081 states have call predecessors, (1285), 1342 states have return successors, (2043), 1408 states have call predecessors, (2043), 1284 states have call successors, (2043) [2022-11-20 09:28:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11738 states to 11738 states and 14103 transitions. [2022-11-20 09:28:25,881 INFO L78 Accepts]: Start accepts. Automaton has 11738 states and 14103 transitions. Word has length 136 [2022-11-20 09:28:25,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:25,881 INFO L495 AbstractCegarLoop]: Abstraction has 11738 states and 14103 transitions. [2022-11-20 09:28:25,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-20 09:28:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 11738 states and 14103 transitions. [2022-11-20 09:28:25,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-20 09:28:25,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:25,889 INFO L195 NwaCegarLoop]: 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] [2022-11-20 09:28:25,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:26,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-20 09:28:26,089 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:26,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:26,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1219164295, now seen corresponding path program 1 times [2022-11-20 09:28:26,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:26,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795058277] [2022-11-20 09:28:26,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:26,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:26,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:28:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:26,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 09:28:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:26,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:28:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:26,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 09:28:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:26,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 09:28:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:26,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 09:28:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:26,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 09:28:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:26,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:28:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:26,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-20 09:28:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:26,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:28:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:26,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-20 09:28:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-20 09:28:26,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:26,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795058277] [2022-11-20 09:28:26,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795058277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:26,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:26,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:28:26,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929486902] [2022-11-20 09:28:26,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:26,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:28:26,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:26,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:28:26,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:28:26,297 INFO L87 Difference]: Start difference. First operand 11738 states and 14103 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) [2022-11-20 09:28:28,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:28,662 INFO L93 Difference]: Finished difference Result 12713 states and 15200 transitions. [2022-11-20 09:28:28,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 09:28:28,662 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 [2022-11-20 09:28:28,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:28,689 INFO L225 Difference]: With dead ends: 12713 [2022-11-20 09:28:28,689 INFO L226 Difference]: Without dead ends: 12711 [2022-11-20 09:28:28,692 INFO L412 NwaCegarLoop]: 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 [2022-11-20 09:28:28,693 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 700 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:28,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 670 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 09:28:28,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12711 states. [2022-11-20 09:28:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12711 to 12442. [2022-11-20 09:28:30,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12442 states, 9689 states have (on average 1.1791722571988854) internal successors, (11425), 9844 states have internal predecessors, (11425), 1353 states have call successors, (1353), 1129 states have call predecessors, (1353), 1398 states have return successors, (2122), 1478 states have call predecessors, (2122), 1352 states have call successors, (2122) [2022-11-20 09:28:30,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12442 states to 12442 states and 14900 transitions. [2022-11-20 09:28:30,310 INFO L78 Accepts]: Start accepts. Automaton has 12442 states and 14900 transitions. Word has length 136 [2022-11-20 09:28:30,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:30,310 INFO L495 AbstractCegarLoop]: Abstraction has 12442 states and 14900 transitions. [2022-11-20 09:28:30,310 INFO L496 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) [2022-11-20 09:28:30,310 INFO L276 IsEmpty]: Start isEmpty. Operand 12442 states and 14900 transitions. [2022-11-20 09:28:30,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-20 09:28:30,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:30,319 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:30,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-20 09:28:30,319 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:30,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:30,320 INFO L85 PathProgramCache]: Analyzing trace with hash 114815496, now seen corresponding path program 1 times [2022-11-20 09:28:30,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:30,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379654531] [2022-11-20 09:28:30,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:30,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:30,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:28:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:30,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 09:28:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:30,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:28:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:30,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:30,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:28:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:30,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 09:28:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:30,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 09:28:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:30,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 09:28:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:30,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 09:28:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:30,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-20 09:28:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:30,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-20 09:28:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:30,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:30,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:28:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:30,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 09:28:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:30,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 09:28:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:30,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-20 09:28:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-11-20 09:28:30,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:30,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379654531] [2022-11-20 09:28:30,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379654531] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:28:30,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723933699] [2022-11-20 09:28:30,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:30,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:30,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:28:30,494 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:28:30,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 09:28:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:30,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 09:28:30,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 09:28:30,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:30,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723933699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:30,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:28:30,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-11-20 09:28:30,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464221121] [2022-11-20 09:28:30,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:30,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:28:30,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:30,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:28:30,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-20 09:28:30,649 INFO L87 Difference]: Start difference. First operand 12442 states and 14900 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-20 09:28:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:31,557 INFO L93 Difference]: Finished difference Result 17590 states and 21120 transitions. [2022-11-20 09:28:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:28:31,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2022-11-20 09:28:31,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:31,571 INFO L225 Difference]: With dead ends: 17590 [2022-11-20 09:28:31,571 INFO L226 Difference]: Without dead ends: 7008 [2022-11-20 09:28:31,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-11-20 09:28:31,580 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 34 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:31,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1280 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 09:28:31,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7008 states. [2022-11-20 09:28:32,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7008 to 6566. [2022-11-20 09:28:32,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6566 states, 5254 states have (on average 1.159307194518462) internal successors, (6091), 5307 states have internal predecessors, (6091), 655 states have call successors, (655), 523 states have call predecessors, (655), 655 states have return successors, (962), 736 states have call predecessors, (962), 654 states have call successors, (962) [2022-11-20 09:28:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6566 states to 6566 states and 7708 transitions. [2022-11-20 09:28:32,391 INFO L78 Accepts]: Start accepts. Automaton has 6566 states and 7708 transitions. Word has length 145 [2022-11-20 09:28:32,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:32,391 INFO L495 AbstractCegarLoop]: Abstraction has 6566 states and 7708 transitions. [2022-11-20 09:28:32,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-20 09:28:32,392 INFO L276 IsEmpty]: Start isEmpty. Operand 6566 states and 7708 transitions. [2022-11-20 09:28:32,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-20 09:28:32,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:32,399 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:32,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:32,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:32,600 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:32,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:32,600 INFO L85 PathProgramCache]: Analyzing trace with hash 62040612, now seen corresponding path program 1 times [2022-11-20 09:28:32,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:32,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905333788] [2022-11-20 09:28:32,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:32,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:28:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 09:28:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:28:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:28:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 09:28:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 09:28:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 09:28:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-20 09:28:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-20 09:28:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 09:28:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:28:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-20 09:28:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-20 09:28:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-20 09:28:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:32,696 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-20 09:28:32,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:32,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905333788] [2022-11-20 09:28:32,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905333788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:32,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:32,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:28:32,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36232483] [2022-11-20 09:28:32,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:32,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:28:32,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:32,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:28:32,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:28:32,699 INFO L87 Difference]: Start difference. First operand 6566 states and 7708 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-20 09:28:33,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:33,897 INFO L93 Difference]: Finished difference Result 7114 states and 8326 transitions. [2022-11-20 09:28:33,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:28:33,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 147 [2022-11-20 09:28:33,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:33,909 INFO L225 Difference]: With dead ends: 7114 [2022-11-20 09:28:33,909 INFO L226 Difference]: Without dead ends: 6365 [2022-11-20 09:28:33,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:28:33,913 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 392 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:33,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 455 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:28:33,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6365 states. [2022-11-20 09:28:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6365 to 6141. [2022-11-20 09:28:34,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6141 states, 4925 states have (on average 1.1595939086294416) internal successors, (5711), 4975 states have internal predecessors, (5711), 609 states have call successors, (609), 483 states have call predecessors, (609), 605 states have return successors, (898), 683 states have call predecessors, (898), 608 states have call successors, (898) [2022-11-20 09:28:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6141 states to 6141 states and 7218 transitions. [2022-11-20 09:28:34,842 INFO L78 Accepts]: Start accepts. Automaton has 6141 states and 7218 transitions. Word has length 147 [2022-11-20 09:28:34,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:34,843 INFO L495 AbstractCegarLoop]: Abstraction has 6141 states and 7218 transitions. [2022-11-20 09:28:34,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-20 09:28:34,843 INFO L276 IsEmpty]: Start isEmpty. Operand 6141 states and 7218 transitions. [2022-11-20 09:28:34,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-11-20 09:28:34,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:34,851 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:34,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-20 09:28:34,851 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:34,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:34,852 INFO L85 PathProgramCache]: Analyzing trace with hash -818503781, now seen corresponding path program 1 times [2022-11-20 09:28:34,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:34,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203540415] [2022-11-20 09:28:34,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:34,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:34,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:28:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:34,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 09:28:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:34,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 09:28:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:35,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:35,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:28:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:35,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 09:28:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:35,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 09:28:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:35,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 09:28:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:35,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-20 09:28:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:35,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-20 09:28:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:35,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-20 09:28:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:35,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:35,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:28:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:35,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-11-20 09:28:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:35,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-20 09:28:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:35,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-20 09:28:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-11-20 09:28:35,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:35,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203540415] [2022-11-20 09:28:35,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203540415] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:28:35,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896519376] [2022-11-20 09:28:35,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:35,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:35,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:28:35,056 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:28:35,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 09:28:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:35,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 09:28:35,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:35,341 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-20 09:28:35,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:35,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896519376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:35,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:28:35,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-20 09:28:35,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235882620] [2022-11-20 09:28:35,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:35,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:28:35,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:35,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:28:35,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:28:35,344 INFO L87 Difference]: Start difference. First operand 6141 states and 7218 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-20 09:28:36,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:36,178 INFO L93 Difference]: Finished difference Result 7977 states and 9378 transitions. [2022-11-20 09:28:36,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:28:36,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 158 [2022-11-20 09:28:36,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:36,189 INFO L225 Difference]: With dead ends: 7977 [2022-11-20 09:28:36,189 INFO L226 Difference]: Without dead ends: 3937 [2022-11-20 09:28:36,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:28:36,195 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 171 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:36,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 372 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 09:28:36,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2022-11-20 09:28:36,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 3937. [2022-11-20 09:28:36,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3937 states, 3191 states have (on average 1.144468818552178) internal successors, (3652), 3225 states have internal predecessors, (3652), 380 states have call successors, (380), 295 states have call predecessors, (380), 364 states have return successors, (516), 417 states have call predecessors, (516), 379 states have call successors, (516) [2022-11-20 09:28:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 4548 transitions. [2022-11-20 09:28:36,761 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 4548 transitions. Word has length 158 [2022-11-20 09:28:36,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:36,762 INFO L495 AbstractCegarLoop]: Abstraction has 3937 states and 4548 transitions. [2022-11-20 09:28:36,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-20 09:28:36,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 4548 transitions. [2022-11-20 09:28:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-20 09:28:36,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:36,768 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:36,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:36,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:36,971 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:36,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:36,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1011844634, now seen corresponding path program 1 times [2022-11-20 09:28:36,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:36,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351095094] [2022-11-20 09:28:36,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:36,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:37,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:28:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:37,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 09:28:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:37,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:28:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:37,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:37,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:28:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:37,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 09:28:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:37,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 09:28:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:37,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 09:28:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:37,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 09:28:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:37,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-20 09:28:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:37,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 09:28:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:37,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:37,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:28:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:37,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-20 09:28:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:37,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-11-20 09:28:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:37,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-20 09:28:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:37,106 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-11-20 09:28:37,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:37,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351095094] [2022-11-20 09:28:37,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351095094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:37,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:37,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:28:37,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843903000] [2022-11-20 09:28:37,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:37,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:28:37,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:37,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:28:37,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:28:37,110 INFO L87 Difference]: Start difference. First operand 3937 states and 4548 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-20 09:28:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:38,164 INFO L93 Difference]: Finished difference Result 5801 states and 6758 transitions. [2022-11-20 09:28:38,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:28:38,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 159 [2022-11-20 09:28:38,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:38,171 INFO L225 Difference]: With dead ends: 5801 [2022-11-20 09:28:38,171 INFO L226 Difference]: Without dead ends: 4040 [2022-11-20 09:28:38,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-20 09:28:38,175 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 316 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:38,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 708 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:28:38,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4040 states. [2022-11-20 09:28:38,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4040 to 3496. [2022-11-20 09:28:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3496 states, 2842 states have (on average 1.145320197044335) internal successors, (3255), 2875 states have internal predecessors, (3255), 336 states have call successors, (336), 259 states have call predecessors, (336), 316 states have return successors, (448), 362 states have call predecessors, (448), 335 states have call successors, (448) [2022-11-20 09:28:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 4039 transitions. [2022-11-20 09:28:38,625 INFO L78 Accepts]: Start accepts. Automaton has 3496 states and 4039 transitions. Word has length 159 [2022-11-20 09:28:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:38,626 INFO L495 AbstractCegarLoop]: Abstraction has 3496 states and 4039 transitions. [2022-11-20 09:28:38,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-20 09:28:38,626 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 4039 transitions. [2022-11-20 09:28:38,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-20 09:28:38,630 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:38,630 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:38,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-20 09:28:38,631 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:38,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:38,631 INFO L85 PathProgramCache]: Analyzing trace with hash 978764957, now seen corresponding path program 1 times [2022-11-20 09:28:38,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:38,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887705406] [2022-11-20 09:28:38,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:38,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:38,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:28:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:38,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 09:28:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:38,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:28:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:38,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:38,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:28:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:38,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 09:28:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:38,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 09:28:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:38,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 09:28:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:38,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 09:28:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:38,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 09:28:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:38,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-20 09:28:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:38,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:38,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:28:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:38,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-20 09:28:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:38,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-11-20 09:28:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:38,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-11-20 09:28:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:38,875 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-20 09:28:38,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:38,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887705406] [2022-11-20 09:28:38,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887705406] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:28:38,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733609537] [2022-11-20 09:28:38,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:38,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:38,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:28:38,877 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:28:38,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 09:28:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:39,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 09:28:39,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-20 09:28:39,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:28:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-20 09:28:39,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733609537] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:28:39,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:28:39,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-11-20 09:28:39,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121319869] [2022-11-20 09:28:39,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:28:39,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-20 09:28:39,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:39,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-20 09:28:39,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-11-20 09:28:39,573 INFO L87 Difference]: Start difference. First operand 3496 states and 4039 transitions. Second operand has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2022-11-20 09:28:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:41,420 INFO L93 Difference]: Finished difference Result 5531 states and 6517 transitions. [2022-11-20 09:28:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 09:28:41,420 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 162 [2022-11-20 09:28:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:41,427 INFO L225 Difference]: With dead ends: 5531 [2022-11-20 09:28:41,427 INFO L226 Difference]: Without dead ends: 3783 [2022-11-20 09:28:41,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 353 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2022-11-20 09:28:41,431 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 1208 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:41,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 925 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 09:28:41,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2022-11-20 09:28:41,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3583. [2022-11-20 09:28:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3583 states, 2887 states have (on average 1.1323172843782474) internal successors, (3269), 2925 states have internal predecessors, (3269), 358 states have call successors, (358), 283 states have call predecessors, (358), 336 states have return successors, (499), 375 states have call predecessors, (499), 357 states have call successors, (499) [2022-11-20 09:28:41,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 4126 transitions. [2022-11-20 09:28:41,939 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 4126 transitions. Word has length 162 [2022-11-20 09:28:41,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:41,939 INFO L495 AbstractCegarLoop]: Abstraction has 3583 states and 4126 transitions. [2022-11-20 09:28:41,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2022-11-20 09:28:41,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 4126 transitions. [2022-11-20 09:28:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-11-20 09:28:41,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:41,945 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:41,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:42,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:42,147 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:42,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:42,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1575925759, now seen corresponding path program 2 times [2022-11-20 09:28:42,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:42,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168204594] [2022-11-20 09:28:42,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:42,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:42,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:28:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:42,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 09:28:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:42,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-20 09:28:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:42,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-20 09:28:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:42,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 09:28:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:42,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-20 09:28:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:42,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 09:28:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:42,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:28:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:42,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-20 09:28:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:42,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:28:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:42,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-20 09:28:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:42,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-20 09:28:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:42,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-20 09:28:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:42,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-20 09:28:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-11-20 09:28:42,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:42,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168204594] [2022-11-20 09:28:42,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168204594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:42,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:42,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:28:42,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100549531] [2022-11-20 09:28:42,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:42,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:28:42,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:42,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:28:42,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:28:42,286 INFO L87 Difference]: Start difference. First operand 3583 states and 4126 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-20 09:28:43,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:43,572 INFO L93 Difference]: Finished difference Result 5452 states and 6270 transitions. [2022-11-20 09:28:43,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 09:28:43,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 175 [2022-11-20 09:28:43,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:43,576 INFO L225 Difference]: With dead ends: 5452 [2022-11-20 09:28:43,576 INFO L226 Difference]: Without dead ends: 1760 [2022-11-20 09:28:43,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-11-20 09:28:43,581 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 802 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:43,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 611 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 09:28:43,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2022-11-20 09:28:43,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1760. [2022-11-20 09:28:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1387 states have (on average 1.1391492429704397) internal successors, (1580), 1408 states have internal predecessors, (1580), 180 states have call successors, (180), 156 states have call predecessors, (180), 192 states have return successors, (286), 195 states have call predecessors, (286), 179 states have call successors, (286) [2022-11-20 09:28:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2046 transitions. [2022-11-20 09:28:43,815 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2046 transitions. Word has length 175 [2022-11-20 09:28:43,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:43,815 INFO L495 AbstractCegarLoop]: Abstraction has 1760 states and 2046 transitions. [2022-11-20 09:28:43,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-20 09:28:43,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2046 transitions. [2022-11-20 09:28:43,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-11-20 09:28:43,818 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:43,818 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:43,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-20 09:28:43,818 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:43,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:43,819 INFO L85 PathProgramCache]: Analyzing trace with hash -61354190, now seen corresponding path program 1 times [2022-11-20 09:28:43,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:43,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175126996] [2022-11-20 09:28:43,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:43,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:43,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:28:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:43,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 09:28:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:43,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 09:28:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:43,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:43,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:28:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:43,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-20 09:28:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:43,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 09:28:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:43,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-20 09:28:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:43,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-20 09:28:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:43,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-20 09:28:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:43,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-11-20 09:28:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:43,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-20 09:28:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:43,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:43,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:28:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:43,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-11-20 09:28:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:43,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-20 09:28:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:43,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-20 09:28:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-11-20 09:28:43,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:43,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175126996] [2022-11-20 09:28:43,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175126996] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:28:43,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931520157] [2022-11-20 09:28:43,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:43,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:43,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:28:43,972 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:28:43,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 09:28:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:44,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 09:28:44,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:44,184 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-11-20 09:28:44,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:44,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931520157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:44,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:28:44,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-20 09:28:44,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014611818] [2022-11-20 09:28:44,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:44,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:28:44,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:44,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:28:44,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-20 09:28:44,188 INFO L87 Difference]: Start difference. First operand 1760 states and 2046 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-20 09:28:44,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:44,690 INFO L93 Difference]: Finished difference Result 3405 states and 3969 transitions. [2022-11-20 09:28:44,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:28:44,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 179 [2022-11-20 09:28:44,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:44,694 INFO L225 Difference]: With dead ends: 3405 [2022-11-20 09:28:44,694 INFO L226 Difference]: Without dead ends: 1477 [2022-11-20 09:28:44,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-11-20 09:28:44,696 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 151 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:44,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 228 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:28:44,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2022-11-20 09:28:44,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1440. [2022-11-20 09:28:44,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1143 states have (on average 1.1286089238845145) internal successors, (1290), 1155 states have internal predecessors, (1290), 145 states have call successors, (145), 124 states have call predecessors, (145), 151 states have return successors, (214), 160 states have call predecessors, (214), 144 states have call successors, (214) [2022-11-20 09:28:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 1649 transitions. [2022-11-20 09:28:44,949 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 1649 transitions. Word has length 179 [2022-11-20 09:28:44,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:44,949 INFO L495 AbstractCegarLoop]: Abstraction has 1440 states and 1649 transitions. [2022-11-20 09:28:44,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-20 09:28:44,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1649 transitions. [2022-11-20 09:28:44,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-11-20 09:28:44,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:44,951 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:44,960 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:45,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-20 09:28:45,152 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:28:45,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:45,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1658574142, now seen corresponding path program 1 times [2022-11-20 09:28:45,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:28:45,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315889081] [2022-11-20 09:28:45,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:45,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:28:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-20 09:28:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 09:28:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 09:28:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:28:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-20 09:28:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-20 09:28:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 09:28:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-20 09:28:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-20 09:28:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-20 09:28:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:28:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-20 09:28:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-20 09:28:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-20 09:28:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-20 09:28:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-20 09:28:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-11-20 09:28:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-11-20 09:28:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 09:28:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-20 09:28:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-20 09:28:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-11-20 09:28:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-11-20 09:28:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,341 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-11-20 09:28:45,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:28:45,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315889081] [2022-11-20 09:28:45,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315889081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 09:28:45,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133788504] [2022-11-20 09:28:45,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:45,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:28:45,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:28:45,343 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:28:45,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 09:28:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:45,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 09:28:45,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 256 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-20 09:28:45,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:28:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-11-20 09:28:45,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133788504] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:28:45,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 09:28:45,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2022-11-20 09:28:45,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943468181] [2022-11-20 09:28:45,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 09:28:45,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 09:28:45,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:28:45,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 09:28:45,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-20 09:28:45,957 INFO L87 Difference]: Start difference. First operand 1440 states and 1649 transitions. Second operand has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2022-11-20 09:28:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:46,610 INFO L93 Difference]: Finished difference Result 1743 states and 1984 transitions. [2022-11-20 09:28:46,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 09:28:46,610 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) Word has length 253 [2022-11-20 09:28:46,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:46,611 INFO L225 Difference]: With dead ends: 1743 [2022-11-20 09:28:46,611 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 09:28:46,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 549 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2022-11-20 09:28:46,613 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 355 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:46,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 362 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:28:46,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 09:28:46,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 09:28:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 09:28:46,614 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 253 [2022-11-20 09:28:46,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:46,614 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 09:28:46,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2022-11-20 09:28:46,614 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 09:28:46,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 09:28:46,617 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-20 09:28:46,617 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-20 09:28:46,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-20 09:28:46,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-20 09:28:46,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 09:30:22,185 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 812 822) no Hoare annotation was computed. [2022-11-20 09:30:22,185 INFO L895 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 812 822) the Hoare annotation is: (let ((.cse13 (not (<= 2 |old(~m_st~0)|))) (.cse16 (= ~E_M~0 0)) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse14 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse15 (= |old(~t1_st~0)| 0)) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (= ~c_num_read~0 0))) (.cse8 (not (= ~q_free~0 0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse12 (not (= ~token~0 ~local~0)))) (and (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse3 .cse4 (not (<= ~t1_pc~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse13 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 (not (< ~local~0 ~token~0)) .cse10 .cse11 (not (<= 2 ~E_1~0)) (not (<= ~token~0 (+ ~local~0 1)))) (let ((.cse17 (<= ~m_pc~0 0))) (or .cse1 (and (or (not (<= ~t1_pc~0 1)) (<= ~m_pc~0 1)) (not .cse17)) .cse13 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse10 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) (and (not (<= 1 ~t1_pc~0)) .cse17) .cse11)) (or .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-11-20 09:30:22,186 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 812 822) no Hoare annotation was computed. [2022-11-20 09:30:22,186 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 226 240) no Hoare annotation was computed. [2022-11-20 09:30:22,187 INFO L895 garLoopResultBuilder]: At program point update_channels1ENTRY(lines 226 240) the Hoare annotation is: (let ((.cse38 (= ~q_read_ev~0 2)) (.cse39 (= ~T1_E~0 ~M_E~0)) (.cse36 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse40 (= ~p_last_write~0 ~q_buf_0~0)) (.cse44 (= ~m_pc~0 ~t1_pc~0)) (.cse49 (<= 1 ~c_dr_pc~0)) (.cse48 (= ~q_free~0 1)) (.cse46 (<= ~c_dr_pc~0 1)) (.cse45 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse50 (<= ~p_num_write~0 ~c_num_read~0)) (.cse32 (<= ~m_pc~0 1)) (.cse31 (<= ~m_pc~0 0)) (.cse34 (= ~E_M~0 0)) (.cse37 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse41 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse42 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse47 (= ~c_last_read~0 ~p_last_write~0)) (.cse43 (= ~M_E~0 2)) (.cse51 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (let ((.cse23 (and .cse39 .cse36 .cse40 .cse44 .cse49 .cse48 .cse46 .cse45 .cse50 (or (not .cse32) .cse31) (not .cse34) .cse37 .cse41 .cse42 .cse47 .cse43 .cse51)) (.cse29 (not (= ~p_num_write~0 0))) (.cse30 (not (= ~c_num_read~0 0))) (.cse4 (and .cse36 .cse37 .cse42 .cse38)) (.cse11 (not (<= |old(~q_req_up~0)| 0))) (.cse20 (not .cse51)) (.cse21 (not .cse50)) (.cse35 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse24 (not .cse49)) (.cse25 (not .cse48)) (.cse26 (not .cse47)) (.cse27 (not (= |old(~q_req_up~0)| 1))) (.cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse6 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse10 (not .cse46)) (.cse13 (not .cse45)) (.cse22 (not (<= 2 |old(~q_write_ev~0)|))) (.cse16 (not (= |old(~q_read_ev~0)| 2))) (.cse0 (= ~c_dr_st~0 0)) (.cse28 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse44)) (.cse2 (not .cse43)) (.cse33 (and .cse36 .cse37 .cse41 .cse42)) (.cse5 (not (<= ~t1_pc~0 0))) (.cse7 (not .cse40)) (.cse8 (not (= ~q_free~0 0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse12 (= ~p_dw_st~0 0)) (.cse14 (not .cse39)) (.cse15 (not (= ~m_st~0 0))) (.cse17 (not (= ~p_dw_i~0 1))) (.cse18 (not (<= 2 ~E_1~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |old(~q_write_ev~0)| 0) .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse20 .cse5 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse23 .cse24 .cse17 .cse25 .cse26 .cse18 .cse19) (or .cse0 .cse1 .cse2 (not (<= 1 |old(~q_read_ev~0)|)) .cse27 .cse20 .cse5 .cse7 .cse21 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse23 .cse24 .cse17 .cse25 .cse26 .cse18 .cse19) (or .cse28 .cse1 (not .cse12) .cse2 .cse4 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse5 .cse29 .cse7 .cse30 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse26 .cse18 .cse19) (or .cse0 .cse1 .cse2 (and (not .cse31) .cse32) .cse33 .cse29 .cse7 .cse34 .cse30 .cse12 .cse13 .cse35 .cse14 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse33 .cse20 .cse5 .cse7 .cse21 .cse9 .cse10 .cse12 .cse35 .cse14 .cse15 .cse22 .cse24 .cse17 .cse25 .cse26 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse27 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (and (= ~q_req_up~0 1) .cse36 .cse37 .cse38) .cse13 .cse14 .cse15 .cse22 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse28 .cse1 .cse2 .cse33 .cse5 .cse7 .cse8 .cse9 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19)))) [2022-11-20 09:30:22,188 INFO L895 garLoopResultBuilder]: At program point L56(lines 39 58) the Hoare annotation is: (let ((.cse1 (not (<= ~c_dr_pc~0 0))) (.cse27 (<= ~q_req_up~0 0)) (.cse24 (not (= |old(~q_req_up~0)| 1))) (.cse14 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse15 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse6 (not (= ~q_free~0 0))) (.cse19 (not (= |old(~q_read_ev~0)| 2))) (.cse28 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (not (= ~M_E~0 2))) (.cse25 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse26 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse7 (not (<= 2 ~E_M~0))) (.cse16 (not (<= ~c_dr_pc~0 1))) (.cse17 (not (<= |old(~q_req_up~0)| 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse18 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse23 (not (<= 2 |old(~q_write_ev~0)|))) (.cse20 (not (<= 1 ~c_dr_pc~0))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse21 (not (= ~q_free~0 1))) (.cse22 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse12 (not (<= 2 ~E_1~0))) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16 .cse17 .cse8 .cse18 .cse9 .cse10 .cse19 .cse20 .cse11 (= |old(~q_write_ev~0)| 0) .cse12 .cse13) (or .cse1 .cse2 (not .cse8) .cse3 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse4 (not (= ~p_num_write~0 0)) .cse5 (not (= ~c_num_read~0 0)) .cse7 .cse17 .cse18 .cse9 .cse10 .cse19 .cse11 .cse21 .cse22 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse17 .cse8 .cse18 .cse9 .cse10 .cse23 .cse19 .cse20 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse3 (not (<= 1 |old(~q_read_ev~0)|)) .cse24 .cse25 .cse4 .cse5 .cse26 .cse7 .cse16 .cse8 .cse9 .cse10 .cse23 (and .cse27 .cse28) .cse20 .cse11 .cse21 .cse22 .cse12 .cse13) (or .cse0 (and .cse27 (= ~q_read_ev~0 2)) .cse2 .cse3 .cse24 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16 .cse8 .cse18 .cse9 .cse10 .cse23 .cse19 .cse20 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse25 .cse4 .cse5 .cse26 .cse7 .cse16 .cse28 .cse8 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse9 .cse10 .cse23 .cse20 .cse11 .cse21 .cse22 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse25 .cse4 .cse5 .cse26 .cse7 .cse16 .cse17 .cse8 .cse18 .cse9 .cse10 .cse23 .cse20 .cse11 .cse21 .cse22 .cse12 .cse13))) [2022-11-20 09:30:22,188 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2022-11-20 09:30:22,188 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2022-11-20 09:30:22,188 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 42 57) no Hoare annotation was computed. [2022-11-20 09:30:22,188 INFO L899 garLoopResultBuilder]: For program point L230-1(lines 226 240) no Hoare annotation was computed. [2022-11-20 09:30:22,189 INFO L899 garLoopResultBuilder]: For program point L803-2(lines 787 811) no Hoare annotation was computed. [2022-11-20 09:30:22,189 INFO L895 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 787 811) the Hoare annotation is: (let ((.cse18 (not (< ~local~0 ~token~0))) (.cse20 (not (<= ~token~0 (+ ~local~0 1)))) (.cse17 (= ~E_M~0 0)) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse19 (not (<= 2 ~E_1~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse15 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse6 (not (= ~p_num_write~0 0))) (.cse16 (= |old(~t1_st~0)| 0)) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse9 (not (= ~q_free~0 0))) (.cse10 (not (<= 2 ~E_M~0))) (.cse11 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse15 .cse4 .cse6 .cse16 .cse7 .cse17 .cse8 .cse9 .cse18 .cse11 .cse12 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 (not (= |old(~m_st~0)| 0)) .cse12 .cse19 .cse20) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse15 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19) (or .cse1 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse14 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse11 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse12) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-11-20 09:30:22,190 INFO L899 garLoopResultBuilder]: For program point L795(lines 795 799) no Hoare annotation was computed. [2022-11-20 09:30:22,190 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 606) no Hoare annotation was computed. [2022-11-20 09:30:22,190 INFO L899 garLoopResultBuilder]: For program point L795-2(lines 795 799) no Hoare annotation was computed. [2022-11-20 09:30:22,190 INFO L895 garLoopResultBuilder]: At program point L630(lines 618 632) the Hoare annotation is: (let ((.cse44 (<= ~p_dw_pc~0 0)) (.cse45 (<= ~p_dw_pc~0 1)) (.cse21 (= ~E_M~0 0)) (.cse47 (<= ~m_pc~0 1)) (.cse46 (<= ~m_pc~0 0))) (let ((.cse30 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse31 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse37 (= ~p_num_write~0 0)) (.cse35 (= ~c_num_read~0 0)) (.cse36 (= ~p_last_write~0 ~q_buf_0~0)) (.cse28 (= |old(~t1_st~0)| ~t1_st~0)) (.cse38 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse34 (= ~q_free~0 0)) (.cse39 (<= 2 ~m_st~0)) (.cse33 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse40 (or (not .cse47) .cse46)) (.cse41 (not .cse21)) (.cse42 (= ~p_dw_st~0 0)) (.cse32 (= ~c_last_read~0 ~p_last_write~0)) (.cse43 (or .cse44 (not .cse45))) (.cse48 (= ~M_E~0 2))) (let ((.cse6 (not (<= ~t1_pc~0 0))) (.cse17 (not .cse48)) (.cse18 (and (= ~T1_E~0 ~M_E~0) .cse37 .cse35 .cse36 .cse28 .cse38 .cse29 .cse34 .cse39 .cse33 .cse40 .cse41 .cse42 .cse32 .cse43 .cse48)) (.cse22 (and .cse30 .cse31)) (.cse27 (not (= |old(~m_st~0)| 0))) (.cse26 (and (not .cse46) .cse47)) (.cse23 (and (not .cse44) .cse45)) (.cse11 (not (<= 2 ~E_M~0))) (.cse16 (not (= ~token~0 ~local~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse42)) (.cse2 (and .cse37 .cse35 .cse36 .cse28 .cse38 .cse29 .cse34 .cse39 .cse33 .cse40 .cse41 .cse42 .cse32 .cse43)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse19 (not (= ~t1_pc~0 1))) (.cse5 (not .cse38)) (.cse7 (not .cse37)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse8 (not .cse36)) (.cse9 (not .cse35)) (.cse10 (not .cse34)) (.cse24 (not (< ~local~0 ~token~0))) (.cse12 (not .cse33)) (.cse13 (and .cse28 .cse29 .cse30 .cse31)) (.cse14 (not .cse32)) (.cse15 (not (<= 2 ~E_1~0))) (.cse25 (not (<= ~token~0 (+ ~local~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse17 .cse18 .cse3 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse21 .cse9 .cse10 .cse11 .cse22 .cse12 .cse23 .cse14 .cse15) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or .cse0 .cse1 .cse17 .cse18 .cse3 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse21 .cse9 .cse10 .cse24 .cse22 .cse12 .cse23 .cse14 .cse15 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse26 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse27 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse17 .cse18 .cse3 .cse4 .cse19 .cse5 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse22 .cse12 .cse23 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse27 .cse14 .cse15 .cse25) (or .cse1 .cse2 .cse26 .cse3 .cse5 .cse7 .cse8 .cse21 .cse9 .cse10 .cse12 .cse23 .cse14) (or .cse0 .cse1 .cse4 (and .cse28 .cse29) .cse19 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse16) (or .cse0 .cse1 .cse2 (and (= ~m_st~0 0) .cse30 .cse31 (not (= ~t1_st~0 0))) .cse3 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse21 .cse9 .cse10 .cse24 .cse12 .cse13 .cse14 .cse15 .cse25))))) [2022-11-20 09:30:22,191 INFO L899 garLoopResultBuilder]: For program point L620(lines 620 625) no Hoare annotation was computed. [2022-11-20 09:30:22,191 INFO L895 garLoopResultBuilder]: At program point L612(lines 596 614) the Hoare annotation is: (let ((.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse11 (= ~E_M~0 0)) (.cse14 (not (< ~local~0 ~token~0))) (.cse18 (not (<= ~token~0 (+ ~local~0 1)))) (.cse20 (not (<= ~t1_pc~0 0))) (.cse22 (not (= ~token~0 ~local~0))) (.cse19 (and (<= |activate_threads2_is_master_triggered_#res#1| 0) .cse4 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse5 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse8 (not (= ~p_num_write~0 0))) (.cse9 (= |old(~t1_st~0)| 0)) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse12 (not (= ~c_num_read~0 0))) (.cse13 (not (= ~q_free~0 0))) (.cse21 (not (<= 2 ~E_M~0))) (.cse15 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse7 .cse20 .cse8 .cse10 .cse12 .cse13 .cse21 .cse15 .cse16 .cse17 .cse22) (or .cse19 .cse1 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse2 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse16) (or .cse19 .cse0 .cse1 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse21 .cse14 .cse15 (not (= |old(~m_st~0)| 0)) .cse16 .cse17 .cse18) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse21 .cse15 .cse16 .cse17 .cse22) (or .cse19 .cse0 .cse1 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse21 .cse15 .cse16 .cse22) (or .cse19 .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse3 .cse7 .cse20 .cse8 .cse10 .cse12 .cse13 .cse21 .cse15 .cse16 .cse22) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse21 .cse15 .cse16 .cse17)))) [2022-11-20 09:30:22,191 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 787 811) no Hoare annotation was computed. [2022-11-20 09:30:22,192 INFO L899 garLoopResultBuilder]: For program point L600(lines 600 609) no Hoare annotation was computed. [2022-11-20 09:30:22,192 INFO L895 garLoopResultBuilder]: At program point L631(lines 615 633) the Hoare annotation is: (let ((.cse46 (<= ~p_dw_pc~0 0)) (.cse47 (<= ~p_dw_pc~0 1)) (.cse10 (= ~E_M~0 0)) (.cse49 (<= ~m_pc~0 1)) (.cse48 (<= ~m_pc~0 0))) (let ((.cse23 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse24 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse25 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse26 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse39 (= ~p_num_write~0 0)) (.cse37 (= ~c_num_read~0 0)) (.cse38 (= ~p_last_write~0 ~q_buf_0~0)) (.cse32 (= |old(~t1_st~0)| ~t1_st~0)) (.cse40 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse33 (= ~m_st~0 |old(~m_st~0)|)) (.cse36 (= ~q_free~0 0)) (.cse41 (<= 2 ~m_st~0)) (.cse35 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse42 (or (not .cse49) .cse48)) (.cse43 (not .cse10)) (.cse44 (= ~p_dw_st~0 0)) (.cse34 (= ~c_last_read~0 ~p_last_write~0)) (.cse45 (or .cse46 (not .cse47))) (.cse50 (= ~M_E~0 2))) (let ((.cse2 (not .cse50)) (.cse3 (and (= ~T1_E~0 ~M_E~0) .cse39 .cse37 .cse38 .cse32 .cse40 .cse33 .cse36 .cse41 .cse35 .cse42 .cse43 .cse44 .cse34 .cse45 .cse50)) (.cse18 (and .cse23 .cse24 .cse25 .cse26)) (.cse30 (and (not .cse48) .cse49)) (.cse15 (and (not .cse46) .cse47)) (.cse22 (not (< ~local~0 ~token~0))) (.cse31 (not (= |old(~m_st~0)| 0))) (.cse28 (not (<= ~token~0 (+ ~local~0 1)))) (.cse21 (= |old(~t1_st~0)| 0)) (.cse29 (not (<= ~t1_pc~0 0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse44)) (.cse20 (and .cse39 .cse37 .cse38 .cse32 .cse40 .cse33 .cse36 .cse41 .cse35 .cse42 .cse43 .cse44 .cse34 .cse45)) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not .cse40)) (.cse8 (not .cse39)) (.cse9 (not .cse38)) (.cse11 (not .cse37)) (.cse12 (not .cse36)) (.cse13 (not (<= 2 ~E_M~0))) (.cse14 (not .cse35)) (.cse27 (and .cse32 .cse33 .cse23 .cse24 .cse25 .cse26)) (.cse16 (not .cse34)) (.cse17 (not (<= 2 ~E_1~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse22 (and (= ~m_st~0 0) .cse23 .cse24 .cse25 (not (= ~t1_st~0 0)) .cse26) .cse14 .cse27 .cse16 .cse17 .cse28) (or .cse0 .cse1 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17) (or .cse0 .cse1 .cse20 .cse4 .cse5 .cse7 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse22 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18) (or .cse0 .cse1 .cse30 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse11 .cse12 .cse13 .cse14 .cse31 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse20 .cse30 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse11 .cse12 .cse13 .cse22 .cse14 .cse31 .cse27 .cse16 .cse17 .cse28) (or .cse0 .cse1 .cse5 (and .cse32 .cse33) .cse6 .cse7 .cse8 .cse21 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse19) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse5 .cse7 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse19) (or .cse0 .cse1 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse19))))) [2022-11-20 09:30:22,192 INFO L899 garLoopResultBuilder]: For program point L600-2(lines 600 609) no Hoare annotation was computed. [2022-11-20 09:30:22,193 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 628) no Hoare annotation was computed. [2022-11-20 09:30:22,193 INFO L899 garLoopResultBuilder]: For program point L619-2(lines 619 628) no Hoare annotation was computed. [2022-11-20 09:30:22,193 INFO L895 garLoopResultBuilder]: At program point L611(lines 599 613) the Hoare annotation is: (let ((.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse18 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse16 (= ~E_M~0 0)) (.cse21 (not (<= ~t1_pc~0 0))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse19 (not (< ~local~0 ~token~0))) (.cse15 (not (<= 2 ~E_1~0))) (.cse20 (not (<= ~token~0 (+ ~local~0 1)))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (and .cse17 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse18 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (not (= ~t1_pc~0 1))) (.cse6 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse12 (not (<= 2 ~E_M~0))) (.cse13 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse22 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse1 .cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse3 .cse6 .cse7 .cse9 .cse16 .cse10 .cse11 .cse13 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse14) (or .cse0 .cse1 .cse3 .cse4 (and .cse17 .cse18) .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse19 .cse13 .cse14 .cse15 .cse20) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse4 .cse6 .cse21 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse21 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 (not (= |old(~m_st~0)| 0)) .cse14 .cse15 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22)))) [2022-11-20 09:30:22,193 INFO L899 garLoopResultBuilder]: For program point L803(lines 803 807) no Hoare annotation was computed. [2022-11-20 09:30:22,194 INFO L895 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (let ((.cse2 (= |old(~p_dw_st~0)| 0)) (.cse30 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse27 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~c_num_read~0 0))) (.cse28 (and .cse30 (= ~p_dw_st~0 0))) (.cse29 (not .cse2)) (.cse13 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse15 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse8 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse20 (not (<= 1 ~c_dr_pc~0))) (.cse10 (not (= ~q_free~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse3 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse30)) (.cse14 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse25 (not (= ~q_free~0 0))) (.cse16 (not (<= 2 ~E_M~0))) (.cse17 (not (<= ~c_dr_pc~0 1))) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse18 (not (= ~m_st~0 0))) (.cse19 (not (<= 2 ~q_write_ev~0))) (.cse21 (not (= ~p_dw_i~0 1))) (.cse11 (= |old(~c_dr_st~0)| 0)) (.cse22 (not (<= ~q_req_up~0 0))) (.cse26 (not (= ~q_read_ev~0 2))) (.cse23 (not (<= 2 ~E_1~0))) (.cse24 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse2 .cse3 .cse4 .cse5 (= ~E_M~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17 .cse9 .cse18 .cse19 .cse20 .cse21 .cse10 .cse11 .cse22 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse3 .cse14 (not (< ~c_num_read~0 ~p_num_write~0)) .cse5 .cse25 .cse16 .cse17 .cse7 .cse9 .cse18 (= ~q_write_ev~0 0) .cse21 .cse11 .cse22 .cse26 .cse23 .cse24) (or .cse27 .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse25 .cse16 .cse9 .cse18 .cse21 .cse11 .cse23 .cse24) (or .cse27 .cse0 .cse1 .cse14 .cse4 .cse5 .cse6 .cse16 .cse7 .cse9 .cse18 .cse28 .cse21 .cse10 .cse11 .cse29 .cse12 .cse23 .cse24) (or .cse27 .cse0 .cse1 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse14 .cse4 .cse5 .cse6 .cse16 .cse7 .cse9 .cse18 .cse28 .cse21 .cse10 .cse29 .cse22 .cse26 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17 .cse8 .cse9 .cse18 .cse19 .cse20 .cse21 .cse10 .cse11 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse25 .cse16 .cse17 .cse7 .cse9 .cse18 .cse19 .cse21 .cse11 .cse22 .cse26 .cse23 .cse24)))) [2022-11-20 09:30:22,194 INFO L895 garLoopResultBuilder]: At program point L323-2(lines 323 327) the Hoare annotation is: (let ((.cse3 (= |old(~p_dw_st~0)| 0)) (.cse40 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse39 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse32 (<= activate_threads1_~tmp~1 0)) (.cse33 (< 0 (+ activate_threads1_~tmp~1 1))) (.cse16 (= ~p_dw_st~0 0))) (let ((.cse31 (not .cse16)) (.cse35 (and .cse40 .cse39 .cse32 .cse33)) (.cse26 (not (<= ~q_req_up~0 0))) (.cse38 (not .cse3)) (.cse15 (not (= ~c_dr_st~0 0))) (.cse30 (not (= ~q_free~0 0))) (.cse4 (and .cse40 .cse39)) (.cse17 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse19 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse21 (not (<= ~c_dr_pc~0 1))) (.cse23 (not (<= 2 ~q_write_ev~0))) (.cse24 (not (<= 1 ~c_dr_pc~0))) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse7 (= ~E_M~0 0)) (.cse10 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse29 (not (<= ~c_dr_pc~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse37 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse18 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse20 (not (<= 2 ~E_M~0))) (.cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~T1_E~0 ~M_E~0))) (.cse22 (not (= ~m_st~0 0))) (.cse36 (and .cse32 .cse33)) (.cse25 (not (= ~p_dw_i~0 1))) (.cse12 (not (= ~q_free~0 1))) (.cse13 (= |old(~c_dr_st~0)| 0)) (.cse34 (not (= ~q_read_ev~0 2))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse27 (not (<= 2 ~E_1~0))) (.cse28 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 (and (= ~q_read_ev~0 1) .cse15 .cse16) .cse1 .cse3 .cse4 .cse17 .cse18 .cse6 .cse19 .cse20 .cse21 .cse11 .cse22 .cse23 .cse24 .cse25 .cse12 .cse13 .cse26 .cse14 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse3 .cse18 .cse6 .cse30 .cse20 .cse11 .cse22 (and .cse31 .cse32 .cse33) .cse25 .cse13 .cse34 .cse27 .cse28) (or .cse0 .cse1 .cse3 .cse35 .cse18 .cse6 .cse30 .cse20 .cse21 .cse9 .cse11 .cse22 .cse23 .cse25 .cse13 .cse26 .cse34 .cse27 .cse28) (or .cse29 .cse0 .cse31 .cse1 .cse3 .cse18 .cse6 .cse30 .cse20 .cse10 .cse11 .cse22 .cse25 .cse13 .cse27 .cse28) (or .cse0 .cse1 .cse3 .cse17 .cse18 .cse6 .cse19 .cse20 .cse21 .cse11 .cse22 .cse23 .cse24 .cse36 .cse25 .cse12 .cse13 .cse26 .cse34 .cse14 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse37 .cse18 .cse5 .cse6 .cse8 .cse20 .cse9 .cse11 .cse22 .cse25 .cse12 .cse38 .cse26 .cse34 .cse14 .cse27 (and .cse39 .cse32 .cse16 .cse33) .cse28) (or .cse0 .cse1 .cse3 .cse17 .cse18 .cse6 .cse19 .cse20 .cse21 .cse10 .cse11 .cse22 .cse23 .cse24 .cse36 .cse25 .cse12 .cse13 .cse34 .cse14 .cse27 .cse28) (or .cse0 .cse1 .cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse35 .cse18 (not (< ~c_num_read~0 ~p_num_write~0)) .cse6 .cse30 .cse20 .cse21 .cse9 .cse11 .cse22 (= ~q_write_ev~0 0) .cse25 .cse13 .cse26 .cse34 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse18 .cse5 .cse6 .cse8 .cse20 .cse9 .cse11 .cse22 (and .cse39 .cse16) .cse25 .cse12 .cse13 .cse38 .cse14 .cse27 .cse28) (or .cse29 .cse0 .cse1 (and .cse15 .cse16) .cse3 .cse4 .cse18 .cse6 .cse30 .cse20 .cse11 .cse22 .cse25 .cse13 .cse27 .cse28) (or .cse0 .cse1 .cse3 .cse4 .cse17 .cse18 .cse6 .cse19 .cse20 .cse21 .cse10 .cse11 .cse22 .cse23 .cse24 .cse25 .cse12 .cse13 .cse14 .cse27 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse36 .cse12 .cse13 .cse34 .cse14) (or .cse29 .cse0 .cse1 .cse37 .cse18 .cse5 .cse6 .cse8 .cse20 .cse9 .cse11 .cse22 .cse36 .cse25 .cse12 .cse13 .cse34 .cse14 .cse27 .cse28)))) [2022-11-20 09:30:22,195 INFO L899 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2022-11-20 09:30:22,195 INFO L895 garLoopResultBuilder]: At program point activate_threads1ENTRY(lines 315 339) the Hoare annotation is: (let ((.cse2 (= |old(~p_dw_st~0)| 0)) (.cse30 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse27 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~c_num_read~0 0))) (.cse28 (and .cse30 (= ~p_dw_st~0 0))) (.cse29 (not .cse2)) (.cse13 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse15 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse8 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse20 (not (<= 1 ~c_dr_pc~0))) (.cse10 (not (= ~q_free~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse3 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse30)) (.cse14 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse25 (not (= ~q_free~0 0))) (.cse16 (not (<= 2 ~E_M~0))) (.cse17 (not (<= ~c_dr_pc~0 1))) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse18 (not (= ~m_st~0 0))) (.cse19 (not (<= 2 ~q_write_ev~0))) (.cse21 (not (= ~p_dw_i~0 1))) (.cse11 (= |old(~c_dr_st~0)| 0)) (.cse22 (not (<= ~q_req_up~0 0))) (.cse26 (not (= ~q_read_ev~0 2))) (.cse23 (not (<= 2 ~E_1~0))) (.cse24 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse2 .cse3 .cse4 .cse5 (= ~E_M~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17 .cse9 .cse18 .cse19 .cse20 .cse21 .cse10 .cse11 .cse22 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse3 .cse14 (not (< ~c_num_read~0 ~p_num_write~0)) .cse5 .cse25 .cse16 .cse17 .cse7 .cse9 .cse18 (= ~q_write_ev~0 0) .cse21 .cse11 .cse22 .cse26 .cse23 .cse24) (or .cse27 .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse25 .cse16 .cse9 .cse18 .cse21 .cse11 .cse23 .cse24) (or .cse27 .cse0 .cse1 .cse14 .cse4 .cse5 .cse6 .cse16 .cse7 .cse9 .cse18 .cse28 .cse21 .cse10 .cse11 .cse29 .cse12 .cse23 .cse24) (or .cse27 .cse0 .cse1 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse14 .cse4 .cse5 .cse6 .cse16 .cse7 .cse9 .cse18 .cse28 .cse21 .cse10 .cse29 .cse22 .cse26 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17 .cse8 .cse9 .cse18 .cse19 .cse20 .cse21 .cse10 .cse11 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse25 .cse16 .cse17 .cse7 .cse9 .cse18 .cse19 .cse21 .cse11 .cse22 .cse26 .cse23 .cse24)))) [2022-11-20 09:30:22,195 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 315 339) no Hoare annotation was computed. [2022-11-20 09:30:22,195 INFO L899 garLoopResultBuilder]: For program point L331(lines 331 335) no Hoare annotation was computed. [2022-11-20 09:30:22,195 INFO L899 garLoopResultBuilder]: For program point L329(line 329) no Hoare annotation was computed. [2022-11-20 09:30:22,195 INFO L899 garLoopResultBuilder]: For program point L331-2(lines 315 339) no Hoare annotation was computed. [2022-11-20 09:30:22,195 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2022-11-20 09:30:22,196 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 634 641) no Hoare annotation was computed. [2022-11-20 09:30:22,196 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 634 641) the Hoare annotation is: true [2022-11-20 09:30:22,196 INFO L899 garLoopResultBuilder]: For program point L735-1(lines 734 757) no Hoare annotation was computed. [2022-11-20 09:30:22,196 INFO L895 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 731 758) the Hoare annotation is: (let ((.cse15 (not (= ~m_st~0 0))) (.cse7 (= ~t1_st~0 0)) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse18 (not (<= ~t1_pc~0 0))) (.cse19 (not (<= 2 ~m_st~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (<= 2 |old(~T1_E~0)|))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse12 (not (= ~q_free~0 0))) (.cse13 (not (<= 2 |old(~E_M~0)|))) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (< ~local~0 ~token~0)) .cse13 .cse14 .cse15 .cse16 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse19 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or .cse19 .cse1 (= |old(~E_M~0)| 0) .cse2 .cse4 .cse5 .cse8 .cse10 .cse11 .cse12 .cse14 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse16) (or .cse19 .cse0 .cse1 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse19 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17))) [2022-11-20 09:30:22,196 INFO L899 garLoopResultBuilder]: For program point L750-1(lines 731 758) no Hoare annotation was computed. [2022-11-20 09:30:22,197 INFO L899 garLoopResultBuilder]: For program point L745-1(lines 734 757) no Hoare annotation was computed. [2022-11-20 09:30:22,197 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 731 758) no Hoare annotation was computed. [2022-11-20 09:30:22,197 INFO L899 garLoopResultBuilder]: For program point L740-1(lines 734 757) no Hoare annotation was computed. [2022-11-20 09:30:22,198 INFO L895 garLoopResultBuilder]: At program point fire_delta_events1ENTRY(lines 279 296) the Hoare annotation is: (let ((.cse29 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse18 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse19 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse8 (not (<= ~c_dr_pc~0 1))) (.cse21 (not (<= 2 |old(~q_write_ev~0)|))) (.cse22 (not (<= 1 ~c_dr_pc~0))) (.cse20 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse0 (= ~c_dr_st~0 0)) (.cse5 (and .cse29 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse6 (not (= ~q_free~0 0))) (.cse26 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse9 (= ~p_dw_st~0 0)) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (<= ~t1_pc~0 0))) (.cse27 (not (= ~p_num_write~0 0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse28 (not (= ~c_num_read~0 0))) (.cse7 (not (<= 2 ~E_M~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~T1_E~0 ~M_E~0))) (.cse12 (not (= ~m_st~0 0))) (.cse13 (not (= |old(~q_read_ev~0)| 2))) (.cse14 (not (= ~p_dw_i~0 1))) (.cse23 (not (= ~q_free~0 1))) (.cse15 (not (<= ~q_req_up~0 0))) (.cse24 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (not (<= 2 ~E_1~0))) (.cse25 (and .cse29 (= ~q_read_ev~0 2))) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse3 (not (< ~c_num_read~0 ~p_num_write~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse19 .cse5 .cse7 .cse8 .cse9 .cse20 .cse11 .cse12 .cse21 .cse22 .cse14 .cse23 .cse24 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse25 .cse17) (or .cse0 .cse26 .cse1 .cse2 .cse3 .cse27 .cse4 .cse5 .cse28 .cse7 .cse10 .cse11 .cse12 .cse14 .cse23 .cse24 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse19 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 .cse22 .cse14 .cse23 .cse15 .cse24 .cse16 .cse17) (or .cse0 .cse1 .cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse27 .cse4 (= ~E_M~0 0) .cse5 .cse28 .cse9 .cse10 .cse20 .cse11 .cse23 .cse24) (or .cse0 .cse26 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse14 .cse16 .cse17) (or .cse26 .cse1 (not .cse9) .cse2 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse3 .cse27 .cse4 .cse28 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse23 .cse15 .cse24 .cse16 .cse25 .cse17)))) [2022-11-20 09:30:22,198 INFO L899 garLoopResultBuilder]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2022-11-20 09:30:22,198 INFO L899 garLoopResultBuilder]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2022-11-20 09:30:22,198 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 279 296) no Hoare annotation was computed. [2022-11-20 09:30:22,198 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2022-11-20 09:30:22,199 INFO L902 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 88 106) the Hoare annotation is: true [2022-11-20 09:30:22,199 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 101) no Hoare annotation was computed. [2022-11-20 09:30:22,199 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 101) no Hoare annotation was computed. [2022-11-20 09:30:22,199 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 88 106) no Hoare annotation was computed. [2022-11-20 09:30:22,199 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 88 106) no Hoare annotation was computed. [2022-11-20 09:30:22,200 INFO L895 garLoopResultBuilder]: At program point L103(lines 91 105) the Hoare annotation is: (let ((.cse33 (= ~T1_E~0 ~M_E~0)) (.cse37 (= ~m_pc~0 ~t1_pc~0)) (.cse39 (<= ~c_dr_pc~0 1)) (.cse31 (<= is_do_read_c_triggered_~__retres1~1 0)) (.cse38 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse35 (<= ~m_pc~0 1)) (.cse34 (<= ~m_pc~0 0)) (.cse7 (= ~E_M~0 0)) (.cse32 (<= 0 is_do_read_c_triggered_~__retres1~1)) (.cse36 (= ~M_E~0 2)) (.cse40 (<= 1 ~c_dr_pc~0))) (let ((.cse24 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse4 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse8 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse15 (not (<= 2 ~q_write_ev~0))) (.cse16 (not .cse40)) (.cse22 (and .cse33 .cse37 .cse40 .cse39 .cse31 .cse38 (or (not .cse35) .cse34) (not .cse7) .cse32 .cse36)) (.cse10 (not .cse39)) (.cse11 (= ~p_dw_st~0 0)) (.cse26 (not (= ~p_num_write~0 0))) (.cse27 (not (= ~c_num_read~0 0))) (.cse12 (not .cse38)) (.cse18 (not (= ~q_free~0 1))) (.cse19 (not (<= ~q_req_up~0 0))) (.cse30 (not (= ~q_read_ev~0 2))) (.cse20 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse28 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse37)) (.cse2 (not .cse36)) (.cse3 (and (not .cse34) .cse35)) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse29 (not (= ~q_free~0 0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse13 (not .cse33)) (.cse14 (not (= ~m_st~0 0))) (.cse25 (and .cse31 .cse32)) (.cse17 (not (= ~p_dw_i~0 1))) (.cse21 (not (<= 2 ~E_1~0))) (.cse23 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse14 .cse25 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse26 .cse6 .cse7 .cse27 .cse11 .cse12 .cse24 .cse13 .cse25 .cse18 .cse20) (or .cse0 .cse28 .cse1 .cse2 .cse3 .cse5 .cse26 .cse6 .cse7 .cse27 .cse9 .cse12 .cse13 .cse14 .cse25 .cse17 .cse18 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse19 .cse30 .cse21 .cse23) (or .cse0 .cse1 (not (= ~q_read_ev~0 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse5 (< 0 ~q_write_ev~0) (not (< ~c_num_read~0 ~p_num_write~0)) .cse6 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~q_write_ev~0 0) .cse25 .cse17 .cse19 .cse30 .cse21 .cse23) (or .cse28 .cse1 (not .cse11) .cse2 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse5 .cse26 .cse6 .cse27 .cse9 .cse12 .cse13 .cse14 .cse25 .cse17 .cse18 .cse19 .cse30 .cse20 .cse21 .cse23) (or .cse0 .cse28 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse29 .cse9 .cse13 .cse14 .cse25 .cse17 .cse21 .cse23)))) [2022-11-20 09:30:22,200 INFO L899 garLoopResultBuilder]: For program point L960(lines 960 966) no Hoare annotation was computed. [2022-11-20 09:30:22,200 INFO L895 garLoopResultBuilder]: At program point L927(line 927) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-20 09:30:22,200 INFO L899 garLoopResultBuilder]: For program point L927-1(line 927) no Hoare annotation was computed. [2022-11-20 09:30:22,201 INFO L895 garLoopResultBuilder]: At program point L250-1(lines 241 258) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_st~0 0))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse11 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse2 (= ~p_dw_st~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse14 .cse15 .cse9 .cse16 .cse17 .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 (= ~q_write_ev~0 ~q_read_ev~0) .cse13 .cse6 .cse8 .cse14 (<= ~q_req_up~0 0) .cse2 (= ~q_read_ev~0 2) .cse15 .cse9 .cse16 .cse17 .cse10))) [2022-11-20 09:30:22,201 INFO L899 garLoopResultBuilder]: For program point L696(lines 686 724) no Hoare annotation was computed. [2022-11-20 09:30:22,201 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 572) no Hoare annotation was computed. [2022-11-20 09:30:22,201 INFO L899 garLoopResultBuilder]: For program point L878(lines 878 883) no Hoare annotation was computed. [2022-11-20 09:30:22,201 INFO L899 garLoopResultBuilder]: For program point L713(lines 713 720) no Hoare annotation was computed. [2022-11-20 09:30:22,201 INFO L895 garLoopResultBuilder]: At program point L482(lines 473 484) the Hoare annotation is: (= ~M_E~0 2) [2022-11-20 09:30:22,201 INFO L899 garLoopResultBuilder]: For program point L350(line 350) no Hoare annotation was computed. [2022-11-20 09:30:22,201 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 09:30:22,202 INFO L895 garLoopResultBuilder]: At program point L829(lines 823 831) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-20 09:30:22,202 INFO L899 garLoopResultBuilder]: For program point L532(line 532) no Hoare annotation was computed. [2022-11-20 09:30:22,202 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse11 (< ~c_num_read~0 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (= ~q_read_ev~0 2)) (.cse8 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse23 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse22 (<= 2 ~q_write_ev~0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse24 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= ~q_req_up~0 0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse10 (<= 2 ~E_1~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse15 (= ~q_free~0 0)) (.cse16 (<= ~t1_pc~0 0)) (.cse19 (= ~p_dw_i~0 1)) (.cse20 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse13 .cse22 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse23 .cse13 .cse22 .cse14 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse6 .cse16 .cse24 .cse17 .cse18 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse19 .cse7 .cse20 .cse8 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse17 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse13 .cse5 .cse15 .cse16 .cse19 (<= ~c_dr_pc~0 0) .cse20 .cse9))) [2022-11-20 09:30:22,202 INFO L895 garLoopResultBuilder]: At program point L912(line 912) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-20 09:30:22,203 INFO L899 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2022-11-20 09:30:22,203 INFO L899 garLoopResultBuilder]: For program point L912-1(line 912) no Hoare annotation was computed. [2022-11-20 09:30:22,203 INFO L899 garLoopResultBuilder]: For program point L846-1(lines 835 858) no Hoare annotation was computed. [2022-11-20 09:30:22,203 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2022-11-20 09:30:22,203 INFO L899 garLoopResultBuilder]: For program point L962(lines 962 965) no Hoare annotation was computed. [2022-11-20 09:30:22,203 INFO L895 garLoopResultBuilder]: At program point L450(lines 413 455) the Hoare annotation is: (= ~M_E~0 2) [2022-11-20 09:30:22,204 INFO L895 garLoopResultBuilder]: At program point L897(line 897) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-11-20 09:30:22,204 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2022-11-20 09:30:22,204 INFO L899 garLoopResultBuilder]: For program point L897-1(line 897) no Hoare annotation was computed. [2022-11-20 09:30:22,204 INFO L899 garLoopResultBuilder]: For program point L352-1(lines 347 387) no Hoare annotation was computed. [2022-11-20 09:30:22,205 INFO L895 garLoopResultBuilder]: At program point L220(lines 173 225) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 1 ~c_dr_pc~0)) (.cse6 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse7 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 1)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse11 (not (= ~c_dr_st~0 0))) (.cse12 (<= ~t1_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~q_req_up~0 0) .cse13 (= ~q_read_ev~0 2) .cse14 .cse15 .cse16 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse17) (and .cse0 (= ~q_req_up~0 1) .cse1 (not .cse13) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~p_num_write~0 ~c_num_read~0) (<= 1 ~q_read_ev~0) .cse14 .cse15 .cse16 .cse17 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-11-20 09:30:22,205 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 706) no Hoare annotation was computed. [2022-11-20 09:30:22,205 INFO L899 garLoopResultBuilder]: For program point L567(lines 567 571) no Hoare annotation was computed. [2022-11-20 09:30:22,205 INFO L895 garLoopResultBuilder]: At program point L435(line 435) the Hoare annotation is: (let ((.cse13 (< ~c_num_read~0 ~p_num_write~0)) (.cse20 (= ~q_read_ev~0 2)) (.cse23 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse19 (<= ~q_req_up~0 0)) (.cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse25 (= ~q_req_up~0 1)) (.cse26 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse24 (<= 2 ~q_write_ev~0)) (.cse16 (<= ~c_dr_pc~0 1)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse27 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse8 (not (= ~E_M~0 0))) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse12 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse17 (= ~q_free~0 0)) (.cse18 (<= ~t1_pc~0 0)) (.cse21 (= ~p_dw_i~0 1)) (.cse22 (= ~token~0 ~local~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse13 .cse14 .cse15 .cse16 .cse5 .cse17 .cse6 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse15 .cse24 .cse16 .cse5 .cse17 .cse6 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11) (and .cse0 .cse25 .cse12 .cse1 .cse2 .cse3 .cse13 .cse14 .cse15 .cse24 .cse16 .cse5 .cse17 .cse6 .cse18 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse6 .cse18 .cse27 .cse19 .cse7 .cse8 .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse18 .cse27 .cse21 .cse9 .cse22 .cse10 .cse11 .cse28) (and .cse0 .cse25 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse6 .cse18 .cse27 .cse7 .cse8 (<= 1 ~q_read_ev~0) .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse15 .cse5 .cse17 .cse18 .cse21 (<= ~c_dr_pc~0 0) .cse22 .cse11))) [2022-11-20 09:30:22,205 INFO L899 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2022-11-20 09:30:22,206 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2022-11-20 09:30:22,206 INFO L895 garLoopResultBuilder]: At program point L568(lines 563 594) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0))) (or (let ((.cse3 (<= ~m_pc~0 0))) (and .cse0 .cse1 .cse2 (or (<= 1 ~t1_pc~0) (not .cse3)) .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) .cse3) (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))))) (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) .cse0 .cse1 .cse2 (<= 2 ~E_M~0) .cse4 .cse5 .cse6 .cse7 (<= 2 ~T1_E~0) .cse8 .cse9 (<= ~c_dr_pc~0 0) (not (= ~t1_st~0 0)) (= ~token~0 ~local~0)))) [2022-11-20 09:30:22,206 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2022-11-20 09:30:22,207 INFO L895 garLoopResultBuilder]: At program point L651-1(lines 642 659) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 (<= 2 ~E_M~0) .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse10))) [2022-11-20 09:30:22,207 INFO L895 garLoopResultBuilder]: At program point L585(line 585) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (not (= ~E_M~0 0))) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (or (let ((.cse3 (<= ~m_pc~0 0))) (and .cse0 .cse1 .cse2 (or (<= 1 ~t1_pc~0) (not .cse3)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) .cse3) (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))))) (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) .cse0 .cse1 .cse2 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse7 (<= 2 ~T1_E~0) .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 0) (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)))) [2022-11-20 09:30:22,207 INFO L899 garLoopResultBuilder]: For program point L585-1(line 585) no Hoare annotation was computed. [2022-11-20 09:30:22,207 INFO L895 garLoopResultBuilder]: At program point L420(line 420) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-11-20 09:30:22,208 INFO L899 garLoopResultBuilder]: For program point L420-1(line 420) no Hoare annotation was computed. [2022-11-20 09:30:22,208 INFO L895 garLoopResultBuilder]: At program point L899(line 899) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 (<= 2 ~E_M~0) .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse10))) [2022-11-20 09:30:22,208 INFO L895 garLoopResultBuilder]: At program point L899-1(line 899) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 (<= 2 ~E_M~0) .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse10))) [2022-11-20 09:30:22,209 INFO L899 garLoopResultBuilder]: For program point L189(lines 188 219) no Hoare annotation was computed. [2022-11-20 09:30:22,209 INFO L895 garLoopResultBuilder]: At program point L470(lines 456 472) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-11-20 09:30:22,209 INFO L895 garLoopResultBuilder]: At program point L916(line 916) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-20 09:30:22,210 INFO L895 garLoopResultBuilder]: At program point L916-1(line 916) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-20 09:30:22,210 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2022-11-20 09:30:22,210 INFO L895 garLoopResultBuilder]: At program point L553(lines 516 559) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= 2 ~T1_E~0)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= ~c_dr_pc~0 0)) (.cse13 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~t1_pc~0 0) .cse9 .cse10 .cse11 .cse12 .cse13) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-11-20 09:30:22,210 INFO L899 garLoopResultBuilder]: For program point L520(lines 520 528) no Hoare annotation was computed. [2022-11-20 09:30:22,211 INFO L895 garLoopResultBuilder]: At program point L388(lines 340 393) the Hoare annotation is: (let ((.cse13 (< ~c_num_read~0 ~p_num_write~0)) (.cse20 (= ~q_read_ev~0 2)) (.cse23 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse19 (<= ~q_req_up~0 0)) (.cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse25 (= ~q_req_up~0 1)) (.cse26 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse24 (<= 2 ~q_write_ev~0)) (.cse16 (<= ~c_dr_pc~0 1)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse27 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse8 (not (= ~E_M~0 0))) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse12 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse17 (= ~q_free~0 0)) (.cse18 (<= ~t1_pc~0 0)) (.cse21 (= ~p_dw_i~0 1)) (.cse22 (= ~token~0 ~local~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse13 .cse14 .cse15 .cse16 .cse5 .cse17 .cse6 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse15 .cse24 .cse16 .cse5 .cse17 .cse6 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11) (and .cse0 .cse25 .cse12 .cse1 .cse2 .cse3 .cse13 .cse14 .cse15 .cse24 .cse16 .cse5 .cse17 .cse6 .cse18 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse6 .cse18 .cse27 .cse19 .cse7 .cse8 .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse18 .cse27 .cse21 .cse9 .cse22 .cse10 .cse11 .cse28) (and .cse0 .cse25 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse6 .cse18 .cse27 .cse7 .cse8 (<= 1 ~q_read_ev~0) .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse15 .cse5 .cse17 .cse18 .cse21 (<= ~c_dr_pc~0 0) .cse22 .cse11))) [2022-11-20 09:30:22,211 INFO L895 garLoopResultBuilder]: At program point L900(line 900) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 (<= 2 ~E_M~0) .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse10))) [2022-11-20 09:30:22,212 INFO L895 garLoopResultBuilder]: At program point L867(lines 860 869) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-11-20 09:30:22,212 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 09:30:22,212 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 190 200) no Hoare annotation was computed. [2022-11-20 09:30:22,212 INFO L895 garLoopResultBuilder]: At program point L537(line 537) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse11 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse3 .cse4 .cse5 .cse6 (<= ~t1_pc~0 0) .cse7 .cse8 .cse9 .cse10 .cse11) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~t1_st~0 0)) .cse11))) [2022-11-20 09:30:22,213 INFO L899 garLoopResultBuilder]: For program point L537-1(line 537) no Hoare annotation was computed. [2022-11-20 09:30:22,213 INFO L895 garLoopResultBuilder]: At program point L917(line 917) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-20 09:30:22,214 INFO L895 garLoopResultBuilder]: At program point L372(lines 347 387) the Hoare annotation is: (let ((.cse32 (= ~p_dw_st~0 0))) (let ((.cse15 (<= 1 ~q_read_ev~0)) (.cse30 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse1 (= ~q_req_up~0 1)) (.cse21 (< ~c_num_read~0 ~p_num_write~0)) (.cse26 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse29 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse27 (= ~p_num_write~0 0)) (.cse28 (= ~c_num_read~0 0)) (.cse23 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse25 (= ~q_read_ev~0 2)) (.cse3 (not .cse32)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse9 (= ~q_free~0 1)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse11 (<= ~c_dr_pc~0 1)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse24 (<= ~q_req_up~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse2 (<= 2 ~E_1~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse12 (not (= ~c_dr_st~0 0))) (.cse22 (= ~q_free~0 0)) (.cse13 (<= ~t1_pc~0 0)) (.cse16 (= ~p_dw_i~0 1)) (.cse31 (<= ~c_dr_pc~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 (not (= ~q_write_ev~0 0)) .cse21 .cse6 .cse7 .cse8 .cse11 .cse12 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse27 .cse3 .cse28 .cse4 .cse5 .cse9 .cse12 .cse23 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse17 .cse29 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse30 .cse8 .cse10 .cse22 .cse13 (<= ~p_num_write~0 1) .cse15 .cse16 .cse31 (<= 1 ~p_num_write~0) .cse18 .cse19) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse8 .cse9 .cse12 .cse23 .cse13 .cse16 .cse17 .cse31 .cse18 .cse19) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse25 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse24 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse23 .cse13 .cse24 .cse32 .cse25 .cse16 .cse17 .cse31 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse8 .cse12 .cse22 .cse13 .cse16 .cse31 .cse18 .cse19)))) [2022-11-20 09:30:22,214 INFO L895 garLoopResultBuilder]: At program point L851-1(lines 832 859) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-20 09:30:22,214 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2022-11-20 09:30:22,215 INFO L895 garLoopResultBuilder]: At program point L422(line 422) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_st~0 0))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse11 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse2 (= ~p_dw_st~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse14 .cse15 .cse9 .cse16 .cse17 .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 (= ~q_write_ev~0 ~q_read_ev~0) .cse13 .cse6 .cse8 .cse14 (<= ~q_req_up~0 0) .cse2 (= ~q_read_ev~0 2) .cse15 .cse9 .cse16 .cse17 .cse10))) [2022-11-20 09:30:22,215 INFO L895 garLoopResultBuilder]: At program point L422-1(line 422) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_st~0 0))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse11 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse2 (= ~p_dw_st~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse14 .cse15 .cse9 .cse16 .cse17 .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 (= ~q_write_ev~0 ~q_read_ev~0) .cse13 .cse6 .cse8 .cse14 (<= ~q_req_up~0 0) .cse2 (= ~q_read_ev~0 2) .cse15 .cse9 .cse16 .cse17 .cse10))) [2022-11-20 09:30:22,216 INFO L895 garLoopResultBuilder]: At program point L439(line 439) the Hoare annotation is: (let ((.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (= ~q_read_ev~0 2)) (.cse8 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse21 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse13 (<= 2 ~q_write_ev~0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= ~q_req_up~0 0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse10 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse11 (<= 2 ~E_M~0)) (.cse12 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse15 (= ~q_free~0 0)) (.cse16 (<= ~t1_pc~0 0)) (.cse19 (= ~p_dw_i~0 1)) (.cse20 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 (< ~c_num_read~0 ~p_num_write~0) .cse11 .cse12 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse21 .cse12 .cse4 .cse13 .cse14 .cse5 .cse16 .cse22 .cse19 .cse7 .cse20 .cse8 .cse9 .cse23) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse21 .cse12 .cse4 .cse13 .cse14 .cse5 .cse16 .cse22 .cse17 .cse19 .cse7 .cse20 .cse9 .cse23) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse5 .cse15 .cse16 .cse19 (<= ~c_dr_pc~0 0) .cse20 .cse9))) [2022-11-20 09:30:22,216 INFO L895 garLoopResultBuilder]: At program point L439-1(line 439) the Hoare annotation is: (let ((.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse17 (= ~q_read_ev~0 2)) (.cse8 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse21 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse20 (<= 2 ~q_write_ev~0)) (.cse13 (<= ~c_dr_pc~0 1)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse16 (<= ~q_req_up~0 0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse10 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse11 (<= 2 ~E_M~0)) (.cse12 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse14 (= ~q_free~0 0)) (.cse15 (<= ~t1_pc~0 0)) (.cse18 (= ~p_dw_i~0 1)) (.cse19 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) (< ~c_num_read~0 ~p_num_write~0) .cse11 .cse12 .cse13 .cse5 .cse14 .cse6 .cse15 .cse16 .cse17 .cse18 .cse19 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse20 .cse13 .cse5 .cse14 .cse6 .cse15 .cse16 .cse17 .cse18 .cse19 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse21 .cse12 .cse4 .cse20 .cse13 .cse5 .cse15 .cse22 .cse18 .cse7 .cse19 .cse8 .cse9 .cse23) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse21 .cse12 .cse4 .cse20 .cse13 .cse5 .cse15 .cse22 .cse16 .cse18 .cse7 .cse19 .cse9 .cse23) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse5 .cse14 .cse15 .cse18 (<= ~c_dr_pc~0 0) .cse19 .cse9))) [2022-11-20 09:30:22,217 INFO L895 garLoopResultBuilder]: At program point L918(line 918) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-20 09:30:22,217 INFO L895 garLoopResultBuilder]: At program point L885(lines 874 887) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-20 09:30:22,217 INFO L895 garLoopResultBuilder]: At program point L687(line 687) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-20 09:30:22,218 INFO L895 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_st~0 0))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse11 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse2 (= ~p_dw_st~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse14 .cse15 .cse9 .cse16 .cse17 .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 (= ~q_write_ev~0 ~q_read_ev~0) .cse13 .cse6 .cse8 .cse14 (<= ~q_req_up~0 0) .cse2 (= ~q_read_ev~0 2) .cse15 .cse9 .cse16 .cse17 .cse10))) [2022-11-20 09:30:22,218 INFO L899 garLoopResultBuilder]: For program point L357(lines 347 387) no Hoare annotation was computed. [2022-11-20 09:30:22,218 INFO L899 garLoopResultBuilder]: For program point L836(lines 836 840) no Hoare annotation was computed. [2022-11-20 09:30:22,219 INFO L899 garLoopResultBuilder]: For program point L836-2(lines 835 858) no Hoare annotation was computed. [2022-11-20 09:30:22,219 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse24 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse25 (< ~c_num_read~0 ~p_num_write~0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (< 0 ~q_write_ev~0)) (.cse14 (= ~q_read_ev~0 2)) (.cse26 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse18 (<= 1 ~c_dr_pc~0)) (.cse19 (= ~q_free~0 1)) (.cse20 (<= 2 ~q_write_ev~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse21 (<= ~p_num_write~0 ~c_num_read~0)) (.cse13 (<= ~q_req_up~0 0)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse18 .cse6 .cse19 (= ~q_read_ev~0 1) .cse20 .cse7 .cse8 .cse10 .cse11 .cse21 .cse13 .cse15 .cse22 .cse16 .cse17 .cse23) (and .cse0 (= ~p_num_write~0 0) .cse2 (= ~c_num_read~0 0) .cse3 .cse4 .cse19 .cse8 .cse10 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse22 .cse24 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse19 .cse20 .cse7 .cse8 .cse11 .cse21 .cse15 .cse22 .cse16 .cse24 .cse17 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse25 .cse5 .cse18 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse19 .cse20 .cse7 .cse8 .cse11 .cse21 .cse13 .cse15 .cse22 .cse16 .cse17 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse15 (<= ~c_dr_pc~0 0) .cse16 .cse17))) [2022-11-20 09:30:22,219 INFO L895 garLoopResultBuilder]: At program point L886(lines 870 888) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-20 09:30:22,220 INFO L895 garLoopResultBuilder]: At program point L589(lines 560 595) the Hoare annotation is: (let ((.cse3 (<= ~m_pc~0 0))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) .cse3)) (.cse11 (= ~t1_pc~0 1)) (.cse12 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (<= 2 ~E_M~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse17 (= ~m_st~0 0)) (.cse5 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (<= ~c_dr_pc~0 0)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 (or (<= 1 ~t1_pc~0) (not .cse3)) .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 .cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse13 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse9 .cse15 .cse16) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse13 .cse4 .cse17 .cse5 .cse7 .cse14 .cse8 .cse9 .cse10 .cse15 .cse16 (= ~token~0 ~local~0)) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse13 .cse4 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse7 .cse14 .cse8 .cse9 .cse15 .cse16 (< ~local~0 ~token~0))))) [2022-11-20 09:30:22,220 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2022-11-20 09:30:22,220 INFO L899 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2022-11-20 09:30:22,220 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 09:30:22,221 INFO L899 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2022-11-20 09:30:22,221 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2022-11-20 09:30:22,221 INFO L899 garLoopResultBuilder]: For program point L689(line 689) no Hoare annotation was computed. [2022-11-20 09:30:22,221 INFO L895 garLoopResultBuilder]: At program point L524(lines 519 558) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= 2 ~T1_E~0) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)) [2022-11-20 09:30:22,222 INFO L895 garLoopResultBuilder]: At program point L904-1(lines 901 941) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-20 09:30:22,222 INFO L895 garLoopResultBuilder]: At program point L409(lines 398 411) the Hoare annotation is: (let ((.cse11 (< ~c_num_read~0 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (= ~q_read_ev~0 2)) (.cse8 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse23 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse22 (<= 2 ~q_write_ev~0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse24 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= ~q_req_up~0 0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse10 (<= 2 ~E_1~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse15 (= ~q_free~0 0)) (.cse16 (<= ~t1_pc~0 0)) (.cse19 (= ~p_dw_i~0 1)) (.cse20 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse13 .cse22 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse23 .cse13 .cse22 .cse14 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse6 .cse16 .cse24 .cse17 .cse18 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse19 .cse7 .cse20 .cse8 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse17 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse13 .cse5 .cse15 .cse16 .cse19 (<= ~c_dr_pc~0 0) .cse20 .cse9))) [2022-11-20 09:30:22,223 INFO L899 garLoopResultBuilder]: For program point L921(line 921) no Hoare annotation was computed. [2022-11-20 09:30:22,223 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 383) no Hoare annotation was computed. [2022-11-20 09:30:22,223 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: false [2022-11-20 09:30:22,223 INFO L899 garLoopResultBuilder]: For program point L905(line 905) no Hoare annotation was computed. [2022-11-20 09:30:22,223 INFO L895 garLoopResultBuilder]: At program point L575-1(lines 563 594) the Hoare annotation is: (let ((.cse5 (<= 2 ~m_st~0)) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse13 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= 2 ~T1_E~0)) (.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse8 (not (= ~E_M~0 0))) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (<= ~c_dr_pc~0 0)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse13 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse14 .cse9 .cse10 .cse15 .cse16 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14 .cse9 .cse10 .cse15 .cse16) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 (= ~token~0 ~local~0)))) [2022-11-20 09:30:22,224 INFO L895 garLoopResultBuilder]: At program point L410(lines 394 412) the Hoare annotation is: (let ((.cse11 (< ~c_num_read~0 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (= ~q_read_ev~0 2)) (.cse8 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse23 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse22 (<= 2 ~q_write_ev~0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse24 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= ~q_req_up~0 0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse10 (<= 2 ~E_1~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse15 (= ~q_free~0 0)) (.cse16 (<= ~t1_pc~0 0)) (.cse19 (= ~p_dw_i~0 1)) (.cse20 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse13 .cse22 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse23 .cse13 .cse22 .cse14 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse6 .cse16 .cse24 .cse17 .cse18 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse19 .cse7 .cse20 .cse8 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse17 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse13 .cse5 .cse15 .cse16 .cse19 (<= ~c_dr_pc~0 0) .cse20 .cse9))) [2022-11-20 09:30:22,224 INFO L899 garLoopResultBuilder]: For program point L245(lines 245 249) no Hoare annotation was computed. [2022-11-20 09:30:22,224 INFO L899 garLoopResultBuilder]: For program point L245-2(lines 244 257) no Hoare annotation was computed. [2022-11-20 09:30:22,225 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2022-11-20 09:30:22,225 INFO L899 garLoopResultBuilder]: For program point L691-1(lines 686 724) no Hoare annotation was computed. [2022-11-20 09:30:22,225 INFO L895 garLoopResultBuilder]: At program point L427-1(lines 424 449) the Hoare annotation is: (let ((.cse29 (= ~p_dw_st~0 0))) (let ((.cse13 (< ~c_num_read~0 ~p_num_write~0)) (.cse23 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse20 (= ~q_read_ev~0 2)) (.cse2 (not .cse29)) (.cse26 (<= 1 ~c_dr_pc~0)) (.cse6 (= ~q_free~0 1)) (.cse24 (<= 2 ~q_write_ev~0)) (.cse16 (<= ~c_dr_pc~0 1)) (.cse27 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (<= ~q_req_up~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse12 (<= 2 ~E_1~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (= ~m_st~0 0)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse17 (= ~q_free~0 0)) (.cse18 (<= ~t1_pc~0 0)) (.cse21 (= ~p_dw_i~0 1)) (.cse25 (<= ~c_dr_pc~0 0)) (.cse22 (= ~token~0 ~local~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse4 .cse5 (not (= ~q_write_ev~0 0)) .cse13 .cse14 .cse15 .cse16 .cse7 .cse17 .cse8 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse2 .cse4 .cse5 .cse14 .cse15 .cse24 .cse16 .cse7 .cse17 .cse8 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11) (and .cse0 .cse12 .cse1 .cse3 .cse4 .cse5 .cse14 .cse15 .cse6 .cse7 .cse8 .cse18 .cse21 .cse9 .cse25 .cse22 .cse11) (and .cse0 .cse12 .cse2 .cse4 .cse5 .cse13 .cse14 .cse26 .cse15 .cse24 .cse16 .cse17 .cse8 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse4 .cse5 .cse14 .cse26 .cse15 .cse6 .cse24 .cse16 .cse7 .cse8 .cse18 .cse27 .cse19 .cse20 .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse2 .cse4 .cse5 .cse14 .cse26 .cse15 .cse6 .cse24 .cse16 .cse7 .cse18 .cse27 .cse21 .cse9 .cse22 .cse10 .cse11 .cse28) (and .cse0 .cse12 .cse1 .cse3 .cse4 .cse5 .cse14 .cse15 .cse6 .cse24 .cse8 .cse18 .cse19 .cse29 .cse20 .cse21 .cse9 .cse25 .cse22 .cse11) (and .cse0 .cse12 .cse2 .cse4 .cse5 .cse14 .cse26 .cse15 .cse6 .cse24 .cse16 .cse7 .cse18 .cse27 .cse19 .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse4 .cse5 .cse14 .cse15 .cse7 .cse17 .cse18 .cse21 .cse25 .cse22 .cse11)))) [2022-11-20 09:30:22,226 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 368) no Hoare annotation was computed. [2022-11-20 09:30:22,226 INFO L899 garLoopResultBuilder]: For program point L576(line 576) no Hoare annotation was computed. [2022-11-20 09:30:22,226 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2022-11-20 09:30:22,226 INFO L899 garLoopResultBuilder]: For program point L923(lines 923 932) no Hoare annotation was computed. [2022-11-20 09:30:22,227 INFO L899 garLoopResultBuilder]: For program point L923-2(lines 923 932) no Hoare annotation was computed. [2022-11-20 09:30:22,227 INFO L895 garLoopResultBuilder]: At program point L725(lines 680 730) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-20 09:30:22,227 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 184) no Hoare annotation was computed. [2022-11-20 09:30:22,228 INFO L895 garLoopResultBuilder]: At program point L147-1(lines 135 170) the Hoare annotation is: (let ((.cse15 (<= 1 ~q_read_ev~0)) (.cse20 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse21 (= ~q_free~0 1)) (.cse22 (<= ~q_req_up~0 0)) (.cse1 (= ~q_req_up~0 1)) (.cse24 (<= 1 ~c_dr_pc~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse25 (<= ~c_dr_pc~0 1)) (.cse26 (= ~q_read_ev~0 2)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse9 (= ~m_st~0 0)) (.cse23 (not (= ~c_dr_st~0 0))) (.cse11 (= ~q_free~0 0)) (.cse12 (<= ~t1_pc~0 0)) (.cse13 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse14 (not (= ~E_M~0 0))) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~p_num_write~0 1) .cse13 .cse14 .cse15 .cse16 .cse17 (<= 1 ~p_num_write~0) .cse18 .cse19) (and .cse0 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse10 .cse12 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse23 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse8 .cse9 .cse21 .cse10 .cse25 .cse23 .cse12 .cse22 .cse13 .cse14 .cse26 .cse16 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (< ~c_num_read~0 ~p_num_write~0) .cse7 .cse24 .cse8 .cse9 .cse10 .cse25 .cse23 .cse11 .cse12 .cse13 .cse14 .cse26 .cse16 .cse18 .cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19))) [2022-11-20 09:30:22,228 INFO L899 garLoopResultBuilder]: For program point L428(line 428) no Hoare annotation was computed. [2022-11-20 09:30:22,228 INFO L899 garLoopResultBuilder]: For program point L841-1(lines 835 858) no Hoare annotation was computed. [2022-11-20 09:30:22,228 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 09:30:22,228 INFO L902 garLoopResultBuilder]: At program point L957(lines 948 959) the Hoare annotation is: true [2022-11-20 09:30:22,229 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2022-11-20 09:30:22,229 INFO L895 garLoopResultBuilder]: At program point L181(lines 176 224) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (not (= ~p_dw_st~0 0)) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (< ~c_num_read~0 ~p_num_write~0) (<= 2 ~E_M~0) (<= 1 ~c_dr_pc~0) (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|) (= ~m_st~0 0) (<= 2 ~q_write_ev~0) (<= ~c_dr_pc~0 1) (not (= ~c_dr_st~0 0)) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (<= ~q_req_up~0 0) (<= 1 ~q_read_ev~0) (= ~p_dw_i~0 1) (= ~token~0 ~local~0) (= ~M_E~0 2) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2022-11-20 09:30:22,229 INFO L899 garLoopResultBuilder]: For program point L148(lines 147 165) no Hoare annotation was computed. [2022-11-20 09:30:22,229 INFO L895 garLoopResultBuilder]: At program point L710(lines 686 724) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-20 09:30:22,230 INFO L895 garLoopResultBuilder]: At program point L545-1(lines 519 558) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (<= ~c_dr_pc~0 0)) (.cse13 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 .cse10 .cse11 (= ~token~0 ~local~0)) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 (< ~local~0 ~token~0)) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) .cse9 .cse10 .cse11 .cse13))) [2022-11-20 09:30:22,230 INFO L895 garLoopResultBuilder]: At program point L149(lines 135 170) the Hoare annotation is: (let ((.cse2 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse12 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse13 (not (= ~E_M~0 0))) (.cse15 (<= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse9 (= ~m_st~0 0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse18 (not (= ~c_dr_st~0 0))) (.cse11 (<= ~t1_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~q_req_up~0 0) .cse12 .cse13 (<= 1 ~q_read_ev~0) .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 (= ~q_free~0 0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 (<= 1 ~c_dr_pc~0) .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 1) .cse18 .cse11 (<= ~p_num_write~0 ~c_num_read~0) (= ~q_read_ev~0 2) .cse14 .cse16 .cse17 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-11-20 09:30:22,230 INFO L899 garLoopResultBuilder]: For program point L496(line 496) no Hoare annotation was computed. [2022-11-20 09:30:22,230 INFO L902 garLoopResultBuilder]: At program point L942(lines 889 947) the Hoare annotation is: true [2022-11-20 09:30:22,230 INFO L895 garLoopResultBuilder]: At program point L876(line 876) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-11-20 09:30:22,230 INFO L899 garLoopResultBuilder]: For program point L876-1(line 876) no Hoare annotation was computed. [2022-11-20 09:30:22,231 INFO L895 garLoopResultBuilder]: At program point L166(lines 132 171) the Hoare annotation is: (let ((.cse13 (<= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~q_req_up~0 1)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse8 (= ~m_st~0 0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse16 (not (= ~c_dr_st~0 0))) (.cse10 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (= ~p_dw_i~0 1)) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_num_read~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~p_num_write~0 1) (<= 1 ~q_read_ev~0) .cse12 .cse13 (<= 1 ~p_num_write~0) .cse14 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< ~c_num_read~0 ~p_num_write~0) .cse6 .cse7 .cse8 .cse9 (<= ~c_dr_pc~0 1) .cse16 .cse10 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse11 (= ~q_read_ev~0 2) .cse12 .cse14 .cse15 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-11-20 09:30:22,231 INFO L895 garLoopResultBuilder]: At program point L348(line 348) the Hoare annotation is: (let ((.cse32 (= ~p_dw_st~0 0))) (let ((.cse15 (<= 1 ~q_read_ev~0)) (.cse30 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse1 (= ~q_req_up~0 1)) (.cse21 (< ~c_num_read~0 ~p_num_write~0)) (.cse26 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse29 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse27 (= ~p_num_write~0 0)) (.cse28 (= ~c_num_read~0 0)) (.cse23 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse25 (= ~q_read_ev~0 2)) (.cse3 (not .cse32)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse9 (= ~q_free~0 1)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse11 (<= ~c_dr_pc~0 1)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse24 (<= ~q_req_up~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse2 (<= 2 ~E_1~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse12 (not (= ~c_dr_st~0 0))) (.cse22 (= ~q_free~0 0)) (.cse13 (<= ~t1_pc~0 0)) (.cse16 (= ~p_dw_i~0 1)) (.cse31 (<= ~c_dr_pc~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 (not (= ~q_write_ev~0 0)) .cse21 .cse6 .cse7 .cse8 .cse11 .cse12 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse27 .cse3 .cse28 .cse4 .cse5 .cse9 .cse12 .cse23 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse17 .cse29 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse30 .cse8 .cse10 .cse22 .cse13 (<= ~p_num_write~0 1) .cse15 .cse16 .cse31 (<= 1 ~p_num_write~0) .cse18 .cse19) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse8 .cse9 .cse12 .cse23 .cse13 .cse16 .cse17 .cse31 .cse18 .cse19) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse25 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse24 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse23 .cse13 .cse24 .cse32 .cse25 .cse16 .cse17 .cse31 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse8 .cse12 .cse22 .cse13 .cse16 .cse31 .cse18 .cse19)))) [2022-11-20 09:30:22,231 INFO L895 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2022-11-20 09:30:22,232 INFO L895 garLoopResultBuilder]: At program point L216-1(lines 176 224) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 0))) (let ((.cse8 (= ~q_free~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse19 (= ~q_req_up~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse20 (not .cse12)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse7 (= ~m_st~0 0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse11 (<= ~t1_pc~0 0)) (.cse23 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse24 (not (= ~E_M~0 0))) (.cse18 (<= 1 ~q_read_ev~0)) (.cse13 (= ~p_dw_i~0 1)) (.cse15 (<= ~c_dr_pc~0 0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= ~p_num_write~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~q_req_up~0 0) .cse12 (= ~q_read_ev~0 2) .cse13 .cse14 .cse15 .cse16 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse17) (and .cse18 (let ((.cse21 (<= ~p_num_write~0 ~c_num_read~0)) (.cse22 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse19 .cse1 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~c_dr_pc~0 1) .cse10 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse11 .cse21 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse19 .cse1 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse21 .cse23 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse22)))) (and .cse0 .cse19 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 (= ~q_free~0 0) .cse11 (<= ~p_num_write~0 1) .cse23 .cse24 .cse18 .cse13 .cse15 (<= 1 ~p_num_write~0) .cse16 .cse17)))) [2022-11-20 09:30:22,232 INFO L895 garLoopResultBuilder]: At program point L497(lines 492 499) the Hoare annotation is: false [2022-11-20 09:30:22,232 INFO L899 garLoopResultBuilder]: For program point L646(lines 646 650) no Hoare annotation was computed. [2022-11-20 09:30:22,232 INFO L899 garLoopResultBuilder]: For program point L646-2(lines 645 658) no Hoare annotation was computed. [2022-11-20 09:30:22,233 INFO L895 garLoopResultBuilder]: At program point L84(lines 72 86) the Hoare annotation is: (let ((.cse22 (not (= ~p_num_write~0 0))) (.cse23 (not (= ~c_num_read~0 0))) (.cse3 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse7 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse15 (not (<= 1 ~c_dr_pc~0))) (.cse17 (not (= ~q_free~0 1))) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse11 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse21 (not (<= ~c_dr_pc~0 0))) (.cse14 (not (<= 2 ~q_write_ev~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~M_E~0 2))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse5 (and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse27 (not (= ~q_free~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (<= ~c_dr_pc~0 1))) (.cse10 (= ~p_dw_st~0 0)) (.cse24 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse12 (not (= ~T1_E~0 ~M_E~0))) (.cse13 (not (= ~m_st~0 0))) (.cse16 (not (= ~p_dw_i~0 1))) (.cse25 (not (<= ~q_req_up~0 0))) (.cse26 (not (= ~q_read_ev~0 2))) (.cse19 (not (<= 2 ~E_1~0))) (.cse20 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse1 (not .cse10) .cse2 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse4 .cse22 .cse5 .cse6 .cse23 .cse8 .cse24 .cse12 .cse13 .cse16 .cse17 .cse25 .cse26 .cse18 .cse19 .cse20) (or .cse0 .cse21 .cse1 .cse2 .cse4 .cse22 .cse5 .cse6 .cse23 .cse8 .cse24 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse22 .cse5 .cse6 (= ~E_M~0 0) .cse23 .cse10 .cse24 .cse11 .cse12 .cse17 .cse18) (or .cse0 .cse1 .cse2 (= ~q_read_ev~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18 .cse19 .cse20) (or .cse0 .cse21 .cse1 .cse2 .cse4 .cse5 .cse6 .cse27 .cse8 .cse10 .cse11 .cse12 .cse13 .cse16 .cse19 .cse20) (or .cse0 .cse21 .cse1 .cse2 .cse4 .cse5 .cse6 .cse27 .cse8 .cse10 .cse12 .cse13 .cse16 .cse26 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse27 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse14 .cse16 .cse25 .cse26 .cse19 .cse20) (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse4 .cse5 (not (< ~c_num_read~0 ~p_num_write~0)) .cse6 .cse27 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 (= ~q_write_ev~0 0) .cse16 .cse25 .cse26 .cse19 .cse20))) [2022-11-20 09:30:22,233 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 69 87) no Hoare annotation was computed. [2022-11-20 09:30:22,233 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 69 87) no Hoare annotation was computed. [2022-11-20 09:30:22,233 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 79) no Hoare annotation was computed. [2022-11-20 09:30:22,233 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 82) no Hoare annotation was computed. [2022-11-20 09:30:22,233 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 73 82) no Hoare annotation was computed. [2022-11-20 09:30:22,233 INFO L902 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 69 87) the Hoare annotation is: true [2022-11-20 09:30:22,233 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 259 278) no Hoare annotation was computed. [2022-11-20 09:30:22,234 INFO L895 garLoopResultBuilder]: At program point L275(lines 262 277) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse27 (= ~q_read_ev~0 2)) (.cse26 (= ~p_dw_st~0 0))) (let ((.cse15 (not (= ~p_num_write~0 0))) (.cse3 (not .cse26)) (.cse18 (not (= ~q_free~0 1))) (.cse19 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse20 (not (<= ~c_dr_pc~0 1))) (.cse17 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse22 (not (<= 1 ~c_dr_pc~0))) (.cse23 (not (<= ~q_req_up~0 0))) (.cse24 (not .cse27)) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse16 (not (= ~c_num_read~0 0))) (.cse7 (not (= ~q_free~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse21 (not (<= 2 ~q_write_ev~0))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse12 (<= 1 exists_runnable_thread1_~__retres1~2)) (.cse25 (not .cse0)) (.cse13 (not (<= 2 ~E_1~0))) (.cse14 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 .cse8 .cse17 .cse9 .cse10 .cse11 .cse18 .cse12 .cse19 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 .cse8 .cse20 .cse9 .cse10 .cse21 .cse22 .cse11 .cse18 .cse12 .cse23 .cse24 .cse19 .cse13 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 .cse8 .cse17 .cse9 .cse10 .cse21 .cse11 .cse18 .cse12 .cse23 .cse24 .cse19 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse5 .cse6 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse8 .cse20 .cse17 .cse9 .cse10 .cse21 .cse22 .cse11 .cse18 .cse12 .cse23 .cse24 .cse19 .cse13 .cse14) (or .cse2 .cse4 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse25 .cse5 (not (< ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 .cse8 .cse20 .cse26 .cse17 .cse9 .cse10 .cse21 .cse22 .cse11 .cse12 .cse23 .cse24 .cse13 .cse14) (or .cse1 .cse2 .cse4 (not (= ~q_req_up~0 1)) .cse5 .cse6 .cse16 .cse7 .cse8 .cse26 .cse9 .cse10 .cse21 .cse11 .cse12 (not (<= 1 ~p_num_write~0)) (not (<= 1 ~q_read_ev~0)) (and .cse25 .cse27) .cse13 (not (<= ~p_num_write~0 1)) .cse14)))) [2022-11-20 09:30:22,234 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 259 278) the Hoare annotation is: true [2022-11-20 09:30:22,234 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2022-11-20 09:30:22,234 INFO L899 garLoopResultBuilder]: For program point L263(lines 263 273) no Hoare annotation was computed. [2022-11-20 09:30:22,234 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 259 278) no Hoare annotation was computed. [2022-11-20 09:30:22,235 INFO L902 garLoopResultBuilder]: At program point error1ENTRY(lines 24 31) the Hoare annotation is: true [2022-11-20 09:30:22,235 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 28) no Hoare annotation was computed. [2022-11-20 09:30:22,235 INFO L899 garLoopResultBuilder]: For program point error1FINAL(lines 24 31) no Hoare annotation was computed. [2022-11-20 09:30:22,235 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 24 31) no Hoare annotation was computed. [2022-11-20 09:30:22,235 INFO L899 garLoopResultBuilder]: For program point L668(lines 668 673) no Hoare annotation was computed. [2022-11-20 09:30:22,235 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 660 679) no Hoare annotation was computed. [2022-11-20 09:30:22,235 INFO L899 garLoopResultBuilder]: For program point L664(lines 664 674) no Hoare annotation was computed. [2022-11-20 09:30:22,235 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 660 679) the Hoare annotation is: true [2022-11-20 09:30:22,235 INFO L902 garLoopResultBuilder]: At program point L676(lines 663 678) the Hoare annotation is: true [2022-11-20 09:30:22,235 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 660 679) no Hoare annotation was computed. [2022-11-20 09:30:22,236 INFO L899 garLoopResultBuilder]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2022-11-20 09:30:22,236 INFO L895 garLoopResultBuilder]: At program point reset_delta_events1ENTRY(lines 297 314) the Hoare annotation is: (let ((.cse32 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse18 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse14 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse15 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse19 (not (<= 2 |old(~q_write_ev~0)|))) (.cse28 (not (< 0 |old(~q_write_ev~0)|))) (.cse20 (not (<= 1 ~c_dr_pc~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse30 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse31 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse6 (and .cse32 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse7 (not (= ~q_free~0 0))) (.cse16 (not (<= ~c_dr_pc~0 1))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse17 (= ~p_dw_st~0 0)) (.cse3 (not (= ~M_E~0 2))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse23 (not (= ~p_num_write~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse24 (not (= ~c_num_read~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse25 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse27 (not (= |old(~q_read_ev~0)| 2))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse21 (not (= ~q_free~0 1))) (.cse26 (not (<= ~q_req_up~0 0))) (.cse22 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse12 (not (<= 2 ~E_1~0))) (.cse29 (and .cse32 (= ~q_read_ev~0 2))) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse8 .cse16 .cse17 .cse18 .cse9 .cse10 .cse19 .cse20 .cse11 .cse21 .cse22 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse6 .cse24 .cse8 .cse25 .cse9 .cse10 .cse11 .cse21 .cse22 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse8 .cse16 .cse17 .cse9 .cse10 .cse19 .cse20 .cse11 .cse21 .cse26 .cse22 .cse12 .cse13) (or .cse0 .cse2 .cse3 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse23 .cse5 (= ~E_M~0 0) .cse6 .cse24 .cse17 .cse25 .cse18 .cse9 .cse21 .cse22) (or .cse0 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse8 .cse16 .cse25 .cse9 .cse10 (not (= |old(~q_read_ev~0)| 1)) .cse19 .cse20 .cse11 .cse21 .cse26 .cse22 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse16 .cse17 .cse25 .cse9 .cse10 .cse27 .cse28 .cse11 .cse26 .cse12 .cse29 .cse13) (or .cse2 .cse3 .cse30 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse16 .cse17 .cse25 .cse9 .cse10 .cse27 .cse28 .cse20 .cse11 .cse26 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse30 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse16 .cse17 .cse25 .cse9 .cse10 .cse27 .cse11 (= |old(~q_write_ev~0)| 0) .cse26 .cse12 .cse13) (or .cse1 .cse2 (not .cse17) .cse3 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse4 .cse23 .cse5 .cse24 .cse8 .cse25 .cse9 .cse10 .cse27 .cse11 .cse21 .cse26 .cse22 .cse12 .cse29 .cse13)))) [2022-11-20 09:30:22,236 INFO L899 garLoopResultBuilder]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2022-11-20 09:30:22,236 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 297 314) no Hoare annotation was computed. [2022-11-20 09:30:22,236 INFO L899 garLoopResultBuilder]: For program point L768-1(lines 762 785) no Hoare annotation was computed. [2022-11-20 09:30:22,237 INFO L899 garLoopResultBuilder]: For program point L763-1(lines 762 785) no Hoare annotation was computed. [2022-11-20 09:30:22,237 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 759 786) no Hoare annotation was computed. [2022-11-20 09:30:22,237 INFO L895 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 759 786) the Hoare annotation is: (let ((.cse15 (not (= ~m_st~0 0))) (.cse7 (= ~t1_st~0 0)) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse18 (not (<= ~t1_pc~0 0))) (.cse19 (not (<= 2 ~m_st~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (<= 2 |old(~T1_E~0)|))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse12 (not (= ~q_free~0 0))) (.cse13 (not (<= 2 |old(~E_M~0)|))) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (< ~local~0 ~token~0)) .cse13 .cse14 .cse15 .cse16 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse19 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or .cse19 .cse1 (= |old(~E_M~0)| 0) .cse2 .cse4 .cse5 .cse8 .cse10 .cse11 .cse12 .cse14 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse16) (or .cse19 .cse0 .cse1 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse19 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17))) [2022-11-20 09:30:22,237 INFO L899 garLoopResultBuilder]: For program point L778-1(lines 759 786) no Hoare annotation was computed. [2022-11-20 09:30:22,237 INFO L899 garLoopResultBuilder]: For program point L773-1(lines 762 785) no Hoare annotation was computed. [2022-11-20 09:30:22,244 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:30:22,247 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:30:22,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:30:22 BoogieIcfgContainer [2022-11-20 09:30:22,437 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:30:22,438 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:30:22,438 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:30:22,438 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:30:22,439 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:13" (3/4) ... [2022-11-20 09:30:22,450 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 09:30:22,459 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-11-20 09:30:22,459 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2022-11-20 09:30:22,459 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2022-11-20 09:30:22,459 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2022-11-20 09:30:22,460 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2022-11-20 09:30:22,460 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2022-11-20 09:30:22,460 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2022-11-20 09:30:22,460 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-11-20 09:30:22,460 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-11-20 09:30:22,461 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2022-11-20 09:30:22,461 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2022-11-20 09:30:22,461 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2022-11-20 09:30:22,461 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2022-11-20 09:30:22,461 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2022-11-20 09:30:22,483 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-11-20 09:30:22,484 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-20 09:30:22,485 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 09:30:22,486 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 09:30:22,520 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || (q_req_up <= 0 && q_write_ev == \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(\old(q_req_up) == 1)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) [2022-11-20 09:30:22,520 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) && ((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local)) [2022-11-20 09:30:22,521 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && ((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) [2022-11-20 09:30:22,529 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((!(p_dw_st == 0) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && !(t1_st == 0))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) [2022-11-20 09:30:22,532 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local)) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && !(t1_st == 0)) && 0 <= \result)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local))) && ((((((((((((!(p_dw_st == 0) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) [2022-11-20 09:30:22,627 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 09:30:22,627 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:30:22,631 INFO L158 Benchmark]: Toolchain (without parser) took 190487.46ms. Allocated memory was 165.7MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 134.1MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-11-20 09:30:22,633 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 125.8MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:30:22,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.60ms. Allocated memory is still 165.7MB. Free memory was 134.1MB in the beginning and 125.8MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 09:30:22,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.46ms. Allocated memory is still 165.7MB. Free memory was 125.8MB in the beginning and 123.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:30:22,640 INFO L158 Benchmark]: Boogie Preprocessor took 75.71ms. Allocated memory is still 165.7MB. Free memory was 123.7MB in the beginning and 121.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:30:22,641 INFO L158 Benchmark]: RCFGBuilder took 1043.49ms. Allocated memory is still 165.7MB. Free memory was 120.8MB in the beginning and 94.4MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-20 09:30:22,643 INFO L158 Benchmark]: TraceAbstraction took 188577.45ms. Allocated memory was 165.7MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 93.5MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2022-11-20 09:30:22,644 INFO L158 Benchmark]: Witness Printer took 189.59ms. Allocated memory is still 4.1GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 09:30:22,645 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.31ms. Allocated memory is still 125.8MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 493.60ms. Allocated memory is still 165.7MB. Free memory was 134.1MB in the beginning and 125.8MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.46ms. Allocated memory is still 165.7MB. Free memory was 125.8MB in the beginning and 123.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.71ms. Allocated memory is still 165.7MB. Free memory was 123.7MB in the beginning and 121.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1043.49ms. Allocated memory is still 165.7MB. Free memory was 120.8MB in the beginning and 94.4MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 188577.45ms. Allocated memory was 165.7MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 93.5MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 189.59ms. Allocated memory is still 4.1GB. Free memory was 2.7GB in the beginning and 2.7GB in the end (delta: 11.5MB). 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: 496]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 28]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 208 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 188.3s, OverallIterations: 35, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 51.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 95.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18612 SdHoareTripleChecker+Valid, 17.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18161 mSDsluCounter, 24616 SdHoareTripleChecker+Invalid, 14.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17186 mSDsCounter, 4223 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18156 IncrementalHoareTripleChecker+Invalid, 22379 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4223 mSolverCounterUnsat, 7430 mSDtfsCounter, 18156 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3749 GetRequests, 3273 SyntacticMatches, 16 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14282occurred in iteration=18, InterpolantAutomatonStates: 403, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.3s AutomataMinimizationTime, 35 MinimizatonAttempts, 9753 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 16053 PreInvPairs, 18024 NumberOfFragments, 28642 HoareAnnotationTreeSize, 16053 FomulaSimplifications, 13096 FormulaSimplificationTreeSizeReduction, 20.9s HoareSimplificationTime, 84 FomulaSimplificationsInter, 574773 FormulaSimplificationTreeSizeReductionInter, 73.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 5734 NumberOfCodeBlocks, 5734 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 6171 ConstructedInterpolants, 0 QuantifiedInterpolants, 11614 SizeOfPredicates, 7 NumberOfNonLiveVariables, 6631 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 52 InterpolantComputations, 32 PerfectInterpolantSequences, 3229/3363 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 889]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 686]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 642]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local) - InvariantResult [Line: 615]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local)) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && !(t1_st == 0)) && 0 <= \result)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local))) && ((((((((((((!(p_dw_st == 0) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 1) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2 - InvariantResult [Line: 680]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: (((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(q_free == 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || q_read_ev == 1) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || q_write_ev == 0) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 516]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 823]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: ((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (1 <= t1_pc || !(m_pc <= 0))) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && ((t1_pc <= 1 && !(m_pc <= 1)) || m_pc <= 0)) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && ((t1_pc <= 1 && !(m_pc <= 1)) || m_pc <= 0)) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token) - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && ((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) - InvariantResult [Line: 663]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && __retres1 <= 0) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 0 <= __retres1) && M_E == 2)) || !(token == local)) && ((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || (__retres1 <= 0 && 0 <= __retres1)) || !(q_free == 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(q_read_ev == 1)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && __retres1 <= 0) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 0 <= __retres1) && M_E == 2)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || 0 < q_write_ev) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || q_write_ev == 0) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 2 <= E_M) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 832]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: (((((((((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 2 <= E_M) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((!(p_dw_st == 0) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && !(t1_st == 0))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2) || ((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && t1_pc <= 0) && q_req_up <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && t1_pc <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: M_E == 2 - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 1) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 901]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || (q_req_up <= 0 && q_write_ev == \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(\old(q_req_up) == 1)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (1 <= q_read_ev && (((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) || (((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)))) || ((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 473]: Loop Invariant Derived loop invariant: M_E == 2 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && t1_pc <= 0) && q_req_up <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && t1_pc <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && q_req_up <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || ((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) && ((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 948]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((((((((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 2 <= E_M) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || 1 <= __retres1) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((!(m_pc == t1_pc) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(c_dr_st == 0)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(q_req_up == 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || 1 <= __retres1) || !(1 <= p_num_write)) || !(1 <= q_read_ev)) || (!(c_dr_st == 0) && q_read_ev == 2)) || !(2 <= E_1)) || !(p_num_write <= 1)) || !(token == local)) - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: (((((((((((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 2 <= E_M) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (1 <= t1_pc || !(m_pc <= 0))) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && ((t1_pc <= 1 && !(m_pc <= 1)) || m_pc <= 0)) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local) RESULT: Ultimate proved your program to be correct! [2022-11-20 09:30:22,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fced5061-2ec4-4983-bd52-6c469e4f808a/bin/uautomizer-ug76WZFUDN/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