/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks NOT_INCREMENTALLY -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-20 12:24:24,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 12:24:24,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 12:24:24,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 12:24:24,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 12:24:24,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 12:24:24,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 12:24:24,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 12:24:24,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 12:24:24,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 12:24:24,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 12:24:24,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 12:24:24,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 12:24:24,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 12:24:24,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 12:24:24,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 12:24:24,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 12:24:24,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 12:24:24,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 12:24:24,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 12:24:24,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 12:24:24,687 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 12:24:24,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 12:24:24,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 12:24:24,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 12:24:24,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 12:24:24,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 12:24:24,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 12:24:24,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 12:24:24,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 12:24:24,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 12:24:24,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 12:24:24,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 12:24:24,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 12:24:24,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 12:24:24,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 12:24:24,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 12:24:24,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 12:24:24,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 12:24:24,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 12:24:24,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 12:24:24,701 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 12:24:24,736 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 12:24:24,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 12:24:24,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 12:24:24,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 12:24:24,738 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 12:24:24,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 12:24:24,741 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 12:24:24,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 12:24:24,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 12:24:24,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 12:24:24,742 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 12:24:24,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 12:24:24,743 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 12:24:24,743 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 12:24:24,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 12:24:24,743 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 12:24:24,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 12:24:24,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 12:24:24,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 12:24:24,744 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 12:24:24,749 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 12:24:24,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 12:24:24,750 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 12:24:24,750 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 12:24:24,750 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 12:24:24,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 12:24:24,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:24,751 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 12:24:24,751 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 12:24:24,751 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> NOT_INCREMENTALLY [2020-07-20 12:24:24,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 12:24:25,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 12:24:25,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 12:24:25,015 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 12:24:25,016 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 12:24:25,017 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-07-20 12:24:25,084 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5cc7ec6/5b42fc17e9a844638f3440f7fa8103c2/FLAG5584477f3 [2020-07-20 12:24:25,512 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 12:24:25,513 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-07-20 12:24:25,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5cc7ec6/5b42fc17e9a844638f3440f7fa8103c2/FLAG5584477f3 [2020-07-20 12:24:25,847 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5cc7ec6/5b42fc17e9a844638f3440f7fa8103c2 [2020-07-20 12:24:25,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 12:24:25,860 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 12:24:25,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 12:24:25,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 12:24:25,865 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 12:24:25,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:24:25" (1/1) ... [2020-07-20 12:24:25,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4680b631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:24:25, skipping insertion in model container [2020-07-20 12:24:25,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:24:25" (1/1) ... [2020-07-20 12:24:25,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 12:24:25,900 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 12:24:26,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 12:24:26,171 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 12:24:26,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 12:24:26,364 INFO L208 MainTranslator]: Completed translation [2020-07-20 12:24:26,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:24:26 WrapperNode [2020-07-20 12:24:26,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 12:24:26,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 12:24:26,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 12:24:26,366 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 12:24:26,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:24:26" (1/1) ... [2020-07-20 12:24:26,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:24:26" (1/1) ... [2020-07-20 12:24:26,385 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:24:26" (1/1) ... [2020-07-20 12:24:26,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:24:26" (1/1) ... [2020-07-20 12:24:26,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:24:26" (1/1) ... [2020-07-20 12:24:26,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:24:26" (1/1) ... [2020-07-20 12:24:26,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:24:26" (1/1) ... [2020-07-20 12:24:26,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 12:24:26,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 12:24:26,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 12:24:26,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 12:24:26,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:24:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 12:24:26,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 12:24:26,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 12:24:26,465 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 12:24:26,465 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2020-07-20 12:24:26,465 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2020-07-20 12:24:26,465 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2020-07-20 12:24:26,465 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2020-07-20 12:24:26,466 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2020-07-20 12:24:26,466 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 12:24:26,466 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 12:24:26,466 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 12:24:26,466 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 12:24:26,466 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 12:24:26,467 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 12:24:26,467 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 12:24:26,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 12:24:26,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 12:24:26,467 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 12:24:26,467 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2020-07-20 12:24:26,468 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2020-07-20 12:24:26,468 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2020-07-20 12:24:26,468 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2020-07-20 12:24:26,468 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2020-07-20 12:24:26,468 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 12:24:26,468 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 12:24:26,469 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 12:24:26,469 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 12:24:26,469 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 12:24:26,469 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 12:24:26,469 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 12:24:26,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 12:24:26,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 12:24:26,887 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 12:24:26,887 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-20 12:24:26,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:24:26 BoogieIcfgContainer [2020-07-20 12:24:26,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 12:24:26,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 12:24:26,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 12:24:26,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 12:24:26,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 12:24:25" (1/3) ... [2020-07-20 12:24:26,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e45262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:24:26, skipping insertion in model container [2020-07-20 12:24:26,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:24:26" (2/3) ... [2020-07-20 12:24:26,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e45262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:24:26, skipping insertion in model container [2020-07-20 12:24:26,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:24:26" (3/3) ... [2020-07-20 12:24:26,901 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-07-20 12:24:26,911 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 12:24:26,918 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 12:24:26,929 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 12:24:26,954 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 12:24:26,954 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 12:24:26,955 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 12:24:26,955 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 12:24:26,955 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 12:24:26,955 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 12:24:26,955 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 12:24:26,955 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 12:24:26,975 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2020-07-20 12:24:26,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-20 12:24:26,985 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:24:26,986 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:24:26,987 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:24:26,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:24:26,993 INFO L82 PathProgramCache]: Analyzing trace with hash 800633075, now seen corresponding path program 1 times [2020-07-20 12:24:27,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:24:27,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [722687038] [2020-07-20 12:24:27,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:24:27,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 12:24:27,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:24:27,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:24:27,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:24:27,267 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [722687038] [2020-07-20 12:24:27,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:24:27,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:24:27,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271621311] [2020-07-20 12:24:27,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:24:27,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:24:27,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:24:27,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:24:27,291 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 3 states. [2020-07-20 12:24:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:24:27,377 INFO L93 Difference]: Finished difference Result 279 states and 392 transitions. [2020-07-20 12:24:27,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:24:27,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-20 12:24:27,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:24:27,395 INFO L225 Difference]: With dead ends: 279 [2020-07-20 12:24:27,395 INFO L226 Difference]: Without dead ends: 175 [2020-07-20 12:24:27,400 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:24:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-07-20 12:24:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2020-07-20 12:24:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-07-20 12:24:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 219 transitions. [2020-07-20 12:24:27,471 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 219 transitions. Word has length 65 [2020-07-20 12:24:27,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:24:27,472 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 219 transitions. [2020-07-20 12:24:27,473 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:24:27,473 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 219 transitions. [2020-07-20 12:24:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-20 12:24:27,478 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:24:27,478 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:24:27,692 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:27,692 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:24:27,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:24:27,694 INFO L82 PathProgramCache]: Analyzing trace with hash -478691660, now seen corresponding path program 1 times [2020-07-20 12:24:27,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:24:27,695 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1203107180] [2020-07-20 12:24:27,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:24:27,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:24:27,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:24:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:24:27,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:24:27,859 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1203107180] [2020-07-20 12:24:27,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:24:27,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:24:27,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651935233] [2020-07-20 12:24:27,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:24:27,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:24:27,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:24:27,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:24:27,863 INFO L87 Difference]: Start difference. First operand 171 states and 219 transitions. Second operand 3 states. [2020-07-20 12:24:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:24:27,925 INFO L93 Difference]: Finished difference Result 468 states and 631 transitions. [2020-07-20 12:24:27,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:24:27,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-20 12:24:27,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:24:27,932 INFO L225 Difference]: With dead ends: 468 [2020-07-20 12:24:27,932 INFO L226 Difference]: Without dead ends: 314 [2020-07-20 12:24:27,935 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:24:27,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-07-20 12:24:27,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 310. [2020-07-20 12:24:27,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2020-07-20 12:24:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 412 transitions. [2020-07-20 12:24:27,981 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 412 transitions. Word has length 65 [2020-07-20 12:24:27,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:24:27,981 INFO L479 AbstractCegarLoop]: Abstraction has 310 states and 412 transitions. [2020-07-20 12:24:27,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:24:27,982 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 412 transitions. [2020-07-20 12:24:27,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 12:24:27,986 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:24:27,986 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:24:28,201 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:28,202 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:24:28,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:24:28,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1988256317, now seen corresponding path program 1 times [2020-07-20 12:24:28,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:24:28,205 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [888978036] [2020-07-20 12:24:28,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:24:28,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-20 12:24:28,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:24:28,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:24:28,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:24:28,396 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [888978036] [2020-07-20 12:24:28,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:24:28,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:24:28,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903112194] [2020-07-20 12:24:28,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:24:28,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:24:28,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:24:28,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:24:28,398 INFO L87 Difference]: Start difference. First operand 310 states and 412 transitions. Second operand 3 states. [2020-07-20 12:24:28,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:24:28,464 INFO L93 Difference]: Finished difference Result 882 states and 1239 transitions. [2020-07-20 12:24:28,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:24:28,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-20 12:24:28,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:24:28,473 INFO L225 Difference]: With dead ends: 882 [2020-07-20 12:24:28,473 INFO L226 Difference]: Without dead ends: 592 [2020-07-20 12:24:28,479 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:24:28,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2020-07-20 12:24:28,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 588. [2020-07-20 12:24:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-07-20 12:24:28,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 791 transitions. [2020-07-20 12:24:28,570 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 791 transitions. Word has length 66 [2020-07-20 12:24:28,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:24:28,571 INFO L479 AbstractCegarLoop]: Abstraction has 588 states and 791 transitions. [2020-07-20 12:24:28,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:24:28,571 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 791 transitions. [2020-07-20 12:24:28,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-20 12:24:28,577 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:24:28,577 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:24:28,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:28,791 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:24:28,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:24:28,792 INFO L82 PathProgramCache]: Analyzing trace with hash -2101642974, now seen corresponding path program 1 times [2020-07-20 12:24:28,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:24:28,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1457973842] [2020-07-20 12:24:28,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:24:28,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-20 12:24:28,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:24:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:24:28,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:24:28,944 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1457973842] [2020-07-20 12:24:28,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:24:28,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:24:28,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122058587] [2020-07-20 12:24:28,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:24:28,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:24:28,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:24:28,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:24:28,946 INFO L87 Difference]: Start difference. First operand 588 states and 791 transitions. Second operand 3 states. [2020-07-20 12:24:29,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:24:29,029 INFO L93 Difference]: Finished difference Result 1301 states and 1786 transitions. [2020-07-20 12:24:29,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:24:29,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-07-20 12:24:29,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:24:29,037 INFO L225 Difference]: With dead ends: 1301 [2020-07-20 12:24:29,037 INFO L226 Difference]: Without dead ends: 802 [2020-07-20 12:24:29,040 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:24:29,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2020-07-20 12:24:29,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 673. [2020-07-20 12:24:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2020-07-20 12:24:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 907 transitions. [2020-07-20 12:24:29,094 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 907 transitions. Word has length 66 [2020-07-20 12:24:29,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:24:29,095 INFO L479 AbstractCegarLoop]: Abstraction has 673 states and 907 transitions. [2020-07-20 12:24:29,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:24:29,095 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 907 transitions. [2020-07-20 12:24:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-07-20 12:24:29,098 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:24:29,098 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-20 12:24:29,312 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:29,313 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:24:29,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:24:29,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1515944043, now seen corresponding path program 1 times [2020-07-20 12:24:29,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:24:29,316 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [297226812] [2020-07-20 12:24:29,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:24:29,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 12:24:29,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:24:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:24:29,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:24:29,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [297226812] [2020-07-20 12:24:29,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:24:29,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:24:29,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165144225] [2020-07-20 12:24:29,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:24:29,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:24:29,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:24:29,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:24:29,444 INFO L87 Difference]: Start difference. First operand 673 states and 907 transitions. Second operand 3 states. [2020-07-20 12:24:29,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:24:29,513 INFO L93 Difference]: Finished difference Result 1545 states and 2227 transitions. [2020-07-20 12:24:29,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:24:29,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-07-20 12:24:29,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:24:29,521 INFO L225 Difference]: With dead ends: 1545 [2020-07-20 12:24:29,521 INFO L226 Difference]: Without dead ends: 892 [2020-07-20 12:24:29,526 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:24:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2020-07-20 12:24:29,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2020-07-20 12:24:29,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2020-07-20 12:24:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1229 transitions. [2020-07-20 12:24:29,591 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1229 transitions. Word has length 86 [2020-07-20 12:24:29,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:24:29,591 INFO L479 AbstractCegarLoop]: Abstraction has 892 states and 1229 transitions. [2020-07-20 12:24:29,591 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:24:29,592 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1229 transitions. [2020-07-20 12:24:29,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2020-07-20 12:24:29,596 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:24:29,596 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:24:29,811 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:29,812 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:24:29,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:24:29,813 INFO L82 PathProgramCache]: Analyzing trace with hash 982228556, now seen corresponding path program 1 times [2020-07-20 12:24:29,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:24:29,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1400505444] [2020-07-20 12:24:29,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:24:29,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:24:29,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:24:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2020-07-20 12:24:29,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:24:29,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1400505444] [2020-07-20 12:24:29,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:24:29,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:24:29,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327114976] [2020-07-20 12:24:29,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:24:29,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:24:29,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:24:29,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:24:29,995 INFO L87 Difference]: Start difference. First operand 892 states and 1229 transitions. Second operand 3 states. [2020-07-20 12:24:30,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:24:30,045 INFO L93 Difference]: Finished difference Result 1667 states and 2281 transitions. [2020-07-20 12:24:30,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:24:30,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2020-07-20 12:24:30,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:24:30,051 INFO L225 Difference]: With dead ends: 1667 [2020-07-20 12:24:30,051 INFO L226 Difference]: Without dead ends: 794 [2020-07-20 12:24:30,055 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:24:30,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2020-07-20 12:24:30,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2020-07-20 12:24:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-07-20 12:24:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1072 transitions. [2020-07-20 12:24:30,110 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1072 transitions. Word has length 151 [2020-07-20 12:24:30,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:24:30,111 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 1072 transitions. [2020-07-20 12:24:30,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:24:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1072 transitions. [2020-07-20 12:24:30,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-07-20 12:24:30,114 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:24:30,114 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-07-20 12:24:30,328 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:30,329 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:24:30,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:24:30,329 INFO L82 PathProgramCache]: Analyzing trace with hash -491128401, now seen corresponding path program 1 times [2020-07-20 12:24:30,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:24:30,330 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [84363654] [2020-07-20 12:24:30,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:24:30,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 12:24:30,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:24:30,538 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-20 12:24:30,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:24:30,539 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [84363654] [2020-07-20 12:24:30,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:24:30,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:24:30,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491973598] [2020-07-20 12:24:30,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:24:30,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:24:30,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:24:30,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:24:30,540 INFO L87 Difference]: Start difference. First operand 794 states and 1072 transitions. Second operand 3 states. [2020-07-20 12:24:30,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:24:30,627 INFO L93 Difference]: Finished difference Result 1239 states and 1741 transitions. [2020-07-20 12:24:30,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:24:30,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2020-07-20 12:24:30,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:24:30,641 INFO L225 Difference]: With dead ends: 1239 [2020-07-20 12:24:30,641 INFO L226 Difference]: Without dead ends: 808 [2020-07-20 12:24:30,647 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:24:30,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2020-07-20 12:24:30,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 794. [2020-07-20 12:24:30,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-07-20 12:24:30,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1070 transitions. [2020-07-20 12:24:30,723 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1070 transitions. Word has length 118 [2020-07-20 12:24:30,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:24:30,725 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 1070 transitions. [2020-07-20 12:24:30,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:24:30,725 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1070 transitions. [2020-07-20 12:24:30,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-07-20 12:24:30,728 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:24:30,729 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-20 12:24:30,942 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:30,943 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:24:30,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:24:30,943 INFO L82 PathProgramCache]: Analyzing trace with hash -226598129, now seen corresponding path program 1 times [2020-07-20 12:24:30,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:24:30,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [505666652] [2020-07-20 12:24:30,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:24:31,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-20 12:24:31,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:24:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:24:31,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 12:24:31,183 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 12:24:31,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [505666652] [2020-07-20 12:24:31,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 12:24:31,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2020-07-20 12:24:31,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395840129] [2020-07-20 12:24:31,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-20 12:24:31,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:24:31,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-20 12:24:31,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-20 12:24:31,186 INFO L87 Difference]: Start difference. First operand 794 states and 1070 transitions. Second operand 4 states. [2020-07-20 12:24:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:24:31,332 INFO L93 Difference]: Finished difference Result 867 states and 1200 transitions. [2020-07-20 12:24:31,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-20 12:24:31,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2020-07-20 12:24:31,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:24:31,339 INFO L225 Difference]: With dead ends: 867 [2020-07-20 12:24:31,339 INFO L226 Difference]: Without dead ends: 864 [2020-07-20 12:24:31,340 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-20 12:24:31,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2020-07-20 12:24:31,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 795. [2020-07-20 12:24:31,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-07-20 12:24:31,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1070 transitions. [2020-07-20 12:24:31,424 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1070 transitions. Word has length 98 [2020-07-20 12:24:31,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:24:31,425 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 1070 transitions. [2020-07-20 12:24:31,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-20 12:24:31,425 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1070 transitions. [2020-07-20 12:24:31,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-07-20 12:24:31,428 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:24:31,428 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-20 12:24:31,641 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:31,642 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:24:31,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:24:31,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1565088270, now seen corresponding path program 1 times [2020-07-20 12:24:31,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:24:31,644 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1322307147] [2020-07-20 12:24:31,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:24:31,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-20 12:24:31,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:24:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:24:31,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 12:24:31,965 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 12:24:31,965 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1322307147] [2020-07-20 12:24:31,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 12:24:31,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2020-07-20 12:24:31,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458978852] [2020-07-20 12:24:31,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 12:24:31,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:24:31,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 12:24:31,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-07-20 12:24:31,967 INFO L87 Difference]: Start difference. First operand 795 states and 1070 transitions. Second operand 12 states. [2020-07-20 12:24:34,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:24:34,092 INFO L93 Difference]: Finished difference Result 3188 states and 5736 transitions. [2020-07-20 12:24:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-20 12:24:34,092 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2020-07-20 12:24:34,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:24:34,131 INFO L225 Difference]: With dead ends: 3188 [2020-07-20 12:24:34,132 INFO L226 Difference]: Without dead ends: 3185 [2020-07-20 12:24:34,136 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2020-07-20 12:24:34,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states. [2020-07-20 12:24:34,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 3018. [2020-07-20 12:24:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-07-20 12:24:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 5258 transitions. [2020-07-20 12:24:34,525 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 5258 transitions. Word has length 99 [2020-07-20 12:24:34,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:24:34,526 INFO L479 AbstractCegarLoop]: Abstraction has 3018 states and 5258 transitions. [2020-07-20 12:24:34,526 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 12:24:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 5258 transitions. [2020-07-20 12:24:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-20 12:24:34,537 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:24:34,537 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:24:34,750 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:34,751 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:24:34,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:24:34,751 INFO L82 PathProgramCache]: Analyzing trace with hash -94268667, now seen corresponding path program 2 times [2020-07-20 12:24:34,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:24:34,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [575901306] [2020-07-20 12:24:34,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:24:34,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:24:34,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:24:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-20 12:24:34,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:24:34,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [575901306] [2020-07-20 12:24:34,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:24:34,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:24:34,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677039340] [2020-07-20 12:24:34,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:24:34,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:24:34,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:24:34,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:24:34,887 INFO L87 Difference]: Start difference. First operand 3018 states and 5258 transitions. Second operand 3 states. [2020-07-20 12:24:35,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:24:35,020 INFO L93 Difference]: Finished difference Result 4585 states and 8608 transitions. [2020-07-20 12:24:35,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:24:35,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2020-07-20 12:24:35,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:24:35,039 INFO L225 Difference]: With dead ends: 4585 [2020-07-20 12:24:35,039 INFO L226 Difference]: Without dead ends: 2341 [2020-07-20 12:24:35,069 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:24:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2020-07-20 12:24:35,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 2255. [2020-07-20 12:24:35,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2255 states. [2020-07-20 12:24:35,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 3570 transitions. [2020-07-20 12:24:35,315 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 3570 transitions. Word has length 125 [2020-07-20 12:24:35,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:24:35,316 INFO L479 AbstractCegarLoop]: Abstraction has 2255 states and 3570 transitions. [2020-07-20 12:24:35,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:24:35,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 3570 transitions. [2020-07-20 12:24:35,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-07-20 12:24:35,326 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:24:35,326 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:24:35,540 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:35,541 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:24:35,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:24:35,542 INFO L82 PathProgramCache]: Analyzing trace with hash 441821845, now seen corresponding path program 1 times [2020-07-20 12:24:35,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:24:35,542 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1705714972] [2020-07-20 12:24:35,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:24:35,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 12:24:35,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:24:35,697 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2020-07-20 12:24:35,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:24:35,698 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1705714972] [2020-07-20 12:24:35,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:24:35,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:24:35,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479541383] [2020-07-20 12:24:35,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:24:35,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:24:35,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:24:35,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:24:35,700 INFO L87 Difference]: Start difference. First operand 2255 states and 3570 transitions. Second operand 3 states. [2020-07-20 12:24:35,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:24:35,838 INFO L93 Difference]: Finished difference Result 4249 states and 7322 transitions. [2020-07-20 12:24:35,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:24:35,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2020-07-20 12:24:35,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:24:35,856 INFO L225 Difference]: With dead ends: 4249 [2020-07-20 12:24:35,856 INFO L226 Difference]: Without dead ends: 2304 [2020-07-20 12:24:35,876 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:24:35,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2020-07-20 12:24:36,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2255. [2020-07-20 12:24:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2255 states. [2020-07-20 12:24:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 3523 transitions. [2020-07-20 12:24:36,102 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 3523 transitions. Word has length 174 [2020-07-20 12:24:36,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:24:36,102 INFO L479 AbstractCegarLoop]: Abstraction has 2255 states and 3523 transitions. [2020-07-20 12:24:36,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:24:36,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 3523 transitions. [2020-07-20 12:24:36,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-07-20 12:24:36,113 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:24:36,113 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-07-20 12:24:36,326 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:36,327 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:24:36,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:24:36,327 INFO L82 PathProgramCache]: Analyzing trace with hash 989406501, now seen corresponding path program 1 times [2020-07-20 12:24:36,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:24:36,328 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [720900084] [2020-07-20 12:24:36,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:24:36,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 12:24:36,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:24:36,471 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-20 12:24:36,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:24:36,471 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [720900084] [2020-07-20 12:24:36,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:24:36,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 12:24:36,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224642630] [2020-07-20 12:24:36,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 12:24:36,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:24:36,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 12:24:36,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:24:36,476 INFO L87 Difference]: Start difference. First operand 2255 states and 3523 transitions. Second operand 3 states. [2020-07-20 12:24:36,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:24:36,570 INFO L93 Difference]: Finished difference Result 2836 states and 4480 transitions. [2020-07-20 12:24:36,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 12:24:36,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2020-07-20 12:24:36,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:24:36,572 INFO L225 Difference]: With dead ends: 2836 [2020-07-20 12:24:36,572 INFO L226 Difference]: Without dead ends: 0 [2020-07-20 12:24:36,601 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 12:24:36,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-20 12:24:36,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-20 12:24:36,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-20 12:24:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-20 12:24:36,602 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2020-07-20 12:24:36,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:24:36,603 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-20 12:24:36,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 12:24:36,603 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-20 12:24:36,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-20 12:24:36,816 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:24:36,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-20 12:24:39,511 WARN L193 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2020-07-20 12:24:39,920 WARN L193 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2020-07-20 12:24:40,061 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-07-20 12:24:40,447 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2020-07-20 12:24:40,736 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2020-07-20 12:24:41,022 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2020-07-20 12:24:41,340 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2020-07-20 12:24:41,714 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2020-07-20 12:24:43,889 WARN L193 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2020-07-20 12:24:44,233 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2020-07-20 12:24:44,643 WARN L193 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2020-07-20 12:24:46,806 WARN L193 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2020-07-20 12:24:48,459 WARN L193 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 115 DAG size of output: 105 [2020-07-20 12:24:48,836 WARN L193 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 69 [2020-07-20 12:24:49,402 WARN L193 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2020-07-20 12:24:49,906 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2020-07-20 12:24:52,046 WARN L193 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2020-07-20 12:24:52,190 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2020-07-20 12:24:52,481 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2020-07-20 12:24:53,121 WARN L193 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2020-07-20 12:24:53,369 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2020-07-20 12:24:53,679 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2020-07-20 12:24:53,683 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2020-07-20 12:24:53,684 INFO L268 CegarLoopResult]: For program point L218(lines 218 223) no Hoare annotation was computed. [2020-07-20 12:24:53,684 INFO L268 CegarLoopResult]: For program point L214(lines 214 224) no Hoare annotation was computed. [2020-07-20 12:24:53,684 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2020-07-20 12:24:53,684 INFO L271 CegarLoopResult]: At program point L226(lines 213 228) the Hoare annotation is: true [2020-07-20 12:24:53,684 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2020-07-20 12:24:53,684 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2020-07-20 12:24:53,684 INFO L268 CegarLoopResult]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2020-07-20 12:24:53,685 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 192 209) the Hoare annotation is: (or (not (<= ~p_dw_pc~0 0)) (not (= 0 |old(~c_dr_st~0)|)) (not (= 0 ~c_num_read~0)) (not (<= ~c_dr_pc~0 0)) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 ~p_dw_i~0)) (and (= 0 ~p_dw_st~0) (= ~c_dr_st~0 0)) (not (= 1 ~q_free~0)) (not (= 0 ~p_num_write~0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-07-20 12:24:53,685 INFO L268 CegarLoopResult]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2020-07-20 12:24:53,685 INFO L264 CegarLoopResult]: At program point L354-1(line 354) the Hoare annotation is: (or (not (= 0 |old(~c_dr_st~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 1 ~p_dw_i~0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~c_dr_st~0 0) (= 1 ~q_free~0) (= ~p_last_write~0 ~q_buf_0~0)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 12:24:53,686 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 349 360) the Hoare annotation is: (or (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~c_dr_st~0 0) (= ~p_last_write~0 ~q_buf_0~0)) (not (= 0 |old(~c_dr_st~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 12:24:53,686 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2020-07-20 12:24:53,686 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2020-07-20 12:24:53,687 INFO L268 CegarLoopResult]: For program point L355(line 355) no Hoare annotation was computed. [2020-07-20 12:24:53,687 INFO L264 CegarLoopResult]: At program point L354(line 354) the Hoare annotation is: (or (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~c_dr_st~0 0) (= ~p_last_write~0 ~q_buf_0~0)) (not (= 0 |old(~c_dr_st~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 12:24:53,688 INFO L264 CegarLoopResult]: At program point L128(lines 91 133) the Hoare annotation is: (let ((.cse10 (= 0 ~q_free~0)) (.cse17 (= 1 ~p_dw_i~0)) (.cse11 (= 1 ~p_num_write~0)) (.cse16 (= ~c_dr_st~0 0)) (.cse12 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse19 (<= ~c_dr_pc~0 0)) (.cse18 (= 0 ~c_num_read~0))) (let ((.cse0 (not .cse18)) (.cse1 (not .cse19)) (.cse4 (not (= 0 |old(~p_num_write~0)|))) (.cse6 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse7 (not (<= |old(~p_dw_pc~0)| 0))) (.cse8 (and .cse10 .cse17 .cse18 (= ~p_num_write~0 (+ |old(~p_num_write~0)| 1)) .cse11 .cse19 .cse16 .cse12 .cse13)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not (= 1 |old(~q_free~0)|))) (.cse5 (not .cse17)) (.cse14 (not (<= 2 |old(~c_dr_st~0)|))) (.cse9 (<= 2 ~c_dr_st~0))) (and (or (not (= 0 |old(~c_dr_st~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 (and .cse9 .cse10 .cse11 .cse12 .cse13) .cse4 .cse5 .cse6 .cse14 .cse7 .cse8) (let ((.cse15 (= (+ ~c_num_read~0 1) ~p_num_write~0))) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse2 .cse3 (not (<= 1 ~c_dr_pc~0)) .cse5 (and .cse10 .cse15 .cse16 .cse12 .cse13) .cse14 (and .cse9 .cse10 .cse15 .cse12 .cse13)))))) [2020-07-20 12:24:53,688 INFO L264 CegarLoopResult]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse7 (not (= 0 ~c_num_read~0))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse4 (<= 2 ~c_dr_st~0)) (.cse10 (<= ~p_dw_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= 0 ~p_num_write~0)) (.cse5 (= 1 ~q_free~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (not (= 1 |old(~q_free~0)|))) (.cse8 (not (= 0 |old(~p_num_write~0)|))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse9 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse3 (not (<= 2 |old(~c_dr_st~0)|))) (.cse13 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse0 .cse1 (not (<= 1 ~c_dr_pc~0)) .cse2 .cse3 (and .cse4 (= ~c_num_read~0 ~p_num_write~0) .cse5 .cse6)) (or (not (= 0 |old(~c_dr_st~0)|)) .cse7 (not (<= ~c_dr_pc~0 0)) .cse0 .cse1 .cse8 .cse2 .cse9 (and .cse10 .cse11 .cse12 (= ~c_dr_st~0 0) .cse5 .cse6) .cse13) (or .cse7 .cse0 (and .cse4 .cse10 .cse11 .cse12 .cse5 .cse6) .cse1 .cse8 .cse2 .cse9 .cse3 .cse13))) [2020-07-20 12:24:53,688 INFO L264 CegarLoopResult]: At program point L124(line 124) the Hoare annotation is: (let ((.cse0 (not (= 0 ~c_num_read~0))) (.cse3 (not (= 0 |old(~p_num_write~0)|))) (.cse5 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse10 (<= ~p_dw_pc~0 0)) (.cse11 (= 1 ~p_num_write~0)) (.cse7 (not (<= |old(~p_dw_pc~0)| 0))) (.cse8 (<= 2 ~c_dr_st~0)) (.cse9 (= 0 ~q_free~0)) (.cse12 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~q_free~0)|))) (.cse4 (not (= 1 ~p_dw_i~0))) (.cse6 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12)) (or (not (= 0 |old(~c_dr_st~0)|)) .cse0 (not (<= ~c_dr_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse9 .cse10 .cse11 (= ~c_dr_st~0 0) .cse12) .cse7) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (and .cse8 .cse9 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse12) .cse1 .cse2 (not (<= 1 ~c_dr_pc~0)) .cse4 .cse6))) [2020-07-20 12:24:53,688 INFO L268 CegarLoopResult]: For program point L124-1(line 124) no Hoare annotation was computed. [2020-07-20 12:24:53,689 INFO L268 CegarLoopResult]: For program point L108(lines 107 127) no Hoare annotation was computed. [2020-07-20 12:24:53,689 INFO L268 CegarLoopResult]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2020-07-20 12:24:53,689 INFO L264 CegarLoopResult]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse7 (<= 2 ~c_dr_st~0)) (.cse6 (not (<= 2 |old(~c_dr_st~0)|))) (.cse0 (not (= 0 ~c_num_read~0))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~q_free~0)|))) (.cse3 (not (= 0 |old(~p_num_write~0)|))) (.cse4 (not (= 1 ~p_dw_i~0))) (.cse5 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse11 (<= ~p_dw_pc~0 0)) (.cse8 (= 0 ~p_num_write~0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9) .cse10) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse1 .cse2 (not (<= 1 ~c_dr_pc~0)) .cse4 .cse6 (and .cse7 (= ~c_num_read~0 ~p_num_write~0) .cse9)) (or .cse0 .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10) (or (not (= 0 |old(~c_dr_st~0)|)) .cse0 (not (<= ~c_dr_pc~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse11 .cse8 (= ~c_dr_st~0 0) .cse9) .cse10))) [2020-07-20 12:24:53,690 INFO L264 CegarLoopResult]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse16 (= 0 ~q_free~0)) (.cse7 (<= ~p_dw_pc~0 0)) (.cse19 (= 1 ~p_num_write~0)) (.cse10 (= ~c_dr_st~0 0)) (.cse12 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse0 (not (= 0 ~c_num_read~0))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 0 ~p_num_write~0)) (.cse11 (= 1 ~q_free~0)) (.cse3 (not (= 1 |old(~q_free~0)|))) (.cse4 (not (= 0 |old(~p_num_write~0)|))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse6 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse15 (<= 2 ~c_dr_st~0)) (.cse18 (not (<= 2 |old(~c_dr_st~0)|))) (.cse13 (and .cse16 .cse7 .cse19 .cse10 .cse12)) (.cse14 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or (not (= 0 |old(~c_dr_st~0)|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14) (let ((.cse17 (= (+ ~c_num_read~0 1) ~p_num_write~0))) (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (and .cse15 .cse16 .cse17 .cse12) .cse2 .cse3 (not (<= 1 ~c_dr_pc~0)) .cse5 .cse18 (and .cse16 .cse17 .cse10 .cse12) (and .cse15 (= ~c_num_read~0 ~p_num_write~0) .cse11 .cse12))) (or .cse0 .cse7 .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse14) (or .cse0 .cse1 .cse2 (and .cse15 .cse8 .cse9 .cse11 .cse12) .cse3 .cse4 .cse5 .cse6 (and .cse15 .cse16 .cse19 .cse12) .cse18 .cse13 .cse14)))) [2020-07-20 12:24:53,690 INFO L268 CegarLoopResult]: For program point L99(lines 99 103) no Hoare annotation was computed. [2020-07-20 12:24:53,690 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2020-07-20 12:24:53,690 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-20 12:24:53,690 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2020-07-20 12:24:53,690 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2020-07-20 12:24:53,691 INFO L264 CegarLoopResult]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse0 (not (<= ~p_dw_pc~0 0))) (.cse2 (not (= 0 ~c_num_read~0))) (.cse3 (not (<= ~c_dr_pc~0 0))) (.cse10 (not (<= 2 |old(~p_dw_st~0)|))) (.cse11 (not (= 1 ~q_free~0))) (.cse7 (not (= 1 ~p_num_write~0))) (.cse12 (<= 2 ~p_dw_st~0)) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse1 (<= 2 ~c_dr_st~0)) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (<= 1 ~c_dr_pc~0))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse6 (not (<= 2 |old(~c_dr_st~0)|))) (.cse8 (not (= 0 ~q_free~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 (not (= 0 |old(~c_dr_st~0)|)) .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (= ~c_dr_st~0 0)) (or .cse4 .cse9 .cse10 .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse11 .cse12 .cse13) (or .cse4 .cse10 .cse5 .cse11 .cse7 .cse12 (not (= 1 ~c_num_read~0)) .cse13) (or .cse1 .cse4 .cse9 .cse5 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse6 .cse8))) [2020-07-20 12:24:53,691 INFO L268 CegarLoopResult]: For program point L82(lines 82 86) no Hoare annotation was computed. [2020-07-20 12:24:53,691 INFO L268 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-07-20 12:24:53,691 INFO L268 CegarLoopResult]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2020-07-20 12:24:53,691 INFO L268 CegarLoopResult]: For program point L74(lines 74 78) no Hoare annotation was computed. [2020-07-20 12:24:53,691 INFO L268 CegarLoopResult]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2020-07-20 12:24:53,693 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (let ((.cse0 (not (<= ~p_dw_pc~0 0))) (.cse2 (not (= 0 ~c_num_read~0))) (.cse3 (not (<= ~c_dr_pc~0 0))) (.cse10 (not (<= 2 |old(~p_dw_st~0)|))) (.cse11 (not (= 1 ~q_free~0))) (.cse7 (not (= 1 ~p_num_write~0))) (.cse12 (<= 2 ~p_dw_st~0)) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse1 (<= 2 ~c_dr_st~0)) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (<= 1 ~c_dr_pc~0))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse6 (not (<= 2 |old(~c_dr_st~0)|))) (.cse8 (not (= 0 ~q_free~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 (not (= 0 |old(~c_dr_st~0)|)) .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (= ~c_dr_st~0 0)) (or .cse4 .cse9 .cse10 .cse5 (not (= ~c_num_read~0 ~p_num_write~0)) .cse11 .cse12 .cse13) (or .cse4 .cse10 .cse5 .cse11 .cse7 .cse12 (not (= 1 ~c_num_read~0)) .cse13) (or .cse1 .cse4 .cse9 .cse5 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse6 .cse8))) [2020-07-20 12:24:53,694 INFO L264 CegarLoopResult]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (= 0 ~p_dw_st~0)) (.cse4 (not (= 1 ~q_free~0))) (.cse6 (<= 2 ~p_dw_st~0)) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse8 (not (<= ~p_dw_pc~0 0))) (.cse10 (not (= 0 ~c_num_read~0))) (.cse11 (not (<= ~c_dr_pc~0 0))) (.cse5 (not (= 1 ~p_num_write~0))) (.cse9 (<= 2 ~c_dr_st~0)) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse14 (not (<= 1 ~c_dr_pc~0))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse12 (not (<= 2 |old(~c_dr_st~0)|))) (.cse13 (not (= 0 ~q_free~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 1 ~c_num_read~0)) .cse7) (or .cse8 .cse9 .cse10 .cse11 .cse0 .cse2 .cse12 .cse5 .cse13) (or .cse0 .cse14 .cse1 .cse2 (not (= ~c_num_read~0 ~p_num_write~0)) .cse3 .cse4 .cse6 .cse7) (or .cse8 (not (= 0 |old(~c_dr_st~0)|)) .cse10 .cse11 .cse0 .cse2 .cse5 .cse13 (= ~c_dr_st~0 0)) (or .cse9 .cse0 .cse14 .cse2 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse12 .cse13))) [2020-07-20 12:24:53,694 INFO L268 CegarLoopResult]: For program point L72-1(line 72) no Hoare annotation was computed. [2020-07-20 12:24:53,694 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-20 12:24:53,694 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (or (not (= ~c_num_read~0 |old(~p_num_write~0)|)) (= ~c_num_read~0 ~p_num_write~0)) [2020-07-20 12:24:53,694 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-20 12:24:53,695 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse8 (not (= ~c_num_read~0 |old(~p_num_write~0)|))) (.cse11 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse17 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse26 (not (= 1 |old(~c_num_read~0)|))) (.cse9 (<= 2 ~c_dr_st~0)) (.cse33 (= ~c_num_read~0 ~p_num_write~0)) (.cse12 (<= 1 ~c_dr_pc~0)) (.cse15 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse31 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse18 (not (= 0 |old(~p_dw_st~0)|))) (.cse19 (not (= 1 |old(~q_free~0)|))) (.cse20 (not (= 0 |old(~p_num_write~0)|))) (.cse21 (<= ~p_dw_pc~0 0)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse32 (= 0 ~p_dw_st~0)) (.cse23 (= 0 ~p_num_write~0)) (.cse34 (= 1 ~q_free~0)) (.cse24 (not (<= |old(~p_dw_pc~0)| 0))) (.cse25 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse0 (not (= 0 |old(~c_dr_st~0)|))) (.cse10 (= 0 ~q_free~0)) (.cse27 (= 0 ~c_num_read~0)) (.cse28 (<= ~c_dr_pc~0 0)) (.cse30 (= ~c_dr_st~0 0)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse29 (not (<= |old(~c_dr_pc~0)| 0))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= 1 |old(~p_num_write~0)|))) (.cse3 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (not (= 0 |old(~q_free~0)|))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse16 (not (<= 2 |old(~c_dr_st~0)|))) (.cse7 (= 1 ~p_num_write~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse1 .cse3 .cse4 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse5 .cse15 .cse16 .cse17) (or .cse1 .cse18 .cse19 .cse20 .cse5 .cse6 .cse16 (and .cse21 .cse22 .cse23) .cse24 .cse25) (or .cse1 .cse2 .cse18 .cse19 .cse5 .cse15 .cse26 .cse16 .cse7) (or .cse1 .cse2 .cse3 .cse4 (and .cse9 .cse10 .cse27 .cse28 .cse13 .cse14) .cse5 .cse6 .cse29 .cse16) (or .cse0 .cse1 (and .cse8 .cse10 .cse11 .cse12 .cse30 .cse13 .cse14) .cse3 .cse4 .cse5 .cse15 .cse17) (or .cse1 .cse18 .cse19 .cse5 .cse15 .cse31 .cse16 (and .cse9 .cse32 .cse33 .cse12 .cse34 .cse13)) (or .cse1 .cse18 .cse19 .cse20 .cse5 .cse6 .cse29 .cse16 .cse24 (and .cse9 .cse27 .cse32 .cse28 .cse34 .cse13) .cse25) (or .cse1 .cse2 .cse19 .cse3 .cse5 .cse15 .cse26 .cse16 .cse7) (or (and .cse9 .cse33 .cse12 .cse34 .cse13 .cse14) .cse1 .cse19 .cse3 .cse5 .cse15 .cse31 .cse16) (or .cse0 .cse1 .cse18 .cse19 .cse20 .cse5 .cse6 .cse29 (and .cse21 .cse27 .cse22 .cse32 .cse28 .cse23 .cse30 .cse34 .cse13) .cse24 .cse25) (or .cse0 .cse1 (and .cse10 .cse27 .cse28 .cse30 .cse13 .cse14) .cse2 .cse3 .cse4 .cse5 .cse6 .cse29) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7))) [2020-07-20 12:24:53,695 INFO L264 CegarLoopResult]: At program point L254(line 254) the Hoare annotation is: (let ((.cse23 (<= 2 ~c_dr_st~0)) (.cse24 (= 1 ~p_dw_i~0)) (.cse19 (= 1 ~q_free~0)) (.cse20 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse13 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse8 (not (= 0 |old(~p_dw_st~0)|))) (.cse15 (<= ~p_dw_pc~0 0)) (.cse16 (= 0 ~c_num_read~0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= 0 ~p_num_write~0)) (.cse14 (not (= 0 |old(~p_num_write~0)|))) (.cse21 (not (<= |old(~p_dw_pc~0)| 0))) (.cse22 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse7 (and .cse23 .cse24 (= ~c_num_read~0 ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse19 .cse20)) (.cse12 (not (= 0 |old(~c_dr_st~0)|))) (.cse1 (not (= 1 |old(~p_num_write~0)|))) (.cse3 (not (= 0 |old(~q_free~0)|))) (.cse5 (not (= 0 |old(~c_num_read~0)|))) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse9 (not (= 1 |old(~q_free~0)|))) (.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (not .cse24)) (.cse10 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse11 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse6 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse8 .cse9 .cse4 .cse10 .cse11 .cse6) (or .cse7 .cse12 .cse0 .cse2 .cse3 .cse4 .cse10 .cse13) (or .cse0 .cse2 .cse3 .cse4 .cse10 .cse6 .cse13) (or .cse7 .cse12 .cse0 .cse8 .cse9 .cse14 .cse4 .cse5 (not (<= |old(~c_dr_pc~0)| 0)) (and .cse15 .cse16 .cse17 (<= ~c_dr_pc~0 0) .cse18 (= ~c_dr_st~0 0) .cse19 .cse20) .cse21 .cse22) (or .cse7 .cse0 .cse8 .cse9 (and .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse14 .cse4 .cse5 .cse6 .cse21 .cse22) (or .cse7 .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse9 .cse2 .cse4 .cse10 .cse11 .cse6)))) [2020-07-20 12:24:53,695 INFO L268 CegarLoopResult]: For program point L242(lines 242 246) no Hoare annotation was computed. [2020-07-20 12:24:53,695 INFO L268 CegarLoopResult]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2020-07-20 12:24:53,696 INFO L268 CegarLoopResult]: For program point L240(line 240) no Hoare annotation was computed. [2020-07-20 12:24:53,696 INFO L264 CegarLoopResult]: At program point L238(line 238) the Hoare annotation is: (let ((.cse32 (= 0 ~p_dw_st~0)) (.cse13 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse11 (<= 2 ~c_dr_st~0)) (.cse38 (= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= 1 ~c_dr_pc~0)) (.cse34 (= 1 ~q_free~0)) (.cse12 (= 0 ~q_free~0)) (.cse37 (= 1 ~p_dw_i~0)) (.cse19 (= 0 ~c_num_read~0)) (.cse20 (= 1 ~p_num_write~0)) (.cse23 (<= ~c_dr_pc~0 0)) (.cse21 (= ~c_dr_st~0 0)) (.cse15 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (<= 2 ~p_dw_st~0))) (let ((.cse10 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse0 (not (= 0 |old(~c_dr_st~0)|))) (.cse24 (not (<= |old(~c_dr_pc~0)| 0))) (.cse18 (not (= 1 |old(~p_num_write~0)|))) (.cse5 (not (<= 2 |old(~p_dw_st~0)|))) (.cse6 (not (= 0 |old(~q_free~0)|))) (.cse28 (not (= 0 |old(~p_num_write~0)|))) (.cse29 (not (<= |old(~p_dw_pc~0)| 0))) (.cse22 (not (= 0 |old(~c_num_read~0)|))) (.cse30 (<= ~p_dw_pc~0 0)) (.cse31 (= ~c_last_read~0 ~p_last_write~0)) (.cse33 (= 0 ~p_num_write~0)) (.cse35 (and .cse12 .cse37 .cse19 (= ~p_num_write~0 (+ |old(~p_num_write~0)| 1)) .cse20 .cse23 .cse21 .cse15 .cse16)) (.cse36 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse1 (and .cse11 .cse37 .cse38 .cse14 .cse34 .cse15 .cse16)) (.cse2 (and .cse12 .cse13 .cse37 .cse14 .cse21 .cse15 .cse16)) (.cse3 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse27 (not (= 0 |old(~p_dw_st~0)|))) (.cse25 (not (= 1 |old(~q_free~0)|))) (.cse4 (and .cse11 .cse37 .cse32 .cse38 .cse14 .cse34 .cse15)) (.cse9 (and .cse11 .cse12 .cse13 .cse37 .cse14 .cse15 .cse16)) (.cse7 (not .cse37)) (.cse8 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse26 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse17 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse3 .cse5 .cse6 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) .cse7 .cse8 .cse17 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse18 (and .cse12 .cse19 .cse20 .cse21 .cse15 .cse16) .cse6 .cse4 .cse5 .cse7 .cse9 .cse22) (or .cse3 .cse18 .cse5 .cse6 (and .cse11 .cse12 .cse19 .cse23 .cse15 .cse16) .cse7 .cse22 .cse24 .cse17) (or .cse1 .cse3 .cse25 .cse5 .cse7 .cse8 .cse26 .cse17) (or .cse0 .cse2 .cse1 .cse3 .cse27 .cse28 .cse29 .cse25 .cse4 .cse7 .cse9 .cse22 .cse24 (and .cse30 .cse19 .cse31 .cse32 .cse23 .cse33 .cse21 .cse34 .cse15) .cse35 .cse36) (or .cse3 .cse18 .cse25 .cse5 .cse7 .cse8 (not (= 1 |old(~c_num_read~0)|)) .cse17 .cse20) (or .cse3 .cse18 .cse5 .cse6 .cse7 .cse22 .cse17 .cse20) (or .cse1 .cse2 .cse3 .cse27 .cse28 .cse29 .cse25 .cse4 .cse7 .cse9 .cse22 (and .cse11 .cse12 .cse19 .cse20 .cse15 .cse16) .cse17 (and .cse11 .cse30 .cse19 .cse31 .cse32 .cse33 .cse34 .cse15) .cse35 .cse36) (or .cse1 .cse2 .cse3 .cse27 .cse25 .cse4 .cse9 .cse7 .cse8 .cse26 .cse17)))) [2020-07-20 12:24:53,697 INFO L264 CegarLoopResult]: At program point L269(line 269) the Hoare annotation is: (let ((.cse14 (= 0 ~q_free~0)) (.cse24 (= 1 ~p_dw_i~0)) (.cse15 (= 0 ~c_num_read~0)) (.cse16 (= 1 ~p_num_write~0)) (.cse23 (<= ~c_dr_pc~0 0)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (<= 2 ~p_dw_st~0))) (let ((.cse8 (not (= 1 |old(~p_num_write~0)|))) (.cse2 (not (= 0 |old(~p_dw_st~0)|))) (.cse19 (not (= 0 |old(~p_num_write~0)|))) (.cse21 (not (<= |old(~p_dw_pc~0)| 0))) (.cse11 (not (= 0 |old(~c_num_read~0)|))) (.cse20 (and .cse14 .cse24 .cse15 (= ~p_num_write~0 (+ |old(~p_num_write~0)| 1)) .cse16 .cse23 .cse17 .cse18)) (.cse22 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse0 (and .cse14 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse24 (<= 1 ~c_dr_pc~0) .cse17 .cse18)) (.cse13 (not (= 0 |old(~c_dr_st~0)|))) (.cse10 (not (= 0 |old(~q_free~0)|))) (.cse12 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse3 (not (= 1 |old(~q_free~0)|))) (.cse9 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (not .cse24)) (.cse5 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse6 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse7 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse1 .cse8 .cse9 .cse10 .cse4 .cse11 .cse7) (or .cse1 .cse9 .cse10 .cse4 .cse5 .cse7 .cse12) (or .cse0 .cse13 .cse1 .cse8 .cse9 .cse10 .cse4 .cse11 (and .cse14 .cse15 .cse16 .cse17 .cse18)) (or .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse11 .cse20 .cse7 .cse21 .cse22) (or .cse0 .cse13 .cse1 .cse2 .cse19 .cse21 (and (<= ~p_dw_pc~0 0) .cse15 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) .cse23 (= 0 ~p_num_write~0) (= 1 ~q_free~0) .cse17) .cse3 .cse4 .cse11 (not (<= |old(~c_dr_pc~0)| 0)) .cse20 .cse22) (or .cse0 .cse13 .cse1 .cse9 .cse10 .cse4 .cse5 .cse12) (or .cse1 .cse3 .cse9 .cse4 .cse5 .cse6 .cse7)))) [2020-07-20 12:24:53,697 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2020-07-20 12:24:53,697 INFO L268 CegarLoopResult]: For program point L251(lines 251 258) no Hoare annotation was computed. [2020-07-20 12:24:53,697 INFO L268 CegarLoopResult]: For program point L247(lines 237 277) no Hoare annotation was computed. [2020-07-20 12:24:53,698 INFO L264 CegarLoopResult]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse25 (= 0 ~p_dw_st~0)) (.cse30 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse16 (<= 2 ~c_dr_st~0)) (.cse38 (= ~c_num_read~0 ~p_num_write~0)) (.cse31 (<= 1 ~c_dr_pc~0)) (.cse27 (= 1 ~q_free~0)) (.cse17 (= 0 ~q_free~0)) (.cse37 (= 1 ~p_dw_i~0)) (.cse18 (= 0 ~c_num_read~0)) (.cse19 (= 1 ~p_num_write~0)) (.cse33 (<= ~c_dr_pc~0 0)) (.cse36 (= ~c_dr_st~0 0)) (.cse20 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (<= 2 ~p_dw_st~0))) (let ((.cse10 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|))) (.cse12 (not (= 0 |old(~p_num_write~0)|))) (.cse13 (not (<= |old(~p_dw_pc~0)| 0))) (.cse34 (not (<= |old(~c_dr_pc~0)| 0))) (.cse23 (<= ~p_dw_pc~0 0)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse26 (= 0 ~p_num_write~0)) (.cse28 (and .cse17 .cse37 .cse18 (= ~p_num_write~0 (+ |old(~p_num_write~0)| 1)) .cse19 .cse33 .cse36 .cse20 .cse21)) (.cse29 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse0 (not (= 0 |old(~c_dr_st~0)|))) (.cse32 (not (= 1 |old(~p_num_write~0)|))) (.cse5 (not (<= 2 |old(~p_dw_st~0)|))) (.cse6 (not (= 0 |old(~q_free~0)|))) (.cse15 (not (= 0 |old(~c_num_read~0)|))) (.cse1 (and .cse16 .cse37 .cse38 .cse31 .cse27 .cse20 .cse21)) (.cse2 (and .cse17 .cse30 .cse37 .cse31 .cse36 .cse20 .cse21)) (.cse3 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse11 (not (= 0 |old(~p_dw_st~0)|))) (.cse14 (not (= 1 |old(~q_free~0)|))) (.cse4 (and .cse16 .cse37 .cse25 .cse38 .cse31 .cse27 .cse20)) (.cse9 (and .cse16 .cse17 .cse30 .cse37 .cse31 .cse20 .cse21)) (.cse7 (not .cse37)) (.cse8 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse35 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse22 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse2 .cse1 .cse3 .cse11 .cse12 .cse13 .cse14 .cse4 .cse7 .cse9 .cse15 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 (and .cse16 .cse23 .cse18 .cse24 .cse25 .cse26 .cse27 .cse20) .cse28 .cse29) (or .cse3 .cse5 .cse6 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse16 .cse17 .cse30 .cse31 .cse20 .cse21) .cse7 .cse8 .cse22 .cse10) (or .cse3 .cse32 .cse5 .cse6 (and .cse16 .cse17 .cse18 .cse33 .cse20 .cse21) .cse7 .cse15 .cse34 .cse22) (or .cse1 .cse3 .cse14 .cse5 .cse7 .cse8 .cse35 .cse22) (or .cse0 .cse2 .cse1 .cse3 .cse11 .cse12 .cse13 .cse14 .cse4 .cse7 .cse9 .cse15 .cse34 (and .cse23 .cse18 .cse24 .cse25 .cse33 .cse26 .cse36 .cse27 .cse20) .cse28 .cse29) (or .cse3 .cse32 .cse14 .cse5 .cse7 .cse8 (not (= 1 |old(~c_num_read~0)|)) .cse22 .cse19) (or .cse0 .cse2 .cse1 .cse3 .cse32 (and .cse17 .cse18 .cse19 .cse36 .cse20 .cse21) .cse6 .cse4 .cse5 .cse7 .cse9 .cse15) (or .cse3 .cse32 .cse5 .cse6 .cse7 .cse15 .cse22 .cse19) (or .cse1 .cse2 .cse3 .cse11 .cse14 .cse4 .cse9 .cse7 .cse8 .cse35 .cse22)))) [2020-07-20 12:24:53,698 INFO L268 CegarLoopResult]: For program point L266(lines 266 273) no Hoare annotation was computed. [2020-07-20 12:24:53,698 INFO L264 CegarLoopResult]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse32 (= 0 ~p_dw_st~0)) (.cse13 (<= 2 ~c_dr_st~0)) (.cse38 (= ~c_num_read~0 ~p_num_write~0)) (.cse34 (= 1 ~q_free~0)) (.cse15 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse16 (<= 1 ~c_dr_pc~0)) (.cse14 (= 0 ~q_free~0)) (.cse37 (= 1 ~p_dw_i~0)) (.cse22 (= 0 ~c_num_read~0)) (.cse23 (= 1 ~p_num_write~0)) (.cse26 (<= ~c_dr_pc~0 0)) (.cse24 (= ~c_dr_st~0 0)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (<= 2 ~p_dw_st~0))) (let ((.cse9 (not (= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse27 (not (<= |old(~c_dr_pc~0)| 0))) (.cse21 (not (= 1 |old(~p_num_write~0)|))) (.cse3 (not (= 0 |old(~p_dw_st~0)|))) (.cse28 (not (= 0 |old(~p_num_write~0)|))) (.cse29 (not (<= |old(~p_dw_pc~0)| 0))) (.cse4 (not (= 1 |old(~q_free~0)|))) (.cse25 (not (= 0 |old(~c_num_read~0)|))) (.cse10 (not (<= 2 |old(~c_dr_st~0)|))) (.cse30 (<= ~p_dw_pc~0 0)) (.cse31 (= ~c_last_read~0 ~p_last_write~0)) (.cse33 (= 0 ~p_num_write~0)) (.cse35 (and .cse14 .cse37 .cse22 (= ~p_num_write~0 (+ |old(~p_num_write~0)| 1)) .cse23 .cse26 .cse24 .cse17 .cse18)) (.cse36 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse20 (not (= 0 |old(~c_dr_st~0)|))) (.cse0 (and .cse14 .cse15 .cse37 .cse16 .cse24 .cse17 .cse18)) (.cse1 (and .cse13 .cse37 .cse38 .cse16 .cse34 .cse17 .cse18)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse5 (and .cse13 .cse37 .cse32 .cse38 .cse16 .cse34 .cse17)) (.cse11 (not (<= 2 |old(~p_dw_st~0)|))) (.cse12 (not (= 0 |old(~q_free~0)|))) (.cse7 (not .cse37)) (.cse8 (not (<= 1 |old(~c_dr_pc~0)|))) (.cse6 (and .cse13 .cse14 .cse15 .cse37 .cse16 .cse17 .cse18)) (.cse19 (not (= (+ |old(~c_num_read~0)| 1) |old(~p_num_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse2 .cse11 .cse12 (and (not (= ~c_num_read~0 |old(~p_num_write~0)|)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse7 .cse8 .cse10 .cse19) (or .cse20 .cse1 .cse0 .cse2 .cse21 (and .cse14 .cse22 .cse23 .cse24 .cse17 .cse18) .cse12 .cse5 .cse11 .cse7 .cse6 .cse25) (or .cse2 .cse21 .cse11 .cse12 (and .cse13 .cse14 .cse22 .cse26 .cse17 .cse18) .cse7 .cse25 .cse27 .cse10) (or .cse1 .cse2 .cse4 .cse11 .cse7 .cse8 .cse9 .cse10) (or .cse20 .cse0 .cse1 .cse2 .cse3 .cse28 .cse29 .cse4 .cse5 .cse7 .cse6 .cse25 .cse27 (and .cse30 .cse22 .cse31 .cse32 .cse26 .cse33 .cse24 .cse34 .cse17) .cse35 .cse36) (or .cse2 .cse21 .cse4 .cse11 .cse7 .cse8 (not (= 1 |old(~c_num_read~0)|)) .cse10 .cse23) (or .cse2 .cse21 .cse11 .cse12 .cse7 .cse25 .cse10 .cse23) (or .cse1 .cse0 .cse2 .cse3 .cse28 .cse29 .cse4 .cse5 .cse7 .cse6 .cse25 (and .cse13 .cse14 .cse22 .cse23 .cse17 .cse18) .cse10 (and .cse13 .cse30 .cse22 .cse31 .cse32 .cse33 .cse34 .cse17) .cse35 .cse36) (or .cse20 .cse0 .cse1 .cse2 .cse5 .cse11 .cse12 .cse7 .cse8 .cse6 .cse19)))) [2020-07-20 12:24:53,698 INFO L268 CegarLoopResult]: For program point L290-1(line 290) no Hoare annotation was computed. [2020-07-20 12:24:53,699 INFO L271 CegarLoopResult]: At program point L299(lines 288 301) the Hoare annotation is: true [2020-07-20 12:24:53,699 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2020-07-20 12:24:53,699 INFO L268 CegarLoopResult]: For program point L292(lines 292 297) no Hoare annotation was computed. [2020-07-20 12:24:53,700 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2020-07-20 12:24:53,700 INFO L271 CegarLoopResult]: At program point L290(line 290) the Hoare annotation is: true [2020-07-20 12:24:53,700 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2020-07-20 12:24:53,700 INFO L271 CegarLoopResult]: At program point L62(lines 50 64) the Hoare annotation is: true [2020-07-20 12:24:53,700 INFO L271 CegarLoopResult]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2020-07-20 12:24:53,700 INFO L268 CegarLoopResult]: For program point L52(lines 52 57) no Hoare annotation was computed. [2020-07-20 12:24:53,701 INFO L268 CegarLoopResult]: For program point L51(lines 51 60) no Hoare annotation was computed. [2020-07-20 12:24:53,701 INFO L268 CegarLoopResult]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2020-07-20 12:24:53,701 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2020-07-20 12:24:53,701 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2020-07-20 12:24:53,703 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 303 331) the Hoare annotation is: (or (not (= 0 |old(~c_dr_st~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~c_dr_st~0 0) (= 1 ~q_free~0) (= ~p_last_write~0 ~q_buf_0~0)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 12:24:53,703 INFO L268 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2020-07-20 12:24:53,703 INFO L268 CegarLoopResult]: For program point L318(line 318) no Hoare annotation was computed. [2020-07-20 12:24:53,703 INFO L264 CegarLoopResult]: At program point L317(line 317) the Hoare annotation is: (let ((.cse10 (= ~c_num_read~0 ~p_num_write~0)) (.cse7 (= 1 ~p_num_write~0)) (.cse0 (= 0 ~q_free~0)) (.cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse3 (<= 1 ~c_dr_pc~0)) (.cse5 (<= 2 ~p_dw_st~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse1 (<= 2 ~c_dr_st~0)) (.cse12 (<= ~p_dw_pc~0 0)) (.cse6 (= 0 ~c_num_read~0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 0 ~p_dw_st~0)) (.cse14 (= 0 ~p_num_write~0)) (.cse11 (= 1 ~q_free~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= 0 |old(~c_dr_st~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= 0 |old(~p_dw_st~0)|)) (and .cse0 .cse6 .cse7 .cse8 .cse4 .cse5) (not (= 0 |old(~p_num_write~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4) (and .cse1 .cse10 .cse3 .cse11 .cse4 .cse5) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (and .cse1 .cse0 .cse6 .cse7 .cse4 .cse5) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5) (and .cse12 .cse6 .cse13 .cse9 (<= ~c_dr_pc~0 0) .cse14 .cse8 .cse11 .cse4) (and .cse1 .cse12 .cse6 .cse13 .cse9 .cse14 .cse11 .cse4) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-20 12:24:53,704 INFO L264 CegarLoopResult]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse10 (= ~c_num_read~0 ~p_num_write~0)) (.cse7 (= 1 ~p_num_write~0)) (.cse0 (= 0 ~q_free~0)) (.cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse3 (<= 1 ~c_dr_pc~0)) (.cse5 (<= 2 ~p_dw_st~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse1 (<= 2 ~c_dr_st~0)) (.cse12 (<= ~p_dw_pc~0 0)) (.cse6 (= 0 ~c_num_read~0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 0 ~p_dw_st~0)) (.cse14 (= 0 ~p_num_write~0)) (.cse11 (= 1 ~q_free~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= 0 |old(~c_dr_st~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= 0 |old(~p_dw_st~0)|)) (and .cse0 .cse6 .cse7 .cse8 .cse4 .cse5) (not (= 0 |old(~p_num_write~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4) (and .cse1 .cse10 .cse3 .cse11 .cse4 .cse5) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (and .cse1 .cse0 .cse6 .cse7 .cse4 .cse5) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5) (and .cse12 .cse6 .cse13 .cse9 (<= ~c_dr_pc~0 0) .cse14 .cse8 .cse11 .cse4) (and .cse1 .cse12 .cse6 .cse13 .cse9 .cse14 .cse11 .cse4) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-20 12:24:53,704 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2020-07-20 12:24:53,704 INFO L268 CegarLoopResult]: For program point L314(line 314) no Hoare annotation was computed. [2020-07-20 12:24:53,704 INFO L264 CegarLoopResult]: At program point L313-1(lines 310 325) the Hoare annotation is: (let ((.cse10 (= ~c_num_read~0 ~p_num_write~0)) (.cse7 (= 1 ~p_num_write~0)) (.cse0 (= 0 ~q_free~0)) (.cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse3 (<= 1 ~c_dr_pc~0)) (.cse5 (<= 2 ~p_dw_st~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse1 (<= 2 ~c_dr_st~0)) (.cse12 (<= ~p_dw_pc~0 0)) (.cse6 (= 0 ~c_num_read~0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 0 ~p_dw_st~0)) (.cse14 (= 0 ~p_num_write~0)) (.cse11 (= 1 ~q_free~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0))) (or (not (= 0 |old(~c_dr_st~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= 0 |old(~p_dw_st~0)|)) (and .cse0 .cse6 .cse7 .cse8 .cse4 .cse5) (not (= 0 |old(~p_num_write~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4) (and .cse1 .cse10 .cse3 .cse11 .cse4 .cse5) (not (= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (and .cse1 .cse0 .cse6 .cse7 .cse4 .cse5) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5) (and .cse12 .cse6 .cse13 .cse9 (<= ~c_dr_pc~0 0) .cse14 .cse8 .cse11 .cse4) (and .cse1 .cse12 .cse6 .cse13 .cse9 .cse14 .cse11 .cse4) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) [2020-07-20 12:24:53,704 INFO L264 CegarLoopResult]: At program point L310(line 310) the Hoare annotation is: (or (not (= 0 |old(~c_dr_st~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 1 ~p_dw_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~c_dr_st~0 0) (= 1 ~q_free~0) (= ~p_last_write~0 ~q_buf_0~0)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2020-07-20 12:24:53,704 INFO L271 CegarLoopResult]: At program point L326(lines 303 331) the Hoare annotation is: true [2020-07-20 12:24:53,704 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-20 12:24:53,705 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0) (= ~c_dr_st~0 0) (= ~p_last_write~0 ~q_buf_0~0)) [2020-07-20 12:24:53,705 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-20 12:24:53,705 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-20 12:24:53,705 INFO L268 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2020-07-20 12:24:53,705 INFO L268 CegarLoopResult]: For program point L32(lines 32 41) no Hoare annotation was computed. [2020-07-20 12:24:53,705 INFO L268 CegarLoopResult]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2020-07-20 12:24:53,705 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2020-07-20 12:24:53,705 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2020-07-20 12:24:53,706 INFO L271 CegarLoopResult]: At program point L43(lines 31 45) the Hoare annotation is: true [2020-07-20 12:24:53,706 INFO L271 CegarLoopResult]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2020-07-20 12:24:53,706 INFO L268 CegarLoopResult]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2020-07-20 12:24:53,706 INFO L264 CegarLoopResult]: At program point L186(lines 135 191) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (<= 2 |old(~p_dw_st~0)|))) (.cse9 (not (= 0 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (= 0 |old(~c_num_read~0)|))) (.cse11 (<= 2 ~p_dw_st~0)) (.cse3 (<= 2 ~c_dr_st~0)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= 0 ~p_dw_st~0)) (.cse6 (<= 1 ~c_dr_pc~0)) (.cse7 (= 1 ~q_free~0))) (and (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse1 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse2 (not (<= |old(~c_dr_pc~0)| 0)) (and .cse3 (= 0 ~c_num_read~0) .cse4 .cse5 .cse6 .cse7) (not (= 0 ~p_num_write~0))) (let ((.cse10 (= ~c_num_read~0 ~p_num_write~0))) (or .cse0 .cse8 .cse9 .cse1 (not (<= 1 |old(~c_dr_pc~0)|)) (and .cse3 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse3 .cse10 .cse6 .cse7 .cse11) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))))) (let ((.cse12 (= 1 ~c_num_read~0))) (or .cse0 .cse8 .cse9 .cse1 .cse2 (and .cse12 .cse3 .cse6 .cse7 .cse11) (not (= 1 ~p_num_write~0)) (and .cse12 .cse3 .cse4 .cse5 .cse6 .cse7))))) [2020-07-20 12:24:53,706 INFO L268 CegarLoopResult]: For program point L151(lines 150 185) no Hoare annotation was computed. [2020-07-20 12:24:53,706 INFO L264 CegarLoopResult]: At program point L182(line 182) the Hoare annotation is: (let ((.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0))) (or .cse0 .cse1 .cse2 .cse3 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse4 (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 ~p_num_write~0))))) [2020-07-20 12:24:53,707 INFO L264 CegarLoopResult]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse13 (= 1 ~p_dw_i~0))) (let ((.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse1 (= 0 ~c_num_read~0)) (.cse7 (not (<= |old(~c_dr_pc~0)| 0))) (.cse12 (= 0 ~q_free~0)) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (<= 2 |old(~p_dw_st~0)|))) (.cse11 (not (= 0 |old(~q_free~0)|))) (.cse5 (not .cse13)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse4 (= 1 ~q_free~0))) (and (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) (and .cse1 .cse2 .cse3 .cse4) .cse5 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse6 .cse7 (not (= 0 ~p_num_write~0))) (let ((.cse8 (= 1 ~c_num_read~0))) (or (and .cse8 .cse2 .cse4 .cse9) .cse0 .cse10 .cse11 .cse5 .cse6 (and .cse12 .cse1 (<= ~c_dr_pc~0 0) .cse9) (and .cse8 .cse13 .cse2 .cse3 .cse4) .cse7 (not (= 1 ~p_num_write~0)))) (let ((.cse14 (= ~c_num_read~0 ~p_num_write~0))) (or (and .cse12 (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse9) .cse0 .cse10 .cse11 .cse5 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1))) (and .cse2 .cse14 .cse4 .cse9) (and .cse13 .cse2 .cse3 .cse14 .cse4)))))) [2020-07-20 12:24:53,707 INFO L264 CegarLoopResult]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (= 0 |old(~c_num_read~0)|))) (.cse5 (not (<= |old(~c_dr_pc~0)| 0)))) (and (or (and (= 0 ~q_free~0) (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) (<= 2 ~p_dw_st~0)) .cse0 .cse1 .cse2 .cse3 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse4 .cse5 (not (= 0 ~p_num_write~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 1 ~p_num_write~0))))) [2020-07-20 12:24:53,707 INFO L268 CegarLoopResult]: For program point L172(lines 172 184) no Hoare annotation was computed. [2020-07-20 12:24:53,707 INFO L268 CegarLoopResult]: For program point L139(lines 139 147) no Hoare annotation was computed. [2020-07-20 12:24:53,707 INFO L264 CegarLoopResult]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (<= 2 |old(~p_dw_st~0)|))) (.cse9 (not (= 0 |old(~q_free~0)|))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (not (= 0 |old(~c_num_read~0)|))) (.cse6 (= 0 ~q_free~0)) (.cse4 (= 0 ~c_num_read~0)) (.cse5 (<= ~c_dr_pc~0 0)) (.cse7 (<= 2 ~p_dw_st~0)) (.cse3 (not (<= |old(~c_dr_pc~0)| 0)))) (and (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse1 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse2 .cse3 (and .cse4 (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) .cse5 (= 1 ~q_free~0)) (not (= 0 ~p_num_write~0))) (or (and .cse6 (= (+ ~c_num_read~0 1) ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse7) .cse0 .cse8 .cse9 .cse1 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or .cse0 .cse8 .cse9 .cse1 .cse2 (and .cse6 .cse4 .cse5 .cse7) .cse3 (not (= 1 ~p_num_write~0))))) [2020-07-20 12:24:53,708 INFO L268 CegarLoopResult]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2020-07-20 12:24:53,708 INFO L264 CegarLoopResult]: At program point L177(line 177) the Hoare annotation is: (let ((.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0))) (or .cse0 .cse1 .cse2 .cse3 (not (<= 1 |old(~c_dr_pc~0)|)) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse4 (not (<= |old(~c_dr_pc~0)| 0)) (not (= 0 ~p_num_write~0))))) [2020-07-20 12:24:53,708 INFO L268 CegarLoopResult]: For program point L142(lines 142 146) no Hoare annotation was computed. [2020-07-20 12:24:53,708 INFO L268 CegarLoopResult]: For program point L173(lines 173 179) no Hoare annotation was computed. [2020-07-20 12:24:53,708 INFO L264 CegarLoopResult]: At program point L169(line 169) the Hoare annotation is: (let ((.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (= 0 |old(~q_free~0)|))) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= 1 ~q_free~0)) (.cse8 (<= 2 ~p_dw_st~0)) (.cse0 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (= 0 |old(~c_num_read~0)|))) (.cse5 (not (<= |old(~c_dr_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 1 ~p_num_write~0)) (and (= 1 ~c_num_read~0) .cse6 (<= ~c_dr_pc~0 0) .cse7 .cse8)) (or .cse0 .cse1 .cse2 .cse3 (not (<= 1 |old(~c_dr_pc~0)|)) (and .cse6 (= ~c_num_read~0 ~p_num_write~0) (<= 1 ~c_dr_pc~0) .cse7 .cse8) (not (= ~p_num_write~0 (+ |old(~c_num_read~0)| 1)))) (or (not (<= ~p_dw_pc~0 0)) .cse0 (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 |old(~q_free~0)|)) .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse4 .cse5 (not (= 0 ~p_num_write~0))))) [2020-07-20 12:24:53,708 INFO L268 CegarLoopResult]: For program point L169-1(line 169) no Hoare annotation was computed. [2020-07-20 12:24:53,708 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2020-07-20 12:24:53,709 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2020-07-20 12:24:53,709 INFO L264 CegarLoopResult]: At program point init_modelENTRY(lines 332 348) the Hoare annotation is: (or (not (= ~c_dr_st~0 0)) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= 0 ~p_dw_st~0)) (not (= 0 |old(~q_free~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= 0 |old(~c_num_read~0)|)) (not (<= |old(~c_dr_pc~0)| 0)) (and (= 0 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~c_num_read~0) (<= ~c_dr_pc~0 0) (= 0 ~p_num_write~0)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-07-20 12:24:53,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 12:24:53 BoogieIcfgContainer [2020-07-20 12:24:53,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 12:24:53,773 INFO L168 Benchmark]: Toolchain (without parser) took 27914.12 ms. Allocated memory was 140.5 MB in the beginning and 602.4 MB in the end (delta: 461.9 MB). Free memory was 103.5 MB in the beginning and 161.4 MB in the end (delta: -57.8 MB). Peak memory consumption was 437.8 MB. Max. memory is 7.1 GB. [2020-07-20 12:24:53,773 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-20 12:24:53,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 504.30 ms. Allocated memory was 140.5 MB in the beginning and 206.6 MB in the end (delta: 66.1 MB). Free memory was 103.1 MB in the beginning and 185.1 MB in the end (delta: -82.0 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2020-07-20 12:24:53,775 INFO L168 Benchmark]: Boogie Preprocessor took 39.07 ms. Allocated memory is still 206.6 MB. Free memory was 185.1 MB in the beginning and 182.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2020-07-20 12:24:53,775 INFO L168 Benchmark]: RCFGBuilder took 487.77 ms. Allocated memory is still 206.6 MB. Free memory was 182.7 MB in the beginning and 156.2 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2020-07-20 12:24:53,776 INFO L168 Benchmark]: TraceAbstraction took 26877.02 ms. Allocated memory was 206.6 MB in the beginning and 602.4 MB in the end (delta: 395.8 MB). Free memory was 155.6 MB in the beginning and 161.4 MB in the end (delta: -5.8 MB). Peak memory consumption was 423.7 MB. Max. memory is 7.1 GB. [2020-07-20 12:24:53,779 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 504.30 ms. Allocated memory was 140.5 MB in the beginning and 206.6 MB in the end (delta: 66.1 MB). Free memory was 103.1 MB in the beginning and 185.1 MB in the end (delta: -82.0 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.07 ms. Allocated memory is still 206.6 MB. Free memory was 185.1 MB in the beginning and 182.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 487.77 ms. Allocated memory is still 206.6 MB. Free memory was 182.7 MB in the beginning and 156.2 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26877.02 ms. Allocated memory was 206.6 MB in the beginning and 602.4 MB in the end (delta: 395.8 MB). Free memory was 155.6 MB in the beginning and 161.4 MB in the end (delta: -5.8 MB). Peak memory consumption was 423.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(0 == \old(c_dr_st)) || ((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || ((((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && 1 <= c_dr_pc) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((2 <= c_dr_st && 1 == p_dw_i) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || ((((((2 <= c_dr_st && 0 == q_free) && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_num_read) + 1 == \old(p_num_write))) && (((((((((((((((((((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && 1 <= c_dr_pc) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st) || ((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || !(\old(p_dw_pc) <= 0)) || !(1 == \old(q_free))) || ((((((2 <= c_dr_st && 1 == p_dw_i) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0)) || !(1 == p_dw_i)) || ((((((2 <= c_dr_st && 0 == q_free) && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(c_num_read))) || (((((2 <= c_dr_st && 0 == q_free) && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(2 <= \old(c_dr_st))) || (((((((2 <= c_dr_st && p_dw_pc <= 0) && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || ((((((((0 == q_free && 1 == p_dw_i) && 0 == c_num_read) && p_num_write == \old(p_num_write) + 1) && 1 == p_num_write) && c_dr_pc <= 0) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || ((((((!(c_num_read == \old(p_num_write)) && 2 <= c_dr_st) && 0 == q_free) && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(2 <= \old(c_dr_st))) || !(\old(c_num_read) + 1 == \old(p_num_write)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || (((((2 <= c_dr_st && 0 == q_free) && 0 == c_num_read) && c_dr_pc <= 0) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(c_dr_st)))) && (((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(\old(c_num_read) == \old(p_num_write))) || !(2 <= \old(c_dr_st)))) && (((((((((((((((!(0 == \old(c_dr_st)) || ((((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && 1 <= c_dr_pc) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || ((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || !(\old(p_dw_pc) <= 0)) || !(1 == \old(q_free))) || ((((((2 <= c_dr_st && 1 == p_dw_i) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0)) || !(1 == p_dw_i)) || ((((((2 <= c_dr_st && 0 == q_free) && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || ((((((((p_dw_pc <= 0 && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc <= 0) && 0 == p_num_write) && c_dr_st == 0) && 1 == q_free) && p_last_write == q_buf_0)) || ((((((((0 == q_free && 1 == p_dw_i) && 0 == c_num_read) && p_num_write == \old(p_num_write) + 1) && 1 == p_num_write) && c_dr_pc <= 0) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(1 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write)) && (((((((((((!(0 == \old(c_dr_st)) || ((((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && 1 <= c_dr_pc) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || ((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_num_write))) || (((((0 == q_free && 0 == c_num_read) && 1 == p_num_write) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(q_free))) || ((((((2 <= c_dr_st && 1 == p_dw_i) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || ((((((2 <= c_dr_st && 0 == q_free) && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(c_num_read)))) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write)) && ((((((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || ((((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && 1 <= c_dr_pc) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || ((((((2 <= c_dr_st && 1 == p_dw_i) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0)) || ((((((2 <= c_dr_st && 0 == q_free) && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(\old(c_num_read) == \old(p_num_write))) || !(2 <= \old(c_dr_st))) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && 2 <= p_dw_st) || !(p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(p_num_write == \old(c_num_read) + 1)) && ((((((((!(p_dw_pc <= 0) || !(p_last_write == q_buf_0)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(0 == p_num_write))) && ((((((!(p_last_write == q_buf_0) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(1 == p_num_write)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((!(0 == \old(c_dr_st)) || !(0 == c_num_read)) || !(c_dr_pc <= 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || (((((p_dw_pc <= 0 && c_last_read == p_last_write) && 0 == p_num_write) && c_dr_st == 0) && 1 == q_free) && p_last_write == q_buf_0)) || ((((0 == q_free && p_dw_pc <= 0) && 1 == p_num_write) && c_dr_st == 0) && p_last_write == q_buf_0)) || !(\old(p_dw_pc) <= 0)) && ((((((((!(c_num_read == \old(p_num_write)) || (((2 <= c_dr_st && 0 == q_free) && c_num_read + 1 == p_num_write) && p_last_write == q_buf_0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(1 <= c_dr_pc)) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || (((0 == q_free && c_num_read + 1 == p_num_write) && c_dr_st == 0) && p_last_write == q_buf_0)) || (((2 <= c_dr_st && c_num_read == p_num_write) && 1 == q_free) && p_last_write == q_buf_0))) && ((((((((!(0 == c_num_read) || p_dw_pc <= 0) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && (((((((((((!(0 == c_num_read) || !(c_dr_pc <= 0)) || !(\old(q_buf_0) == \old(p_last_write))) || ((((2 <= c_dr_st && c_last_read == p_last_write) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || (((2 <= c_dr_st && 0 == q_free) && 1 == p_num_write) && p_last_write == q_buf_0)) || !(2 <= \old(c_dr_st))) || ((((0 == q_free && p_dw_pc <= 0) && 1 == p_num_write) && c_dr_st == 0) && p_last_write == q_buf_0)) || !(\old(p_dw_pc) <= 0)) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((!(p_dw_pc <= 0) || !(p_last_write == q_buf_0)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || (((0 == c_num_read && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(0 == p_num_write)) && ((((((((((((1 == c_num_read && c_last_read == p_last_write) && 1 == q_free) && 2 <= p_dw_st) || !(p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || (((0 == q_free && 0 == c_num_read) && c_dr_pc <= 0) && 2 <= p_dw_st)) || ((((1 == c_num_read && 1 == p_dw_i) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free)) || !(\old(c_dr_pc) <= 0)) || !(1 == p_num_write))) && (((((((((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && 2 <= p_dw_st) || !(p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(p_num_write == \old(c_num_read) + 1)) || (((c_last_read == p_last_write && c_num_read == p_num_write) && 1 == q_free) && 2 <= p_dw_st)) || ((((1 == p_dw_i && c_last_read == p_last_write) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 == q_free)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: ((((((((((((((((!(0 == \old(c_dr_st)) || !(\old(q_buf_0) == \old(p_last_write))) || (((((0 == q_free && 2 <= c_dr_st) && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(p_dw_st))) || (((((0 == q_free && 0 == c_num_read) && 1 == p_num_write) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(p_num_write))) || !(\old(p_dw_pc) <= 0)) || (((((2 <= c_dr_st && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0)) || (((((2 <= c_dr_st && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || (((((2 <= c_dr_st && 0 == q_free) && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_dr_pc) <= 0)) || (((((0 == q_free && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || ((((((((p_dw_pc <= 0 && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc <= 0) && 0 == p_num_write) && c_dr_st == 0) && 1 == q_free) && p_last_write == q_buf_0)) || (((((((2 <= c_dr_st && p_dw_pc <= 0) && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || !(\old(c_last_read) == \old(p_last_write)) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && 1 <= c_dr_pc) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st) || ((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || ((((((2 <= c_dr_st && 1 == p_dw_i) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0)) || ((((((2 <= c_dr_st && 0 == q_free) && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(\old(c_num_read) == \old(p_num_write))) || !(2 <= \old(c_dr_st))) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || ((((((!(c_num_read == \old(p_num_write)) && 2 <= c_dr_st) && 0 == q_free) && c_num_read + 1 == p_num_write) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(2 <= \old(c_dr_st))) || !(\old(c_num_read) + 1 == \old(p_num_write)))) && (((((((((((!(0 == \old(c_dr_st)) || ((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || ((((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && 1 <= c_dr_pc) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(p_num_write))) || (((((0 == q_free && 0 == c_num_read) && 1 == p_num_write) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(q_free))) || ((((((2 <= c_dr_st && 1 == p_dw_i) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || ((((((2 <= c_dr_st && 0 == q_free) && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(c_num_read)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || (((((2 <= c_dr_st && 0 == q_free) && 0 == c_num_read) && c_dr_pc <= 0) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(c_dr_st)))) && (((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(\old(c_num_read) == \old(p_num_write))) || !(2 <= \old(c_dr_st)))) && (((((((((((((((!(0 == \old(c_dr_st)) || ((((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && 1 <= c_dr_pc) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || ((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || !(\old(p_dw_pc) <= 0)) || !(1 == \old(q_free))) || ((((((2 <= c_dr_st && 1 == p_dw_i) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0)) || !(1 == p_dw_i)) || ((((((2 <= c_dr_st && 0 == q_free) && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || ((((((((p_dw_pc <= 0 && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc <= 0) && 0 == p_num_write) && c_dr_st == 0) && 1 == q_free) && p_last_write == q_buf_0)) || ((((((((0 == q_free && 1 == p_dw_i) && 0 == c_num_read) && p_num_write == \old(p_num_write) + 1) && 1 == p_num_write) && c_dr_pc <= 0) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(1 == \old(q_free))) || !(2 <= \old(p_dw_st))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || !(1 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write)) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(1 == \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || !(2 <= \old(c_dr_st))) || 1 == p_num_write)) && (((((((((((((((((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st) || ((((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && 1 <= c_dr_pc) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(q_buf_0) == \old(p_last_write))) || !(0 == \old(p_dw_st))) || !(0 == \old(p_num_write))) || !(\old(p_dw_pc) <= 0)) || !(1 == \old(q_free))) || ((((((2 <= c_dr_st && 1 == p_dw_i) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0)) || !(1 == p_dw_i)) || ((((((2 <= c_dr_st && 0 == q_free) && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(c_num_read))) || (((((2 <= c_dr_st && 0 == q_free) && 0 == c_num_read) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(2 <= \old(c_dr_st))) || (((((((2 <= c_dr_st && p_dw_pc <= 0) && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && 0 == p_num_write) && 1 == q_free) && p_last_write == q_buf_0)) || ((((((((0 == q_free && 1 == p_dw_i) && 0 == c_num_read) && p_num_write == \old(p_num_write) + 1) && 1 == p_num_write) && c_dr_pc <= 0) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((((!(0 == \old(c_dr_st)) || ((((((0 == q_free && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && 1 <= c_dr_pc) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || ((((((2 <= c_dr_st && 1 == p_dw_i) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((2 <= c_dr_st && 1 == p_dw_i) && 0 == p_dw_st) && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && p_last_write == q_buf_0)) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || ((((((2 <= c_dr_st && 0 == q_free) && c_num_read + 1 == p_num_write) && 1 == p_dw_i) && 1 <= c_dr_pc) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(\old(c_num_read) + 1 == \old(p_num_write))) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((!(0 == \old(c_dr_st)) || !(0 == c_num_read)) || !(c_dr_pc <= 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(\old(p_dw_pc) <= 0)) || ((((((((0 == q_free && 1 == p_dw_i) && 0 == c_num_read) && p_num_write == \old(p_num_write) + 1) && 1 == p_num_write) && c_dr_pc <= 0) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st)) && ((((((((((!(0 == c_num_read) || !(c_dr_pc <= 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || ((((2 <= c_dr_st && 0 == q_free) && 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0)) || ((((((((0 == q_free && 1 == p_dw_i) && 0 == c_num_read) && p_num_write == \old(p_num_write) + 1) && 1 == p_num_write) && c_dr_pc <= 0) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st))) && (((((((!(c_num_read == \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(1 <= c_dr_pc)) || !(1 == p_dw_i)) || ((((0 == q_free && c_num_read + 1 == p_num_write) && c_dr_st == 0) && p_last_write == q_buf_0) && 2 <= p_dw_st)) || !(2 <= \old(c_dr_st))) || ((((2 <= c_dr_st && 0 == q_free) && c_num_read + 1 == p_num_write) && p_last_write == q_buf_0) && 2 <= p_dw_st)) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((!(p_dw_pc <= 0) || !(p_last_write == q_buf_0)) || !(0 == \old(p_dw_st))) || !(1 == \old(q_free))) || !(1 == p_dw_i)) || !(p_last_write == \old(c_last_read))) || !(0 == \old(c_num_read))) || !(\old(c_dr_pc) <= 0)) || (((((2 <= c_dr_st && 0 == c_num_read) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 <= c_dr_pc) && 1 == q_free)) || !(0 == p_num_write)) && (((((((!(p_last_write == q_buf_0) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(1 <= \old(c_dr_pc))) || (((((2 <= c_dr_st && c_last_read == p_last_write) && c_num_read == p_num_write) && 0 == p_dw_st) && 1 <= c_dr_pc) && 1 == q_free)) || ((((2 <= c_dr_st && c_num_read == p_num_write) && 1 <= c_dr_pc) && 1 == q_free) && 2 <= p_dw_st)) || !(p_num_write == \old(c_num_read) + 1))) && (((((((!(p_last_write == q_buf_0) || !(2 <= \old(p_dw_st))) || !(0 == \old(q_free))) || !(1 == p_dw_i)) || !(0 == \old(c_num_read))) || ((((1 == c_num_read && 2 <= c_dr_st) && 1 <= c_dr_pc) && 1 == q_free) && 2 <= p_dw_st)) || !(1 == p_num_write)) || (((((1 == c_num_read && 2 <= c_dr_st) && c_last_read == p_last_write) && 0 == p_dw_st) && 1 <= c_dr_pc) && 1 == q_free)) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((!(0 == c_num_read) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || ((2 <= c_dr_st && 0 == p_num_write) && p_last_write == q_buf_0)) || !(\old(p_dw_pc) <= 0)) && ((((((!(c_num_read == \old(p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(1 <= c_dr_pc)) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || ((2 <= c_dr_st && c_num_read == p_num_write) && p_last_write == q_buf_0))) && ((((((((!(0 == c_num_read) || !(\old(q_buf_0) == \old(p_last_write))) || p_dw_pc <= 0) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) <= 0))) && (((((((((!(0 == \old(c_dr_st)) || !(0 == c_num_read)) || !(c_dr_pc <= 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == \old(q_free))) || !(0 == \old(p_num_write))) || !(1 == p_dw_i)) || !(c_last_read == \old(p_last_write))) || (((p_dw_pc <= 0 && 0 == p_num_write) && c_dr_st == 0) && p_last_write == q_buf_0)) || !(\old(p_dw_pc) <= 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.8s, OverallIterations: 12, TraceHistogramMax: 4, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2107 SDtfs, 2267 SDslu, 1716 SDs, 0 SdLazy, 1697 SolverSat, 483 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1454 GetRequests, 1419 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3018occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 526 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 4526 PreInvPairs, 4934 NumberOfFragments, 7978 HoareAnnotationTreeSize, 4526 FomulaSimplifications, 6694 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 45 FomulaSimplificationsInter, 15454 FormulaSimplificationTreeSizeReductionInter, 14.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1255 NumberOfCodeBlocks, 1255 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1438 ConstructedInterpolants, 0 QuantifiedInterpolants, 276986 SizeOfPredicates, 17 NumberOfNonLiveVariables, 7466 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 460/504 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...