./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 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 20:46:22,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 20:46:22,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 20:46:22,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 20:46:22,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 20:46:22,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 20:46:22,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 20:46:22,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 20:46:22,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 20:46:22,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 20:46:22,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 20:46:22,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 20:46:22,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 20:46:22,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 20:46:22,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 20:46:22,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 20:46:22,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 20:46:22,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 20:46:22,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 20:46:22,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 20:46:22,229 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 20:46:22,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 20:46:22,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 20:46:22,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 20:46:22,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 20:46:22,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 20:46:22,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 20:46:22,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 20:46:22,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 20:46:22,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 20:46:22,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 20:46:22,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 20:46:22,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 20:46:22,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 20:46:22,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 20:46:22,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 20:46:22,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 20:46:22,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 20:46:22,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 20:46:22,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 20:46:22,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 20:46:22,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 20:46:22,248 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 20:46:22,276 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 20:46:22,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 20:46:22,277 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 20:46:22,277 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 20:46:22,278 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 20:46:22,278 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 20:46:22,279 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 20:46:22,279 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 20:46:22,279 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 20:46:22,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 20:46:22,280 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 20:46:22,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 20:46:22,281 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 20:46:22,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 20:46:22,281 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 20:46:22,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 20:46:22,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 20:46:22,281 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 20:46:22,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 20:46:22,283 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 20:46:22,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 20:46:22,283 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 20:46:22,283 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 20:46:22,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 20:46:22,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 20:46:22,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 20:46:22,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 20:46:22,284 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 20:46:22,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 20:46:22,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 20:46:22,285 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 20:46:22,285 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 20:46:22,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 20:46:22,286 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-07-22 20:46:22,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 20:46:22,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 20:46:22,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 20:46:22,512 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 20:46:22,512 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 20:46:22,513 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-07-22 20:46:22,565 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb764147c/c683ffabf04e42bf89b5a5a49522cd8e/FLAG5ada16348 [2022-07-22 20:46:23,025 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 20:46:23,026 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-07-22 20:46:23,035 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb764147c/c683ffabf04e42bf89b5a5a49522cd8e/FLAG5ada16348 [2022-07-22 20:46:23,411 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb764147c/c683ffabf04e42bf89b5a5a49522cd8e [2022-07-22 20:46:23,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 20:46:23,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 20:46:23,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 20:46:23,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 20:46:23,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 20:46:23,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 08:46:23" (1/1) ... [2022-07-22 20:46:23,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23e5547e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:23, skipping insertion in model container [2022-07-22 20:46:23,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 08:46:23" (1/1) ... [2022-07-22 20:46:23,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 20:46:23,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 20:46:23,592 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2022-07-22 20:46:23,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2022-07-22 20:46:23,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 20:46:23,663 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 20:46:23,673 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2022-07-22 20:46:23,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2022-07-22 20:46:23,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 20:46:23,718 INFO L208 MainTranslator]: Completed translation [2022-07-22 20:46:23,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:23 WrapperNode [2022-07-22 20:46:23,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 20:46:23,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 20:46:23,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 20:46:23,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 20:46:23,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:23" (1/1) ... [2022-07-22 20:46:23,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:23" (1/1) ... [2022-07-22 20:46:23,764 INFO L137 Inliner]: procedures = 55, calls = 60, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 402 [2022-07-22 20:46:23,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 20:46:23,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 20:46:23,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 20:46:23,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 20:46:23,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:23" (1/1) ... [2022-07-22 20:46:23,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:23" (1/1) ... [2022-07-22 20:46:23,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:23" (1/1) ... [2022-07-22 20:46:23,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:23" (1/1) ... [2022-07-22 20:46:23,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:23" (1/1) ... [2022-07-22 20:46:23,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:23" (1/1) ... [2022-07-22 20:46:23,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:23" (1/1) ... [2022-07-22 20:46:23,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 20:46:23,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 20:46:23,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 20:46:23,804 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 20:46:23,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:23" (1/1) ... [2022-07-22 20:46:23,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 20:46:23,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:46:23,831 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 20:46:23,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 20:46:23,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 20:46:23,879 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-22 20:46:23,880 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-22 20:46:23,880 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-07-22 20:46:23,880 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-07-22 20:46:23,880 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-07-22 20:46:23,880 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-07-22 20:46:23,880 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-07-22 20:46:23,881 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-07-22 20:46:23,881 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-07-22 20:46:23,881 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-07-22 20:46:23,881 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-07-22 20:46:23,881 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-07-22 20:46:23,881 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-07-22 20:46:23,881 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-07-22 20:46:23,882 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-07-22 20:46:23,882 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-07-22 20:46:23,882 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-07-22 20:46:23,882 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-07-22 20:46:23,882 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-07-22 20:46:23,882 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-07-22 20:46:23,883 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-07-22 20:46:23,883 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-07-22 20:46:23,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 20:46:23,883 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-07-22 20:46:23,883 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-07-22 20:46:23,883 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-07-22 20:46:23,884 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-07-22 20:46:23,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 20:46:23,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 20:46:23,884 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-07-22 20:46:23,884 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-07-22 20:46:23,957 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 20:46:23,958 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 20:46:24,453 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 20:46:24,466 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 20:46:24,468 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-22 20:46:24,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 08:46:24 BoogieIcfgContainer [2022-07-22 20:46:24,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 20:46:24,473 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 20:46:24,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 20:46:24,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 20:46:24,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 08:46:23" (1/3) ... [2022-07-22 20:46:24,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31719f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 08:46:24, skipping insertion in model container [2022-07-22 20:46:24,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:46:23" (2/3) ... [2022-07-22 20:46:24,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31719f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 08:46:24, skipping insertion in model container [2022-07-22 20:46:24,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 08:46:24" (3/3) ... [2022-07-22 20:46:24,480 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-07-22 20:46:24,493 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 20:46:24,493 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-22 20:46:24,559 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 20:46:24,567 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2729c4bb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@13e23071 [2022-07-22 20:46:24,568 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-22 20:46:24,574 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-07-22 20:46:24,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-22 20:46:24,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:24,592 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-07-22 20:46:24,593 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:24,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:24,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1497674214, now seen corresponding path program 1 times [2022-07-22 20:46:24,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:24,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169184825] [2022-07-22 20:46:24,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:24,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:24,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:24,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:46:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:24,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:46:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:24,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:46:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:24,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:46:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:24,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:24,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:24,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169184825] [2022-07-22 20:46:24,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169184825] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:24,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:24,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 20:46:24,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36581661] [2022-07-22 20:46:24,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:24,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 20:46:24,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:24,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 20:46:24,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:46:25,003 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-07-22 20:46:25,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:25,736 INFO L93 Difference]: Finished difference Result 530 states and 790 transitions. [2022-07-22 20:46:25,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 20:46:25,738 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-07-22 20:46:25,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:25,749 INFO L225 Difference]: With dead ends: 530 [2022-07-22 20:46:25,750 INFO L226 Difference]: Without dead ends: 329 [2022-07-22 20:46:25,754 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-07-22 20:46:25,756 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 516 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:25,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 746 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 20:46:25,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-22 20:46:25,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 288. [2022-07-22 20:46:25,829 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-07-22 20:46:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 404 transitions. [2022-07-22 20:46:25,837 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 404 transitions. Word has length 57 [2022-07-22 20:46:25,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:25,838 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 404 transitions. [2022-07-22 20:46:25,838 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-07-22 20:46:25,839 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 404 transitions. [2022-07-22 20:46:25,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-22 20:46:25,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:25,849 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-07-22 20:46:25,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 20:46:25,849 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:25,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:25,850 INFO L85 PathProgramCache]: Analyzing trace with hash -604187876, now seen corresponding path program 1 times [2022-07-22 20:46:25,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:25,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730934581] [2022-07-22 20:46:25,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:25,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:25,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:25,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:46:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:25,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:46:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:25,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:46:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:25,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:46:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:25,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:25,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730934581] [2022-07-22 20:46:25,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730934581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:25,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:25,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:46:25,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881875616] [2022-07-22 20:46:25,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:25,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:46:25,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:26,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:46:26,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:46:26,002 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-07-22 20:46:26,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:26,819 INFO L93 Difference]: Finished difference Result 620 states and 878 transitions. [2022-07-22 20:46:26,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 20:46:26,819 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-07-22 20:46:26,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:26,832 INFO L225 Difference]: With dead ends: 620 [2022-07-22 20:46:26,833 INFO L226 Difference]: Without dead ends: 437 [2022-07-22 20:46:26,839 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-07-22 20:46:26,842 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 493 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:26,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1025 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 20:46:26,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-07-22 20:46:26,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 373. [2022-07-22 20:46:26,896 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-07-22 20:46:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 521 transitions. [2022-07-22 20:46:26,899 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 521 transitions. Word has length 57 [2022-07-22 20:46:26,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:26,899 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 521 transitions. [2022-07-22 20:46:26,899 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-07-22 20:46:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 521 transitions. [2022-07-22 20:46:26,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-22 20:46:26,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:26,902 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-07-22 20:46:26,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 20:46:26,903 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:26,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:26,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1641391578, now seen corresponding path program 1 times [2022-07-22 20:46:26,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:26,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199980764] [2022-07-22 20:46:26,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:26,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:26,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:26,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:46:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:26,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:46:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:26,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:46:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:26,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:46:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:26,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:26,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199980764] [2022-07-22 20:46:26,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199980764] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:26,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:26,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:46:26,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735358989] [2022-07-22 20:46:26,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:26,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:46:26,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:26,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:46:26,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:46:26,999 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-07-22 20:46:27,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:27,423 INFO L93 Difference]: Finished difference Result 703 states and 997 transitions. [2022-07-22 20:46:27,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 20:46:27,423 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-07-22 20:46:27,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:27,428 INFO L225 Difference]: With dead ends: 703 [2022-07-22 20:46:27,428 INFO L226 Difference]: Without dead ends: 435 [2022-07-22 20:46:27,433 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-07-22 20:46:27,436 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 436 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:27,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 688 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 20:46:27,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-07-22 20:46:27,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 373. [2022-07-22 20:46:27,474 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-07-22 20:46:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 518 transitions. [2022-07-22 20:46:27,476 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 518 transitions. Word has length 57 [2022-07-22 20:46:27,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:27,477 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 518 transitions. [2022-07-22 20:46:27,477 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-07-22 20:46:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 518 transitions. [2022-07-22 20:46:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-22 20:46:27,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:27,479 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-07-22 20:46:27,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 20:46:27,480 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:27,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:27,480 INFO L85 PathProgramCache]: Analyzing trace with hash 743998300, now seen corresponding path program 1 times [2022-07-22 20:46:27,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:27,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513654320] [2022-07-22 20:46:27,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:27,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:27,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:27,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:46:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:27,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:46:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:27,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:46:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:27,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:46:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:27,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:27,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513654320] [2022-07-22 20:46:27,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513654320] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:27,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:27,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:46:27,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152562870] [2022-07-22 20:46:27,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:27,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:46:27,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:27,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:46:27,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:46:27,597 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-07-22 20:46:28,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:28,181 INFO L93 Difference]: Finished difference Result 739 states and 1054 transitions. [2022-07-22 20:46:28,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 20:46:28,182 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-07-22 20:46:28,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:28,186 INFO L225 Difference]: With dead ends: 739 [2022-07-22 20:46:28,187 INFO L226 Difference]: Without dead ends: 472 [2022-07-22 20:46:28,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-07-22 20:46:28,212 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 267 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:28,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 916 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 20:46:28,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-07-22 20:46:28,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 382. [2022-07-22 20:46:28,248 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-07-22 20:46:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 527 transitions. [2022-07-22 20:46:28,251 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 527 transitions. Word has length 57 [2022-07-22 20:46:28,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:28,252 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 527 transitions. [2022-07-22 20:46:28,253 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-07-22 20:46:28,253 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 527 transitions. [2022-07-22 20:46:28,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-22 20:46:28,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:28,259 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-07-22 20:46:28,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 20:46:28,259 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:28,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:28,260 INFO L85 PathProgramCache]: Analyzing trace with hash 671611742, now seen corresponding path program 1 times [2022-07-22 20:46:28,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:28,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020043405] [2022-07-22 20:46:28,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:28,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:28,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:28,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:46:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:28,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:46:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:28,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:46:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:28,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:46:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:28,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:28,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020043405] [2022-07-22 20:46:28,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020043405] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:28,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:28,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:46:28,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668742722] [2022-07-22 20:46:28,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:28,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:46:28,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:28,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:46:28,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:46:28,393 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-07-22 20:46:29,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:29,416 INFO L93 Difference]: Finished difference Result 1537 states and 2220 transitions. [2022-07-22 20:46:29,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 20:46:29,417 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-07-22 20:46:29,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:29,423 INFO L225 Difference]: With dead ends: 1537 [2022-07-22 20:46:29,423 INFO L226 Difference]: Without dead ends: 1261 [2022-07-22 20:46:29,425 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-07-22 20:46:29,426 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 938 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:29,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 913 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-22 20:46:29,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2022-07-22 20:46:29,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1090. [2022-07-22 20:46:29,497 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-07-22 20:46:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1511 transitions. [2022-07-22 20:46:29,502 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1511 transitions. Word has length 57 [2022-07-22 20:46:29,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:29,502 INFO L495 AbstractCegarLoop]: Abstraction has 1090 states and 1511 transitions. [2022-07-22 20:46:29,502 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-07-22 20:46:29,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1511 transitions. [2022-07-22 20:46:29,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 20:46:29,503 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:29,504 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-07-22 20:46:29,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 20:46:29,504 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:29,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:29,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1385451018, now seen corresponding path program 1 times [2022-07-22 20:46:29,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:29,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212342981] [2022-07-22 20:46:29,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:29,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:29,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:29,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:29,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:29,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:29,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:29,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:29,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:29,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:29,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212342981] [2022-07-22 20:46:29,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212342981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:29,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:29,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 20:46:29,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689269950] [2022-07-22 20:46:29,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:29,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 20:46:29,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:29,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 20:46:29,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:46:29,581 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-07-22 20:46:30,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:30,183 INFO L93 Difference]: Finished difference Result 1313 states and 1826 transitions. [2022-07-22 20:46:30,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 20:46:30,184 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-07-22 20:46:30,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:30,189 INFO L225 Difference]: With dead ends: 1313 [2022-07-22 20:46:30,191 INFO L226 Difference]: Without dead ends: 1225 [2022-07-22 20:46:30,193 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-07-22 20:46:30,195 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 532 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:30,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 897 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 20:46:30,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2022-07-22 20:46:30,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1186. [2022-07-22 20:46:30,290 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-07-22 20:46:30,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1643 transitions. [2022-07-22 20:46:30,296 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1643 transitions. Word has length 65 [2022-07-22 20:46:30,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:30,296 INFO L495 AbstractCegarLoop]: Abstraction has 1186 states and 1643 transitions. [2022-07-22 20:46:30,296 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-07-22 20:46:30,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1643 transitions. [2022-07-22 20:46:30,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 20:46:30,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:30,298 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-07-22 20:46:30,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 20:46:30,298 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:30,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:30,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1789236969, now seen corresponding path program 1 times [2022-07-22 20:46:30,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:30,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874769025] [2022-07-22 20:46:30,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:30,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:30,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:30,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:30,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:30,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:30,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:30,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:30,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:30,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:30,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874769025] [2022-07-22 20:46:30,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874769025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:30,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:30,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 20:46:30,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997856858] [2022-07-22 20:46:30,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:30,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 20:46:30,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:30,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 20:46:30,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:46:30,374 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-07-22 20:46:31,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:31,100 INFO L93 Difference]: Finished difference Result 1533 states and 2120 transitions. [2022-07-22 20:46:31,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 20:46:31,100 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-07-22 20:46:31,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:31,107 INFO L225 Difference]: With dead ends: 1533 [2022-07-22 20:46:31,108 INFO L226 Difference]: Without dead ends: 1356 [2022-07-22 20:46:31,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-07-22 20:46:31,109 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 706 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:31,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1040 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 20:46:31,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2022-07-22 20:46:31,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1282. [2022-07-22 20:46:31,185 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-07-22 20:46:31,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1777 transitions. [2022-07-22 20:46:31,191 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1777 transitions. Word has length 65 [2022-07-22 20:46:31,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:31,191 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1777 transitions. [2022-07-22 20:46:31,191 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-07-22 20:46:31,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1777 transitions. [2022-07-22 20:46:31,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 20:46:31,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:31,193 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-07-22 20:46:31,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 20:46:31,193 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:31,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:31,194 INFO L85 PathProgramCache]: Analyzing trace with hash -239349141, now seen corresponding path program 1 times [2022-07-22 20:46:31,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:31,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597838453] [2022-07-22 20:46:31,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:31,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:31,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:31,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:31,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:31,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:31,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:31,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:31,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:31,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:31,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597838453] [2022-07-22 20:46:31,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597838453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:31,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:31,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 20:46:31,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596534076] [2022-07-22 20:46:31,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:31,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 20:46:31,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:31,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 20:46:31,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-22 20:46:31,322 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-07-22 20:46:31,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:31,923 INFO L93 Difference]: Finished difference Result 1583 states and 2191 transitions. [2022-07-22 20:46:31,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 20:46:31,923 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-07-22 20:46:31,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:31,929 INFO L225 Difference]: With dead ends: 1583 [2022-07-22 20:46:31,929 INFO L226 Difference]: Without dead ends: 1316 [2022-07-22 20:46:31,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-22 20:46:31,931 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 305 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:31,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1078 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 20:46:31,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2022-07-22 20:46:32,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1287. [2022-07-22 20:46:32,010 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-07-22 20:46:32,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1780 transitions. [2022-07-22 20:46:32,014 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1780 transitions. Word has length 65 [2022-07-22 20:46:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:32,015 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 1780 transitions. [2022-07-22 20:46:32,015 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-07-22 20:46:32,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1780 transitions. [2022-07-22 20:46:32,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 20:46:32,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:32,017 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-07-22 20:46:32,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 20:46:32,017 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:32,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:32,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1268708439, now seen corresponding path program 1 times [2022-07-22 20:46:32,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:32,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873461044] [2022-07-22 20:46:32,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:32,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:32,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:32,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:32,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:32,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:32,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:32,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:32,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:32,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:32,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873461044] [2022-07-22 20:46:32,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873461044] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:32,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:32,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 20:46:32,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511052833] [2022-07-22 20:46:32,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:32,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 20:46:32,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:32,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 20:46:32,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 20:46:32,112 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-07-22 20:46:33,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:33,686 INFO L93 Difference]: Finished difference Result 2949 states and 4052 transitions. [2022-07-22 20:46:33,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-22 20:46:33,686 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-07-22 20:46:33,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:33,697 INFO L225 Difference]: With dead ends: 2949 [2022-07-22 20:46:33,698 INFO L226 Difference]: Without dead ends: 2677 [2022-07-22 20:46:33,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-07-22 20:46:33,701 INFO L413 NwaCegarLoop]: 490 mSDtfsCounter, 1324 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 437 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 437 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:33,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1341 Valid, 1469 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [437 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-22 20:46:33,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2022-07-22 20:46:33,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 2427. [2022-07-22 20:46:33,835 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-07-22 20:46:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 3264 transitions. [2022-07-22 20:46:33,867 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 3264 transitions. Word has length 65 [2022-07-22 20:46:33,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:33,867 INFO L495 AbstractCegarLoop]: Abstraction has 2427 states and 3264 transitions. [2022-07-22 20:46:33,868 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-07-22 20:46:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 3264 transitions. [2022-07-22 20:46:33,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 20:46:33,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:33,873 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-07-22 20:46:33,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 20:46:33,874 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:33,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:33,874 INFO L85 PathProgramCache]: Analyzing trace with hash -217259350, now seen corresponding path program 1 times [2022-07-22 20:46:33,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:33,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65594924] [2022-07-22 20:46:33,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:33,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:33,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:33,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:33,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:33,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:33,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:33,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:33,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:33,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:33,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65594924] [2022-07-22 20:46:33,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65594924] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:33,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:33,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 20:46:33,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308847276] [2022-07-22 20:46:33,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:33,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 20:46:33,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:33,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 20:46:33,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-22 20:46:33,968 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-07-22 20:46:34,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:34,625 INFO L93 Difference]: Finished difference Result 4028 states and 5388 transitions. [2022-07-22 20:46:34,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 20:46:34,625 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-07-22 20:46:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:34,638 INFO L225 Difference]: With dead ends: 4028 [2022-07-22 20:46:34,639 INFO L226 Difference]: Without dead ends: 2616 [2022-07-22 20:46:34,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-22 20:46:34,643 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 206 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:34,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1193 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 20:46:34,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2022-07-22 20:46:34,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 2472. [2022-07-22 20:46:34,795 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-07-22 20:46:34,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3303 transitions. [2022-07-22 20:46:34,803 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3303 transitions. Word has length 65 [2022-07-22 20:46:34,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:34,803 INFO L495 AbstractCegarLoop]: Abstraction has 2472 states and 3303 transitions. [2022-07-22 20:46:34,803 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-07-22 20:46:34,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3303 transitions. [2022-07-22 20:46:34,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 20:46:34,805 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:34,805 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-07-22 20:46:34,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 20:46:34,806 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:34,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:34,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1168944044, now seen corresponding path program 1 times [2022-07-22 20:46:34,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:34,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555439143] [2022-07-22 20:46:34,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:34,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:34,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:34,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:34,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:34,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:34,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:34,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:34,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:34,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:34,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:34,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555439143] [2022-07-22 20:46:34,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555439143] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:34,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:34,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 20:46:34,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592674726] [2022-07-22 20:46:34,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:34,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 20:46:34,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:34,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 20:46:34,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:46:34,898 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-07-22 20:46:35,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:35,643 INFO L93 Difference]: Finished difference Result 3907 states and 5142 transitions. [2022-07-22 20:46:35,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 20:46:35,643 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-07-22 20:46:35,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:35,655 INFO L225 Difference]: With dead ends: 3907 [2022-07-22 20:46:35,655 INFO L226 Difference]: Without dead ends: 2670 [2022-07-22 20:46:35,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-07-22 20:46:35,659 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 680 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:35,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 814 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 20:46:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2022-07-22 20:46:35,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2450. [2022-07-22 20:46:35,785 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-07-22 20:46:35,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3263 transitions. [2022-07-22 20:46:35,792 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3263 transitions. Word has length 65 [2022-07-22 20:46:35,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:35,793 INFO L495 AbstractCegarLoop]: Abstraction has 2450 states and 3263 transitions. [2022-07-22 20:46:35,793 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-07-22 20:46:35,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3263 transitions. [2022-07-22 20:46:35,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 20:46:35,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:35,796 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-07-22 20:46:35,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 20:46:35,796 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:35,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:35,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1034930538, now seen corresponding path program 1 times [2022-07-22 20:46:35,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:35,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193373014] [2022-07-22 20:46:35,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:35,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:35,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:35,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:35,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:35,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:35,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:35,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:35,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:35,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:35,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:35,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193373014] [2022-07-22 20:46:35,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193373014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:35,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:35,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:46:35,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314510824] [2022-07-22 20:46:35,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:35,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:46:35,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:35,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:46:35,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:46:35,881 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-07-22 20:46:36,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:36,435 INFO L93 Difference]: Finished difference Result 5525 states and 7242 transitions. [2022-07-22 20:46:36,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 20:46:36,436 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-07-22 20:46:36,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:36,455 INFO L225 Difference]: With dead ends: 5525 [2022-07-22 20:46:36,455 INFO L226 Difference]: Without dead ends: 4093 [2022-07-22 20:46:36,461 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-07-22 20:46:36,462 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 653 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:36,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 655 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 20:46:36,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4093 states. [2022-07-22 20:46:36,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4093 to 3821. [2022-07-22 20:46:36,684 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-07-22 20:46:36,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 5004 transitions. [2022-07-22 20:46:36,696 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 5004 transitions. Word has length 65 [2022-07-22 20:46:36,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:36,696 INFO L495 AbstractCegarLoop]: Abstraction has 3821 states and 5004 transitions. [2022-07-22 20:46:36,697 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-07-22 20:46:36,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 5004 transitions. [2022-07-22 20:46:36,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 20:46:36,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:36,699 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-07-22 20:46:36,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 20:46:36,700 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:36,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:36,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1593552473, now seen corresponding path program 1 times [2022-07-22 20:46:36,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:36,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385339820] [2022-07-22 20:46:36,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:36,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:36,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:36,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:36,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:36,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:36,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:36,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:36,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:36,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:36,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:36,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385339820] [2022-07-22 20:46:36,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385339820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:36,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:36,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 20:46:36,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962875214] [2022-07-22 20:46:36,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:36,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 20:46:36,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:36,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 20:46:36,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:46:36,758 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-07-22 20:46:37,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:37,363 INFO L93 Difference]: Finished difference Result 8839 states and 11518 transitions. [2022-07-22 20:46:37,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 20:46:37,364 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-07-22 20:46:37,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:37,390 INFO L225 Difference]: With dead ends: 8839 [2022-07-22 20:46:37,390 INFO L226 Difference]: Without dead ends: 6015 [2022-07-22 20:46:37,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-22 20:46:37,399 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 377 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:37,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 766 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 20:46:37,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6015 states. [2022-07-22 20:46:37,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6015 to 5499. [2022-07-22 20:46:37,776 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-07-22 20:46:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5499 states to 5499 states and 7119 transitions. [2022-07-22 20:46:37,793 INFO L78 Accepts]: Start accepts. Automaton has 5499 states and 7119 transitions. Word has length 66 [2022-07-22 20:46:37,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:37,795 INFO L495 AbstractCegarLoop]: Abstraction has 5499 states and 7119 transitions. [2022-07-22 20:46:37,795 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-07-22 20:46:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 5499 states and 7119 transitions. [2022-07-22 20:46:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-22 20:46:37,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:37,798 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-07-22 20:46:37,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 20:46:37,798 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:37,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:37,799 INFO L85 PathProgramCache]: Analyzing trace with hash -455119352, now seen corresponding path program 1 times [2022-07-22 20:46:37,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:37,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715321845] [2022-07-22 20:46:37,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:37,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:37,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:37,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:37,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:37,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:37,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:37,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:37,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:37,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:37,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:37,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715321845] [2022-07-22 20:46:37,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715321845] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:37,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:37,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:46:37,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006961546] [2022-07-22 20:46:37,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:37,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:46:37,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:37,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:46:37,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:46:37,860 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-07-22 20:46:38,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:38,550 INFO L93 Difference]: Finished difference Result 7129 states and 9121 transitions. [2022-07-22 20:46:38,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 20:46:38,551 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-07-22 20:46:38,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:38,576 INFO L225 Difference]: With dead ends: 7129 [2022-07-22 20:46:38,577 INFO L226 Difference]: Without dead ends: 7126 [2022-07-22 20:46:38,579 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-07-22 20:46:38,579 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 918 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:38,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 554 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 20:46:38,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7126 states. [2022-07-22 20:46:38,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7126 to 6553. [2022-07-22 20:46:38,996 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-07-22 20:46:39,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6553 states to 6553 states and 8408 transitions. [2022-07-22 20:46:39,015 INFO L78 Accepts]: Start accepts. Automaton has 6553 states and 8408 transitions. Word has length 73 [2022-07-22 20:46:39,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:39,015 INFO L495 AbstractCegarLoop]: Abstraction has 6553 states and 8408 transitions. [2022-07-22 20:46:39,016 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-07-22 20:46:39,016 INFO L276 IsEmpty]: Start isEmpty. Operand 6553 states and 8408 transitions. [2022-07-22 20:46:39,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-22 20:46:39,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:39,018 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-07-22 20:46:39,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 20:46:39,019 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:39,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:39,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1224424688, now seen corresponding path program 1 times [2022-07-22 20:46:39,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:39,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606917776] [2022-07-22 20:46:39,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:39,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:39,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:39,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:39,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:39,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:39,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:39,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:39,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:39,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:39,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:39,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606917776] [2022-07-22 20:46:39,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606917776] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:46:39,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484351734] [2022-07-22 20:46:39,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:39,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:46:39,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:46:39,104 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:46:39,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 20:46:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:39,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 20:46:39,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:46:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:39,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 20:46:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:39,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484351734] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 20:46:39,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 20:46:39,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-07-22 20:46:39,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703529705] [2022-07-22 20:46:39,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 20:46:39,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 20:46:39,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:39,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 20:46:39,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-22 20:46:39,567 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-07-22 20:46:41,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:41,410 INFO L93 Difference]: Finished difference Result 14199 states and 17936 transitions. [2022-07-22 20:46:41,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-22 20:46:41,411 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-07-22 20:46:41,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:41,466 INFO L225 Difference]: With dead ends: 14199 [2022-07-22 20:46:41,466 INFO L226 Difference]: Without dead ends: 14196 [2022-07-22 20:46:41,476 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-07-22 20:46:41,477 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 1211 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:41,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 1246 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-22 20:46:41,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14196 states. [2022-07-22 20:46:42,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14196 to 11811. [2022-07-22 20:46:42,302 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-07-22 20:46:42,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11811 states to 11811 states and 15022 transitions. [2022-07-22 20:46:42,334 INFO L78 Accepts]: Start accepts. Automaton has 11811 states and 15022 transitions. Word has length 74 [2022-07-22 20:46:42,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:42,335 INFO L495 AbstractCegarLoop]: Abstraction has 11811 states and 15022 transitions. [2022-07-22 20:46:42,335 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-07-22 20:46:42,335 INFO L276 IsEmpty]: Start isEmpty. Operand 11811 states and 15022 transitions. [2022-07-22 20:46:42,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-22 20:46:42,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:42,346 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-07-22 20:46:42,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-22 20:46:42,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-22 20:46:42,559 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:42,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:42,560 INFO L85 PathProgramCache]: Analyzing trace with hash -499209592, now seen corresponding path program 2 times [2022-07-22 20:46:42,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:42,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604268759] [2022-07-22 20:46:42,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:42,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:42,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:42,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:42,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:42,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:42,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:42,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:42,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:42,612 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 20:46:42,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:42,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604268759] [2022-07-22 20:46:42,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604268759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:42,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:42,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 20:46:42,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080338976] [2022-07-22 20:46:42,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:42,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 20:46:42,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:42,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 20:46:42,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:46:42,614 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-07-22 20:46:43,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:43,343 INFO L93 Difference]: Finished difference Result 18354 states and 23364 transitions. [2022-07-22 20:46:43,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 20:46:43,441 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-07-22 20:46:43,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:43,467 INFO L225 Difference]: With dead ends: 18354 [2022-07-22 20:46:43,467 INFO L226 Difference]: Without dead ends: 8416 [2022-07-22 20:46:43,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-22 20:46:43,486 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 423 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:43,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 783 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 20:46:43,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8416 states. [2022-07-22 20:46:43,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8416 to 7864. [2022-07-22 20:46:43,889 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-07-22 20:46:43,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7864 states to 7864 states and 9848 transitions. [2022-07-22 20:46:43,910 INFO L78 Accepts]: Start accepts. Automaton has 7864 states and 9848 transitions. Word has length 77 [2022-07-22 20:46:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:43,911 INFO L495 AbstractCegarLoop]: Abstraction has 7864 states and 9848 transitions. [2022-07-22 20:46:43,911 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-07-22 20:46:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand 7864 states and 9848 transitions. [2022-07-22 20:46:43,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-22 20:46:43,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:43,915 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-07-22 20:46:43,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 20:46:43,915 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:43,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:43,915 INFO L85 PathProgramCache]: Analyzing trace with hash 867535010, now seen corresponding path program 1 times [2022-07-22 20:46:43,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:43,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516097887] [2022-07-22 20:46:43,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:43,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:43,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:43,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:43,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:43,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:43,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:43,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:43,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:43,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 20:46:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-22 20:46:43,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:43,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516097887] [2022-07-22 20:46:43,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516097887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:43,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:43,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 20:46:43,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068218948] [2022-07-22 20:46:43,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:43,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 20:46:43,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:43,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 20:46:43,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:46:43,978 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-07-22 20:46:45,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:45,553 INFO L93 Difference]: Finished difference Result 21738 states and 27065 transitions. [2022-07-22 20:46:45,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 20:46:45,554 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-07-22 20:46:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:45,615 INFO L225 Difference]: With dead ends: 21738 [2022-07-22 20:46:45,615 INFO L226 Difference]: Without dead ends: 14895 [2022-07-22 20:46:45,642 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-07-22 20:46:45,643 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 765 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:45,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 1054 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 20:46:45,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14895 states. [2022-07-22 20:46:46,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14895 to 14036. [2022-07-22 20:46:46,418 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-07-22 20:46:46,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14036 states to 14036 states and 17454 transitions. [2022-07-22 20:46:46,446 INFO L78 Accepts]: Start accepts. Automaton has 14036 states and 17454 transitions. Word has length 84 [2022-07-22 20:46:46,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:46,446 INFO L495 AbstractCegarLoop]: Abstraction has 14036 states and 17454 transitions. [2022-07-22 20:46:46,446 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-07-22 20:46:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 14036 states and 17454 transitions. [2022-07-22 20:46:46,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-22 20:46:46,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:46,453 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-07-22 20:46:46,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 20:46:46,453 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:46,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:46,454 INFO L85 PathProgramCache]: Analyzing trace with hash 260386383, now seen corresponding path program 1 times [2022-07-22 20:46:46,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:46,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708782877] [2022-07-22 20:46:46,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:46,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:46:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:46:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:46:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:46:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 20:46:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:46:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 20:46:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,515 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-22 20:46:46,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:46,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708782877] [2022-07-22 20:46:46,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708782877] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:46:46,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510070828] [2022-07-22 20:46:46,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:46,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:46:46,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:46:46,520 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:46:46,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 20:46:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:46,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:46:46,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:46:46,619 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 20:46:46,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:46:46,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510070828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:46,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:46:46,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:46:46,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138844626] [2022-07-22 20:46:46,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:46,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:46:46,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:46,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:46:46,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:46:46,622 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-07-22 20:46:47,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:47,310 INFO L93 Difference]: Finished difference Result 15912 states and 20081 transitions. [2022-07-22 20:46:47,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:46:47,311 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-07-22 20:46:47,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:47,351 INFO L225 Difference]: With dead ends: 15912 [2022-07-22 20:46:47,351 INFO L226 Difference]: Without dead ends: 14282 [2022-07-22 20:46:47,359 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-07-22 20:46:47,359 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-07-22 20:46:47,360 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-07-22 20:46:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14282 states. [2022-07-22 20:46:47,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14282 to 14282. [2022-07-22 20:46:47,997 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-07-22 20:46:48,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14282 states to 14282 states and 17788 transitions. [2022-07-22 20:46:48,027 INFO L78 Accepts]: Start accepts. Automaton has 14282 states and 17788 transitions. Word has length 92 [2022-07-22 20:46:48,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:48,027 INFO L495 AbstractCegarLoop]: Abstraction has 14282 states and 17788 transitions. [2022-07-22 20:46:48,028 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-07-22 20:46:48,028 INFO L276 IsEmpty]: Start isEmpty. Operand 14282 states and 17788 transitions. [2022-07-22 20:46:48,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-22 20:46:48,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:48,034 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-07-22 20:46:48,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 20:46:48,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-22 20:46:48,253 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:48,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:48,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1083636890, now seen corresponding path program 1 times [2022-07-22 20:46:48,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:48,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109476741] [2022-07-22 20:46:48,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:48,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:48,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:48,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:46:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:48,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:46:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:48,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:46:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:48,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:46:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:48,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:46:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:48,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:46:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:48,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 20:46:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-22 20:46:48,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:48,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109476741] [2022-07-22 20:46:48,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109476741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:48,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:46:48,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 20:46:48,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939442507] [2022-07-22 20:46:48,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:48,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 20:46:48,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:48,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 20:46:48,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-22 20:46:48,322 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-07-22 20:46:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:49,839 INFO L93 Difference]: Finished difference Result 25156 states and 31107 transitions. [2022-07-22 20:46:49,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 20:46:49,840 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-07-22 20:46:49,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:49,879 INFO L225 Difference]: With dead ends: 25156 [2022-07-22 20:46:49,879 INFO L226 Difference]: Without dead ends: 12757 [2022-07-22 20:46:49,910 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-07-22 20:46:49,911 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 1520 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 447 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 447 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:49,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 931 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [447 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-22 20:46:49,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12757 states. [2022-07-22 20:46:50,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12757 to 11857. [2022-07-22 20:46:50,625 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-07-22 20:46:50,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11857 states to 11857 states and 14532 transitions. [2022-07-22 20:46:50,671 INFO L78 Accepts]: Start accepts. Automaton has 11857 states and 14532 transitions. Word has length 93 [2022-07-22 20:46:50,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:50,671 INFO L495 AbstractCegarLoop]: Abstraction has 11857 states and 14532 transitions. [2022-07-22 20:46:50,671 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-07-22 20:46:50,672 INFO L276 IsEmpty]: Start isEmpty. Operand 11857 states and 14532 transitions. [2022-07-22 20:46:50,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-22 20:46:50,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:50,685 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-07-22 20:46:50,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-22 20:46:50,686 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:50,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:50,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1789084765, now seen corresponding path program 1 times [2022-07-22 20:46:50,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:50,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975412475] [2022-07-22 20:46:50,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:50,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:50,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:50,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:46:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:50,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:46:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:50,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:46:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:50,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:46:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:50,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 20:46:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:50,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:46:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:50,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-22 20:46:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:50,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:46:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:50,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-22 20:46:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:50,765 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-22 20:46:50,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:50,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975412475] [2022-07-22 20:46:50,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975412475] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:46:50,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42812486] [2022-07-22 20:46:50,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:50,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:46:50,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:46:50,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:46:50,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 20:46:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:50,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:46:50,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:46:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-22 20:46:50,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:46:50,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42812486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:50,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:46:50,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-22 20:46:50,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147330827] [2022-07-22 20:46:50,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:50,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:46:50,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:50,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:46:50,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:46:50,968 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-07-22 20:46:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:51,590 INFO L93 Difference]: Finished difference Result 13574 states and 16943 transitions. [2022-07-22 20:46:51,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:46:51,591 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-07-22 20:46:51,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:51,631 INFO L225 Difference]: With dead ends: 13574 [2022-07-22 20:46:51,631 INFO L226 Difference]: Without dead ends: 12576 [2022-07-22 20:46:51,643 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-07-22 20:46:51,644 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-07-22 20:46:51,644 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-07-22 20:46:51,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12576 states. [2022-07-22 20:46:52,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12576 to 12550. [2022-07-22 20:46:52,476 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-07-22 20:46:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12550 states to 12550 states and 15470 transitions. [2022-07-22 20:46:52,500 INFO L78 Accepts]: Start accepts. Automaton has 12550 states and 15470 transitions. Word has length 118 [2022-07-22 20:46:52,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:52,500 INFO L495 AbstractCegarLoop]: Abstraction has 12550 states and 15470 transitions. [2022-07-22 20:46:52,500 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-07-22 20:46:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 12550 states and 15470 transitions. [2022-07-22 20:46:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-22 20:46:52,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:52,512 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-07-22 20:46:52,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 20:46:52,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:46:52,732 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:52,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:52,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2070810004, now seen corresponding path program 1 times [2022-07-22 20:46:52,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:52,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775949292] [2022-07-22 20:46:52,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:52,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:52,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:52,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:46:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:52,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:46:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:52,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:46:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:52,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:46:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:52,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 20:46:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:52,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 20:46:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:52,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:46:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:52,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 20:46:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:52,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:46:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:52,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 20:46:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-22 20:46:52,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:52,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775949292] [2022-07-22 20:46:52,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775949292] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:46:52,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092085803] [2022-07-22 20:46:52,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:52,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:46:52,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:46:52,815 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:46:52,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 20:46:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:52,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:46:52,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:46:52,926 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-22 20:46:52,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:46:52,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092085803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:52,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:46:52,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:46:52,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796313491] [2022-07-22 20:46:52,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:52,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:46:52,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:52,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:46:52,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:46:52,929 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-07-22 20:46:53,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:53,460 INFO L93 Difference]: Finished difference Result 14780 states and 18580 transitions. [2022-07-22 20:46:53,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:46:53,460 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-07-22 20:46:53,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:53,494 INFO L225 Difference]: With dead ends: 14780 [2022-07-22 20:46:53,494 INFO L226 Difference]: Without dead ends: 12856 [2022-07-22 20:46:53,509 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-07-22 20:46:53,509 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-07-22 20:46:53,510 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-07-22 20:46:53,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12856 states. [2022-07-22 20:46:54,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12856 to 12790. [2022-07-22 20:46:54,213 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-07-22 20:46:54,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12790 states to 12790 states and 15636 transitions. [2022-07-22 20:46:54,235 INFO L78 Accepts]: Start accepts. Automaton has 12790 states and 15636 transitions. Word has length 134 [2022-07-22 20:46:54,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:54,235 INFO L495 AbstractCegarLoop]: Abstraction has 12790 states and 15636 transitions. [2022-07-22 20:46:54,236 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-07-22 20:46:54,236 INFO L276 IsEmpty]: Start isEmpty. Operand 12790 states and 15636 transitions. [2022-07-22 20:46:54,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-22 20:46:54,243 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:54,243 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-07-22 20:46:54,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 20:46:54,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:46:54,444 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:54,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:54,444 INFO L85 PathProgramCache]: Analyzing trace with hash -931525195, now seen corresponding path program 1 times [2022-07-22 20:46:54,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:54,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108874388] [2022-07-22 20:46:54,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:54,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:46:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:46:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:46:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:46:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-22 20:46:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 20:46:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:46:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 20:46:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:46:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 20:46:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,517 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-22 20:46:54,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:54,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108874388] [2022-07-22 20:46:54,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108874388] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:46:54,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948062304] [2022-07-22 20:46:54,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:54,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:46:54,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:46:54,520 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:46:54,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 20:46:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:54,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 20:46:54,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:46:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-22 20:46:54,628 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:46:54,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948062304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:54,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:46:54,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:46:54,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164908607] [2022-07-22 20:46:54,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:54,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:46:54,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:54,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:46:54,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:46:54,630 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-07-22 20:46:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:55,321 INFO L93 Difference]: Finished difference Result 15003 states and 18535 transitions. [2022-07-22 20:46:55,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:46:55,322 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-07-22 20:46:55,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:55,349 INFO L225 Difference]: With dead ends: 15003 [2022-07-22 20:46:55,349 INFO L226 Difference]: Without dead ends: 12841 [2022-07-22 20:46:55,357 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-07-22 20:46:55,357 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-07-22 20:46:55,357 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-07-22 20:46:55,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12841 states. [2022-07-22 20:46:55,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12841 to 12772. [2022-07-22 20:46:56,003 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-07-22 20:46:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12772 states to 12772 states and 15564 transitions. [2022-07-22 20:46:56,029 INFO L78 Accepts]: Start accepts. Automaton has 12772 states and 15564 transitions. Word has length 134 [2022-07-22 20:46:56,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:56,029 INFO L495 AbstractCegarLoop]: Abstraction has 12772 states and 15564 transitions. [2022-07-22 20:46:56,029 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-07-22 20:46:56,029 INFO L276 IsEmpty]: Start isEmpty. Operand 12772 states and 15564 transitions. [2022-07-22 20:46:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-22 20:46:56,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:56,040 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-07-22 20:46:56,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-22 20:46:56,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-22 20:46:56,241 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:56,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:56,242 INFO L85 PathProgramCache]: Analyzing trace with hash -564892461, now seen corresponding path program 1 times [2022-07-22 20:46:56,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:56,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723741603] [2022-07-22 20:46:56,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:56,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:56,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:56,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:46:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:56,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:46:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:56,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:46:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:56,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:46:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:56,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 20:46:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:56,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:46:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:56,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:46:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:56,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 20:46:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:56,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:46:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:56,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 20:46:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-22 20:46:56,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:56,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723741603] [2022-07-22 20:46:56,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723741603] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:46:56,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614877741] [2022-07-22 20:46:56,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:56,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:46:56,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:46:56,326 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:46:56,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-22 20:46:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:56,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 20:46:56,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:46:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-22 20:46:56,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:46:56,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614877741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:56,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:46:56,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:46:56,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928572366] [2022-07-22 20:46:56,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:56,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:46:56,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:56,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:46:56,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:46:56,480 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-07-22 20:46:57,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:57,033 INFO L93 Difference]: Finished difference Result 13697 states and 16818 transitions. [2022-07-22 20:46:57,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:46:57,034 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-07-22 20:46:57,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:57,066 INFO L225 Difference]: With dead ends: 13697 [2022-07-22 20:46:57,066 INFO L226 Difference]: Without dead ends: 12606 [2022-07-22 20:46:57,071 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-07-22 20:46:57,072 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-07-22 20:46:57,072 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-07-22 20:46:57,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12606 states. [2022-07-22 20:46:57,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12606 to 12568. [2022-07-22 20:46:57,832 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-07-22 20:46:57,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12568 states to 12568 states and 15265 transitions. [2022-07-22 20:46:57,859 INFO L78 Accepts]: Start accepts. Automaton has 12568 states and 15265 transitions. Word has length 135 [2022-07-22 20:46:57,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:46:57,860 INFO L495 AbstractCegarLoop]: Abstraction has 12568 states and 15265 transitions. [2022-07-22 20:46:57,860 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-07-22 20:46:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 12568 states and 15265 transitions. [2022-07-22 20:46:57,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-22 20:46:57,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:46:57,868 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-07-22 20:46:57,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-22 20:46:58,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:46:58,069 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:46:58,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:46:58,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1386105035, now seen corresponding path program 1 times [2022-07-22 20:46:58,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:46:58,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759144406] [2022-07-22 20:46:58,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:58,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:46:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:46:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:46:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:46:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:46:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:46:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 20:46:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:46:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:46:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 20:46:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:46:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 20:46:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-22 20:46:58,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:46:58,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759144406] [2022-07-22 20:46:58,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759144406] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:46:58,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797668992] [2022-07-22 20:46:58,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:46:58,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:46:58,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:46:58,159 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:46:58,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-22 20:46:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:46:58,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 20:46:58,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:46:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-22 20:46:58,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:46:58,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797668992] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:46:58,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:46:58,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-22 20:46:58,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149770825] [2022-07-22 20:46:58,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:46:58,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:46:58,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:46:58,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:46:58,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 20:46:58,313 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-07-22 20:46:59,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:46:59,136 INFO L93 Difference]: Finished difference Result 13904 states and 16977 transitions. [2022-07-22 20:46:59,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 20:46:59,136 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-07-22 20:46:59,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:46:59,165 INFO L225 Difference]: With dead ends: 13904 [2022-07-22 20:46:59,165 INFO L226 Difference]: Without dead ends: 12561 [2022-07-22 20:46:59,172 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-07-22 20:46:59,173 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 300 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 20:46:59,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 478 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 20:46:59,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12561 states. [2022-07-22 20:47:00,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12561 to 12002. [2022-07-22 20:47:00,024 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-07-22 20:47:00,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12002 states to 12002 states and 14511 transitions. [2022-07-22 20:47:00,053 INFO L78 Accepts]: Start accepts. Automaton has 12002 states and 14511 transitions. Word has length 136 [2022-07-22 20:47:00,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:00,053 INFO L495 AbstractCegarLoop]: Abstraction has 12002 states and 14511 transitions. [2022-07-22 20:47:00,053 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-07-22 20:47:00,054 INFO L276 IsEmpty]: Start isEmpty. Operand 12002 states and 14511 transitions. [2022-07-22 20:47:00,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-22 20:47:00,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:00,063 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-07-22 20:47:00,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-22 20:47:00,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:00,263 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:00,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:00,264 INFO L85 PathProgramCache]: Analyzing trace with hash 78962637, now seen corresponding path program 1 times [2022-07-22 20:47:00,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:00,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611985557] [2022-07-22 20:47:00,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:00,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:47:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:47:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:47:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:47:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 20:47:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:47:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 20:47:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 20:47:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,356 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-22 20:47:00,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:00,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611985557] [2022-07-22 20:47:00,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611985557] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:00,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420492277] [2022-07-22 20:47:00,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:00,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:00,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:00,360 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:00,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-22 20:47:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:00,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 20:47:00,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-22 20:47:00,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:00,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420492277] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:00,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:00,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-22 20:47:00,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443648787] [2022-07-22 20:47:00,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:00,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:47:00,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:00,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:47:00,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 20:47:00,541 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-07-22 20:47:01,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:01,611 INFO L93 Difference]: Finished difference Result 13122 states and 15882 transitions. [2022-07-22 20:47:01,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 20:47:01,611 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-07-22 20:47:01,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:01,637 INFO L225 Difference]: With dead ends: 13122 [2022-07-22 20:47:01,637 INFO L226 Difference]: Without dead ends: 11748 [2022-07-22 20:47:01,645 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-07-22 20:47:01,645 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 321 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:01,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 486 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 20:47:01,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11748 states. [2022-07-22 20:47:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11748 to 11726. [2022-07-22 20:47:02,245 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-07-22 20:47:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11726 states to 11726 states and 14112 transitions. [2022-07-22 20:47:02,269 INFO L78 Accepts]: Start accepts. Automaton has 11726 states and 14112 transitions. Word has length 136 [2022-07-22 20:47:02,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:02,269 INFO L495 AbstractCegarLoop]: Abstraction has 11726 states and 14112 transitions. [2022-07-22 20:47:02,269 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-07-22 20:47:02,269 INFO L276 IsEmpty]: Start isEmpty. Operand 11726 states and 14112 transitions. [2022-07-22 20:47:02,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-22 20:47:02,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:02,277 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-07-22 20:47:02,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-22 20:47:02,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-22 20:47:02,477 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:02,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:02,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1976459403, now seen corresponding path program 1 times [2022-07-22 20:47:02,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:02,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939311304] [2022-07-22 20:47:02,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:02,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:47:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:47:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:47:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:47:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 20:47:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:47:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 20:47:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 20:47:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,547 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-22 20:47:02,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:02,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939311304] [2022-07-22 20:47:02,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939311304] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:02,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035680511] [2022-07-22 20:47:02,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:02,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:02,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:02,550 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:02,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-22 20:47:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:02,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 20:47:02,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:02,661 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-22 20:47:02,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:02,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035680511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:02,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:02,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-22 20:47:02,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672858251] [2022-07-22 20:47:02,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:02,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:47:02,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:02,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:47:02,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:47:02,664 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-07-22 20:47:03,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:03,308 INFO L93 Difference]: Finished difference Result 12853 states and 15487 transitions. [2022-07-22 20:47:03,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 20:47:03,308 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-07-22 20:47:03,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:03,332 INFO L225 Difference]: With dead ends: 12853 [2022-07-22 20:47:03,332 INFO L226 Difference]: Without dead ends: 11754 [2022-07-22 20:47:03,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-22 20:47:03,338 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-07-22 20:47:03,339 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-07-22 20:47:03,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11754 states. [2022-07-22 20:47:03,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11754 to 11738. [2022-07-22 20:47:03,937 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-07-22 20:47:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11738 states to 11738 states and 14103 transitions. [2022-07-22 20:47:03,959 INFO L78 Accepts]: Start accepts. Automaton has 11738 states and 14103 transitions. Word has length 136 [2022-07-22 20:47:03,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:03,960 INFO L495 AbstractCegarLoop]: Abstraction has 11738 states and 14103 transitions. [2022-07-22 20:47:03,960 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-07-22 20:47:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 11738 states and 14103 transitions. [2022-07-22 20:47:03,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-22 20:47:03,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:03,967 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-07-22 20:47:03,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-22 20:47:04,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-22 20:47:04,168 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:04,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:04,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1219164295, now seen corresponding path program 1 times [2022-07-22 20:47:04,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:04,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783528884] [2022-07-22 20:47:04,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:04,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:04,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:04,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:47:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:04,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:47:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:04,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:47:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:04,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:47:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:04,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 20:47:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:04,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:47:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:04,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:04,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 20:47:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:04,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:04,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 20:47:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:04,281 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-22 20:47:04,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:04,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783528884] [2022-07-22 20:47:04,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783528884] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:04,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:47:04,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 20:47:04,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016197664] [2022-07-22 20:47:04,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:04,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 20:47:04,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:04,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 20:47:04,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:47:04,283 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-07-22 20:47:05,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:05,385 INFO L93 Difference]: Finished difference Result 12713 states and 15200 transitions. [2022-07-22 20:47:05,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 20:47:05,385 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-07-22 20:47:05,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:05,414 INFO L225 Difference]: With dead ends: 12713 [2022-07-22 20:47:05,414 INFO L226 Difference]: Without dead ends: 12711 [2022-07-22 20:47:05,421 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-07-22 20:47:05,421 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 690 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:05,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 770 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 20:47:05,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12711 states. [2022-07-22 20:47:06,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12711 to 12442. [2022-07-22 20:47:06,189 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-07-22 20:47:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12442 states to 12442 states and 14900 transitions. [2022-07-22 20:47:06,216 INFO L78 Accepts]: Start accepts. Automaton has 12442 states and 14900 transitions. Word has length 136 [2022-07-22 20:47:06,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:06,217 INFO L495 AbstractCegarLoop]: Abstraction has 12442 states and 14900 transitions. [2022-07-22 20:47:06,217 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-07-22 20:47:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 12442 states and 14900 transitions. [2022-07-22 20:47:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-22 20:47:06,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:06,226 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-07-22 20:47:06,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-22 20:47:06,226 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:06,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:06,226 INFO L85 PathProgramCache]: Analyzing trace with hash 114815496, now seen corresponding path program 1 times [2022-07-22 20:47:06,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:06,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212487988] [2022-07-22 20:47:06,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:06,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:47:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:47:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:47:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 20:47:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:47:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-22 20:47:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 20:47:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-22 20:47:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-22 20:47:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-22 20:47:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-22 20:47:06,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:06,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212487988] [2022-07-22 20:47:06,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212487988] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:06,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673887204] [2022-07-22 20:47:06,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:06,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:06,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:06,324 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:06,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 20:47:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:06,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 20:47:06,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-22 20:47:06,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:06,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673887204] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:06,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:06,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-07-22 20:47:06,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871214839] [2022-07-22 20:47:06,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:06,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 20:47:06,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:06,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 20:47:06,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-22 20:47:06,441 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-07-22 20:47:06,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:06,919 INFO L93 Difference]: Finished difference Result 17590 states and 21120 transitions. [2022-07-22 20:47:06,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 20:47:06,919 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-07-22 20:47:06,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:06,940 INFO L225 Difference]: With dead ends: 17590 [2022-07-22 20:47:06,940 INFO L226 Difference]: Without dead ends: 7008 [2022-07-22 20:47:06,955 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-07-22 20:47:06,955 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-07-22 20:47:06,955 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-07-22 20:47:06,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7008 states. [2022-07-22 20:47:07,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7008 to 6566. [2022-07-22 20:47:07,344 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-07-22 20:47:07,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6566 states to 6566 states and 7708 transitions. [2022-07-22 20:47:07,358 INFO L78 Accepts]: Start accepts. Automaton has 6566 states and 7708 transitions. Word has length 145 [2022-07-22 20:47:07,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:07,358 INFO L495 AbstractCegarLoop]: Abstraction has 6566 states and 7708 transitions. [2022-07-22 20:47:07,359 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-07-22 20:47:07,359 INFO L276 IsEmpty]: Start isEmpty. Operand 6566 states and 7708 transitions. [2022-07-22 20:47:07,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-22 20:47:07,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:07,366 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-07-22 20:47:07,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-22 20:47:07,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-22 20:47:07,567 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:07,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:07,567 INFO L85 PathProgramCache]: Analyzing trace with hash 62040612, now seen corresponding path program 1 times [2022-07-22 20:47:07,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:07,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982921894] [2022-07-22 20:47:07,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:07,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:47:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:47:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:47:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 20:47:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-22 20:47:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-22 20:47:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 20:47:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-22 20:47:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 20:47:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-22 20:47:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-22 20:47:07,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:07,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982921894] [2022-07-22 20:47:07,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982921894] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:07,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:47:07,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 20:47:07,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020383842] [2022-07-22 20:47:07,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:07,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 20:47:07,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:07,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 20:47:07,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:47:07,631 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-07-22 20:47:08,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:08,191 INFO L93 Difference]: Finished difference Result 7114 states and 8326 transitions. [2022-07-22 20:47:08,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 20:47:08,192 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-07-22 20:47:08,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:08,204 INFO L225 Difference]: With dead ends: 7114 [2022-07-22 20:47:08,204 INFO L226 Difference]: Without dead ends: 6365 [2022-07-22 20:47:08,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-22 20:47:08,208 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 388 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:08,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 535 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 20:47:08,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6365 states. [2022-07-22 20:47:08,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6365 to 6141. [2022-07-22 20:47:08,616 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-07-22 20:47:08,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6141 states to 6141 states and 7218 transitions. [2022-07-22 20:47:08,628 INFO L78 Accepts]: Start accepts. Automaton has 6141 states and 7218 transitions. Word has length 147 [2022-07-22 20:47:08,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:08,628 INFO L495 AbstractCegarLoop]: Abstraction has 6141 states and 7218 transitions. [2022-07-22 20:47:08,629 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-07-22 20:47:08,629 INFO L276 IsEmpty]: Start isEmpty. Operand 6141 states and 7218 transitions. [2022-07-22 20:47:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-22 20:47:08,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:08,635 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-07-22 20:47:08,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-22 20:47:08,635 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:08,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:08,635 INFO L85 PathProgramCache]: Analyzing trace with hash -818503781, now seen corresponding path program 1 times [2022-07-22 20:47:08,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:08,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252447134] [2022-07-22 20:47:08,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:08,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:08,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:08,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 20:47:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:08,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:08,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:08,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:08,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:47:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:08,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 20:47:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:08,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-22 20:47:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:08,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 20:47:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:08,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 20:47:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:08,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 20:47:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:08,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:08,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:08,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-22 20:47:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:08,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 20:47:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:08,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-22 20:47:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-22 20:47:08,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:08,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252447134] [2022-07-22 20:47:08,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252447134] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:08,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331464858] [2022-07-22 20:47:08,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:08,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:08,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:08,705 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:08,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 20:47:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:08,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:47:08,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 20:47:08,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:08,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331464858] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:08,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:08,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:47:08,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60528842] [2022-07-22 20:47:08,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:08,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:47:08,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:08,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:47:08,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:47:08,908 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-07-22 20:47:09,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:09,263 INFO L93 Difference]: Finished difference Result 7977 states and 9378 transitions. [2022-07-22 20:47:09,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:47:09,264 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-07-22 20:47:09,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:09,273 INFO L225 Difference]: With dead ends: 7977 [2022-07-22 20:47:09,273 INFO L226 Difference]: Without dead ends: 3937 [2022-07-22 20:47:09,277 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-07-22 20:47:09,278 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-07-22 20:47:09,278 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-07-22 20:47:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2022-07-22 20:47:09,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 3937. [2022-07-22 20:47:09,514 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-07-22 20:47:09,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 4548 transitions. [2022-07-22 20:47:09,520 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 4548 transitions. Word has length 158 [2022-07-22 20:47:09,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:09,521 INFO L495 AbstractCegarLoop]: Abstraction has 3937 states and 4548 transitions. [2022-07-22 20:47:09,521 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-07-22 20:47:09,521 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 4548 transitions. [2022-07-22 20:47:09,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-22 20:47:09,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:09,525 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-07-22 20:47:09,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-22 20:47:09,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:09,726 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:09,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:09,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1011844634, now seen corresponding path program 1 times [2022-07-22 20:47:09,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:09,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933224999] [2022-07-22 20:47:09,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:09,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:47:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:47:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:47:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 20:47:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 20:47:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-22 20:47:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 20:47:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-22 20:47:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-22 20:47:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-22 20:47:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-22 20:47:09,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:09,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933224999] [2022-07-22 20:47:09,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933224999] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:09,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:47:09,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:47:09,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438477093] [2022-07-22 20:47:09,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:09,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:47:09,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:09,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:47:09,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:47:09,804 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-07-22 20:47:10,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:10,377 INFO L93 Difference]: Finished difference Result 5801 states and 6758 transitions. [2022-07-22 20:47:10,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 20:47:10,378 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-07-22 20:47:10,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:10,385 INFO L225 Difference]: With dead ends: 5801 [2022-07-22 20:47:10,385 INFO L226 Difference]: Without dead ends: 4040 [2022-07-22 20:47:10,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-22 20:47:10,388 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 313 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:10,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 792 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 20:47:10,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4040 states. [2022-07-22 20:47:10,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4040 to 3496. [2022-07-22 20:47:10,606 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-07-22 20:47:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 4039 transitions. [2022-07-22 20:47:10,611 INFO L78 Accepts]: Start accepts. Automaton has 3496 states and 4039 transitions. Word has length 159 [2022-07-22 20:47:10,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:10,611 INFO L495 AbstractCegarLoop]: Abstraction has 3496 states and 4039 transitions. [2022-07-22 20:47:10,612 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-07-22 20:47:10,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 4039 transitions. [2022-07-22 20:47:10,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-22 20:47:10,614 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:10,614 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-07-22 20:47:10,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-22 20:47:10,615 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:10,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:10,615 INFO L85 PathProgramCache]: Analyzing trace with hash 978764957, now seen corresponding path program 1 times [2022-07-22 20:47:10,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:10,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182937709] [2022-07-22 20:47:10,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:10,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:10,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:10,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:10,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:47:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:10,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:10,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:10,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:47:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:10,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:47:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:10,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 20:47:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:10,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 20:47:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:10,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-22 20:47:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:10,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-22 20:47:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:10,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:10,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:10,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 20:47:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:10,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-22 20:47:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:10,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-22 20:47:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:10,716 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-22 20:47:10,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:10,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182937709] [2022-07-22 20:47:10,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182937709] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:10,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415080683] [2022-07-22 20:47:10,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:10,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:10,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:10,718 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:10,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-22 20:47:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:10,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 20:47:10,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-22 20:47:10,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 20:47:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-22 20:47:11,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415080683] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 20:47:11,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 20:47:11,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-07-22 20:47:11,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239889403] [2022-07-22 20:47:11,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 20:47:11,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 20:47:11,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:11,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 20:47:11,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-22 20:47:11,186 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-07-22 20:47:12,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:12,215 INFO L93 Difference]: Finished difference Result 5531 states and 6517 transitions. [2022-07-22 20:47:12,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-22 20:47:12,216 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-07-22 20:47:12,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:12,222 INFO L225 Difference]: With dead ends: 5531 [2022-07-22 20:47:12,222 INFO L226 Difference]: Without dead ends: 3783 [2022-07-22 20:47:12,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 354 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2022-07-22 20:47:12,226 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 1184 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:12,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1205 Valid, 1004 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-22 20:47:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2022-07-22 20:47:12,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3583. [2022-07-22 20:47:12,450 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-07-22 20:47:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 4126 transitions. [2022-07-22 20:47:12,456 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 4126 transitions. Word has length 162 [2022-07-22 20:47:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:12,456 INFO L495 AbstractCegarLoop]: Abstraction has 3583 states and 4126 transitions. [2022-07-22 20:47:12,456 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-07-22 20:47:12,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 4126 transitions. [2022-07-22 20:47:12,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-22 20:47:12,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:12,460 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-07-22 20:47:12,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-22 20:47:12,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-07-22 20:47:12,661 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:12,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:12,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1575925759, now seen corresponding path program 2 times [2022-07-22 20:47:12,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:12,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631848009] [2022-07-22 20:47:12,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:12,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:47:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-22 20:47:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 20:47:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:47:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 20:47:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:47:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 20:47:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 20:47:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 20:47:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:47:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-22 20:47:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:12,726 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-07-22 20:47:12,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:12,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631848009] [2022-07-22 20:47:12,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631848009] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:12,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:47:12,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 20:47:12,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795060200] [2022-07-22 20:47:12,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:12,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 20:47:12,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:12,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 20:47:12,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:47:12,728 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-07-22 20:47:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:13,454 INFO L93 Difference]: Finished difference Result 5452 states and 6270 transitions. [2022-07-22 20:47:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 20:47:13,454 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-07-22 20:47:13,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:13,457 INFO L225 Difference]: With dead ends: 5452 [2022-07-22 20:47:13,457 INFO L226 Difference]: Without dead ends: 1760 [2022-07-22 20:47:13,461 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-07-22 20:47:13,461 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 796 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:13,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 710 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 20:47:13,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2022-07-22 20:47:13,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1760. [2022-07-22 20:47:13,576 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-07-22 20:47:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2046 transitions. [2022-07-22 20:47:13,579 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2046 transitions. Word has length 175 [2022-07-22 20:47:13,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:13,579 INFO L495 AbstractCegarLoop]: Abstraction has 1760 states and 2046 transitions. [2022-07-22 20:47:13,579 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-07-22 20:47:13,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2046 transitions. [2022-07-22 20:47:13,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-22 20:47:13,581 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:13,581 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-07-22 20:47:13,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-22 20:47:13,581 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:13,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:13,582 INFO L85 PathProgramCache]: Analyzing trace with hash -61354190, now seen corresponding path program 1 times [2022-07-22 20:47:13,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:13,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524582584] [2022-07-22 20:47:13,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:13,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:13,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:13,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-22 20:47:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:13,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:47:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:13,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:13,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:13,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 20:47:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:13,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 20:47:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:13,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 20:47:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:13,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-22 20:47:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:13,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 20:47:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:13,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-22 20:47:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:13,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-22 20:47:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:13,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:13,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:13,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-22 20:47:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:13,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-22 20:47:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:13,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-22 20:47:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-22 20:47:13,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:13,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524582584] [2022-07-22 20:47:13,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524582584] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:13,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384044429] [2022-07-22 20:47:13,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:13,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:13,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:13,664 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:13,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-22 20:47:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:13,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 20:47:13,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-07-22 20:47:13,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:47:13,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384044429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:47:13,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:47:13,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-22 20:47:13,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920352893] [2022-07-22 20:47:13,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:47:13,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:47:13,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:13,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:47:13,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-22 20:47:13,804 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-07-22 20:47:14,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:14,019 INFO L93 Difference]: Finished difference Result 3405 states and 3969 transitions. [2022-07-22 20:47:14,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 20:47:14,019 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-07-22 20:47:14,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:14,022 INFO L225 Difference]: With dead ends: 3405 [2022-07-22 20:47:14,022 INFO L226 Difference]: Without dead ends: 1477 [2022-07-22 20:47:14,024 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-07-22 20:47:14,024 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 151 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:14,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 275 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 20:47:14,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2022-07-22 20:47:14,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1440. [2022-07-22 20:47:14,123 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-07-22 20:47:14,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 1649 transitions. [2022-07-22 20:47:14,125 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 1649 transitions. Word has length 179 [2022-07-22 20:47:14,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:14,125 INFO L495 AbstractCegarLoop]: Abstraction has 1440 states and 1649 transitions. [2022-07-22 20:47:14,125 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-07-22 20:47:14,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1649 transitions. [2022-07-22 20:47:14,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-07-22 20:47:14,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:47:14,127 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-07-22 20:47:14,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-22 20:47:14,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-07-22 20:47:14,327 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:47:14,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:47:14,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1658574142, now seen corresponding path program 1 times [2022-07-22 20:47:14,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:47:14,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233653123] [2022-07-22 20:47:14,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:14,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:47:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:47:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:47:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:47:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:47:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:47:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 20:47:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 20:47:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-22 20:47:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-22 20:47:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-22 20:47:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-22 20:47:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-22 20:47:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-22 20:47:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-22 20:47:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-22 20:47:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-22 20:47:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:47:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:47:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-22 20:47:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-22 20:47:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-22 20:47:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-07-22 20:47:14,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:47:14,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233653123] [2022-07-22 20:47:14,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233653123] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:47:14,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218422963] [2022-07-22 20:47:14,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:47:14,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:14,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:47:14,422 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 20:47:14,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-22 20:47:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:47:14,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 20:47:14,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:47:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 256 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-22 20:47:14,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 20:47:14,853 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-07-22 20:47:14,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218422963] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 20:47:14,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 20:47:14,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2022-07-22 20:47:14,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240962283] [2022-07-22 20:47:14,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 20:47:14,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 20:47:14,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:47:14,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 20:47:14,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-22 20:47:14,856 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-07-22 20:47:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:47:15,271 INFO L93 Difference]: Finished difference Result 1743 states and 1984 transitions. [2022-07-22 20:47:15,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 20:47:15,272 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-07-22 20:47:15,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:47:15,272 INFO L225 Difference]: With dead ends: 1743 [2022-07-22 20:47:15,272 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 20:47:15,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 548 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2022-07-22 20:47:15,274 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 346 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 20:47:15,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 448 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 20:47:15,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 20:47:15,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 20:47:15,275 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-07-22 20:47:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 20:47:15,275 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 253 [2022-07-22 20:47:15,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:47:15,275 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 20:47:15,275 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-07-22 20:47:15,275 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 20:47:15,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 20:47:15,277 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-22 20:47:15,278 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-22 20:47:15,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-22 20:47:15,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:47:15,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 20:48:17,287 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 812 822) no Hoare annotation was computed. [2022-07-22 20:48:17,288 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-07-22 20:48:17,288 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 812 822) no Hoare annotation was computed. [2022-07-22 20:48:17,288 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 226 240) no Hoare annotation was computed. [2022-07-22 20:48:17,288 INFO L895 garLoopResultBuilder]: At program point update_channels1ENTRY(lines 226 240) the Hoare annotation is: (let ((.cse36 (= ~T1_E~0 ~M_E~0)) (.cse38 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse37 (= ~p_last_write~0 ~q_buf_0~0)) (.cse43 (= ~m_pc~0 ~t1_pc~0)) (.cse46 (<= 1 ~c_dr_pc~0)) (.cse45 (= ~q_free~0 1)) (.cse47 (<= ~c_dr_pc~0 1)) (.cse50 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse48 (<= ~p_num_write~0 ~c_num_read~0)) (.cse33 (<= ~m_pc~0 1)) (.cse32 (<= ~m_pc~0 0)) (.cse34 (= ~E_M~0 0)) (.cse39 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse40 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse41 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse44 (= ~c_last_read~0 ~p_last_write~0)) (.cse42 (= ~M_E~0 2)) (.cse49 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (let ((.cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse6 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse27 (not (= |old(~q_req_up~0)| 1))) (.cse23 (and .cse36 .cse38 .cse37 .cse43 .cse46 .cse45 .cse47 .cse50 .cse48 (or (not .cse33) .cse32) (not .cse34) .cse39 .cse40 .cse41 .cse44 .cse42 .cse49)) (.cse30 (not (= ~p_num_write~0 0))) (.cse31 (not (= ~c_num_read~0 0))) (.cse4 (and .cse38 .cse39 .cse41 (= ~q_read_ev~0 2))) (.cse11 (not (<= |old(~q_req_up~0)| 0))) (.cse13 (not .cse50)) (.cse16 (not (= |old(~q_read_ev~0)| 2))) (.cse20 (not .cse49)) (.cse21 (not .cse48)) (.cse10 (not .cse47)) (.cse35 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse22 (not (<= 2 |old(~q_write_ev~0)|))) (.cse24 (not .cse46)) (.cse25 (not .cse45)) (.cse26 (not .cse44)) (.cse0 (= ~c_dr_st~0 0)) (.cse29 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse43)) (.cse2 (not .cse42)) (.cse28 (and .cse38 .cse39 .cse40 .cse41)) (.cse5 (not (<= ~t1_pc~0 0))) (.cse7 (not .cse37)) (.cse8 (not (= ~q_free~0 0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse12 (= ~p_dw_st~0 0)) (.cse14 (not .cse36)) (.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 .cse27 .cse28 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse16 .cse17 .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 .cse29 .cse1 (not .cse12) .cse2 .cse4 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse5 .cse30 .cse7 .cse31 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse26 .cse18 .cse19) (or .cse0 .cse1 .cse2 (and (not .cse32) .cse33) .cse28 .cse30 .cse7 .cse34 .cse31 .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 .cse28 .cse20 .cse5 .cse7 .cse21 .cse9 .cse10 .cse12 .cse35 .cse14 .cse15 .cse22 .cse24 .cse17 .cse25 .cse26 .cse18 .cse19) (or .cse0 .cse29 .cse1 .cse2 .cse28 .cse5 .cse7 .cse8 .cse9 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19)))) [2022-07-22 20:48:17,289 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-07-22 20:48:17,289 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2022-07-22 20:48:17,289 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2022-07-22 20:48:17,289 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 42 57) no Hoare annotation was computed. [2022-07-22 20:48:17,289 INFO L899 garLoopResultBuilder]: For program point L230-1(lines 226 240) no Hoare annotation was computed. [2022-07-22 20:48:17,289 INFO L899 garLoopResultBuilder]: For program point L803-2(lines 787 811) no Hoare annotation was computed. [2022-07-22 20:48:17,290 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-07-22 20:48:17,290 INFO L899 garLoopResultBuilder]: For program point L795(lines 795 799) no Hoare annotation was computed. [2022-07-22 20:48:17,290 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 606) no Hoare annotation was computed. [2022-07-22 20:48:17,290 INFO L899 garLoopResultBuilder]: For program point L795-2(lines 795 799) no Hoare annotation was computed. [2022-07-22 20:48:17,290 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-07-22 20:48:17,290 INFO L899 garLoopResultBuilder]: For program point L620(lines 620 625) no Hoare annotation was computed. [2022-07-22 20:48:17,290 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-07-22 20:48:17,291 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 787 811) no Hoare annotation was computed. [2022-07-22 20:48:17,291 INFO L899 garLoopResultBuilder]: For program point L600(lines 600 609) no Hoare annotation was computed. [2022-07-22 20:48:17,291 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-07-22 20:48:17,291 INFO L899 garLoopResultBuilder]: For program point L600-2(lines 600 609) no Hoare annotation was computed. [2022-07-22 20:48:17,291 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 628) no Hoare annotation was computed. [2022-07-22 20:48:17,291 INFO L899 garLoopResultBuilder]: For program point L619-2(lines 619 628) no Hoare annotation was computed. [2022-07-22 20:48:17,291 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-07-22 20:48:17,291 INFO L899 garLoopResultBuilder]: For program point L803(lines 803 807) no Hoare annotation was computed. [2022-07-22 20:48:17,292 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-07-22 20:48:17,292 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-07-22 20:48:17,292 INFO L899 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2022-07-22 20:48:17,292 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-07-22 20:48:17,292 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 315 339) no Hoare annotation was computed. [2022-07-22 20:48:17,292 INFO L899 garLoopResultBuilder]: For program point L331(lines 331 335) no Hoare annotation was computed. [2022-07-22 20:48:17,292 INFO L899 garLoopResultBuilder]: For program point L329(line 329) no Hoare annotation was computed. [2022-07-22 20:48:17,292 INFO L899 garLoopResultBuilder]: For program point L331-2(lines 315 339) no Hoare annotation was computed. [2022-07-22 20:48:17,292 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2022-07-22 20:48:17,292 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 634 641) no Hoare annotation was computed. [2022-07-22 20:48:17,292 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 634 641) the Hoare annotation is: true [2022-07-22 20:48:17,293 INFO L899 garLoopResultBuilder]: For program point L735-1(lines 734 757) no Hoare annotation was computed. [2022-07-22 20:48:17,293 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-07-22 20:48:17,293 INFO L899 garLoopResultBuilder]: For program point L750-1(lines 731 758) no Hoare annotation was computed. [2022-07-22 20:48:17,293 INFO L899 garLoopResultBuilder]: For program point L745-1(lines 734 757) no Hoare annotation was computed. [2022-07-22 20:48:17,293 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 731 758) no Hoare annotation was computed. [2022-07-22 20:48:17,293 INFO L899 garLoopResultBuilder]: For program point L740-1(lines 734 757) no Hoare annotation was computed. [2022-07-22 20:48:17,293 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-07-22 20:48:17,294 INFO L899 garLoopResultBuilder]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2022-07-22 20:48:17,294 INFO L899 garLoopResultBuilder]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2022-07-22 20:48:17,294 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 279 296) no Hoare annotation was computed. [2022-07-22 20:48:17,294 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2022-07-22 20:48:17,294 INFO L902 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 88 106) the Hoare annotation is: true [2022-07-22 20:48:17,294 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 101) no Hoare annotation was computed. [2022-07-22 20:48:17,294 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 101) no Hoare annotation was computed. [2022-07-22 20:48:17,294 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 88 106) no Hoare annotation was computed. [2022-07-22 20:48:17,295 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 88 106) no Hoare annotation was computed. [2022-07-22 20:48:17,295 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-07-22 20:48:17,295 INFO L899 garLoopResultBuilder]: For program point L960(lines 960 966) no Hoare annotation was computed. [2022-07-22 20:48:17,295 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-07-22 20:48:17,295 INFO L899 garLoopResultBuilder]: For program point L927-1(line 927) no Hoare annotation was computed. [2022-07-22 20:48:17,295 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-07-22 20:48:17,295 INFO L899 garLoopResultBuilder]: For program point L696(lines 686 724) no Hoare annotation was computed. [2022-07-22 20:48:17,295 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 572) no Hoare annotation was computed. [2022-07-22 20:48:17,295 INFO L899 garLoopResultBuilder]: For program point L878(lines 878 883) no Hoare annotation was computed. [2022-07-22 20:48:17,295 INFO L899 garLoopResultBuilder]: For program point L713(lines 713 720) no Hoare annotation was computed. [2022-07-22 20:48:17,295 INFO L895 garLoopResultBuilder]: At program point L482(lines 473 484) the Hoare annotation is: (= ~M_E~0 2) [2022-07-22 20:48:17,295 INFO L899 garLoopResultBuilder]: For program point L350(line 350) no Hoare annotation was computed. [2022-07-22 20:48:17,295 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 20:48:17,296 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-07-22 20:48:17,296 INFO L899 garLoopResultBuilder]: For program point L532(line 532) no Hoare annotation was computed. [2022-07-22 20:48:17,296 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-07-22 20:48:17,296 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-07-22 20:48:17,296 INFO L899 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2022-07-22 20:48:17,296 INFO L899 garLoopResultBuilder]: For program point L912-1(line 912) no Hoare annotation was computed. [2022-07-22 20:48:17,296 INFO L899 garLoopResultBuilder]: For program point L846-1(lines 835 858) no Hoare annotation was computed. [2022-07-22 20:48:17,296 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2022-07-22 20:48:17,296 INFO L899 garLoopResultBuilder]: For program point L962(lines 962 965) no Hoare annotation was computed. [2022-07-22 20:48:17,296 INFO L895 garLoopResultBuilder]: At program point L450(lines 413 455) the Hoare annotation is: (= ~M_E~0 2) [2022-07-22 20:48:17,296 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-07-22 20:48:17,296 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2022-07-22 20:48:17,297 INFO L899 garLoopResultBuilder]: For program point L897-1(line 897) no Hoare annotation was computed. [2022-07-22 20:48:17,297 INFO L899 garLoopResultBuilder]: For program point L352-1(lines 347 387) no Hoare annotation was computed. [2022-07-22 20:48:17,297 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-07-22 20:48:17,297 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 706) no Hoare annotation was computed. [2022-07-22 20:48:17,297 INFO L899 garLoopResultBuilder]: For program point L567(lines 567 571) no Hoare annotation was computed. [2022-07-22 20:48:17,297 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-07-22 20:48:17,297 INFO L899 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2022-07-22 20:48:17,297 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2022-07-22 20:48:17,297 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-07-22 20:48:17,297 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2022-07-22 20:48:17,298 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-07-22 20:48:17,298 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-07-22 20:48:17,298 INFO L899 garLoopResultBuilder]: For program point L585-1(line 585) no Hoare annotation was computed. [2022-07-22 20:48:17,298 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-07-22 20:48:17,298 INFO L899 garLoopResultBuilder]: For program point L420-1(line 420) no Hoare annotation was computed. [2022-07-22 20:48:17,298 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-07-22 20:48:17,298 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-07-22 20:48:17,298 INFO L899 garLoopResultBuilder]: For program point L189(lines 188 219) no Hoare annotation was computed. [2022-07-22 20:48:17,298 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-07-22 20:48:17,298 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-07-22 20:48:17,299 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-07-22 20:48:17,299 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2022-07-22 20:48:17,299 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-07-22 20:48:17,299 INFO L899 garLoopResultBuilder]: For program point L520(lines 520 528) no Hoare annotation was computed. [2022-07-22 20:48:17,299 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-07-22 20:48:17,299 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-07-22 20:48:17,299 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-07-22 20:48:17,300 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 20:48:17,300 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 190 200) no Hoare annotation was computed. [2022-07-22 20:48:17,300 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-07-22 20:48:17,300 INFO L899 garLoopResultBuilder]: For program point L537-1(line 537) no Hoare annotation was computed. [2022-07-22 20:48:17,300 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-07-22 20:48:17,300 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-07-22 20:48:17,301 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-07-22 20:48:17,301 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2022-07-22 20:48:17,301 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-07-22 20:48:17,301 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-07-22 20:48:17,301 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-07-22 20:48:17,302 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-07-22 20:48:17,302 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-07-22 20:48:17,302 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-07-22 20:48:17,302 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-07-22 20:48:17,303 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-07-22 20:48:17,303 INFO L899 garLoopResultBuilder]: For program point L357(lines 347 387) no Hoare annotation was computed. [2022-07-22 20:48:17,303 INFO L899 garLoopResultBuilder]: For program point L836(lines 836 840) no Hoare annotation was computed. [2022-07-22 20:48:17,303 INFO L899 garLoopResultBuilder]: For program point L836-2(lines 835 858) no Hoare annotation was computed. [2022-07-22 20:48:17,303 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-07-22 20:48:17,303 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-07-22 20:48:17,304 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-07-22 20:48:17,304 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2022-07-22 20:48:17,304 INFO L899 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2022-07-22 20:48:17,304 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 20:48:17,304 INFO L899 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2022-07-22 20:48:17,304 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2022-07-22 20:48:17,304 INFO L899 garLoopResultBuilder]: For program point L689(line 689) no Hoare annotation was computed. [2022-07-22 20:48:17,305 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-07-22 20:48:17,305 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-07-22 20:48:17,305 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-07-22 20:48:17,305 INFO L899 garLoopResultBuilder]: For program point L921(line 921) no Hoare annotation was computed. [2022-07-22 20:48:17,305 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 383) no Hoare annotation was computed. [2022-07-22 20:48:17,305 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: false [2022-07-22 20:48:17,306 INFO L899 garLoopResultBuilder]: For program point L905(line 905) no Hoare annotation was computed. [2022-07-22 20:48:17,306 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-07-22 20:48:17,306 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-07-22 20:48:17,306 INFO L899 garLoopResultBuilder]: For program point L245(lines 245 249) no Hoare annotation was computed. [2022-07-22 20:48:17,306 INFO L899 garLoopResultBuilder]: For program point L245-2(lines 244 257) no Hoare annotation was computed. [2022-07-22 20:48:17,306 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2022-07-22 20:48:17,306 INFO L899 garLoopResultBuilder]: For program point L691-1(lines 686 724) no Hoare annotation was computed. [2022-07-22 20:48:17,307 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-07-22 20:48:17,307 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 368) no Hoare annotation was computed. [2022-07-22 20:48:17,307 INFO L899 garLoopResultBuilder]: For program point L576(line 576) no Hoare annotation was computed. [2022-07-22 20:48:17,307 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2022-07-22 20:48:17,307 INFO L899 garLoopResultBuilder]: For program point L923(lines 923 932) no Hoare annotation was computed. [2022-07-22 20:48:17,307 INFO L899 garLoopResultBuilder]: For program point L923-2(lines 923 932) no Hoare annotation was computed. [2022-07-22 20:48:17,308 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-07-22 20:48:17,308 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 184) no Hoare annotation was computed. [2022-07-22 20:48:17,308 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-07-22 20:48:17,308 INFO L899 garLoopResultBuilder]: For program point L428(line 428) no Hoare annotation was computed. [2022-07-22 20:48:17,308 INFO L899 garLoopResultBuilder]: For program point L841-1(lines 835 858) no Hoare annotation was computed. [2022-07-22 20:48:17,308 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 20:48:17,308 INFO L902 garLoopResultBuilder]: At program point L957(lines 948 959) the Hoare annotation is: true [2022-07-22 20:48:17,308 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2022-07-22 20:48:17,308 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-07-22 20:48:17,308 INFO L899 garLoopResultBuilder]: For program point L148(lines 147 165) no Hoare annotation was computed. [2022-07-22 20:48:17,308 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-07-22 20:48:17,309 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-07-22 20:48:17,309 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-07-22 20:48:17,309 INFO L899 garLoopResultBuilder]: For program point L496(line 496) no Hoare annotation was computed. [2022-07-22 20:48:17,309 INFO L902 garLoopResultBuilder]: At program point L942(lines 889 947) the Hoare annotation is: true [2022-07-22 20:48:17,309 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-07-22 20:48:17,309 INFO L899 garLoopResultBuilder]: For program point L876-1(line 876) no Hoare annotation was computed. [2022-07-22 20:48:17,310 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-07-22 20:48:17,310 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-07-22 20:48:17,310 INFO L895 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2022-07-22 20:48:17,310 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-07-22 20:48:17,310 INFO L895 garLoopResultBuilder]: At program point L497(lines 492 499) the Hoare annotation is: false [2022-07-22 20:48:17,310 INFO L899 garLoopResultBuilder]: For program point L646(lines 646 650) no Hoare annotation was computed. [2022-07-22 20:48:17,311 INFO L899 garLoopResultBuilder]: For program point L646-2(lines 645 658) no Hoare annotation was computed. [2022-07-22 20:48:17,311 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-07-22 20:48:17,311 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 69 87) no Hoare annotation was computed. [2022-07-22 20:48:17,311 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 69 87) no Hoare annotation was computed. [2022-07-22 20:48:17,311 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 79) no Hoare annotation was computed. [2022-07-22 20:48:17,311 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 82) no Hoare annotation was computed. [2022-07-22 20:48:17,312 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 73 82) no Hoare annotation was computed. [2022-07-22 20:48:17,312 INFO L902 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 69 87) the Hoare annotation is: true [2022-07-22 20:48:17,312 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 259 278) no Hoare annotation was computed. [2022-07-22 20:48:17,312 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-07-22 20:48:17,312 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 259 278) the Hoare annotation is: true [2022-07-22 20:48:17,312 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2022-07-22 20:48:17,312 INFO L899 garLoopResultBuilder]: For program point L263(lines 263 273) no Hoare annotation was computed. [2022-07-22 20:48:17,313 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 259 278) no Hoare annotation was computed. [2022-07-22 20:48:17,313 INFO L902 garLoopResultBuilder]: At program point error1ENTRY(lines 24 31) the Hoare annotation is: true [2022-07-22 20:48:17,313 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 28) no Hoare annotation was computed. [2022-07-22 20:48:17,313 INFO L899 garLoopResultBuilder]: For program point error1FINAL(lines 24 31) no Hoare annotation was computed. [2022-07-22 20:48:17,313 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 24 31) no Hoare annotation was computed. [2022-07-22 20:48:17,313 INFO L899 garLoopResultBuilder]: For program point L668(lines 668 673) no Hoare annotation was computed. [2022-07-22 20:48:17,313 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 660 679) no Hoare annotation was computed. [2022-07-22 20:48:17,313 INFO L899 garLoopResultBuilder]: For program point L664(lines 664 674) no Hoare annotation was computed. [2022-07-22 20:48:17,314 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 660 679) the Hoare annotation is: true [2022-07-22 20:48:17,314 INFO L902 garLoopResultBuilder]: At program point L676(lines 663 678) the Hoare annotation is: true [2022-07-22 20:48:17,314 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 660 679) no Hoare annotation was computed. [2022-07-22 20:48:17,314 INFO L899 garLoopResultBuilder]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2022-07-22 20:48:17,314 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-07-22 20:48:17,314 INFO L899 garLoopResultBuilder]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2022-07-22 20:48:17,314 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 297 314) no Hoare annotation was computed. [2022-07-22 20:48:17,315 INFO L899 garLoopResultBuilder]: For program point L768-1(lines 762 785) no Hoare annotation was computed. [2022-07-22 20:48:17,315 INFO L899 garLoopResultBuilder]: For program point L763-1(lines 762 785) no Hoare annotation was computed. [2022-07-22 20:48:17,315 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 759 786) no Hoare annotation was computed. [2022-07-22 20:48:17,316 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-07-22 20:48:17,316 INFO L899 garLoopResultBuilder]: For program point L778-1(lines 759 786) no Hoare annotation was computed. [2022-07-22 20:48:17,316 INFO L899 garLoopResultBuilder]: For program point L773-1(lines 762 785) no Hoare annotation was computed. [2022-07-22 20:48:17,319 INFO L356 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-07-22 20:48:17,321 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 20:48:17,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 08:48:17 BoogieIcfgContainer [2022-07-22 20:48:17,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 20:48:17,449 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 20:48:17,449 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 20:48:17,449 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 20:48:17,450 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 08:46:24" (3/4) ... [2022-07-22 20:48:17,452 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 20:48:17,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-07-22 20:48:17,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2022-07-22 20:48:17,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2022-07-22 20:48:17,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2022-07-22 20:48:17,458 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2022-07-22 20:48:17,458 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2022-07-22 20:48:17,458 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2022-07-22 20:48:17,458 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-07-22 20:48:17,458 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-07-22 20:48:17,458 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2022-07-22 20:48:17,458 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2022-07-22 20:48:17,458 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2022-07-22 20:48:17,459 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2022-07-22 20:48:17,459 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2022-07-22 20:48:17,475 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-07-22 20:48:17,476 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-22 20:48:17,476 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 20:48:17,477 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 20:48:17,502 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-07-22 20:48:17,503 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-07-22 20:48:17,503 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-07-22 20:48:17,510 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-07-22 20:48:17,510 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-07-22 20:48:17,573 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 20:48:17,573 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 20:48:17,574 INFO L158 Benchmark]: Toolchain (without parser) took 114159.28ms. Allocated memory was 98.6MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 71.1MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2022-07-22 20:48:17,575 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 98.6MB. Free memory is still 56.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 20:48:17,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.51ms. Allocated memory is still 98.6MB. Free memory was 70.8MB in the beginning and 69.4MB in the end (delta: 1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 20:48:17,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.14ms. Allocated memory is still 98.6MB. Free memory was 69.4MB in the beginning and 66.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 20:48:17,581 INFO L158 Benchmark]: Boogie Preprocessor took 29.17ms. Allocated memory is still 98.6MB. Free memory was 66.7MB in the beginning and 64.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 20:48:17,582 INFO L158 Benchmark]: RCFGBuilder took 668.14ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 64.6MB in the beginning and 88.7MB in the end (delta: -24.1MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2022-07-22 20:48:17,583 INFO L158 Benchmark]: TraceAbstraction took 112975.28ms. Allocated memory was 119.5MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 88.2MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2022-07-22 20:48:17,583 INFO L158 Benchmark]: Witness Printer took 124.40ms. Allocated memory is still 3.5GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 20:48:17,584 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.23ms. Allocated memory is still 98.6MB. Free memory is still 56.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.51ms. Allocated memory is still 98.6MB. Free memory was 70.8MB in the beginning and 69.4MB in the end (delta: 1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.14ms. Allocated memory is still 98.6MB. Free memory was 69.4MB in the beginning and 66.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.17ms. Allocated memory is still 98.6MB. Free memory was 66.7MB in the beginning and 64.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 668.14ms. Allocated memory was 98.6MB in the beginning and 119.5MB in the end (delta: 21.0MB). Free memory was 64.6MB in the beginning and 88.7MB in the end (delta: -24.1MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * TraceAbstraction took 112975.28ms. Allocated memory was 119.5MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 88.2MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 124.40ms. Allocated memory is still 3.5GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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: 112.8s, OverallIterations: 35, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 28.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 61.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18303 SdHoareTripleChecker+Valid, 11.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17852 mSDsluCounter, 27313 SdHoareTripleChecker+Invalid, 9.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17186 mSDsCounter, 4532 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15454 IncrementalHoareTripleChecker+Invalid, 19986 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4532 mSolverCounterUnsat, 10127 mSDtfsCounter, 15454 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3749 GetRequests, 3273 SyntacticMatches, 16 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1436 ImplicationChecksByTransitivity, 3.6s 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: 13.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 9753 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 16053 PreInvPairs, 18024 NumberOfFragments, 28642 HoareAnnotationTreeSize, 16053 FomulaSimplifications, 19504 FormulaSimplificationTreeSizeReduction, 12.4s HoareSimplificationTime, 84 FomulaSimplificationsInter, 577625 FormulaSimplificationTreeSizeReductionInter, 49.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 5734 NumberOfCodeBlocks, 5734 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 6171 ConstructedInterpolants, 0 QuantifiedInterpolants, 11646 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-07-22 20:48:17,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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