./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_962484bc-242f-408f-a23f-77048643a1f2/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_962484bc-242f-408f-a23f-77048643a1f2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_962484bc-242f-408f-a23f-77048643a1f2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_962484bc-242f-408f-a23f-77048643a1f2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_962484bc-242f-408f-a23f-77048643a1f2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_962484bc-242f-408f-a23f-77048643a1f2/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a436e4bf9da4ee1e6356d8c8c6b3cd5e98b60423 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 02:56:26,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 02:56:26,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 02:56:26,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 02:56:26,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 02:56:26,094 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 02:56:26,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 02:56:26,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 02:56:26,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 02:56:26,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 02:56:26,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 02:56:26,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 02:56:26,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 02:56:26,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 02:56:26,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 02:56:26,144 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 02:56:26,146 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 02:56:26,149 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 02:56:26,157 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 02:56:26,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 02:56:26,167 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 02:56:26,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 02:56:26,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 02:56:26,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 02:56:26,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 02:56:26,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 02:56:26,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 02:56:26,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 02:56:26,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 02:56:26,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 02:56:26,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 02:56:26,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 02:56:26,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 02:56:26,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 02:56:26,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 02:56:26,195 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 02:56:26,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 02:56:26,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 02:56:26,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 02:56:26,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 02:56:26,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 02:56:26,202 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_962484bc-242f-408f-a23f-77048643a1f2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 02:56:26,248 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 02:56:26,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 02:56:26,250 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 02:56:26,251 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 02:56:26,251 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 02:56:26,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 02:56:26,251 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 02:56:26,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 02:56:26,252 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 02:56:26,252 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 02:56:26,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 02:56:26,253 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 02:56:26,253 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 02:56:26,254 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 02:56:26,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 02:56:26,254 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 02:56:26,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 02:56:26,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 02:56:26,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 02:56:26,255 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 02:56:26,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 02:56:26,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 02:56:26,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 02:56:26,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 02:56:26,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 02:56:26,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 02:56:26,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 02:56:26,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 02:56:26,257 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 02:56:26,257 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_962484bc-242f-408f-a23f-77048643a1f2/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_962484bc-242f-408f-a23f-77048643a1f2/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a436e4bf9da4ee1e6356d8c8c6b3cd5e98b60423 [2020-11-28 02:56:26,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 02:56:26,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 02:56:26,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 02:56:26,618 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 02:56:26,619 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 02:56:26,620 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_962484bc-242f-408f-a23f-77048643a1f2/bin/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2020-11-28 02:56:26,703 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_962484bc-242f-408f-a23f-77048643a1f2/bin/uautomizer/data/2ff23eafd/e8fd8bbed0ad4f8bb226af80cf5ac93d/FLAG354c88c28 [2020-11-28 02:56:27,221 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 02:56:27,222 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_962484bc-242f-408f-a23f-77048643a1f2/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2020-11-28 02:56:27,240 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_962484bc-242f-408f-a23f-77048643a1f2/bin/uautomizer/data/2ff23eafd/e8fd8bbed0ad4f8bb226af80cf5ac93d/FLAG354c88c28 [2020-11-28 02:56:27,545 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_962484bc-242f-408f-a23f-77048643a1f2/bin/uautomizer/data/2ff23eafd/e8fd8bbed0ad4f8bb226af80cf5ac93d [2020-11-28 02:56:27,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 02:56:27,551 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 02:56:27,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 02:56:27,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 02:56:27,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 02:56:27,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:56:27" (1/1) ... [2020-11-28 02:56:27,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a520aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:27, skipping insertion in model container [2020-11-28 02:56:27,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:56:27" (1/1) ... [2020-11-28 02:56:27,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 02:56:27,621 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 02:56:27,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:56:27,919 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 02:56:27,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:56:27,972 INFO L208 MainTranslator]: Completed translation [2020-11-28 02:56:27,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:27 WrapperNode [2020-11-28 02:56:27,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 02:56:27,975 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 02:56:27,975 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 02:56:27,975 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 02:56:27,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:27" (1/1) ... [2020-11-28 02:56:27,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:27" (1/1) ... [2020-11-28 02:56:28,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 02:56:28,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 02:56:28,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 02:56:28,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 02:56:28,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:27" (1/1) ... [2020-11-28 02:56:28,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:27" (1/1) ... [2020-11-28 02:56:28,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:27" (1/1) ... [2020-11-28 02:56:28,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:27" (1/1) ... [2020-11-28 02:56:28,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:27" (1/1) ... [2020-11-28 02:56:28,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:27" (1/1) ... [2020-11-28 02:56:28,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:27" (1/1) ... [2020-11-28 02:56:28,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 02:56:28,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 02:56:28,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 02:56:28,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 02:56:28,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_962484bc-242f-408f-a23f-77048643a1f2/bin/uautomizer/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-11-28 02:56:28,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 02:56:28,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 02:56:28,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 02:56:28,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 02:56:28,863 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 02:56:28,866 INFO L298 CfgBuilder]: Removed 46 assume(true) statements. [2020-11-28 02:56:28,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:28 BoogieIcfgContainer [2020-11-28 02:56:28,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 02:56:28,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 02:56:28,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 02:56:28,875 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 02:56:28,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:56:27" (1/3) ... [2020-11-28 02:56:28,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76eaa205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:56:28, skipping insertion in model container [2020-11-28 02:56:28,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:27" (2/3) ... [2020-11-28 02:56:28,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76eaa205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:56:28, skipping insertion in model container [2020-11-28 02:56:28,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:28" (3/3) ... [2020-11-28 02:56:28,879 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-11-28 02:56:28,893 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 02:56:28,897 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 02:56:28,909 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-11-28 02:56:28,946 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 02:56:28,946 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 02:56:28,947 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 02:56:28,947 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 02:56:28,947 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 02:56:28,947 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 02:56:28,947 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 02:56:28,947 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 02:56:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-11-28 02:56:28,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-28 02:56:28,975 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:28,976 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] [2020-11-28 02:56:28,977 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:28,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:28,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1325512772, now seen corresponding path program 1 times [2020-11-28 02:56:28,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:28,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356582282] [2020-11-28 02:56:28,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:29,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:29,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356582282] [2020-11-28 02:56:29,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:29,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:56:29,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127171846] [2020-11-28 02:56:29,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:56:29,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:29,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:56:29,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:56:29,181 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2020-11-28 02:56:29,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:29,299 INFO L93 Difference]: Finished difference Result 216 states and 328 transitions. [2020-11-28 02:56:29,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:56:29,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-11-28 02:56:29,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:29,323 INFO L225 Difference]: With dead ends: 216 [2020-11-28 02:56:29,325 INFO L226 Difference]: Without dead ends: 135 [2020-11-28 02:56:29,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 02:56:29,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-11-28 02:56:29,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2020-11-28 02:56:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-11-28 02:56:29,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2020-11-28 02:56:29,380 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 34 [2020-11-28 02:56:29,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:29,380 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2020-11-28 02:56:29,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:56:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2020-11-28 02:56:29,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-28 02:56:29,383 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:29,383 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] [2020-11-28 02:56:29,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 02:56:29,384 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:29,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:29,385 INFO L82 PathProgramCache]: Analyzing trace with hash 317140169, now seen corresponding path program 1 times [2020-11-28 02:56:29,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:29,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042929602] [2020-11-28 02:56:29,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:29,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042929602] [2020-11-28 02:56:29,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:29,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:56:29,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405914968] [2020-11-28 02:56:29,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:56:29,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:29,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:56:29,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:56:29,509 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand 3 states. [2020-11-28 02:56:29,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:29,578 INFO L93 Difference]: Finished difference Result 323 states and 450 transitions. [2020-11-28 02:56:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:56:29,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-11-28 02:56:29,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:29,583 INFO L225 Difference]: With dead ends: 323 [2020-11-28 02:56:29,583 INFO L226 Difference]: Without dead ends: 215 [2020-11-28 02:56:29,584 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 02:56:29,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-11-28 02:56:29,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2020-11-28 02:56:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-11-28 02:56:29,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 292 transitions. [2020-11-28 02:56:29,620 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 292 transitions. Word has length 35 [2020-11-28 02:56:29,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:29,621 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 292 transitions. [2020-11-28 02:56:29,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:56:29,622 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2020-11-28 02:56:29,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-28 02:56:29,628 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:29,628 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] [2020-11-28 02:56:29,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 02:56:29,630 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:29,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:29,630 INFO L82 PathProgramCache]: Analyzing trace with hash -658420749, now seen corresponding path program 1 times [2020-11-28 02:56:29,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:29,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490758657] [2020-11-28 02:56:29,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:29,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:29,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490758657] [2020-11-28 02:56:29,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:29,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:56:29,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275332085] [2020-11-28 02:56:29,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:56:29,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:29,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:56:29,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:56:29,748 INFO L87 Difference]: Start difference. First operand 211 states and 292 transitions. Second operand 3 states. [2020-11-28 02:56:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:29,817 INFO L93 Difference]: Finished difference Result 526 states and 727 transitions. [2020-11-28 02:56:29,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:56:29,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-11-28 02:56:29,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:29,828 INFO L225 Difference]: With dead ends: 526 [2020-11-28 02:56:29,828 INFO L226 Difference]: Without dead ends: 321 [2020-11-28 02:56:29,830 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 02:56:29,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-11-28 02:56:29,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 297. [2020-11-28 02:56:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2020-11-28 02:56:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 408 transitions. [2020-11-28 02:56:29,887 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 408 transitions. Word has length 35 [2020-11-28 02:56:29,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:29,887 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 408 transitions. [2020-11-28 02:56:29,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:56:29,887 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2020-11-28 02:56:29,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-28 02:56:29,889 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:29,890 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-28 02:56:29,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 02:56:29,890 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:29,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:29,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1720921099, now seen corresponding path program 1 times [2020-11-28 02:56:29,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:29,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002398948] [2020-11-28 02:56:29,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:29,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002398948] [2020-11-28 02:56:29,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:29,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:56:29,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883914804] [2020-11-28 02:56:29,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:56:29,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:29,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:56:29,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:56:29,983 INFO L87 Difference]: Start difference. First operand 297 states and 408 transitions. Second operand 3 states. [2020-11-28 02:56:30,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:30,073 INFO L93 Difference]: Finished difference Result 740 states and 1007 transitions. [2020-11-28 02:56:30,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:56:30,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-11-28 02:56:30,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:30,077 INFO L225 Difference]: With dead ends: 740 [2020-11-28 02:56:30,077 INFO L226 Difference]: Without dead ends: 449 [2020-11-28 02:56:30,081 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 02:56:30,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2020-11-28 02:56:30,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2020-11-28 02:56:30,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2020-11-28 02:56:30,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 592 transitions. [2020-11-28 02:56:30,127 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 592 transitions. Word has length 48 [2020-11-28 02:56:30,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:30,127 INFO L481 AbstractCegarLoop]: Abstraction has 449 states and 592 transitions. [2020-11-28 02:56:30,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:56:30,127 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 592 transitions. [2020-11-28 02:56:30,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-28 02:56:30,134 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:30,134 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] [2020-11-28 02:56:30,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 02:56:30,135 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:30,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:30,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1954870078, now seen corresponding path program 1 times [2020-11-28 02:56:30,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:30,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126748367] [2020-11-28 02:56:30,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:30,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126748367] [2020-11-28 02:56:30,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:30,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:56:30,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922085543] [2020-11-28 02:56:30,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:56:30,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:30,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:56:30,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:56:30,240 INFO L87 Difference]: Start difference. First operand 449 states and 592 transitions. Second operand 3 states. [2020-11-28 02:56:30,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:30,303 INFO L93 Difference]: Finished difference Result 914 states and 1200 transitions. [2020-11-28 02:56:30,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:56:30,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-11-28 02:56:30,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:30,307 INFO L225 Difference]: With dead ends: 914 [2020-11-28 02:56:30,307 INFO L226 Difference]: Without dead ends: 555 [2020-11-28 02:56:30,308 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 02:56:30,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-11-28 02:56:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2020-11-28 02:56:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2020-11-28 02:56:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 718 transitions. [2020-11-28 02:56:30,334 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 718 transitions. Word has length 52 [2020-11-28 02:56:30,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:30,334 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 718 transitions. [2020-11-28 02:56:30,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:56:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 718 transitions. [2020-11-28 02:56:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-28 02:56:30,336 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:30,336 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:30,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 02:56:30,337 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:30,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:30,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1072726775, now seen corresponding path program 1 times [2020-11-28 02:56:30,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:30,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732550131] [2020-11-28 02:56:30,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:30,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732550131] [2020-11-28 02:56:30,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:30,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 02:56:30,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114552860] [2020-11-28 02:56:30,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 02:56:30,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:30,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 02:56:30,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:30,453 INFO L87 Difference]: Start difference. First operand 555 states and 718 transitions. Second operand 5 states. [2020-11-28 02:56:30,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:30,727 INFO L93 Difference]: Finished difference Result 1620 states and 2104 transitions. [2020-11-28 02:56:30,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 02:56:30,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-11-28 02:56:30,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:30,735 INFO L225 Difference]: With dead ends: 1620 [2020-11-28 02:56:30,735 INFO L226 Difference]: Without dead ends: 1203 [2020-11-28 02:56:30,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 02:56:30,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-11-28 02:56:30,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 579. [2020-11-28 02:56:30,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2020-11-28 02:56:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 738 transitions. [2020-11-28 02:56:30,778 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 738 transitions. Word has length 53 [2020-11-28 02:56:30,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:30,778 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 738 transitions. [2020-11-28 02:56:30,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 02:56:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 738 transitions. [2020-11-28 02:56:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-28 02:56:30,780 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:30,780 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:30,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 02:56:30,781 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:30,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:30,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1443121531, now seen corresponding path program 1 times [2020-11-28 02:56:30,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:30,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938011305] [2020-11-28 02:56:30,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:30,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:30,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938011305] [2020-11-28 02:56:30,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:30,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 02:56:30,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713443603] [2020-11-28 02:56:30,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 02:56:30,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:30,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 02:56:30,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:30,904 INFO L87 Difference]: Start difference. First operand 579 states and 738 transitions. Second operand 5 states. [2020-11-28 02:56:31,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:31,029 INFO L93 Difference]: Finished difference Result 1356 states and 1736 transitions. [2020-11-28 02:56:31,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 02:56:31,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-11-28 02:56:31,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:31,035 INFO L225 Difference]: With dead ends: 1356 [2020-11-28 02:56:31,035 INFO L226 Difference]: Without dead ends: 866 [2020-11-28 02:56:31,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 02:56:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2020-11-28 02:56:31,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 480. [2020-11-28 02:56:31,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2020-11-28 02:56:31,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 610 transitions. [2020-11-28 02:56:31,074 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 610 transitions. Word has length 53 [2020-11-28 02:56:31,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:31,075 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 610 transitions. [2020-11-28 02:56:31,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 02:56:31,075 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 610 transitions. [2020-11-28 02:56:31,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-28 02:56:31,076 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:31,077 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:31,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 02:56:31,077 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:31,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:31,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1577075455, now seen corresponding path program 1 times [2020-11-28 02:56:31,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:31,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829797045] [2020-11-28 02:56:31,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-28 02:56:31,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829797045] [2020-11-28 02:56:31,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:31,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:56:31,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192726434] [2020-11-28 02:56:31,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:56:31,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:31,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:56:31,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:56:31,151 INFO L87 Difference]: Start difference. First operand 480 states and 610 transitions. Second operand 3 states. [2020-11-28 02:56:31,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:31,205 INFO L93 Difference]: Finished difference Result 862 states and 1099 transitions. [2020-11-28 02:56:31,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:56:31,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-11-28 02:56:31,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:31,211 INFO L225 Difference]: With dead ends: 862 [2020-11-28 02:56:31,211 INFO L226 Difference]: Without dead ends: 478 [2020-11-28 02:56:31,212 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 02:56:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-11-28 02:56:31,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 437. [2020-11-28 02:56:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2020-11-28 02:56:31,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 544 transitions. [2020-11-28 02:56:31,258 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 544 transitions. Word has length 53 [2020-11-28 02:56:31,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:31,259 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 544 transitions. [2020-11-28 02:56:31,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:56:31,259 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 544 transitions. [2020-11-28 02:56:31,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-28 02:56:31,261 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:31,261 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:31,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 02:56:31,262 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:31,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:31,262 INFO L82 PathProgramCache]: Analyzing trace with hash -179687324, now seen corresponding path program 1 times [2020-11-28 02:56:31,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:31,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759655432] [2020-11-28 02:56:31,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:31,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:31,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759655432] [2020-11-28 02:56:31,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:31,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:56:31,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095811431] [2020-11-28 02:56:31,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:56:31,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:31,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:56:31,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:56:31,358 INFO L87 Difference]: Start difference. First operand 437 states and 544 transitions. Second operand 4 states. [2020-11-28 02:56:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:31,411 INFO L93 Difference]: Finished difference Result 481 states and 596 transitions. [2020-11-28 02:56:31,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 02:56:31,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-11-28 02:56:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:31,415 INFO L225 Difference]: With dead ends: 481 [2020-11-28 02:56:31,416 INFO L226 Difference]: Without dead ends: 479 [2020-11-28 02:56:31,417 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11-28 02:56:31,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2020-11-28 02:56:31,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 435. [2020-11-28 02:56:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-11-28 02:56:31,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 541 transitions. [2020-11-28 02:56:31,451 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 541 transitions. Word has length 53 [2020-11-28 02:56:31,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:31,451 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 541 transitions. [2020-11-28 02:56:31,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:56:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 541 transitions. [2020-11-28 02:56:31,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-28 02:56:31,453 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:31,453 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:31,453 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 02:56:31,453 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:31,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:31,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1275353301, now seen corresponding path program 1 times [2020-11-28 02:56:31,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:31,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940778792] [2020-11-28 02:56:31,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:31,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940778792] [2020-11-28 02:56:31,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075801427] [2020-11-28 02:56:31,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_962484bc-242f-408f-a23f-77048643a1f2/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 02:56:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:31,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-28 02:56:31,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 02:56:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:31,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 02:56:31,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-28 02:56:31,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715018478] [2020-11-28 02:56:31,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 02:56:31,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:31,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 02:56:31,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 02:56:31,780 INFO L87 Difference]: Start difference. First operand 435 states and 541 transitions. Second operand 6 states. [2020-11-28 02:56:31,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:31,931 INFO L93 Difference]: Finished difference Result 781 states and 968 transitions. [2020-11-28 02:56:31,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 02:56:31,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2020-11-28 02:56:31,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:31,937 INFO L225 Difference]: With dead ends: 781 [2020-11-28 02:56:31,937 INFO L226 Difference]: Without dead ends: 779 [2020-11-28 02:56:31,938 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 02:56:31,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2020-11-28 02:56:32,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 633. [2020-11-28 02:56:32,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2020-11-28 02:56:32,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 794 transitions. [2020-11-28 02:56:32,005 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 794 transitions. Word has length 54 [2020-11-28 02:56:32,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:32,006 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 794 transitions. [2020-11-28 02:56:32,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 02:56:32,006 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 794 transitions. [2020-11-28 02:56:32,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-28 02:56:32,008 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:32,008 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:32,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-11-28 02:56:32,223 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:32,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:32,224 INFO L82 PathProgramCache]: Analyzing trace with hash 602571322, now seen corresponding path program 2 times [2020-11-28 02:56:32,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:32,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818128470] [2020-11-28 02:56:32,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:32,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818128470] [2020-11-28 02:56:32,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:32,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:56:32,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040302217] [2020-11-28 02:56:32,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:56:32,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:32,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:56:32,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:56:32,266 INFO L87 Difference]: Start difference. First operand 633 states and 794 transitions. Second operand 3 states. [2020-11-28 02:56:32,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:32,333 INFO L93 Difference]: Finished difference Result 966 states and 1210 transitions. [2020-11-28 02:56:32,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:56:32,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-11-28 02:56:32,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:32,337 INFO L225 Difference]: With dead ends: 966 [2020-11-28 02:56:32,337 INFO L226 Difference]: Without dead ends: 629 [2020-11-28 02:56:32,338 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 02:56:32,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-11-28 02:56:32,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 580. [2020-11-28 02:56:32,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2020-11-28 02:56:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 719 transitions. [2020-11-28 02:56:32,386 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 719 transitions. Word has length 69 [2020-11-28 02:56:32,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:32,387 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 719 transitions. [2020-11-28 02:56:32,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:56:32,387 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 719 transitions. [2020-11-28 02:56:32,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-28 02:56:32,389 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:32,389 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:32,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 02:56:32,389 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:32,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:32,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1336457993, now seen corresponding path program 1 times [2020-11-28 02:56:32,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:32,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302176386] [2020-11-28 02:56:32,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:32,459 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-28 02:56:32,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302176386] [2020-11-28 02:56:32,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:32,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:56:32,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434700675] [2020-11-28 02:56:32,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:56:32,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:32,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:56:32,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:56:32,462 INFO L87 Difference]: Start difference. First operand 580 states and 719 transitions. Second operand 3 states. [2020-11-28 02:56:32,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:32,533 INFO L93 Difference]: Finished difference Result 1172 states and 1450 transitions. [2020-11-28 02:56:32,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:56:32,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-11-28 02:56:32,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:32,537 INFO L225 Difference]: With dead ends: 1172 [2020-11-28 02:56:32,537 INFO L226 Difference]: Without dead ends: 598 [2020-11-28 02:56:32,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 02:56:32,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-11-28 02:56:32,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 580. [2020-11-28 02:56:32,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2020-11-28 02:56:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 699 transitions. [2020-11-28 02:56:32,586 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 699 transitions. Word has length 80 [2020-11-28 02:56:32,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:32,586 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 699 transitions. [2020-11-28 02:56:32,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:56:32,586 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 699 transitions. [2020-11-28 02:56:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-28 02:56:32,588 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:32,588 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-28 02:56:32,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 02:56:32,589 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:32,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:32,589 INFO L82 PathProgramCache]: Analyzing trace with hash 393751957, now seen corresponding path program 1 times [2020-11-28 02:56:32,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:32,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316011201] [2020-11-28 02:56:32,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-28 02:56:32,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316011201] [2020-11-28 02:56:32,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:32,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:56:32,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179905299] [2020-11-28 02:56:32,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:56:32,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:32,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:56:32,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:56:32,640 INFO L87 Difference]: Start difference. First operand 580 states and 699 transitions. Second operand 3 states. [2020-11-28 02:56:32,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:32,695 INFO L93 Difference]: Finished difference Result 911 states and 1095 transitions. [2020-11-28 02:56:32,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:56:32,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2020-11-28 02:56:32,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:32,697 INFO L225 Difference]: With dead ends: 911 [2020-11-28 02:56:32,698 INFO L226 Difference]: Without dead ends: 284 [2020-11-28 02:56:32,699 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 02:56:32,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-11-28 02:56:32,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2020-11-28 02:56:32,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-11-28 02:56:32,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 320 transitions. [2020-11-28 02:56:32,720 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 320 transitions. Word has length 81 [2020-11-28 02:56:32,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:32,720 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 320 transitions. [2020-11-28 02:56:32,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:56:32,721 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 320 transitions. [2020-11-28 02:56:32,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-11-28 02:56:32,722 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:32,722 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 02:56:32,723 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 02:56:32,723 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:32,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:32,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1534139577, now seen corresponding path program 1 times [2020-11-28 02:56:32,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:32,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036836770] [2020-11-28 02:56:32,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-28 02:56:32,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036836770] [2020-11-28 02:56:32,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:32,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:56:32,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042352386] [2020-11-28 02:56:32,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:56:32,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:32,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:56:32,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:56:32,790 INFO L87 Difference]: Start difference. First operand 282 states and 320 transitions. Second operand 3 states. [2020-11-28 02:56:32,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:32,823 INFO L93 Difference]: Finished difference Result 401 states and 458 transitions. [2020-11-28 02:56:32,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:56:32,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-11-28 02:56:32,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:32,826 INFO L225 Difference]: With dead ends: 401 [2020-11-28 02:56:32,826 INFO L226 Difference]: Without dead ends: 279 [2020-11-28 02:56:32,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 02:56:32,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-11-28 02:56:32,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2020-11-28 02:56:32,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2020-11-28 02:56:32,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 315 transitions. [2020-11-28 02:56:32,848 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 315 transitions. Word has length 101 [2020-11-28 02:56:32,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:32,849 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 315 transitions. [2020-11-28 02:56:32,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:56:32,849 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 315 transitions. [2020-11-28 02:56:32,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-11-28 02:56:32,851 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:32,852 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:32,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 02:56:32,852 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:32,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:32,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1342369766, now seen corresponding path program 1 times [2020-11-28 02:56:32,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:32,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58849361] [2020-11-28 02:56:32,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:32,922 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-28 02:56:32,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58849361] [2020-11-28 02:56:32,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:32,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:56:32,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739685933] [2020-11-28 02:56:32,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:56:32,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:32,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:56:32,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:56:32,927 INFO L87 Difference]: Start difference. First operand 279 states and 315 transitions. Second operand 4 states. [2020-11-28 02:56:32,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:32,974 INFO L93 Difference]: Finished difference Result 395 states and 447 transitions. [2020-11-28 02:56:32,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:56:32,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-11-28 02:56:32,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:32,976 INFO L225 Difference]: With dead ends: 395 [2020-11-28 02:56:32,977 INFO L226 Difference]: Without dead ends: 270 [2020-11-28 02:56:32,979 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-11-28 02:56:32,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-11-28 02:56:32,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2020-11-28 02:56:32,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-11-28 02:56:33,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 300 transitions. [2020-11-28 02:56:33,000 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 300 transitions. Word has length 102 [2020-11-28 02:56:33,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:33,001 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 300 transitions. [2020-11-28 02:56:33,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:56:33,001 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 300 transitions. [2020-11-28 02:56:33,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-11-28 02:56:33,003 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:33,003 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:33,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-28 02:56:33,003 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:33,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:33,004 INFO L82 PathProgramCache]: Analyzing trace with hash 759125341, now seen corresponding path program 1 times [2020-11-28 02:56:33,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:33,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673749378] [2020-11-28 02:56:33,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:33,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:33,073 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 02:56:33,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673749378] [2020-11-28 02:56:33,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:33,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:56:33,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421259996] [2020-11-28 02:56:33,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:56:33,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:33,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:56:33,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:56:33,076 INFO L87 Difference]: Start difference. First operand 270 states and 300 transitions. Second operand 3 states. [2020-11-28 02:56:33,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:33,124 INFO L93 Difference]: Finished difference Result 400 states and 443 transitions. [2020-11-28 02:56:33,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:56:33,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2020-11-28 02:56:33,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:33,127 INFO L225 Difference]: With dead ends: 400 [2020-11-28 02:56:33,127 INFO L226 Difference]: Without dead ends: 259 [2020-11-28 02:56:33,128 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-28 02:56:33,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-11-28 02:56:33,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 250. [2020-11-28 02:56:33,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-11-28 02:56:33,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 271 transitions. [2020-11-28 02:56:33,151 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 271 transitions. Word has length 102 [2020-11-28 02:56:33,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:33,151 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 271 transitions. [2020-11-28 02:56:33,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:56:33,152 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 271 transitions. [2020-11-28 02:56:33,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-11-28 02:56:33,153 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:33,154 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 02:56:33,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-28 02:56:33,154 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:33,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:33,155 INFO L82 PathProgramCache]: Analyzing trace with hash 961855834, now seen corresponding path program 1 times [2020-11-28 02:56:33,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:33,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879345282] [2020-11-28 02:56:33,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:33,241 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-28 02:56:33,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879345282] [2020-11-28 02:56:33,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:33,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:56:33,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731832351] [2020-11-28 02:56:33,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:56:33,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:33,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:56:33,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:56:33,244 INFO L87 Difference]: Start difference. First operand 250 states and 271 transitions. Second operand 4 states. [2020-11-28 02:56:33,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:33,277 INFO L93 Difference]: Finished difference Result 250 states and 271 transitions. [2020-11-28 02:56:33,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 02:56:33,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2020-11-28 02:56:33,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:33,278 INFO L225 Difference]: With dead ends: 250 [2020-11-28 02:56:33,278 INFO L226 Difference]: Without dead ends: 0 [2020-11-28 02:56:33,279 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:56:33,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-28 02:56:33,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-28 02:56:33,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-28 02:56:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-28 02:56:33,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2020-11-28 02:56:33,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:33,280 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-28 02:56:33,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:56:33,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-28 02:56:33,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-28 02:56:33,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-28 02:56:33,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-28 02:56:33,993 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2020-11-28 02:56:34,139 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2020-11-28 02:56:34,728 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-11-28 02:56:34,947 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2020-11-28 02:56:35,273 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2020-11-28 02:56:35,517 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2020-11-28 02:56:35,825 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2020-11-28 02:56:36,162 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2020-11-28 02:56:36,617 WARN L193 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-11-28 02:56:36,814 WARN L193 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2020-11-28 02:56:37,539 WARN L193 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-11-28 02:56:37,745 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2020-11-28 02:56:38,444 WARN L193 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-11-28 02:56:38,978 WARN L193 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-11-28 02:56:39,488 WARN L193 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-11-28 02:56:40,030 WARN L193 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-11-28 02:56:40,259 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2020-11-28 02:56:40,464 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-11-28 02:56:40,626 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2020-11-28 02:56:41,096 WARN L193 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-11-28 02:56:41,608 WARN L193 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-11-28 02:56:41,784 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2020-11-28 02:56:42,282 WARN L193 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-11-28 02:56:42,754 WARN L193 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-11-28 02:56:43,218 WARN L193 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-11-28 02:56:43,222 INFO L274 CegarLoopResult]: For program point L316(line 316) no Hoare annotation was computed. [2020-11-28 02:56:43,222 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-28 02:56:43,222 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-11-28 02:56:43,222 INFO L274 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-11-28 02:56:43,222 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-11-28 02:56:43,222 INFO L274 CegarLoopResult]: For program point L53(lines 53 62) no Hoare annotation was computed. [2020-11-28 02:56:43,222 INFO L274 CegarLoopResult]: For program point L53-2(lines 53 62) no Hoare annotation was computed. [2020-11-28 02:56:43,222 INFO L274 CegarLoopResult]: For program point L53-3(lines 53 62) no Hoare annotation was computed. [2020-11-28 02:56:43,223 INFO L274 CegarLoopResult]: For program point L53-5(lines 53 62) no Hoare annotation was computed. [2020-11-28 02:56:43,223 INFO L270 CegarLoopResult]: At program point L301(lines 290 303) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-11-28 02:56:43,223 INFO L274 CegarLoopResult]: For program point L268(lines 268 275) no Hoare annotation was computed. [2020-11-28 02:56:43,223 INFO L274 CegarLoopResult]: For program point L153(lines 152 187) no Hoare annotation was computed. [2020-11-28 02:56:43,224 INFO L274 CegarLoopResult]: For program point L54(lines 54 59) no Hoare annotation was computed. [2020-11-28 02:56:43,224 INFO L274 CegarLoopResult]: For program point L54-1(lines 54 59) no Hoare annotation was computed. [2020-11-28 02:56:43,224 INFO L270 CegarLoopResult]: At program point L302(lines 286 304) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-11-28 02:56:43,224 INFO L274 CegarLoopResult]: For program point L253(lines 253 260) no Hoare annotation was computed. [2020-11-28 02:56:43,224 INFO L274 CegarLoopResult]: For program point L220(lines 220 225) no Hoare annotation was computed. [2020-11-28 02:56:43,225 INFO L274 CegarLoopResult]: For program point L220-1(lines 220 225) no Hoare annotation was computed. [2020-11-28 02:56:43,225 INFO L274 CegarLoopResult]: For program point L154-1(lines 154 164) no Hoare annotation was computed. [2020-11-28 02:56:43,225 INFO L274 CegarLoopResult]: For program point L322(lines 322 326) no Hoare annotation was computed. [2020-11-28 02:56:43,225 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-28 02:56:43,225 INFO L274 CegarLoopResult]: For program point L240(line 240) no Hoare annotation was computed. [2020-11-28 02:56:43,225 INFO L274 CegarLoopResult]: For program point L174(lines 174 186) no Hoare annotation was computed. [2020-11-28 02:56:43,225 INFO L274 CegarLoopResult]: For program point L141(lines 141 149) no Hoare annotation was computed. [2020-11-28 02:56:43,225 INFO L274 CegarLoopResult]: For program point L175(lines 175 181) no Hoare annotation was computed. [2020-11-28 02:56:43,225 INFO L274 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2020-11-28 02:56:43,226 INFO L270 CegarLoopResult]: At program point L109-1(lines 97 134) the Hoare annotation is: (let ((.cse21 (+ ~c_num_read~0 1))) (let ((.cse8 (<= .cse21 ~p_num_write~0)) (.cse9 (<= ~p_num_write~0 .cse21)) (.cse2 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse3 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse14 (= ~p_dw_pc~0 1)) (.cse7 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse5 (= ~q_free~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse11 (<= ~p_num_write~0 1)) (.cse12 (<= 1 ~p_num_write~0)) (.cse6 (= ~p_dw_pc~0 0)) (.cse0 (= ~q_read_ev~0 2)) (.cse20 (= ~c_dr_st~0 2)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse18 (= ~q_free~0 1)) (.cse13 (not (= ~q_write_ev~0 1))) (.cse19 (= ~c_num_read~0 0)) (.cse15 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse5 .cse8 .cse0 .cse9 .cse10 .cse14 .cse1 .cse13 .cse15) (and .cse6 .cse0 .cse10 .cse1 .cse16 .cse17 .cse4 .cse18 .cse13 .cse19) (and .cse7 .cse20 .cse2 .cse3 .cse4) (and .cse6 .cse20 .cse4 .cse18) (and .cse5 .cse7 .cse20 .cse10 .cse14) (and .cse5 .cse6 .cse7 .cse20 .cse10) (and .cse5 .cse6 .cse0 .cse10 .cse1 .cse11 .cse12 .cse13 .cse19 .cse15) (and .cse6 .cse0 .cse20 .cse10 .cse16 .cse17 .cse18 .cse13 .cse19 .cse15)))) [2020-11-28 02:56:43,226 INFO L274 CegarLoopResult]: For program point L76-2(lines 76 80) no Hoare annotation was computed. [2020-11-28 02:56:43,226 INFO L274 CegarLoopResult]: For program point L76-3(lines 76 80) no Hoare annotation was computed. [2020-11-28 02:56:43,226 INFO L274 CegarLoopResult]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2020-11-28 02:56:43,226 INFO L274 CegarLoopResult]: For program point L110(lines 109 129) no Hoare annotation was computed. [2020-11-28 02:56:43,226 INFO L274 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-11-28 02:56:43,226 INFO L274 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-11-28 02:56:43,226 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-28 02:56:43,226 INFO L274 CegarLoopResult]: For program point L144(lines 144 148) no Hoare annotation was computed. [2020-11-28 02:56:43,227 INFO L270 CegarLoopResult]: At program point L111(lines 97 134) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse5 (= ~p_num_write~0 0)) (.cse7 (= ~c_num_read~0 0)) (.cse2 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 2)) (.cse3 (= ~q_read_ev~0 2)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (not (= ~q_write_ev~0 1))) (.cse8 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4 (= ~c_dr_st~0 0) .cse5 .cse2 .cse6 .cse7) (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0) .cse1 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse2) (and .cse1 .cse3 (<= ~p_num_write~0 ~c_num_read~0) .cse4 (= ~p_dw_pc~0 1) .cse6 (<= ~c_num_read~0 ~p_num_write~0) .cse8))) [2020-11-28 02:56:43,227 INFO L270 CegarLoopResult]: At program point L45(lines 33 47) the Hoare annotation is: (let ((.cse8 (= ~c_dr_pc~0 1)) (.cse1 (= ~c_dr_st~0 2)) (.cse4 (= ~q_free~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~q_read_ev~0 2)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= ~p_num_write~0 1)) (.cse2 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse10 (<= 1 ~p_num_write~0)) (.cse3 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_num_read~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ ~c_num_read~0 1))) (and .cse4 (<= .cse5 ~p_num_write~0) .cse6 .cse1 (<= ~p_num_write~0 .cse5) .cse7 (= ~p_dw_pc~0 1) .cse2 .cse8)) (and .cse4 .cse0 .cse1 .cse6 .cse7 .cse2 .cse9 .cse10 .cse11 .cse8) (and .cse1 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse3) (and .cse4 .cse0 .cse6 .cse7 (= ~c_dr_st~0 0) .cse9 .cse2 .cse10 .cse3 .cse11))) [2020-11-28 02:56:43,227 INFO L270 CegarLoopResult]: At program point L45-1(lines 33 47) the Hoare annotation is: (let ((.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (not (= ~q_write_ev~0 1))) (.cse7 (<= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= 2 ~p_dw_st~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= ~p_num_write~0 1)) (.cse5 (= ~q_free~0 1)) (.cse9 (<= 1 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 (= ~c_dr_pc~0 0) .cse5 .cse9 .cse6 .cse7) (and .cse0 (= ~c_num_read~0 1) .cse2 .cse3 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) .cse4 .cse8 .cse5 .cse9))) [2020-11-28 02:56:43,228 INFO L270 CegarLoopResult]: At program point L12-1(lines 140 192) the Hoare annotation is: (let ((.cse0 (= 2 ~p_dw_st~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse10 (= ~p_dw_pc~0 0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~p_dw_st~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~p_num_write~0 0)) (.cse8 (= ~q_free~0 1)) (.cse4 (not (= ~q_write_ev~0 1))) (.cse5 (= ~c_num_read~0 0))) (or (and (= ~q_free~0 0) .cse0 .cse1 .cse2 .cse3 (<= ~p_num_write~0 1) (= ~c_dr_pc~0 0) (<= 1 ~p_num_write~0) .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse7 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0) .cse8 .cse9) (and .cse10 .cse0 .cse2 .cse7 .cse11 .cse8 .cse5) (and .cse1 .cse6 .cse12 .cse2 .cse3 .cse7 .cse8 .cse4 .cse9) (and .cse10 .cse1 .cse12 .cse2 .cse7 .cse11 .cse8 .cse4 .cse5))) [2020-11-28 02:56:43,228 INFO L274 CegarLoopResult]: For program point L244(lines 244 248) no Hoare annotation was computed. [2020-11-28 02:56:43,228 INFO L274 CegarLoopResult]: For program point L244-1(lines 239 279) no Hoare annotation was computed. [2020-11-28 02:56:43,228 INFO L270 CegarLoopResult]: At program point L145(lines 140 192) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (and (= ~q_free~0 0) (= 2 ~p_dw_st~0) (<= .cse0 ~p_num_write~0) (= ~q_read_ev~0 2) (<= ~p_num_write~0 .cse0) (= ~p_last_write~0 ~q_buf_0~0) (= ~p_dw_pc~0 1) (not (= ~q_write_ev~0 1)) (= ~c_dr_pc~0 1))) [2020-11-28 02:56:43,228 INFO L270 CegarLoopResult]: At program point L46(lines 30 48) the Hoare annotation is: (let ((.cse13 (+ ~c_num_read~0 1))) (let ((.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~q_free~0 0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= .cse13 ~p_num_write~0)) (.cse3 (= ~q_read_ev~0 2)) (.cse5 (<= ~p_num_write~0 .cse13)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse8 (<= ~p_num_write~0 1)) (.cse9 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse10 (<= 1 ~p_num_write~0)) (.cse4 (= ~c_dr_st~0 2)) (.cse12 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~p_dw_pc~0 1) .cse7 .cse9 .cse11) (and .cse1 .cse4 .cse7 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 (= ~c_dr_st~0 0) .cse8 .cse9 .cse12 .cse10) (and .cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse12)))) [2020-11-28 02:56:43,229 INFO L270 CegarLoopResult]: At program point L46-1(lines 30 48) the Hoare annotation is: (let ((.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (not (= ~q_write_ev~0 1))) (.cse7 (<= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= 2 ~p_dw_st~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= ~p_num_write~0 1)) (.cse5 (= ~q_free~0 1)) (.cse9 (<= 1 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 (= ~c_dr_pc~0 0) .cse5 .cse9 .cse6 .cse7) (and .cse0 (= ~c_num_read~0 1) .cse2 .cse3 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) .cse4 .cse8 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|) .cse5 .cse9))) [2020-11-28 02:56:43,229 INFO L277 CegarLoopResult]: At program point L360(lines 351 362) the Hoare annotation is: true [2020-11-28 02:56:43,229 INFO L274 CegarLoopResult]: For program point L294(lines 294 299) no Hoare annotation was computed. [2020-11-28 02:56:43,229 INFO L270 CegarLoopResult]: At program point L228(lines 215 230) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse0 .cse2 .cse13 .cse7) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-11-28 02:56:43,230 INFO L270 CegarLoopResult]: At program point L228-1(lines 215 230) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-11-28 02:56:43,230 INFO L277 CegarLoopResult]: At program point L328(lines 305 333) the Hoare annotation is: true [2020-11-28 02:56:43,230 INFO L270 CegarLoopResult]: At program point L229(lines 212 231) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse0 .cse2 .cse13 .cse7) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-11-28 02:56:43,231 INFO L270 CegarLoopResult]: At program point L229-1(lines 212 231) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-11-28 02:56:43,231 INFO L270 CegarLoopResult]: At program point L64(lines 52 66) the Hoare annotation is: (let ((.cse16 (+ ~c_num_read~0 1))) (let ((.cse6 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 2)) (.cse15 (= ~p_dw_pc~0 1)) (.cse3 (= ~q_read_ev~0 2)) (.cse4 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse1 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse2 (= ~c_dr_pc~0 0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_pc~0 0)) (.cse9 (<= .cse16 ~p_num_write~0)) (.cse10 (<= ~p_num_write~0 .cse16)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= ~p_num_write~0 1)) (.cse13 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse14 (<= 1 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse9 .cse3 .cse0 .cse10 .cse11 .cse15 .cse6) (and .cse7 .cse8 .cse0 .cse11 .cse4 .cse1 .cse13 .cse5) (and .cse7 .cse0 .cse11 .cse15 .cse1) (and .cse3 (= ~c_dr_st~0 0) .cse4 .cse1 .cse5 .cse2 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2020-11-28 02:56:43,232 INFO L270 CegarLoopResult]: At program point L64-1(lines 52 66) the Hoare annotation is: (let ((.cse0 (= 2 ~p_dw_st~0)) (.cse6 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse13 (= ~p_dw_st~0 0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (<= ~p_num_write~0 1)) (.cse5 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse7 (= ~q_free~0 1)) (.cse12 (<= 1 ~p_num_write~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (= ~c_num_read~0 1) .cse2 .cse3 .cse4 .cse11 .cse6 .cse7 .cse12) (and .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse12 .cse8 .cse9))) [2020-11-28 02:56:43,232 INFO L274 CegarLoopResult]: For program point L98(lines 98 106) no Hoare annotation was computed. [2020-11-28 02:56:43,232 INFO L270 CegarLoopResult]: At program point L65(lines 49 67) the Hoare annotation is: (let ((.cse17 (+ ~c_num_read~0 1))) (let ((.cse3 (= ~p_dw_pc~0 1)) (.cse9 (= ~c_dr_pc~0 1)) (.cse6 (= ~q_read_ev~0 2)) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse8 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse0 (= ~q_free~0 0)) (.cse10 (= ~p_dw_pc~0 0)) (.cse11 (<= .cse17 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 .cse17)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (<= ~p_num_write~0 1)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse15 (<= 1 ~p_num_write~0)) (.cse1 (= ~c_dr_st~0 2)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse16 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse1 .cse12 .cse2 .cse13 .cse14 .cse15) (and .cse0 .cse11 .cse6 .cse1 .cse12 .cse2 .cse3 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse7 .cse4 .cse14 .cse8 .cse5) (and .cse6 (= ~c_dr_st~0 0) .cse7 .cse4 .cse8 .cse5 .cse16 .cse0 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14 .cse15) (and .cse1 .cse4 .cse5 .cse16)))) [2020-11-28 02:56:43,232 INFO L270 CegarLoopResult]: At program point L65-1(lines 49 67) the Hoare annotation is: (let ((.cse1 (= ~p_dw_st~0 0)) (.cse11 (= ~c_num_read~0 1)) (.cse12 (<= ~p_num_write~0 1)) (.cse13 (<= 1 ~p_num_write~0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse0 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse15 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse6 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse10 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse4 .cse12 .cse6 .cse7 .cse13 .cse8) (and .cse14 .cse11 .cse2 .cse3 .cse4 .cse12 .cse15 .cse7 .cse13) (and .cse14 .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-11-28 02:56:43,232 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-11-28 02:56:43,233 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-28 02:56:43,233 INFO L270 CegarLoopResult]: At program point L280(lines 232 285) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse0 .cse2 .cse13 .cse7) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-11-28 02:56:43,234 INFO L270 CegarLoopResult]: At program point L264(lines 239 279) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse0 .cse2 .cse13 .cse7) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-11-28 02:56:43,234 INFO L274 CegarLoopResult]: For program point L198(lines 198 202) no Hoare annotation was computed. [2020-11-28 02:56:43,234 INFO L274 CegarLoopResult]: For program point L198-2(lines 197 210) no Hoare annotation was computed. [2020-11-28 02:56:43,234 INFO L274 CegarLoopResult]: For program point L34(lines 34 43) no Hoare annotation was computed. [2020-11-28 02:56:43,234 INFO L274 CegarLoopResult]: For program point L34-2(lines 34 43) no Hoare annotation was computed. [2020-11-28 02:56:43,234 INFO L274 CegarLoopResult]: For program point L34-3(lines 34 43) no Hoare annotation was computed. [2020-11-28 02:56:43,234 INFO L274 CegarLoopResult]: For program point L34-5(lines 34 43) no Hoare annotation was computed. [2020-11-28 02:56:43,236 INFO L270 CegarLoopResult]: At program point L348(lines 334 350) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~q_read_ev~0 2) (<= ~p_num_write~0 ~c_num_read~0) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (not (= ~q_write_ev~0 1)) (<= ~c_num_read~0 ~p_num_write~0) (= ~c_num_read~0 0)) [2020-11-28 02:56:43,237 INFO L270 CegarLoopResult]: At program point L315-1(lines 194 327) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-11-28 02:56:43,237 INFO L270 CegarLoopResult]: At program point L249(lines 239 279) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-11-28 02:56:43,237 INFO L274 CegarLoopResult]: For program point L216(lines 216 226) no Hoare annotation was computed. [2020-11-28 02:56:43,238 INFO L274 CegarLoopResult]: For program point L216-1(lines 216 226) no Hoare annotation was computed. [2020-11-28 02:56:43,238 INFO L274 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2020-11-28 02:56:43,238 INFO L270 CegarLoopResult]: At program point L84-2(lines 68 92) the Hoare annotation is: (let ((.cse19 (+ ~c_num_read~0 1))) (let ((.cse2 (= ~q_read_ev~0 2)) (.cse6 (= ~c_dr_st~0 0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse1 (<= .cse19 ~p_num_write~0)) (.cse3 (<= ~p_num_write~0 .cse19)) (.cse15 (<= ~p_num_write~0 1)) (.cse17 (<= 1 ~p_num_write~0)) (.cse9 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse11 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse12 (= ~c_dr_pc~0 0)) (.cse5 (= ~p_dw_pc~0 1)) (.cse0 (= ~q_free~0 0)) (.cse13 (= ~p_dw_pc~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse18 (= ~c_dr_st~0 2)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse10 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse2 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse0 .cse13 .cse14 .cse1 .cse3 .cse4 .cse15 .cse16 .cse17) (and .cse2 .cse8 .cse6 .cse10 .cse7 .cse0 .cse13 .cse1 .cse3 .cse4 .cse15 .cse16 .cse17) (and .cse14 .cse18 .cse9 .cse11 .cse12) (and .cse0 .cse14 .cse18 .cse4 .cse5) (and .cse0 .cse13 .cse14 .cse18 .cse4 .cse8 .cse16 .cse10)))) [2020-11-28 02:56:43,238 INFO L274 CegarLoopResult]: For program point L84-3(lines 84 88) no Hoare annotation was computed. [2020-11-28 02:56:43,238 INFO L270 CegarLoopResult]: At program point L84-5(lines 68 92) the Hoare annotation is: (let ((.cse9 (= ~p_dw_st~0 0)) (.cse4 (<= ~p_num_write~0 1)) (.cse7 (<= 1 ~p_num_write~0)) (.cse0 (= 2 ~p_dw_st~0)) (.cse8 (<= ~p_num_write~0 ~c_num_read~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~p_dw_pc~0 1)) (.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse6 (= ~q_free~0 1)) (.cse10 (not (= ~q_write_ev~0 1))) (.cse11 (<= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= ~c_dr_pc~0 1))) (or (and .cse0 (= ~c_num_read~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse1 .cse2 .cse3 .cse6 .cse10 .cse11 .cse12) (and .cse9 .cse8 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse10 .cse11) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse6 .cse10 .cse11 .cse12))) [2020-11-28 02:56:43,239 INFO L274 CegarLoopResult]: For program point L101(lines 101 105) no Hoare annotation was computed. [2020-11-28 02:56:43,239 INFO L274 CegarLoopResult]: For program point L35(lines 35 40) no Hoare annotation was computed. [2020-11-28 02:56:43,239 INFO L274 CegarLoopResult]: For program point L35-1(lines 35 40) no Hoare annotation was computed. [2020-11-28 02:56:43,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:56:43 BoogieIcfgContainer [2020-11-28 02:56:43,311 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 02:56:43,312 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 02:56:43,312 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 02:56:43,312 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 02:56:43,313 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:28" (3/4) ... [2020-11-28 02:56:43,316 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-28 02:56:43,329 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-11-28 02:56:43,330 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-11-28 02:56:43,331 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-28 02:56:43,332 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-28 02:56:43,358 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-28 02:56:43,359 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-28 02:56:43,359 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-28 02:56:43,359 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-28 02:56:43,360 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-28 02:56:43,360 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-28 02:56:43,360 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-28 02:56:43,361 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-28 02:56:43,361 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-28 02:56:43,361 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-28 02:56:43,362 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((((((((p_dw_pc == 0 && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((q_free == 0 && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((((q_free == 0 && p_dw_pc == 0) && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0)) || (((((((((q_free == 0 && p_dw_pc == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1)) || (((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1) [2020-11-28 02:56:43,362 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) || (((((((p_dw_pc == 0 && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write == 0) && c_dr_pc == 0) && !(q_write_ev == 1)) && c_num_read == 0)) || (((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_last_write == q_buf_0) && p_num_write == 0) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((c_dr_st == 2 && q_read_ev == 2) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-11-28 02:56:43,363 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && c_dr_pc == 0) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_dr_pc == 1)) || (((((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && q_read_ev == 2) && p_last_write == q_buf_0) && __retres1 == 0) && p_num_write <= 1) && 1 <= p_num_write) && c_num_read == 0) && c_dr_pc == 1)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && p_dw_pc == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write <= 1) && __retres1 == 0) && 1 <= p_num_write) && c_dr_pc == 0) && c_num_read == 0) [2020-11-28 02:56:43,364 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((q_free == 0 && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && __retres1 == 0) && p_num_write <= 1) && 0 == \result) && 1 <= p_num_write) && c_dr_pc == 1) || (((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && 0 == \result) && c_dr_pc == 1)) || ((((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0)) || (((((((((((q_free == 0 && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && __retres1 == 0) && c_dr_st == 0) && p_num_write <= 1) && 0 == \result) && c_dr_pc == 0) && 1 <= p_num_write)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0) [2020-11-28 02:56:43,364 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && c_dr_pc == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read <= p_num_write)) || (((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_last_read == p_last_write) && p_num_write <= 1) && 0 == \result) && q_free == 1) && 1 <= p_num_write) [2020-11-28 02:56:43,364 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((c_dr_st == 2 && __retres1 == 0) && c_dr_pc == 0) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1)) || (((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && tmp == 0) && 0 == \result)) || ((((q_free == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0)) || (((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write) [2020-11-28 02:56:43,365 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((q_free == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && \result == 0) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1)) || ((((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && tmp == 0) && 0 == \result) && \result == 0)) || ((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0) [2020-11-28 02:56:43,365 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((p_num_write <= c_num_read && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && \result == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((c_num_read == 1 && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_last_read == p_last_write) && p_num_write <= 1) && \result == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && tmp == 0) && q_free == 1) && 1 <= p_num_write)) || (((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && tmp == 0) && \result == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-11-28 02:56:43,365 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && c_dr_pc == 1) || (((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && c_dr_st == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || ((((q_free == 0 && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1)) || (((((((q_free == 0 && p_dw_pc == 0) && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && tmp == 0) && 0 == \result) [2020-11-28 02:56:43,435 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_962484bc-242f-408f-a23f-77048643a1f2/bin/uautomizer/witness.graphml [2020-11-28 02:56:43,435 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 02:56:43,436 INFO L168 Benchmark]: Toolchain (without parser) took 15885.39 ms. Allocated memory was 109.1 MB in the beginning and 232.8 MB in the end (delta: 123.7 MB). Free memory was 81.3 MB in the beginning and 203.5 MB in the end (delta: -122.2 MB). Peak memory consumption was 135.6 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:43,437 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 109.1 MB. Free memory is still 66.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 02:56:43,437 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.50 ms. Allocated memory was 109.1 MB in the beginning and 132.1 MB in the end (delta: 23.1 MB). Free memory was 81.3 MB in the beginning and 106.4 MB in the end (delta: -25.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:43,438 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.78 ms. Allocated memory is still 132.1 MB. Free memory was 106.4 MB in the beginning and 104.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:43,438 INFO L168 Benchmark]: Boogie Preprocessor took 29.49 ms. Allocated memory is still 132.1 MB. Free memory was 104.3 MB in the beginning and 102.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:43,438 INFO L168 Benchmark]: RCFGBuilder took 818.94 ms. Allocated memory is still 132.1 MB. Free memory was 102.7 MB in the beginning and 76.5 MB in the end (delta: 26.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:43,439 INFO L168 Benchmark]: TraceAbstraction took 14440.54 ms. Allocated memory was 132.1 MB in the beginning and 232.8 MB in the end (delta: 100.7 MB). Free memory was 76.5 MB in the beginning and 74.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 111.4 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:43,439 INFO L168 Benchmark]: Witness Printer took 123.46 ms. Allocated memory is still 232.8 MB. Free memory was 74.9 MB in the beginning and 203.5 MB in the end (delta: -128.5 MB). Peak memory consumption was 4.7 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:43,443 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 109.1 MB. Free memory is still 66.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 418.50 ms. Allocated memory was 109.1 MB in the beginning and 132.1 MB in the end (delta: 23.1 MB). Free memory was 81.3 MB in the beginning and 106.4 MB in the end (delta: -25.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 44.78 ms. Allocated memory is still 132.1 MB. Free memory was 106.4 MB in the beginning and 104.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 29.49 ms. Allocated memory is still 132.1 MB. Free memory was 104.3 MB in the beginning and 102.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 818.94 ms. Allocated memory is still 132.1 MB. Free memory was 102.7 MB in the beginning and 76.5 MB in the end (delta: 26.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14440.54 ms. Allocated memory was 132.1 MB in the beginning and 232.8 MB in the end (delta: 100.7 MB). Free memory was 76.5 MB in the beginning and 74.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 111.4 MB. Max. memory is 16.1 GB. * Witness Printer took 123.46 ms. Allocated memory is still 232.8 MB. Free memory was 74.9 MB in the beginning and 203.5 MB in the end (delta: -128.5 MB). Peak memory consumption was 4.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) || (((((((p_dw_pc == 0 && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write == 0) && c_dr_pc == 0) && !(q_write_ev == 1)) && c_num_read == 0)) || (((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_last_write == q_buf_0) && p_num_write == 0) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((c_dr_st == 2 && q_read_ev == 2) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: ((((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && tmp == 0) && q_free == 1) && 1 <= p_num_write) || ((((((((p_num_write <= c_num_read && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((((p_dw_st == 0 && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read <= p_num_write)) || (((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && tmp == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && c_dr_pc == 1) || (((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && c_dr_st == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || ((((q_free == 0 && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1)) || (((((((q_free == 0 && p_dw_pc == 0) && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && tmp == 0) && 0 == \result) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((((p_num_write <= c_num_read && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && \result == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((c_num_read == 1 && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_last_read == p_last_write) && p_num_write <= 1) && \result == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && tmp == 0) && q_free == 1) && 1 <= p_num_write)) || (((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && tmp == 0) && \result == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((((((((((q_free == 0 && 2 == p_dw_st) && q_read_ev == 2) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && c_dr_pc == 0) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read == 0) || (((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && tmp == 0) && q_free == 1) && c_num_read <= p_num_write)) || ((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((((((q_read_ev == 2 && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write)) || ((((((((p_dw_pc == 0 && q_read_ev == 2) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read == 0) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((q_free == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && \result == 0) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1)) || ((((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && tmp == 0) && 0 == \result) && \result == 0)) || ((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((((((((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((((((((p_dw_pc == 0 && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((q_free == 0 && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((((q_free == 0 && p_dw_pc == 0) && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0)) || (((((((((q_free == 0 && p_dw_pc == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1)) || (((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && c_dr_pc == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read <= p_num_write)) || ((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_last_read == p_last_write) && p_num_write <= 1) && q_free == 1) && 1 <= p_num_write) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && c_dr_pc == 0) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_dr_pc == 1)) || (((((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && q_read_ev == 2) && p_last_write == q_buf_0) && __retres1 == 0) && p_num_write <= 1) && 1 <= p_num_write) && c_num_read == 0) && c_dr_pc == 1)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && p_dw_pc == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write <= 1) && __retres1 == 0) && 1 <= p_num_write) && c_dr_pc == 0) && c_num_read == 0) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 1)) && c_dr_pc == 1 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: ((((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && tmp == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && tmp == 0) && q_free == 1) && 1 <= p_num_write)) || (((((((((p_num_write <= c_num_read && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((p_dw_st == 0 && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && __retres1 == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read <= p_num_write) - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: ((((((c_dr_st == 2 && __retres1 == 0) && c_dr_pc == 0) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1)) || (((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && tmp == 0) && 0 == \result)) || ((((q_free == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0)) || (((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write) - InvariantResult [Line: 305]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 334]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && c_dr_pc == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read <= p_num_write)) || (((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_last_read == p_last_write) && p_num_write <= 1) && 0 == \result) && q_free == 1) && 1 <= p_num_write) - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((q_free == 0 && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && __retres1 == 0) && p_num_write <= 1) && 0 == \result) && 1 <= p_num_write) && c_dr_pc == 1) || (((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && 0 == \result) && c_dr_pc == 1)) || ((((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0)) || (((((((((((q_free == 0 && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && __retres1 == 0) && c_dr_st == 0) && p_num_write <= 1) && 0 == \result) && c_dr_pc == 0) && 1 <= p_num_write)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0) - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.3s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2052 SDtfs, 1724 SDslu, 2161 SDs, 0 SdLazy, 206 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=633occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 1368 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 27 PreInvPairs, 241 NumberOfFragments, 5152 HoareAnnotationTreeSize, 27 FomulaSimplifications, 69970 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 27 FomulaSimplificationsInter, 11166 FormulaSimplificationTreeSizeReductionInter, 8.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1162 NumberOfCodeBlocks, 1162 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1144 ConstructedInterpolants, 0 QuantifiedInterpolants, 199170 SizeOfPredicates, 2 NumberOfNonLiveVariables, 218 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 280/284 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...