./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa63abe8d244d72d8b78f82e911235dbe511cfc8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 03:19:57,058 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 03:19:57,059 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 03:19:57,065 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 03:19:57,065 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 03:19:57,066 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 03:19:57,067 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 03:19:57,068 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 03:19:57,069 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 03:19:57,070 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 03:19:57,071 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 03:19:57,071 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 03:19:57,072 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 03:19:57,072 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 03:19:57,073 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 03:19:57,074 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 03:19:57,074 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 03:19:57,076 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 03:19:57,077 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 03:19:57,078 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 03:19:57,078 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 03:19:57,079 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 03:19:57,081 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 03:19:57,081 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 03:19:57,081 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 03:19:57,082 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 03:19:57,082 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 03:19:57,083 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 03:19:57,083 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 03:19:57,084 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 03:19:57,084 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 03:19:57,085 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 03:19:57,085 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 03:19:57,085 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 03:19:57,086 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 03:19:57,086 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 03:19:57,086 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 03:19:57,094 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 03:19:57,094 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 03:19:57,095 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 03:19:57,095 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 03:19:57,095 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 03:19:57,095 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 03:19:57,096 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 03:19:57,096 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 03:19:57,096 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 03:19:57,096 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 03:19:57,096 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 03:19:57,096 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 03:19:57,096 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 03:19:57,097 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 03:19:57,097 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 03:19:57,097 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 03:19:57,097 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 03:19:57,097 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 03:19:57,098 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 03:19:57,098 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 03:19:57,098 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 03:19:57,098 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 03:19:57,098 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 03:19:57,098 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 03:19:57,098 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 03:19:57,098 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 03:19:57,099 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 03:19:57,099 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 03:19:57,099 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 03:19:57,099 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 03:19:57,099 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 03:19:57,099 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 03:19:57,099 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 03:19:57,100 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 03:19:57,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 03:19:57,100 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 03:19:57,100 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> aa63abe8d244d72d8b78f82e911235dbe511cfc8 [2018-12-03 03:19:57,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 03:19:57,132 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 03:19:57,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 03:19:57,136 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 03:19:57,136 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 03:19:57,137 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan/../../sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-12-03 03:19:57,181 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan/data/62ac2b68f/ca032fb6d58c4c40a021a2dada581939/FLAG5efb63d01 [2018-12-03 03:19:57,575 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 03:19:57,576 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-12-03 03:19:57,580 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan/data/62ac2b68f/ca032fb6d58c4c40a021a2dada581939/FLAG5efb63d01 [2018-12-03 03:19:57,588 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan/data/62ac2b68f/ca032fb6d58c4c40a021a2dada581939 [2018-12-03 03:19:57,589 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 03:19:57,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 03:19:57,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 03:19:57,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 03:19:57,594 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 03:19:57,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 03:19:57" (1/1) ... [2018-12-03 03:19:57,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15ed00b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:19:57, skipping insertion in model container [2018-12-03 03:19:57,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 03:19:57" (1/1) ... [2018-12-03 03:19:57,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 03:19:57,618 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 03:19:57,718 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 03:19:57,721 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 03:19:57,739 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 03:19:57,749 INFO L195 MainTranslator]: Completed translation [2018-12-03 03:19:57,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:19:57 WrapperNode [2018-12-03 03:19:57,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 03:19:57,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 03:19:57,750 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 03:19:57,750 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 03:19:57,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:19:57" (1/1) ... [2018-12-03 03:19:57,762 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:19:57" (1/1) ... [2018-12-03 03:19:57,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 03:19:57,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 03:19:57,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 03:19:57,768 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 03:19:57,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:19:57" (1/1) ... [2018-12-03 03:19:57,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:19:57" (1/1) ... [2018-12-03 03:19:57,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:19:57" (1/1) ... [2018-12-03 03:19:57,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:19:57" (1/1) ... [2018-12-03 03:19:57,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:19:57" (1/1) ... [2018-12-03 03:19:57,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:19:57" (1/1) ... [2018-12-03 03:19:57,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:19:57" (1/1) ... [2018-12-03 03:19:57,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 03:19:57,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 03:19:57,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 03:19:57,822 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 03:19:57,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:19:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan/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 [2018-12-03 03:19:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-12-03 03:19:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-12-03 03:19:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-12-03 03:19:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-12-03 03:19:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 03:19:57,856 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 03:19:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2018-12-03 03:19:57,856 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2018-12-03 03:19:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-12-03 03:19:57,856 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-12-03 03:19:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2018-12-03 03:19:57,856 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2018-12-03 03:19:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 03:19:57,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 03:19:57,856 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-12-03 03:19:57,856 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-12-03 03:19:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-12-03 03:19:57,857 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-12-03 03:19:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2018-12-03 03:19:57,857 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2018-12-03 03:19:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-12-03 03:19:57,857 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-12-03 03:19:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 03:19:57,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 03:19:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2018-12-03 03:19:57,857 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2018-12-03 03:19:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2018-12-03 03:19:57,857 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2018-12-03 03:19:57,857 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-12-03 03:19:57,858 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-12-03 03:19:58,049 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 03:19:58,050 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-03 03:19:58,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:19:58 BoogieIcfgContainer [2018-12-03 03:19:58,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 03:19:58,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 03:19:58,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 03:19:58,054 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 03:19:58,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 03:19:57" (1/3) ... [2018-12-03 03:19:58,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d02d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:19:58, skipping insertion in model container [2018-12-03 03:19:58,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:19:57" (2/3) ... [2018-12-03 03:19:58,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25d02d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:19:58, skipping insertion in model container [2018-12-03 03:19:58,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:19:58" (3/3) ... [2018-12-03 03:19:58,057 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-12-03 03:19:58,065 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 03:19:58,071 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 03:19:58,086 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 03:19:58,112 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 03:19:58,112 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 03:19:58,112 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 03:19:58,112 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 03:19:58,113 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 03:19:58,113 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 03:19:58,113 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 03:19:58,113 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 03:19:58,124 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2018-12-03 03:19:58,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 03:19:58,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:19:58,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:19:58,131 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:19:58,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:19:58,134 INFO L82 PathProgramCache]: Analyzing trace with hash 489843548, now seen corresponding path program 1 times [2018-12-03 03:19:58,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:19:58,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:19:58,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:19:58,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:19:58,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:19:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:19:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:19:58,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:19:58,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:19:58,277 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:19:58,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:19:58,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:19:58,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:19:58,289 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 3 states. [2018-12-03 03:19:58,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:19:58,334 INFO L93 Difference]: Finished difference Result 279 states and 395 transitions. [2018-12-03 03:19:58,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:19:58,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-03 03:19:58,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:19:58,343 INFO L225 Difference]: With dead ends: 279 [2018-12-03 03:19:58,343 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 03:19:58,346 INFO L631 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 [2018-12-03 03:19:58,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 03:19:58,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2018-12-03 03:19:58,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-03 03:19:58,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2018-12-03 03:19:58,382 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 65 [2018-12-03 03:19:58,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:19:58,382 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2018-12-03 03:19:58,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:19:58,382 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2018-12-03 03:19:58,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 03:19:58,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:19:58,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:19:58,385 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:19:58,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:19:58,385 INFO L82 PathProgramCache]: Analyzing trace with hash 343031424, now seen corresponding path program 1 times [2018-12-03 03:19:58,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:19:58,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:19:58,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:19:58,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:19:58,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:19:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:19:58,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:19:58,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:19:58,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 03:19:58,455 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:19:58,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:19:58,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:19:58,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:19:58,457 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 4 states. [2018-12-03 03:19:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:19:58,574 INFO L93 Difference]: Finished difference Result 469 states and 653 transitions. [2018-12-03 03:19:58,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:19:58,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-03 03:19:58,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:19:58,577 INFO L225 Difference]: With dead ends: 469 [2018-12-03 03:19:58,577 INFO L226 Difference]: Without dead ends: 318 [2018-12-03 03:19:58,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:19:58,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-03 03:19:58,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2018-12-03 03:19:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-12-03 03:19:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 411 transitions. [2018-12-03 03:19:58,603 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 411 transitions. Word has length 66 [2018-12-03 03:19:58,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:19:58,603 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 411 transitions. [2018-12-03 03:19:58,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:19:58,604 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 411 transitions. [2018-12-03 03:19:58,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 03:19:58,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:19:58,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:19:58,607 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:19:58,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:19:58,607 INFO L82 PathProgramCache]: Analyzing trace with hash 229644767, now seen corresponding path program 1 times [2018-12-03 03:19:58,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:19:58,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:19:58,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:19:58,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:19:58,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:19:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:19:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:19:58,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:19:58,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:19:58,659 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:19:58,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:19:58,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:19:58,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:19:58,660 INFO L87 Difference]: Start difference. First operand 314 states and 411 transitions. Second operand 6 states. [2018-12-03 03:19:58,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:19:58,692 INFO L93 Difference]: Finished difference Result 575 states and 767 transitions. [2018-12-03 03:19:58,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 03:19:58,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-03 03:19:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:19:58,694 INFO L225 Difference]: With dead ends: 575 [2018-12-03 03:19:58,694 INFO L226 Difference]: Without dead ends: 324 [2018-12-03 03:19:58,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 03:19:58,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-12-03 03:19:58,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2018-12-03 03:19:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-12-03 03:19:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 417 transitions. [2018-12-03 03:19:58,712 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 417 transitions. Word has length 66 [2018-12-03 03:19:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:19:58,713 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 417 transitions. [2018-12-03 03:19:58,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:19:58,713 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 417 transitions. [2018-12-03 03:19:58,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 03:19:58,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:19:58,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:19:58,714 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:19:58,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:19:58,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1490517977, now seen corresponding path program 1 times [2018-12-03 03:19:58,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:19:58,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:19:58,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:19:58,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:19:58,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:19:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:19:58,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:19:58,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:19:58,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 03:19:58,738 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:19:58,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:19:58,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:19:58,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:19:58,739 INFO L87 Difference]: Start difference. First operand 324 states and 417 transitions. Second operand 4 states. [2018-12-03 03:19:58,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:19:58,810 INFO L93 Difference]: Finished difference Result 585 states and 748 transitions. [2018-12-03 03:19:58,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:19:58,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-03 03:19:58,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:19:58,813 INFO L225 Difference]: With dead ends: 585 [2018-12-03 03:19:58,813 INFO L226 Difference]: Without dead ends: 278 [2018-12-03 03:19:58,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:19:58,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-03 03:19:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-12-03 03:19:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-03 03:19:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 349 transitions. [2018-12-03 03:19:58,832 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 349 transitions. Word has length 66 [2018-12-03 03:19:58,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:19:58,832 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 349 transitions. [2018-12-03 03:19:58,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:19:58,833 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 349 transitions. [2018-12-03 03:19:58,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 03:19:58,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:19:58,834 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:19:58,834 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:19:58,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:19:58,835 INFO L82 PathProgramCache]: Analyzing trace with hash -791423587, now seen corresponding path program 1 times [2018-12-03 03:19:58,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:19:58,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:19:58,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:19:58,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:19:58,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:19:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:19:58,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:19:58,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:19:58,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:19:58,893 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:19:58,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:19:58,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:19:58,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:19:58,894 INFO L87 Difference]: Start difference. First operand 278 states and 349 transitions. Second operand 6 states. [2018-12-03 03:19:59,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:19:59,219 INFO L93 Difference]: Finished difference Result 850 states and 1130 transitions. [2018-12-03 03:19:59,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 03:19:59,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-03 03:19:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:19:59,222 INFO L225 Difference]: With dead ends: 850 [2018-12-03 03:19:59,223 INFO L226 Difference]: Without dead ends: 589 [2018-12-03 03:19:59,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-03 03:19:59,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-12-03 03:19:59,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 577. [2018-12-03 03:19:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-12-03 03:19:59,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 713 transitions. [2018-12-03 03:19:59,260 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 713 transitions. Word has length 66 [2018-12-03 03:19:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:19:59,261 INFO L480 AbstractCegarLoop]: Abstraction has 577 states and 713 transitions. [2018-12-03 03:19:59,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:19:59,261 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 713 transitions. [2018-12-03 03:19:59,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 03:19:59,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:19:59,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:19:59,262 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:19:59,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:19:59,262 INFO L82 PathProgramCache]: Analyzing trace with hash -2070748322, now seen corresponding path program 1 times [2018-12-03 03:19:59,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:19:59,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:19:59,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:19:59,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:19:59,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:19:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:19:59,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:19:59,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:19:59,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 03:19:59,299 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:19:59,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:19:59,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:19:59,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:19:59,300 INFO L87 Difference]: Start difference. First operand 577 states and 713 transitions. Second operand 6 states. [2018-12-03 03:19:59,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:19:59,354 INFO L93 Difference]: Finished difference Result 1140 states and 1459 transitions. [2018-12-03 03:19:59,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 03:19:59,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-03 03:19:59,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:19:59,358 INFO L225 Difference]: With dead ends: 1140 [2018-12-03 03:19:59,358 INFO L226 Difference]: Without dead ends: 616 [2018-12-03 03:19:59,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 03:19:59,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-12-03 03:19:59,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 604. [2018-12-03 03:19:59,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-12-03 03:19:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 735 transitions. [2018-12-03 03:19:59,388 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 735 transitions. Word has length 66 [2018-12-03 03:19:59,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:19:59,388 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 735 transitions. [2018-12-03 03:19:59,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:19:59,388 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 735 transitions. [2018-12-03 03:19:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 03:19:59,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:19:59,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:19:59,390 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:19:59,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:19:59,391 INFO L82 PathProgramCache]: Analyzing trace with hash -295740960, now seen corresponding path program 1 times [2018-12-03 03:19:59,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:19:59,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:19:59,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:19:59,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:19:59,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:19:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:19:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:19:59,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:19:59,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 03:19:59,456 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:19:59,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:19:59,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:19:59,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:19:59,456 INFO L87 Difference]: Start difference. First operand 604 states and 735 transitions. Second operand 4 states. [2018-12-03 03:19:59,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:19:59,561 INFO L93 Difference]: Finished difference Result 842 states and 1059 transitions. [2018-12-03 03:19:59,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:19:59,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-03 03:19:59,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:19:59,565 INFO L225 Difference]: With dead ends: 842 [2018-12-03 03:19:59,565 INFO L226 Difference]: Without dead ends: 839 [2018-12-03 03:19:59,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:19:59,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-12-03 03:19:59,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 675. [2018-12-03 03:19:59,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-12-03 03:19:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 829 transitions. [2018-12-03 03:19:59,605 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 829 transitions. Word has length 66 [2018-12-03 03:19:59,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:19:59,606 INFO L480 AbstractCegarLoop]: Abstraction has 675 states and 829 transitions. [2018-12-03 03:19:59,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:19:59,606 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 829 transitions. [2018-12-03 03:19:59,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 03:19:59,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:19:59,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:19:59,607 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:19:59,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:19:59,608 INFO L82 PathProgramCache]: Analyzing trace with hash -578339491, now seen corresponding path program 1 times [2018-12-03 03:19:59,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:19:59,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:19:59,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:19:59,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:19:59,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:19:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:19:59,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:19:59,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:19:59,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:19:59,646 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:19:59,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:19:59,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:19:59,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:19:59,647 INFO L87 Difference]: Start difference. First operand 675 states and 829 transitions. Second operand 3 states. [2018-12-03 03:19:59,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:19:59,695 INFO L93 Difference]: Finished difference Result 1249 states and 1576 transitions. [2018-12-03 03:19:59,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:19:59,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-03 03:19:59,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:19:59,699 INFO L225 Difference]: With dead ends: 1249 [2018-12-03 03:19:59,699 INFO L226 Difference]: Without dead ends: 655 [2018-12-03 03:19:59,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:19:59,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-12-03 03:19:59,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 567. [2018-12-03 03:19:59,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-12-03 03:19:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 677 transitions. [2018-12-03 03:19:59,733 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 677 transitions. Word has length 67 [2018-12-03 03:19:59,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:19:59,733 INFO L480 AbstractCegarLoop]: Abstraction has 567 states and 677 transitions. [2018-12-03 03:19:59,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:19:59,733 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 677 transitions. [2018-12-03 03:19:59,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 03:19:59,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:19:59,735 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:19:59,735 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:19:59,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:19:59,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1082734469, now seen corresponding path program 1 times [2018-12-03 03:19:59,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:19:59,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:19:59,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:19:59,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:19:59,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:19:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:19:59,799 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 03:19:59,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:19:59,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:19:59,800 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2018-12-03 03:19:59,802 INFO L205 CegarAbsIntRunner]: [0], [3], [12], [13], [16], [22], [26], [27], [66], [69], [71], [76], [79], [82], [86], [87], [88], [100], [109], [112], [115], [121], [127], [134], [137], [149], [152], [155], [163], [164], [165], [175], [177], [193], [203], [205], [207], [208], [209], [212], [214], [217], [228], [232], [234], [238], [240], [243], [248], [258], [259], [260], [261], [262], [263], [267], [268], [269], [270], [273], [274], [277], [278], [279], [280], [281], [285], [286], [287], [289], [290], [291] [2018-12-03 03:19:59,830 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:19:59,830 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:19:59,998 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 03:19:59,998 INFO L272 AbstractInterpreter]: Visited 42 different actions 54 times. Merged at 7 different actions 7 times. Never widened. Performed 530 root evaluator evaluations with a maximum evaluation depth of 3. Performed 530 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-12-03 03:20:00,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:20:00,004 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 03:20:00,153 INFO L227 lantSequenceWeakener]: Weakened 55 states. On average, predicates are now at 70.68% of their original sizes. [2018-12-03 03:20:00,153 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 03:20:00,342 INFO L418 sIntCurrentIteration]: We unified 86 AI predicates to 86 [2018-12-03 03:20:00,342 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 03:20:00,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 03:20:00,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [6] total 25 [2018-12-03 03:20:00,343 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:20:00,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 03:20:00,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 03:20:00,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-12-03 03:20:00,344 INFO L87 Difference]: Start difference. First operand 567 states and 677 transitions. Second operand 21 states. [2018-12-03 03:20:01,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:20:01,536 INFO L93 Difference]: Finished difference Result 1058 states and 1276 transitions. [2018-12-03 03:20:01,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 03:20:01,536 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2018-12-03 03:20:01,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:20:01,538 INFO L225 Difference]: With dead ends: 1058 [2018-12-03 03:20:01,539 INFO L226 Difference]: Without dead ends: 506 [2018-12-03 03:20:01,541 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 99 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 03:20:01,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-12-03 03:20:01,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 498. [2018-12-03 03:20:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-12-03 03:20:01,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 588 transitions. [2018-12-03 03:20:01,567 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 588 transitions. Word has length 87 [2018-12-03 03:20:01,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:20:01,568 INFO L480 AbstractCegarLoop]: Abstraction has 498 states and 588 transitions. [2018-12-03 03:20:01,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 03:20:01,568 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 588 transitions. [2018-12-03 03:20:01,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 03:20:01,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:20:01,569 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:20:01,569 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:20:01,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:20:01,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1369387122, now seen corresponding path program 1 times [2018-12-03 03:20:01,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:20:01,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:20:01,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:20:01,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:20:01,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:20:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:20:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 03:20:01,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:20:01,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:20:01,633 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2018-12-03 03:20:01,633 INFO L205 CegarAbsIntRunner]: [0], [3], [12], [13], [16], [22], [26], [27], [34], [50], [54], [57], [59], [61], [65], [66], [69], [71], [74], [76], [79], [84], [86], [87], [88], [100], [109], [112], [115], [121], [124], [134], [137], [149], [159], [161], [163], [164], [165], [175], [177], [193], [196], [199], [203], [205], [207], [208], [209], [212], [228], [236], [238], [240], [243], [248], [259], [260], [261], [262], [263], [265], [266], [267], [268], [269], [270], [273], [274], [275], [276], [277], [279], [280], [281], [285], [286], [287], [289], [290], [291] [2018-12-03 03:20:01,635 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:20:01,635 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:20:01,666 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 03:20:01,666 INFO L272 AbstractInterpreter]: Visited 79 different actions 103 times. Merged at 2 different actions 2 times. Never widened. Performed 672 root evaluator evaluations with a maximum evaluation depth of 3. Performed 672 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-12-03 03:20:01,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:20:01,667 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 03:20:01,718 INFO L227 lantSequenceWeakener]: Weakened 95 states. On average, predicates are now at 81.95% of their original sizes. [2018-12-03 03:20:01,718 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 03:20:02,038 INFO L418 sIntCurrentIteration]: We unified 98 AI predicates to 98 [2018-12-03 03:20:02,038 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 03:20:02,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 03:20:02,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [6] total 42 [2018-12-03 03:20:02,038 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:20:02,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 03:20:02,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 03:20:02,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 03:20:02,039 INFO L87 Difference]: Start difference. First operand 498 states and 588 transitions. Second operand 38 states. [2018-12-03 03:20:04,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:20:04,372 INFO L93 Difference]: Finished difference Result 1061 states and 1307 transitions. [2018-12-03 03:20:04,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 03:20:04,372 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 99 [2018-12-03 03:20:04,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:20:04,373 INFO L225 Difference]: With dead ends: 1061 [2018-12-03 03:20:04,373 INFO L226 Difference]: Without dead ends: 656 [2018-12-03 03:20:04,375 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 122 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=350, Invalid=3432, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 03:20:04,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-12-03 03:20:04,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 622. [2018-12-03 03:20:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-12-03 03:20:04,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 746 transitions. [2018-12-03 03:20:04,395 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 746 transitions. Word has length 99 [2018-12-03 03:20:04,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:20:04,395 INFO L480 AbstractCegarLoop]: Abstraction has 622 states and 746 transitions. [2018-12-03 03:20:04,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 03:20:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 746 transitions. [2018-12-03 03:20:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 03:20:04,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:20:04,397 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:20:04,397 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:20:04,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:20:04,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1957952781, now seen corresponding path program 1 times [2018-12-03 03:20:04,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:20:04,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:20:04,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:20:04,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:20:04,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:20:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:20:04,458 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 03:20:04,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:20:04,459 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:20:04,459 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2018-12-03 03:20:04,459 INFO L205 CegarAbsIntRunner]: [0], [3], [12], [13], [16], [22], [26], [27], [34], [50], [54], [57], [59], [61], [65], [66], [69], [71], [74], [76], [79], [82], [86], [87], [88], [100], [109], [112], [115], [121], [124], [127], [134], [137], [149], [152], [155], [163], [164], [165], [175], [177], [193], [196], [199], [203], [205], [207], [208], [209], [212], [214], [217], [228], [232], [234], [238], [240], [243], [248], [258], [259], [260], [261], [262], [263], [265], [266], [267], [268], [269], [270], [273], [274], [275], [276], [277], [278], [279], [280], [281], [285], [286], [287], [289], [290], [291] [2018-12-03 03:20:04,460 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:20:04,460 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:20:04,524 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 03:20:04,525 INFO L272 AbstractInterpreter]: Visited 81 different actions 192 times. Merged at 23 different actions 25 times. Never widened. Performed 2390 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2390 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 36 variables. [2018-12-03 03:20:04,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:20:04,527 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 03:20:04,596 INFO L227 lantSequenceWeakener]: Weakened 105 states. On average, predicates are now at 80.54% of their original sizes. [2018-12-03 03:20:04,596 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 03:20:05,077 INFO L418 sIntCurrentIteration]: We unified 118 AI predicates to 118 [2018-12-03 03:20:05,077 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 03:20:05,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 03:20:05,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [44] imperfect sequences [8] total 50 [2018-12-03 03:20:05,078 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:20:05,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 03:20:05,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 03:20:05,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1731, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 03:20:05,079 INFO L87 Difference]: Start difference. First operand 622 states and 746 transitions. Second operand 44 states. [2018-12-03 03:20:09,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:20:09,257 INFO L93 Difference]: Finished difference Result 1089 states and 1334 transitions. [2018-12-03 03:20:09,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 03:20:09,257 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 119 [2018-12-03 03:20:09,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:20:09,260 INFO L225 Difference]: With dead ends: 1089 [2018-12-03 03:20:09,260 INFO L226 Difference]: Without dead ends: 583 [2018-12-03 03:20:09,263 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 149 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1547 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=502, Invalid=5048, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 03:20:09,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2018-12-03 03:20:09,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 557. [2018-12-03 03:20:09,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-12-03 03:20:09,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 653 transitions. [2018-12-03 03:20:09,296 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 653 transitions. Word has length 119 [2018-12-03 03:20:09,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:20:09,297 INFO L480 AbstractCegarLoop]: Abstraction has 557 states and 653 transitions. [2018-12-03 03:20:09,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 03:20:09,297 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 653 transitions. [2018-12-03 03:20:09,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 03:20:09,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:20:09,298 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:20:09,298 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:20:09,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:20:09,298 INFO L82 PathProgramCache]: Analyzing trace with hash -93324102, now seen corresponding path program 1 times [2018-12-03 03:20:09,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:20:09,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:20:09,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:20:09,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:20:09,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:20:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:20:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-03 03:20:09,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:20:09,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:20:09,370 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 121 with the following transitions: [2018-12-03 03:20:09,370 INFO L205 CegarAbsIntRunner]: [0], [3], [12], [13], [16], [22], [26], [27], [34], [50], [54], [57], [59], [61], [65], [66], [69], [71], [74], [76], [79], [82], [84], [86], [87], [88], [100], [109], [112], [115], [121], [124], [127], [134], [137], [149], [152], [155], [157], [161], [163], [164], [165], [175], [177], [193], [196], [199], [203], [205], [207], [208], [209], [212], [214], [217], [228], [232], [234], [238], [240], [243], [248], [258], [259], [260], [261], [262], [263], [265], [266], [267], [268], [269], [270], [273], [274], [275], [276], [277], [278], [279], [280], [281], [285], [286], [287], [289], [290], [291] [2018-12-03 03:20:09,371 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:20:09,371 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:20:09,449 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:20:09,450 INFO L272 AbstractInterpreter]: Visited 90 different actions 312 times. Merged at 31 different actions 51 times. Never widened. Performed 3258 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3258 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 4 different actions. Largest state had 36 variables. [2018-12-03 03:20:09,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:20:09,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:20:09,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:20:09,452 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 03:20:09,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:20:09,458 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:20:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:20:09,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:20:09,616 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 03:20:09,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:20:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-03 03:20:09,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:20:09,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 7] total 17 [2018-12-03 03:20:09,766 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:20:09,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 03:20:09,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 03:20:09,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-12-03 03:20:09,767 INFO L87 Difference]: Start difference. First operand 557 states and 653 transitions. Second operand 14 states. [2018-12-03 03:20:11,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:20:11,018 INFO L93 Difference]: Finished difference Result 1231 states and 1770 transitions. [2018-12-03 03:20:11,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 03:20:11,019 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2018-12-03 03:20:11,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:20:11,022 INFO L225 Difference]: With dead ends: 1231 [2018-12-03 03:20:11,022 INFO L226 Difference]: Without dead ends: 1228 [2018-12-03 03:20:11,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 240 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2018-12-03 03:20:11,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2018-12-03 03:20:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1181. [2018-12-03 03:20:11,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2018-12-03 03:20:11,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1684 transitions. [2018-12-03 03:20:11,076 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1684 transitions. Word has length 120 [2018-12-03 03:20:11,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:20:11,076 INFO L480 AbstractCegarLoop]: Abstraction has 1181 states and 1684 transitions. [2018-12-03 03:20:11,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 03:20:11,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1684 transitions. [2018-12-03 03:20:11,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 03:20:11,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:20:11,078 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:20:11,078 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:20:11,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:20:11,078 INFO L82 PathProgramCache]: Analyzing trace with hash -131156192, now seen corresponding path program 1 times [2018-12-03 03:20:11,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:20:11,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:20:11,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:20:11,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:20:11,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:20:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:20:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-12-03 03:20:11,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:20:11,133 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:20:11,133 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-12-03 03:20:11,134 INFO L205 CegarAbsIntRunner]: [0], [3], [12], [13], [16], [22], [26], [27], [34], [50], [54], [57], [59], [61], [65], [66], [69], [71], [74], [76], [79], [82], [84], [86], [87], [88], [100], [109], [112], [115], [121], [124], [127], [134], [137], [149], [152], [155], [159], [161], [163], [164], [165], [175], [177], [193], [196], [199], [203], [205], [207], [208], [209], [212], [214], [217], [228], [232], [234], [236], [238], [240], [243], [246], [248], [258], [259], [260], [261], [262], [263], [265], [266], [267], [268], [269], [270], [273], [274], [275], [276], [277], [278], [279], [280], [281], [285], [286], [287], [289], [290], [291] [2018-12-03 03:20:11,135 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:20:11,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:20:11,426 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:20:11,426 INFO L272 AbstractInterpreter]: Visited 92 different actions 1204 times. Merged at 44 different actions 355 times. Never widened. Performed 11457 root evaluator evaluations with a maximum evaluation depth of 3. Performed 11457 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 59 fixpoints after 11 different actions. Largest state had 36 variables. [2018-12-03 03:20:11,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:20:11,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:20:11,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:20:11,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 03:20:11,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:20:11,434 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:20:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:20:11,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:20:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 03:20:11,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:20:11,630 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-03 03:20:11,645 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 03:20:11,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [7] total 9 [2018-12-03 03:20:11,645 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:20:11,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:20:11,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:20:11,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 03:20:11,646 INFO L87 Difference]: Start difference. First operand 1181 states and 1684 transitions. Second operand 3 states. [2018-12-03 03:20:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:20:11,725 INFO L93 Difference]: Finished difference Result 1908 states and 2973 transitions. [2018-12-03 03:20:11,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:20:11,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-12-03 03:20:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:20:11,730 INFO L225 Difference]: With dead ends: 1908 [2018-12-03 03:20:11,731 INFO L226 Difference]: Without dead ends: 1157 [2018-12-03 03:20:11,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 290 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 03:20:11,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2018-12-03 03:20:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2018-12-03 03:20:11,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2018-12-03 03:20:11,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1648 transitions. [2018-12-03 03:20:11,789 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1648 transitions. Word has length 147 [2018-12-03 03:20:11,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:20:11,790 INFO L480 AbstractCegarLoop]: Abstraction has 1157 states and 1648 transitions. [2018-12-03 03:20:11,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:20:11,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1648 transitions. [2018-12-03 03:20:11,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-03 03:20:11,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:20:11,791 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:20:11,791 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:20:11,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:20:11,791 INFO L82 PathProgramCache]: Analyzing trace with hash 702795309, now seen corresponding path program 1 times [2018-12-03 03:20:11,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:20:11,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:20:11,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:20:11,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:20:11,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:20:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:20:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-03 03:20:11,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:20:11,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:20:11,841 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-12-03 03:20:11,841 INFO L205 CegarAbsIntRunner]: [0], [3], [12], [13], [16], [22], [26], [27], [34], [50], [54], [57], [59], [61], [65], [66], [69], [71], [74], [76], [79], [84], [86], [87], [88], [100], [109], [112], [115], [121], [124], [127], [134], [137], [149], [152], [157], [159], [161], [163], [164], [165], [175], [177], [193], [196], [199], [203], [205], [207], [208], [209], [212], [214], [217], [228], [232], [234], [236], [238], [240], [243], [246], [248], [258], [259], [260], [261], [262], [263], [265], [266], [267], [268], [269], [270], [273], [274], [275], [276], [277], [278], [279], [280], [281], [285], [286], [287], [289], [290], [291] [2018-12-03 03:20:11,842 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:20:11,842 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:20:12,172 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:20:12,172 INFO L272 AbstractInterpreter]: Visited 91 different actions 1425 times. Merged at 42 different actions 398 times. Widened at 1 different actions 1 times. Performed 13389 root evaluator evaluations with a maximum evaluation depth of 3. Performed 13389 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 86 fixpoints after 12 different actions. Largest state had 36 variables. [2018-12-03 03:20:12,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:20:12,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:20:12,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:20:12,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 03:20:12,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:20:12,187 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:20:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:20:12,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:20:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 03:20:12,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:20:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-12-03 03:20:12,308 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 03:20:12,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2018-12-03 03:20:12,308 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:20:12,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:20:12,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:20:12,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-03 03:20:12,309 INFO L87 Difference]: Start difference. First operand 1157 states and 1648 transitions. Second operand 3 states. [2018-12-03 03:20:12,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:20:12,411 INFO L93 Difference]: Finished difference Result 2181 states and 3511 transitions. [2018-12-03 03:20:12,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:20:12,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-12-03 03:20:12,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:20:12,416 INFO L225 Difference]: With dead ends: 2181 [2018-12-03 03:20:12,416 INFO L226 Difference]: Without dead ends: 1309 [2018-12-03 03:20:12,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 296 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-03 03:20:12,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2018-12-03 03:20:12,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1309. [2018-12-03 03:20:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2018-12-03 03:20:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1924 transitions. [2018-12-03 03:20:12,487 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1924 transitions. Word has length 148 [2018-12-03 03:20:12,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:20:12,487 INFO L480 AbstractCegarLoop]: Abstraction has 1309 states and 1924 transitions. [2018-12-03 03:20:12,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:20:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1924 transitions. [2018-12-03 03:20:12,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-12-03 03:20:12,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:20:12,491 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:20:12,491 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:20:12,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:20:12,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2085321985, now seen corresponding path program 1 times [2018-12-03 03:20:12,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:20:12,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:20:12,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:20:12,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:20:12,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:20:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:20:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 66 proven. 20 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2018-12-03 03:20:12,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:20:12,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:20:12,575 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 272 with the following transitions: [2018-12-03 03:20:12,575 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [8], [12], [13], [16], [22], [26], [27], [34], [36], [39], [50], [54], [57], [59], [61], [65], [66], [69], [71], [74], [76], [79], [82], [84], [86], [87], [88], [89], [91], [96], [98], [99], [100], [109], [112], [115], [117], [121], [124], [127], [130], [134], [137], [140], [148], [149], [152], [155], [157], [161], [163], [164], [165], [175], [177], [180], [185], [193], [196], [199], [203], [205], [207], [208], [209], [212], [214], [217], [228], [232], [234], [238], [240], [243], [246], [248], [258], [259], [260], [261], [262], [263], [265], [266], [267], [268], [269], [270], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285], [286], [287], [289], [290], [291] [2018-12-03 03:20:12,576 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:20:12,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:20:12,737 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:20:12,737 INFO L272 AbstractInterpreter]: Visited 98 different actions 732 times. Merged at 42 different actions 172 times. Widened at 1 different actions 1 times. Performed 6948 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6948 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 34 fixpoints after 12 different actions. Largest state had 36 variables. [2018-12-03 03:20:12,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:20:12,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:20:12,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:20:12,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 03:20:12,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:20:12,744 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:20:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:20:12,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:20:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-12-03 03:20:12,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:20:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 81 proven. 20 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-12-03 03:20:12,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 03:20:12,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 4] total 10 [2018-12-03 03:20:12,976 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:20:12,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:20:12,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:20:12,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 03:20:12,976 INFO L87 Difference]: Start difference. First operand 1309 states and 1924 transitions. Second operand 3 states. [2018-12-03 03:20:13,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:20:13,031 INFO L93 Difference]: Finished difference Result 2182 states and 3592 transitions. [2018-12-03 03:20:13,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:20:13,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2018-12-03 03:20:13,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:20:13,036 INFO L225 Difference]: With dead ends: 2182 [2018-12-03 03:20:13,036 INFO L226 Difference]: Without dead ends: 1294 [2018-12-03 03:20:13,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 537 SyntacticMatches, 7 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 03:20:13,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2018-12-03 03:20:13,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2018-12-03 03:20:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1294 states. [2018-12-03 03:20:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1903 transitions. [2018-12-03 03:20:13,103 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1903 transitions. Word has length 271 [2018-12-03 03:20:13,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:20:13,104 INFO L480 AbstractCegarLoop]: Abstraction has 1294 states and 1903 transitions. [2018-12-03 03:20:13,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:20:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1903 transitions. [2018-12-03 03:20:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-03 03:20:13,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:20:13,107 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:20:13,107 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:20:13,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:20:13,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1141168378, now seen corresponding path program 1 times [2018-12-03 03:20:13,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:20:13,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:20:13,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:20:13,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:20:13,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:20:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:20:13,139 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2018-12-03 03:20:13,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:20:13,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:20:13,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:20:13,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:20:13,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:20:13,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:20:13,140 INFO L87 Difference]: Start difference. First operand 1294 states and 1903 transitions. Second operand 3 states. [2018-12-03 03:20:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:20:13,219 INFO L93 Difference]: Finished difference Result 2153 states and 3412 transitions. [2018-12-03 03:20:13,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:20:13,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2018-12-03 03:20:13,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:20:13,225 INFO L225 Difference]: With dead ends: 2153 [2018-12-03 03:20:13,225 INFO L226 Difference]: Without dead ends: 1280 [2018-12-03 03:20:13,230 INFO L631 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 [2018-12-03 03:20:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2018-12-03 03:20:13,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1280. [2018-12-03 03:20:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2018-12-03 03:20:13,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1867 transitions. [2018-12-03 03:20:13,291 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1867 transitions. Word has length 207 [2018-12-03 03:20:13,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:20:13,291 INFO L480 AbstractCegarLoop]: Abstraction has 1280 states and 1867 transitions. [2018-12-03 03:20:13,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:20:13,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1867 transitions. [2018-12-03 03:20:13,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-03 03:20:13,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:20:13,295 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:20:13,296 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:20:13,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:20:13,296 INFO L82 PathProgramCache]: Analyzing trace with hash 4617751, now seen corresponding path program 1 times [2018-12-03 03:20:13,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:20:13,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:20:13,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:20:13,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:20:13,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:20:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:20:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 49 proven. 9 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-12-03 03:20:13,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:20:13,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:20:13,339 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 257 with the following transitions: [2018-12-03 03:20:13,340 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [8], [12], [13], [16], [22], [26], [27], [34], [36], [39], [50], [54], [57], [59], [61], [65], [66], [69], [71], [74], [76], [79], [82], [84], [86], [87], [88], [89], [91], [96], [98], [99], [100], [109], [112], [115], [117], [121], [124], [134], [137], [143], [148], [149], [152], [155], [157], [159], [161], [163], [164], [165], [175], [177], [180], [185], [193], [196], [199], [201], [203], [205], [207], [208], [209], [212], [214], [217], [228], [232], [234], [236], [238], [240], [243], [246], [248], [258], [259], [260], [261], [262], [263], [265], [266], [267], [268], [269], [270], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285], [286], [287], [289], [290], [291] [2018-12-03 03:20:13,341 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:20:13,341 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:20:13,611 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:20:13,612 INFO L272 AbstractInterpreter]: Visited 99 different actions 1049 times. Merged at 48 different actions 267 times. Never widened. Performed 8784 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8784 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 59 fixpoints after 15 different actions. Largest state had 36 variables. [2018-12-03 03:20:13,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:20:13,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:20:13,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:20:13,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 03:20:13,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:20:13,619 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:20:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:20:13,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:20:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-12-03 03:20:13,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:20:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 49 proven. 9 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-12-03 03:20:13,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 03:20:13,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2018-12-03 03:20:13,839 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:20:13,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:20:13,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:20:13,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:20:13,840 INFO L87 Difference]: Start difference. First operand 1280 states and 1867 transitions. Second operand 3 states. [2018-12-03 03:20:13,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:20:13,893 INFO L93 Difference]: Finished difference Result 2139 states and 3439 transitions. [2018-12-03 03:20:13,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:20:13,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2018-12-03 03:20:13,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:20:13,897 INFO L225 Difference]: With dead ends: 2139 [2018-12-03 03:20:13,897 INFO L226 Difference]: Without dead ends: 1280 [2018-12-03 03:20:13,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:20:13,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2018-12-03 03:20:13,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1280. [2018-12-03 03:20:13,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2018-12-03 03:20:13,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1849 transitions. [2018-12-03 03:20:13,959 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1849 transitions. Word has length 256 [2018-12-03 03:20:13,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:20:13,959 INFO L480 AbstractCegarLoop]: Abstraction has 1280 states and 1849 transitions. [2018-12-03 03:20:13,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:20:13,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1849 transitions. [2018-12-03 03:20:13,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-03 03:20:13,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:20:13,963 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:20:13,963 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:20:13,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:20:13,963 INFO L82 PathProgramCache]: Analyzing trace with hash -553885547, now seen corresponding path program 1 times [2018-12-03 03:20:13,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:20:13,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:20:13,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:20:13,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:20:13,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:20:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:20:14,033 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 56 proven. 67 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-12-03 03:20:14,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:20:14,033 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:20:14,034 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 257 with the following transitions: [2018-12-03 03:20:14,034 INFO L205 CegarAbsIntRunner]: [0], [3], [5], [10], [12], [13], [16], [22], [26], [27], [34], [36], [39], [50], [54], [57], [59], [61], [65], [66], [69], [71], [74], [76], [79], [82], [84], [86], [87], [88], [89], [91], [96], [98], [99], [100], [109], [112], [115], [117], [121], [124], [134], [137], [143], [148], [149], [152], [155], [157], [159], [161], [163], [164], [165], [175], [177], [180], [185], [193], [196], [199], [201], [203], [205], [207], [208], [209], [212], [214], [217], [228], [232], [234], [236], [238], [240], [243], [246], [248], [258], [259], [260], [261], [262], [263], [265], [266], [267], [268], [269], [270], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285], [286], [287], [289], [290], [291] [2018-12-03 03:20:14,034 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:20:14,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:20:14,434 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:20:14,434 INFO L272 AbstractInterpreter]: Visited 112 different actions 1767 times. Merged at 55 different actions 561 times. Widened at 3 different actions 3 times. Performed 14589 root evaluator evaluations with a maximum evaluation depth of 3. Performed 14589 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 114 fixpoints after 21 different actions. Largest state had 36 variables. [2018-12-03 03:20:14,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:20:14,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:20:14,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:20:14,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 03:20:14,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:20:14,445 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:20:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:20:14,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:20:14,575 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-12-03 03:20:14,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:20:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 58 proven. 19 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-12-03 03:20:14,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 03:20:14,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 12 [2018-12-03 03:20:14,735 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:20:14,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:20:14,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:20:14,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-12-03 03:20:14,736 INFO L87 Difference]: Start difference. First operand 1280 states and 1849 transitions. Second operand 6 states. [2018-12-03 03:20:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:20:14,811 INFO L93 Difference]: Finished difference Result 2141 states and 3381 transitions. [2018-12-03 03:20:14,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 03:20:14,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 256 [2018-12-03 03:20:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:20:14,815 INFO L225 Difference]: With dead ends: 2141 [2018-12-03 03:20:14,815 INFO L226 Difference]: Without dead ends: 1282 [2018-12-03 03:20:14,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 507 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-12-03 03:20:14,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2018-12-03 03:20:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1280. [2018-12-03 03:20:14,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2018-12-03 03:20:14,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1846 transitions. [2018-12-03 03:20:14,877 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1846 transitions. Word has length 256 [2018-12-03 03:20:14,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:20:14,877 INFO L480 AbstractCegarLoop]: Abstraction has 1280 states and 1846 transitions. [2018-12-03 03:20:14,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:20:14,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1846 transitions. [2018-12-03 03:20:14,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-12-03 03:20:14,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:20:14,882 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:20:14,882 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 03:20:14,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:20:14,882 INFO L82 PathProgramCache]: Analyzing trace with hash 95096662, now seen corresponding path program 1 times [2018-12-03 03:20:14,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:20:14,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:20:14,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:20:14,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:20:14,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:20:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:20:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 43 proven. 61 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-12-03 03:20:14,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:20:14,951 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:20:14,951 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2018-12-03 03:20:14,952 INFO L205 CegarAbsIntRunner]: [0], [3], [12], [13], [16], [22], [26], [27], [34], [36], [39], [50], [54], [57], [59], [61], [65], [66], [69], [71], [74], [76], [79], [82], [84], [86], [87], [88], [89], [91], [96], [98], [99], [100], [109], [112], [115], [117], [121], [124], [134], [137], [140], [148], [149], [152], [155], [157], [159], [161], [163], [164], [165], [175], [177], [180], [185], [193], [196], [199], [201], [203], [205], [207], [208], [209], [212], [214], [217], [228], [232], [234], [236], [238], [240], [243], [246], [248], [258], [259], [260], [261], [262], [263], [265], [266], [267], [268], [269], [270], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285], [286], [287], [289], [290], [291] [2018-12-03 03:20:14,953 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:20:14,953 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:20:15,088 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:20:15,088 INFO L272 AbstractInterpreter]: Visited 97 different actions 681 times. Merged at 45 different actions 189 times. Never widened. Performed 5450 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5450 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 41 fixpoints after 14 different actions. Largest state had 36 variables. [2018-12-03 03:20:15,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:20:15,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:20:15,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:20:15,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 03:20:15,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:20:15,097 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:20:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:20:15,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:20:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-12-03 03:20:15,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:20:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-12-03 03:20:15,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 03:20:15,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 4] total 11 [2018-12-03 03:20:15,309 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:20:15,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:20:15,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:20:15,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-03 03:20:15,309 INFO L87 Difference]: Start difference. First operand 1280 states and 1846 transitions. Second operand 3 states. [2018-12-03 03:20:15,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:20:15,357 INFO L93 Difference]: Finished difference Result 1651 states and 2449 transitions. [2018-12-03 03:20:15,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:20:15,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2018-12-03 03:20:15,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:20:15,358 INFO L225 Difference]: With dead ends: 1651 [2018-12-03 03:20:15,358 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 03:20:15,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 508 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-03 03:20:15,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 03:20:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 03:20:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 03:20:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 03:20:15,364 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 255 [2018-12-03 03:20:15,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:20:15,364 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 03:20:15,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:20:15,364 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 03:20:15,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 03:20:15,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 03:20:15,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:15,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:20:16,490 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 81 [2018-12-03 03:20:16,769 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 90 [2018-12-03 03:20:16,985 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 85 [2018-12-03 03:20:17,285 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 91 [2018-12-03 03:20:17,512 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 86 [2018-12-03 03:20:17,730 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 76 [2018-12-03 03:20:17,925 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 88 [2018-12-03 03:20:18,143 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 74 [2018-12-03 03:20:18,380 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 90 [2018-12-03 03:20:20,249 WARN L180 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 196 DAG size of output: 134 [2018-12-03 03:20:20,405 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2018-12-03 03:20:20,653 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 93 [2018-12-03 03:20:20,919 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 92 [2018-12-03 03:20:21,123 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 55 [2018-12-03 03:20:22,153 WARN L180 SmtUtils]: Spent 943.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 124 [2018-12-03 03:20:23,781 WARN L180 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 175 DAG size of output: 134 [2018-12-03 03:20:24,048 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 99 [2018-12-03 03:20:25,640 WARN L180 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 195 DAG size of output: 124 [2018-12-03 03:20:26,145 WARN L180 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2018-12-03 03:20:26,549 WARN L180 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 99 [2018-12-03 03:20:26,796 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 1 [2018-12-03 03:20:28,846 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 196 DAG size of output: 134 [2018-12-03 03:20:29,484 WARN L180 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 91 [2018-12-03 03:20:29,705 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2018-12-03 03:20:30,634 WARN L180 SmtUtils]: Spent 922.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 95 [2018-12-03 03:20:30,969 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 78 [2018-12-03 03:20:31,331 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 117 [2018-12-03 03:20:31,535 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 76 [2018-12-03 03:20:31,969 WARN L180 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 87 [2018-12-03 03:20:31,973 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2018-12-03 03:20:31,973 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 223) no Hoare annotation was computed. [2018-12-03 03:20:31,973 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 224) no Hoare annotation was computed. [2018-12-03 03:20:31,974 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2018-12-03 03:20:31,974 INFO L444 ceAbstractionStarter]: At program point L226(lines 213 228) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_i~0 1))) (.cse10 (= exists_runnable_thread_~__retres1~2 1)) (.cse1 (not (= 0 ~p_last_write~0))) (.cse4 (not (= ~q_free~0 1))) (.cse2 (not (= 2 ~q_write_ev~0))) (.cse5 (not (= ~p_dw_pc~0 0))) (.cse3 (not (= 0 ~q_buf_0~0))) (.cse6 (not (= 0 ~p_num_write~0))) (.cse7 (< ~q_read_ev~0 2)) (.cse8 (not (= ~p_dw_st~0 0))) (.cse9 (not (= 0 ~c_num_read~0))) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (or (not (= 1 ~c_dr_pc~0)) .cse4 .cse5 .cse6) .cse7 (not (= 2 ~c_dr_st~0)) .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse10 .cse1 .cse4 .cse2 (not (= 1 ~c_dr_i~0)) .cse5 .cse3 .cse6 .cse7 .cse8 .cse9 (not (= 0 ~c_dr_pc~0)) .cse11 (not (= 0 ~c_dr_st~0))))) [2018-12-03 03:20:31,974 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2018-12-03 03:20:31,974 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2018-12-03 03:20:31,974 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2018-12-03 03:20:31,975 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 192 209) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (not (= 0 ~p_last_write~0)) (not (= ~q_free~0 1)) (not (= 2 ~q_write_ev~0)) (not (= 1 ~c_dr_i~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_num_write~0)) (< ~q_read_ev~0 2) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 ~c_num_read~0)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0)) (not (= 0 ~c_dr_pc~0)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= 0 |old(~c_dr_st~0)|))) [2018-12-03 03:20:31,975 INFO L448 ceAbstractionStarter]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2018-12-03 03:20:31,975 INFO L444 ceAbstractionStarter]: At program point L354-1(line 354) the Hoare annotation is: (or (= |old(~p_dw_i~0)| 1) (not (= 0 |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (and (= ~p_dw_pc~0 0) (= ~q_free~0 1) (<= 2 ~q_read_ev~0) (= ~p_dw_st~0 0) (= ~c_dr_st~0 0) (= ~c_dr_i~0 1) (= ~c_num_read~0 0) (= ~q_write_ev~0 2) (= ~p_last_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_buf_0~0 0) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= 0 ~p_num_write~0)) (not (= 0 |old(~c_dr_pc~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|))) [2018-12-03 03:20:31,975 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 349 360) the Hoare annotation is: (or (= |old(~p_dw_i~0)| 1) (and (= ~p_dw_pc~0 0) (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (= ~c_dr_st~0 0) (= ~c_num_read~0 0) (= ~q_free~0 0) (= ~p_last_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_buf_0~0 0) (= ~c_dr_pc~0 0) (= 0 ~p_num_write~0)) (not (= 0 |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|))) [2018-12-03 03:20:31,975 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2018-12-03 03:20:31,975 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2018-12-03 03:20:31,976 INFO L448 ceAbstractionStarter]: For program point L355(line 355) no Hoare annotation was computed. [2018-12-03 03:20:31,976 INFO L444 ceAbstractionStarter]: At program point L354(line 354) the Hoare annotation is: (or (= |old(~p_dw_i~0)| 1) (and (= ~p_dw_pc~0 0) (= ~p_dw_st~0 0) (not (= ~p_dw_i~0 1)) (= ~c_dr_st~0 0) (= ~c_num_read~0 0) (= ~q_free~0 0) (= ~p_last_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_buf_0~0 0) (= ~c_dr_pc~0 0) (= 0 ~p_num_write~0)) (not (= 0 |old(~p_last_write~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|))) [2018-12-03 03:20:31,976 INFO L444 ceAbstractionStarter]: At program point L128(lines 91 133) the Hoare annotation is: (let ((.cse1 (<= 2 ~q_write_ev~0)) (.cse8 (not (= 2 |old(~q_write_ev~0)|))) (.cse10 (not (= 0 |old(~q_buf_0~0)|))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse18 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse19 (not (= 1 ~c_dr_pc~0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~c_dr_st~0 0)) (.cse4 (= 1 ~p_dw_pc~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~p_dw_st~0 2)) (.cse7 (not (= |old(~q_free~0)| 1))) (.cse9 (not (= |old(~p_dw_pc~0)| 0))) (.cse11 (not (= 0 |old(~p_num_write~0)|))) (.cse12 (< ~q_read_ev~0 2)) (.cse13 (not (= 0 ~c_num_read~0))) (.cse14 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~p_num_write~0 1)) (not (= 0 |old(~p_last_write~0)|)) .cse7 .cse8 (not (= 1 ~c_dr_i~0)) .cse9 .cse10 .cse11 .cse12 .cse13 (not (= 0 ~c_dr_pc~0)) .cse14 (not (= 0 |old(~c_dr_st~0)|))) (let ((.cse15 (<= 2 ~p_dw_st~0)) (.cse16 (<= (+ |old(~p_num_write~0)| 1) ~p_num_write~0)) (.cse17 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or .cse12 (< |old(~q_write_ev~0)| 2) (and .cse15 .cse1 (<= 2 ~c_dr_st~0) .cse2 .cse16 .cse4 .cse5 .cse17) (< |old(~c_dr_st~0)| 2) (and .cse15 .cse1 .cse2 .cse16 .cse3 .cse4 .cse5 .cse17) (or (or .cse18 .cse0 .cse19 (not (= |old(~p_dw_pc~0)| 1))) (< |old(~p_num_write~0)| ~c_num_read~0) (< ~c_num_read~0 |old(~p_num_write~0)|)))) (or (or (not (= 2 |old(~c_dr_st~0)|)) .cse8 .cse10) .cse0 .cse18 .cse19 (and .cse2 .cse3 .cse4 .cse5 (= ~q_write_ev~0 2) (= 1 ~p_num_write~0) .cse6) (or .cse7 .cse9) .cse11 .cse12 .cse13 .cse14))) [2018-12-03 03:20:31,976 INFO L444 ceAbstractionStarter]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse4 (not (= 1 ~c_dr_pc~0))) (.cse8 (= ~p_dw_pc~0 0)) (.cse9 (= ~q_free~0 1)) (.cse7 (= ~q_write_ev~0 2)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= 0 ~p_num_write~0)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse5 (not (= |old(~q_free~0)| 1))) (.cse0 (not (= 2 |old(~q_write_ev~0)|))) (.cse6 (not (= |old(~p_dw_pc~0)| 0))) (.cse1 (not (= 0 |old(~q_buf_0~0)|))) (.cse13 (not (= 0 |old(~p_num_write~0)|))) (.cse14 (< ~q_read_ev~0 2)) (.cse15 (not (= 0 ~c_num_read~0))) (.cse16 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or (or (not (= 2 |old(~c_dr_st~0)|)) .cse0 .cse1) .cse2 .cse3 .cse4 (or .cse5 .cse6) (and (and .cse7 (= ~c_dr_st~0 2)) .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16) (or .cse14 (< |old(~q_write_ev~0)| 2) (< |old(~c_dr_st~0)| 2) (and (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse10 (= 1 ~p_dw_pc~0)) (<= 2 ~q_write_ev~0) (<= 2 ~c_dr_st~0)) (or (or .cse3 .cse2 .cse4 (not (= |old(~p_dw_pc~0)| 1))) (< |old(~p_num_write~0)| ~c_num_read~0) (< ~c_num_read~0 |old(~p_num_write~0)|))) (or (and .cse8 .cse9 (= ~c_dr_st~0 0) .cse7 .cse11 (= ~q_buf_0~0 0) .cse12) .cse2 (not (= 0 |old(~p_last_write~0)|)) .cse5 .cse0 (not (= 1 ~c_dr_i~0)) .cse6 .cse1 .cse13 .cse14 .cse15 (not (= 0 ~c_dr_pc~0)) .cse16 (not (= 0 |old(~c_dr_st~0)|))))) [2018-12-03 03:20:31,977 INFO L444 ceAbstractionStarter]: At program point L124(line 124) the Hoare annotation is: (let ((.cse10 (<= 2 ~c_dr_st~0)) (.cse3 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse4 (not (= 1 ~c_dr_pc~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse5 (not (= |old(~q_free~0)| 1))) (.cse0 (not (= 2 |old(~q_write_ev~0)|))) (.cse6 (not (= |old(~p_dw_pc~0)| 0))) (.cse1 (not (= 0 |old(~q_buf_0~0)|))) (.cse7 (not (= 0 |old(~p_num_write~0)|))) (.cse8 (= ~p_dw_pc~0 0)) (.cse9 (= ~q_write_ev~0 1)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (= ~q_free~0 0)) (.cse13 (< ~q_read_ev~0 2)) (.cse14 (not (= 0 ~c_num_read~0))) (.cse15 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or (or (not (= 2 |old(~c_dr_st~0)|)) .cse0 .cse1) .cse2 .cse3 .cse4 (or .cse5 .cse6) .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 (= 1 ~p_num_write~0)) .cse13 .cse14 .cse15) (or .cse13 (< |old(~q_write_ev~0)| 2) (< |old(~c_dr_st~0)| 2) (let ((.cse16 (+ |old(~p_num_write~0)| 1))) (and .cse12 .cse10 (<= .cse16 ~p_num_write~0) .cse11 (= 1 ~p_dw_pc~0) (<= ~p_num_write~0 .cse16))) (or (or .cse3 .cse2 .cse4 (not (= |old(~p_dw_pc~0)| 1))) (< |old(~p_num_write~0)| ~c_num_read~0) (< ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse2 (not (= 0 |old(~p_last_write~0)|)) .cse5 .cse0 (not (= 1 ~c_dr_i~0)) .cse6 .cse1 .cse7 (and .cse8 .cse9 .cse11 (= ~c_dr_st~0 0) .cse12 (= ~p_num_write~0 1)) .cse13 .cse14 (not (= 0 ~c_dr_pc~0)) .cse15 (not (= 0 |old(~c_dr_st~0)|))))) [2018-12-03 03:20:31,977 INFO L448 ceAbstractionStarter]: For program point L124-1(line 124) no Hoare annotation was computed. [2018-12-03 03:20:31,977 INFO L448 ceAbstractionStarter]: For program point L108(lines 107 127) no Hoare annotation was computed. [2018-12-03 03:20:31,977 INFO L448 ceAbstractionStarter]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2018-12-03 03:20:31,977 INFO L444 ceAbstractionStarter]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse3 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse4 (not (= 1 ~c_dr_pc~0))) (.cse10 (<= 2 ~c_dr_st~0)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse5 (not (= |old(~q_free~0)| 1))) (.cse0 (not (= 2 |old(~q_write_ev~0)|))) (.cse6 (not (= |old(~p_dw_pc~0)| 0))) (.cse1 (not (= 0 |old(~q_buf_0~0)|))) (.cse13 (not (= 0 |old(~p_num_write~0)|))) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (= ~q_free~0 1)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse12 (= 0 ~p_num_write~0)) (.cse14 (< ~q_read_ev~0 2)) (.cse15 (not (= 0 ~c_num_read~0))) (.cse16 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or (or (not (= 2 |old(~c_dr_st~0)|)) .cse0 .cse1) .cse2 .cse3 .cse4 (or .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16) (or .cse14 (< |old(~q_write_ev~0)| 2) (< |old(~c_dr_st~0)| 2) (or (or .cse3 .cse2 .cse4 (not (= |old(~p_dw_pc~0)| 1))) (< |old(~p_num_write~0)| ~c_num_read~0) (< ~c_num_read~0 |old(~p_num_write~0)|)) (and (and (and .cse11 (= 1 ~p_dw_pc~0)) (= ~p_num_write~0 |old(~p_num_write~0)|)) .cse9 .cse10)) (or .cse2 (not (= 0 |old(~p_last_write~0)|)) .cse5 .cse0 (not (= 1 ~c_dr_i~0)) .cse6 .cse1 .cse13 (and .cse11 .cse7 .cse8 .cse9 (= ~c_dr_st~0 0) .cse12) .cse14 .cse15 (not (= 0 ~c_dr_pc~0)) .cse16 (not (= 0 |old(~c_dr_st~0)|))))) [2018-12-03 03:20:31,978 INFO L444 ceAbstractionStarter]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse9 (= ~q_free~0 1)) (.cse7 (= ~q_write_ev~0 2)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= 0 ~p_num_write~0)) (.cse5 (not (= |old(~q_free~0)| 1))) (.cse0 (not (= 2 |old(~q_write_ev~0)|))) (.cse8 (= ~p_dw_pc~0 0)) (.cse6 (not (= |old(~p_dw_pc~0)| 0))) (.cse1 (not (= 0 |old(~q_buf_0~0)|))) (.cse13 (not (= 0 |old(~p_num_write~0)|))) (.cse17 (not (= 0 ~c_num_read~0))) (.cse18 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse14 (< ~q_read_ev~0 2)) (.cse19 (<= 2 ~q_write_ev~0)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~c_dr_st~0 0)) (.cse16 (= ~q_free~0 0)) (.cse3 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse4 (not (= 1 ~c_dr_pc~0)))) (and (or (or (not (= 2 |old(~c_dr_st~0)|)) .cse0 .cse1) .cse2 .cse3 .cse4 (or .cse5 .cse6) (and (and .cse7 (= ~c_dr_st~0 2)) .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 (and .cse8 .cse10 .cse15 .cse16 .cse7 (= 1 ~p_num_write~0)) .cse17 .cse18) (or (and .cse8 .cse9 .cse15 .cse7 .cse11 (= ~q_buf_0~0 0) .cse12) .cse2 (not (= 0 |old(~p_last_write~0)|)) .cse5 .cse0 (not (= 1 ~c_dr_i~0)) (and .cse8 .cse19 .cse10 .cse15 .cse16 (= ~p_num_write~0 1)) .cse6 .cse1 .cse13 .cse14 .cse17 (not (= 0 ~c_dr_pc~0)) .cse18 (not (= 0 |old(~c_dr_st~0)|))) (let ((.cse20 (<= (+ |old(~p_num_write~0)| 1) ~p_num_write~0)) (.cse21 (= 1 ~p_dw_pc~0)) (.cse22 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or .cse14 (< |old(~q_write_ev~0)| 2) (< |old(~c_dr_st~0)| 2) (and .cse19 (<= 2 ~c_dr_st~0) .cse20 .cse10 .cse21 .cse16 .cse22) (and .cse19 .cse20 .cse10 .cse15 .cse21 .cse16 .cse22) (or (or .cse3 .cse2 .cse4 (not (= |old(~p_dw_pc~0)| 1))) (< |old(~p_num_write~0)| ~c_num_read~0) (< ~c_num_read~0 |old(~p_num_write~0)|)))))) [2018-12-03 03:20:31,978 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 103) no Hoare annotation was computed. [2018-12-03 03:20:31,978 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2018-12-03 03:20:31,978 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2018-12-03 03:20:31,978 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2018-12-03 03:20:31,979 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2018-12-03 03:20:31,979 INFO L444 ceAbstractionStarter]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse12 (not (= 1 ~q_write_ev~0))) (.cse14 (not (= 0 ~c_num_read~0))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse6 (not (= ~q_free~0 1))) (.cse15 (not (= 0 ~c_dr_pc~0))) (.cse8 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (< ~q_write_ev~0 2)) (.cse13 (not (= 1 ~p_num_write~0))) (.cse4 (<= 2 ~p_dw_st~0)) (.cse7 (< |old(~p_dw_st~0)| 2)) (.cse10 (< ~q_read_ev~0 2)) (.cse11 (not (= ~q_free~0 0))) (.cse16 (< |old(~c_dr_st~0)| 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not (= 1 ~c_dr_pc~0))) (.cse5 (not (= ~p_dw_pc~0 1))) (.cse17 (<= 2 ~c_dr_st~0))) (and (or .cse0 (< ~p_num_write~0 ~c_num_read~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< ~c_num_read~0 ~p_num_write~0) .cse7 .cse8) (or .cse1 .cse2 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~c_dr_st~0 0) .cse15 (not (= 0 |old(~c_dr_st~0)|))) (or .cse10 .cse1 .cse2 .cse3 .cse11 .cse16 .cse12 .cse17 .cse13 .cse14 .cse9) (or (or .cse1 .cse2 (not (= ~q_read_ev~0 1)) .cse5 .cse6 .cse15 .cse8) .cse0 .cse13 (not (= 1 ~c_num_read~0)) .cse4 .cse7) (let ((.cse18 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse18) .cse10 .cse11 .cse16 (< .cse18 ~p_num_write~0) (or .cse1 .cse2 .cse3 .cse5) .cse17)))) [2018-12-03 03:20:31,979 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 86) no Hoare annotation was computed. [2018-12-03 03:20:31,979 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-12-03 03:20:31,979 INFO L448 ceAbstractionStarter]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2018-12-03 03:20:31,979 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 78) no Hoare annotation was computed. [2018-12-03 03:20:31,979 INFO L448 ceAbstractionStarter]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2018-12-03 03:20:31,980 INFO L444 ceAbstractionStarter]: At program point L72(line 72) the Hoare annotation is: (let ((.cse12 (not (= 1 ~q_write_ev~0))) (.cse14 (not (= 0 ~c_num_read~0))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse6 (not (= ~q_free~0 1))) (.cse15 (not (= 0 ~c_dr_pc~0))) (.cse8 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (< ~q_write_ev~0 2)) (.cse13 (not (= 1 ~p_num_write~0))) (.cse4 (<= 2 ~p_dw_st~0)) (.cse7 (< |old(~p_dw_st~0)| 2)) (.cse10 (< ~q_read_ev~0 2)) (.cse11 (not (= ~q_free~0 0))) (.cse16 (< |old(~c_dr_st~0)| 2)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not (= 1 ~c_dr_pc~0))) (.cse5 (not (= ~p_dw_pc~0 1))) (.cse17 (<= 2 ~c_dr_st~0))) (and (or .cse0 (< ~p_num_write~0 ~c_num_read~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< ~c_num_read~0 ~p_num_write~0) .cse7 .cse8) (or .cse1 .cse2 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~c_dr_st~0 0) .cse15 (not (= 0 |old(~c_dr_st~0)|))) (or .cse10 .cse1 .cse2 .cse3 .cse11 .cse16 .cse12 .cse17 .cse13 .cse14 .cse9) (or (or .cse1 .cse2 (not (= ~q_read_ev~0 1)) .cse5 .cse6 .cse15 .cse8) .cse0 .cse13 (not (= 1 ~c_num_read~0)) .cse4 .cse7) (let ((.cse18 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse18) .cse10 .cse11 .cse16 (< .cse18 ~p_num_write~0) (or .cse1 .cse2 .cse3 .cse5) .cse17)))) [2018-12-03 03:20:31,980 INFO L444 ceAbstractionStarter]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse11 (< ~q_read_ev~0 2)) (.cse2 (not (= 1 ~c_dr_pc~0))) (.cse13 (not (= ~q_free~0 0))) (.cse14 (< |old(~c_dr_st~0)| 2)) (.cse16 (not (= 1 ~q_write_ev~0))) (.cse18 (not (= 0 ~c_num_read~0))) (.cse15 (not (= ~p_dw_pc~0 0))) (.cse12 (<= 2 ~c_dr_st~0)) (.cse7 (= immediate_notify_threads_~tmp~0 0)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse3 (not (= ~p_dw_pc~0 1))) (.cse4 (not (= ~q_free~0 1))) (.cse19 (not (= 0 ~c_dr_pc~0))) (.cse9 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse6 (< ~q_write_ev~0 2)) (.cse5 (= ~p_dw_st~0 0)) (.cse17 (not (= 1 ~p_num_write~0))) (.cse8 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 ~p_num_write~0) (and (<= 2 ~p_dw_st~0) .cse7) .cse8 .cse9) (let ((.cse10 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse10) .cse11 (and (or .cse5 .cse7) .cse12) .cse13 .cse14 (< .cse10 ~p_num_write~0) (or .cse0 .cse1 .cse2 .cse3))) (or .cse0 .cse1 (and (= ~c_dr_st~0 0) .cse7) .cse15 .cse11 .cse13 .cse16 .cse17 .cse18 .cse19 (not (= 0 |old(~c_dr_st~0)|))) (or .cse11 .cse0 .cse1 .cse2 .cse13 .cse14 .cse16 .cse17 .cse18 .cse15 (and .cse12 .cse7)) (or (or .cse0 .cse1 (not (= ~q_read_ev~0 1)) .cse3 .cse4 .cse19 .cse9) .cse6 (and .cse5 (= immediate_notify_threads_~tmp~0 1)) .cse17 (not (= 1 ~c_num_read~0)) .cse8))) [2018-12-03 03:20:31,980 INFO L448 ceAbstractionStarter]: For program point L72-1(line 72) no Hoare annotation was computed. [2018-12-03 03:20:31,980 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-03 03:20:31,980 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~p_num_write~0 |old(~p_num_write~0)|) (= |old(~c_num_read~0)| ~c_num_read~0)) [2018-12-03 03:20:31,981 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 03:20:31,981 INFO L448 ceAbstractionStarter]: For program point L290-1(line 290) no Hoare annotation was computed. [2018-12-03 03:20:31,981 INFO L451 ceAbstractionStarter]: At program point L299(lines 288 301) the Hoare annotation is: true [2018-12-03 03:20:31,981 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2018-12-03 03:20:31,981 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 297) no Hoare annotation was computed. [2018-12-03 03:20:31,981 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2018-12-03 03:20:31,981 INFO L451 ceAbstractionStarter]: At program point L290(line 290) the Hoare annotation is: true [2018-12-03 03:20:31,981 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2018-12-03 03:20:31,982 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse11 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse10 (not (= ~p_dw_i~0 1))) (.cse40 (not (= 1 |old(~c_dr_pc~0)|))) (.cse12 (not (= |old(~p_dw_pc~0)| 1))) (.cse36 (not (= |old(~p_dw_st~0)| 0))) (.cse41 (+ |old(~c_num_read~0)| 1)) (.cse37 (= ~p_dw_pc~0 0)) (.cse38 (= ~q_free~0 1)) (.cse34 (= ~p_dw_st~0 0))) (let ((.cse1 (not (= |old(~p_dw_st~0)| 2))) (.cse8 (let ((.cse42 (= (mod ~c_dr_st~0 2) 0))) (or (and .cse42 .cse37 .cse38 (= ~p_num_write~0 0) .cse34) (and .cse42 (= ~p_dw_st~0 2))))) (.cse23 (< |old(~p_num_write~0)| .cse41)) (.cse4 (not (= |old(~q_free~0)| 0))) (.cse28 (< .cse41 |old(~p_num_write~0)|)) (.cse20 (= ~q_free~0 0)) (.cse25 (<= 2 ~p_dw_st~0)) (.cse13 (< |old(~q_write_ev~0)| 2)) (.cse32 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse24 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse14 (<= 2 ~q_write_ev~0)) (.cse26 (= |old(~c_num_read~0)| ~c_num_read~0)) (.cse31 (<= 2 ~c_dr_st~0)) (.cse27 (= 1 ~c_dr_pc~0)) (.cse16 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= 1 ~p_dw_pc~0)) (.cse33 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse15 (<= 2 ~q_read_ev~0)) (.cse17 (= ~c_dr_st~0 0)) (.cse19 (= ~c_num_read~0 0)) (.cse21 (= ~c_dr_pc~0 0)) (.cse22 (not (= 0 |old(~c_dr_pc~0)|))) (.cse9 (not (= 0 |old(~c_dr_st~0)|))) (.cse35 (or .cse11 .cse10 .cse40 .cse12 .cse36)) (.cse0 (or .cse11 .cse10 .cse40 .cse12)) (.cse3 (< |old(~q_read_ev~0)| 2)) (.cse30 (< |old(~c_dr_st~0)| 2)) (.cse7 (= ~q_write_ev~0 2)) (.cse5 (not (= 1 |old(~p_num_write~0)|))) (.cse2 (not (= 2 |old(~q_write_ev~0)|))) (.cse39 (not (= 1 |old(~c_num_read~0)|))) (.cse29 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8) .cse9) (or .cse1 .cse10 .cse11 .cse12 .cse3 .cse13 .cse4 .cse5 .cse6 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse8 (= ~p_num_write~0 1) .cse21) .cse22 .cse9) (or .cse23 .cse0 (and .cse24 .cse25 .cse14 .cse26 .cse15 .cse27 .cse16 .cse17 .cse18 .cse20) .cse3 .cse13 .cse4 .cse28 .cse29 .cse9) (or .cse23 .cse0 .cse3 .cse13 .cse4 .cse30 .cse28 (and .cse24 .cse25 .cse14 .cse26 .cse31 .cse15 .cse27 .cse16 .cse18 .cse20) .cse29) (or .cse0 .cse3 .cse13 .cse32 .cse30 (and .cse24 .cse25 .cse14 .cse26 .cse31 .cse15 .cse27 .cse16 .cse18) .cse33 .cse29) (or .cse3 .cse13 .cse32 .cse30 (and .cse24 .cse14 .cse26 .cse31 .cse34 .cse15 .cse27 .cse16 .cse18) .cse35 .cse33) (or .cse10 (not (= 0 |old(~p_last_write~0)|)) (not (= |old(~q_free~0)| 1)) .cse2 (not (= 1 ~c_dr_i~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) .cse3 .cse36 .cse6 (and .cse37 .cse38 .cse15 .cse34 .cse17 .cse19 .cse7 (= ~p_last_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_buf_0~0 0) .cse21 (= 0 ~p_num_write~0)) .cse22 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) .cse9) (or .cse3 .cse7 .cse30 .cse35 .cse5 .cse2 .cse39) (or .cse0 .cse3 .cse30 .cse7 .cse5 .cse2 .cse39 .cse29)))) [2018-12-03 03:20:31,982 INFO L444 ceAbstractionStarter]: At program point L254(line 254) the Hoare annotation is: (let ((.cse21 (= 1 ~c_dr_pc~0)) (.cse22 (= ~p_last_write~0 ~q_buf_0~0)) (.cse33 (= ~p_dw_i~0 1))) (let ((.cse5 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (not .cse33)) (.cse7 (not (= 1 |old(~c_dr_pc~0)|))) (.cse8 (not (= |old(~p_dw_pc~0)| 1))) (.cse32 (+ |old(~c_num_read~0)| 1)) (.cse31 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse33 .cse21 .cse22 (= 1 ~p_dw_pc~0))) (.cse29 (<= 2 ~q_write_ev~0)) (.cse30 (<= 2 ~c_dr_st~0)) (.cse15 (<= 2 ~q_read_ev~0))) (let ((.cse2 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse10 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse9 (not (= |old(~p_dw_st~0)| 0))) (.cse4 (and .cse31 .cse29 .cse30 .cse15)) (.cse23 (not (= 0 |old(~c_num_read~0)|))) (.cse24 (not (= 0 |old(~c_dr_pc~0)|))) (.cse3 (< |old(~c_dr_st~0)| 2)) (.cse27 (< |old(~p_num_write~0)| .cse32)) (.cse11 (or .cse5 .cse6 .cse7 .cse8)) (.cse0 (< |old(~q_read_ev~0)| 2)) (.cse1 (< |old(~q_write_ev~0)| 2)) (.cse26 (not (= |old(~q_free~0)| 0))) (.cse28 (< .cse32 |old(~p_num_write~0)|)) (.cse12 (< |old(~p_dw_st~0)| 2)) (.cse25 (not (= 0 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (or .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (or .cse11 .cse0 .cse1 .cse2 .cse3 .cse10 .cse12) (let ((.cse17 (= ~q_write_ev~0 2)) (.cse19 (= ~q_buf_0~0 0)) (.cse13 (= ~p_dw_pc~0 0)) (.cse14 (= ~q_free~0 1)) (.cse16 (= ~c_num_read~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (= 0 ~p_num_write~0))) (or (and .cse13 .cse14 .cse15 (= ~c_dr_st~0 0) .cse16 .cse17 (= ~p_last_write~0 0) .cse18 .cse19 (= ~c_dr_pc~0 0) .cse20) .cse6 (not (= 0 |old(~p_last_write~0)|)) (not (= |old(~q_free~0)| 1)) (not (= 2 |old(~q_write_ev~0)|)) (not (= 1 ~c_dr_i~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (and (and .cse17 .cse19 (= ~c_dr_st~0 2)) .cse13 .cse14 .cse15 .cse21 .cse22 .cse16 .cse18 .cse20) (not (= 0 |old(~p_num_write~0)|)) .cse0 .cse4 .cse9 .cse23 .cse24 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) .cse25)) (or (not (= |old(~p_dw_st~0)| 2)) .cse6 .cse5 .cse8 .cse0 .cse1 .cse26 .cse4 (not (= 1 |old(~p_num_write~0)|)) .cse23 .cse24 .cse25) (or .cse27 .cse11 .cse0 .cse1 .cse26 .cse3 .cse28 .cse12) (or .cse27 .cse11 .cse0 .cse1 .cse26 .cse28 (and .cse29 .cse30 .cse31 .cse15) .cse12 .cse25))))) [2018-12-03 03:20:31,983 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 246) no Hoare annotation was computed. [2018-12-03 03:20:31,983 INFO L448 ceAbstractionStarter]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2018-12-03 03:20:31,983 INFO L448 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2018-12-03 03:20:31,983 INFO L444 ceAbstractionStarter]: At program point L238(line 238) the Hoare annotation is: (let ((.cse48 (= ~p_dw_i~0 1)) (.cse52 (+ ~c_num_read~0 1))) (let ((.cse46 (<= .cse52 ~p_num_write~0)) (.cse32 (<= 2 ~p_dw_st~0)) (.cse47 (<= ~p_num_write~0 .cse52)) (.cse49 (<= ~c_num_read~0 ~p_num_write~0)) (.cse50 (<= ~p_num_write~0 ~c_num_read~0)) (.cse35 (<= 2 ~c_dr_st~0)) (.cse5 (= ~p_dw_st~0 0)) (.cse7 (= 1 ~c_dr_pc~0)) (.cse33 (<= 2 ~q_write_ev~0)) (.cse6 (<= 2 ~q_read_ev~0)) (.cse36 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= ~c_dr_st~0 0)) (.cse37 (= 1 ~p_dw_pc~0)) (.cse8 (= ~c_num_read~0 0)) (.cse38 (= ~q_free~0 0)) (.cse20 (= ~c_dr_pc~0 0)) (.cse43 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not .cse48)) (.cse45 (not (= 1 |old(~c_dr_pc~0)|))) (.cse44 (not (= |old(~p_dw_pc~0)| 1))) (.cse51 (+ |old(~c_num_read~0)| 1))) (let ((.cse31 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse34 (= |old(~c_num_read~0)| ~c_num_read~0)) (.cse25 (< |old(~p_num_write~0)| .cse51)) (.cse30 (< .cse51 |old(~p_num_write~0)|)) (.cse26 (or .cse43 .cse1 .cse45 .cse44)) (.cse9 (= ~q_write_ev~0 2)) (.cse17 (not (= 2 |old(~q_write_ev~0)|))) (.cse39 (< |old(~p_dw_st~0)| 2)) (.cse16 (and (= ~p_dw_st~0 2) .cse33 .cse6 .cse36 .cse19 .cse37 .cse8 .cse38 (= ~p_num_write~0 1) .cse20)) (.cse28 (not (= |old(~q_free~0)| 0))) (.cse42 (not (= 1 |old(~p_num_write~0)|))) (.cse14 (not (= 0 |old(~c_num_read~0)|))) (.cse24 (not (= 0 |old(~c_dr_pc~0)|))) (.cse15 (not (= 0 |old(~c_dr_st~0)|))) (.cse0 (and .cse49 .cse50 .cse33 .cse35 .cse5 .cse6 .cse48 .cse7 .cse36 .cse37)) (.cse18 (< |old(~q_read_ev~0)| 2)) (.cse27 (< |old(~q_write_ev~0)| 2)) (.cse40 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse22 (and .cse38 .cse46 .cse32 .cse33 .cse47 .cse6 .cse48 .cse7 .cse36 .cse19 .cse37)) (.cse21 (and .cse49 .cse50 .cse32 .cse33 .cse35 .cse6 .cse48 .cse7 .cse36 .cse37)) (.cse29 (< |old(~c_dr_st~0)| 2)) (.cse2 (and .cse38 .cse46 .cse32 .cse33 .cse35 .cse47 .cse6 .cse48 .cse7 .cse36 .cse37)) (.cse23 (not (= |old(~p_dw_st~0)| 0))) (.cse41 (< |old(~c_num_read~0)| |old(~p_num_write~0)|))) (and (let ((.cse4 (= ~q_free~0 1)) (.cse3 (= ~p_dw_pc~0 0)) (.cse10 (= ~p_last_write~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= ~q_buf_0~0 0)) (.cse13 (= 0 ~p_num_write~0))) (or .cse0 .cse1 (not (= |old(~q_free~0)| 1)) .cse2 (not (= 1 ~c_dr_i~0)) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~c_dr_st~0 2) .cse13) .cse14 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) .cse15 (not (= 0 |old(~p_last_write~0)|)) .cse16 .cse17 (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) .cse18 (and .cse4 .cse3 .cse6 .cse5 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12 .cse20 .cse13) .cse21 .cse22 .cse23 .cse24)) (or .cse25 .cse26 .cse18 .cse27 .cse28 .cse29 .cse30 (and .cse31 .cse32 .cse33 .cse34 .cse35 .cse6 .cse7 .cse36 .cse37 .cse38) .cse39) (or .cse26 .cse18 .cse27 .cse40 .cse29 (and .cse31 .cse32 .cse33 .cse34 .cse35 .cse6 .cse7 .cse36 .cse37) .cse41 .cse39) (or .cse0 .cse25 .cse26 .cse30 .cse2 .cse18 .cse27 .cse28 .cse22 .cse21 .cse39 .cse15) (or .cse26 .cse18 .cse29 .cse9 .cse42 .cse17 (not (= 1 |old(~c_num_read~0)|)) .cse39) (or .cse0 (not (= |old(~p_dw_st~0)| 2)) .cse1 .cse43 .cse16 .cse44 .cse2 .cse18 .cse27 .cse28 .cse22 .cse21 .cse42 .cse14 .cse24 .cse15) (or .cse0 .cse18 .cse27 .cse40 .cse22 .cse21 .cse29 .cse2 (or .cse43 .cse1 .cse45 .cse44 .cse23) .cse41))))) [2018-12-03 03:20:31,984 INFO L444 ceAbstractionStarter]: At program point L269(line 269) the Hoare annotation is: (let ((.cse32 (+ ~c_num_read~0 1)) (.cse30 (= ~p_dw_i~0 1)) (.cse31 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse22 (and (not (= ~p_dw_st~0 1)) .cse30 (= 1 ~c_dr_pc~0) .cse31 (= 1 ~p_dw_pc~0))) (.cse19 (<= .cse32 ~p_num_write~0)) (.cse20 (<= 2 ~p_dw_st~0)) (.cse23 (<= ~p_num_write~0 .cse32)) (.cse8 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (not .cse30)) (.cse28 (not (= 1 |old(~c_dr_pc~0)|))) (.cse9 (not (= |old(~p_dw_pc~0)| 1))) (.cse29 (+ |old(~c_num_read~0)| 1)) (.cse21 (<= 2 ~q_write_ev~0)) (.cse24 (<= 2 ~q_read_ev~0)) (.cse26 (= ~c_dr_pc~0 0)) (.cse25 (= ~c_num_read~0 0)) (.cse18 (= ~q_free~0 0))) (let ((.cse13 (not (= 0 |old(~c_num_read~0)|))) (.cse12 (and .cse21 .cse24 (and (= ~p_num_write~0 1) .cse26 .cse30 .cse31) (and .cse25 .cse18 (= ~p_dw_st~0 2) (= ~p_dw_pc~0 1)))) (.cse14 (not (= 0 |old(~c_dr_pc~0)|))) (.cse3 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse4 (< |old(~c_dr_st~0)| 2)) (.cse27 (not (= |old(~p_dw_st~0)| 0))) (.cse5 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (.cse16 (< |old(~p_num_write~0)| .cse29)) (.cse0 (or .cse8 .cse7 .cse28 .cse9)) (.cse1 (< |old(~q_read_ev~0)| 2)) (.cse2 (< |old(~q_write_ev~0)| 2)) (.cse11 (not (= |old(~q_free~0)| 0))) (.cse17 (< .cse29 |old(~p_num_write~0)|)) (.cse10 (and .cse22 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24)) (.cse6 (< |old(~p_dw_st~0)| 2)) (.cse15 (not (= 0 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (not (= |old(~p_dw_st~0)| 2)) .cse7 .cse8 .cse9 .cse10 .cse1 .cse2 .cse11 .cse12 (not (= 1 |old(~p_num_write~0)|)) .cse13 .cse14 .cse15) (or .cse16 .cse0 .cse1 .cse2 .cse11 .cse4 .cse17 .cse6) (or .cse7 (not (= 0 |old(~p_last_write~0)|)) (not (= |old(~q_free~0)| 1)) (not (= 2 |old(~q_write_ev~0)|)) (not (= 1 ~c_dr_i~0)) (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) .cse1 (and (= ~p_dw_pc~0 0) (= ~q_free~0 1) .cse24 (= ~p_dw_st~0 0) .cse25 (= ~q_write_ev~0 2) (= ~p_last_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_buf_0~0 0) .cse26 (= 0 ~p_num_write~0)) .cse27 .cse13 .cse12 .cse14 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) .cse15) (or .cse1 .cse2 .cse3 .cse4 .cse10 (or .cse8 .cse7 .cse28 .cse9 .cse27) .cse5) (or .cse16 .cse0 .cse1 .cse2 .cse11 .cse17 .cse10 .cse6 .cse15))))) [2018-12-03 03:20:31,984 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2018-12-03 03:20:31,984 INFO L448 ceAbstractionStarter]: For program point L251(lines 251 258) no Hoare annotation was computed. [2018-12-03 03:20:31,984 INFO L448 ceAbstractionStarter]: For program point L247(lines 237 277) no Hoare annotation was computed. [2018-12-03 03:20:31,985 INFO L444 ceAbstractionStarter]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse37 (= ~p_dw_i~0 1)) (.cse42 (+ ~c_num_read~0 1))) (let ((.cse35 (<= .cse42 ~p_num_write~0)) (.cse19 (<= 2 ~p_dw_st~0)) (.cse36 (<= ~p_num_write~0 .cse42)) (.cse38 (<= ~c_num_read~0 ~p_num_write~0)) (.cse39 (<= ~p_num_write~0 ~c_num_read~0)) (.cse22 (<= 2 ~c_dr_st~0)) (.cse24 (= 1 ~c_dr_pc~0)) (.cse20 (<= 2 ~q_write_ev~0)) (.cse23 (<= 2 ~q_read_ev~0)) (.cse25 (= ~p_last_write~0 ~q_buf_0~0)) (.cse40 (= ~c_dr_st~0 0)) (.cse26 (= 1 ~p_dw_pc~0)) (.cse27 (= ~q_free~0 0)) (.cse32 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not .cse37)) (.cse34 (not (= 1 |old(~c_dr_pc~0)|))) (.cse33 (not (= |old(~p_dw_pc~0)| 1))) (.cse41 (+ |old(~c_num_read~0)| 1))) (let ((.cse18 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse21 (= |old(~c_num_read~0)| ~c_num_read~0)) (.cse12 (< |old(~p_num_write~0)| .cse41)) (.cse17 (< .cse41 |old(~p_num_write~0)|)) (.cse13 (or .cse32 .cse1 .cse34 .cse33)) (.cse6 (not (= 2 |old(~q_write_ev~0)|))) (.cse28 (< |old(~p_dw_st~0)| 2)) (.cse5 (and (= ~p_dw_st~0 2) .cse20 .cse23 .cse25 .cse40 .cse26 (= ~c_num_read~0 0) .cse27 (= ~p_num_write~0 1) (= ~c_dr_pc~0 0))) (.cse15 (not (= |old(~q_free~0)| 0))) (.cse31 (not (= 1 |old(~p_num_write~0)|))) (.cse3 (not (= 0 |old(~c_num_read~0)|))) (.cse11 (not (= 0 |old(~c_dr_pc~0)|))) (.cse4 (not (= 0 |old(~c_dr_st~0)|))) (.cse0 (and .cse38 .cse39 .cse20 .cse22 (= ~p_dw_st~0 0) .cse23 .cse37 .cse24 .cse25 .cse26)) (.cse7 (< |old(~q_read_ev~0)| 2)) (.cse14 (< |old(~q_write_ev~0)| 2)) (.cse29 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse8 (and .cse27 .cse35 .cse19 .cse20 .cse36 .cse23 .cse37 .cse24 .cse25 .cse40 .cse26)) (.cse9 (and .cse38 .cse39 .cse19 .cse20 .cse22 .cse23 .cse37 .cse24 .cse25 .cse26)) (.cse16 (< |old(~c_dr_st~0)| 2)) (.cse2 (and .cse27 .cse35 .cse19 .cse20 .cse22 .cse36 .cse23 .cse37 .cse24 .cse25 .cse26)) (.cse10 (not (= |old(~p_dw_st~0)| 0))) (.cse30 (< |old(~c_num_read~0)| |old(~p_num_write~0)|))) (and (or .cse0 .cse1 (not (= |old(~q_free~0)| 1)) .cse2 (not (= 1 ~c_dr_i~0)) .cse3 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) .cse4 (not (= 0 |old(~p_last_write~0)|)) .cse5 .cse6 (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse13 .cse7 .cse14 .cse15 .cse16 .cse17 (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) .cse28) (or .cse13 .cse7 .cse14 .cse29 .cse16 (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) .cse30 .cse28) (or .cse0 .cse12 .cse13 .cse17 .cse2 .cse7 .cse14 .cse15 .cse8 .cse9 .cse28 .cse4) (or .cse13 .cse7 .cse16 (= ~q_write_ev~0 2) .cse31 .cse6 (not (= 1 |old(~c_num_read~0)|)) .cse28) (or .cse0 (not (= |old(~p_dw_st~0)| 2)) .cse1 .cse32 .cse5 .cse33 .cse2 .cse7 .cse14 .cse15 .cse8 .cse9 .cse31 .cse3 .cse11 .cse4) (or .cse0 .cse7 .cse14 .cse29 .cse8 .cse9 .cse16 .cse2 (or .cse32 .cse1 .cse34 .cse33 .cse10) .cse30))))) [2018-12-03 03:20:31,985 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 273) no Hoare annotation was computed. [2018-12-03 03:20:31,986 INFO L444 ceAbstractionStarter]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse48 (= ~p_dw_i~0 1)) (.cse52 (+ ~c_num_read~0 1))) (let ((.cse46 (<= .cse52 ~p_num_write~0)) (.cse32 (<= 2 ~p_dw_st~0)) (.cse47 (<= ~p_num_write~0 .cse52)) (.cse49 (<= ~c_num_read~0 ~p_num_write~0)) (.cse50 (<= ~p_num_write~0 ~c_num_read~0)) (.cse35 (<= 2 ~c_dr_st~0)) (.cse5 (= ~p_dw_st~0 0)) (.cse7 (= 1 ~c_dr_pc~0)) (.cse33 (<= 2 ~q_write_ev~0)) (.cse6 (<= 2 ~q_read_ev~0)) (.cse36 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= ~c_dr_st~0 0)) (.cse37 (= 1 ~p_dw_pc~0)) (.cse8 (= ~c_num_read~0 0)) (.cse38 (= ~q_free~0 0)) (.cse20 (= ~c_dr_pc~0 0)) (.cse43 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not .cse48)) (.cse45 (not (= 1 |old(~c_dr_pc~0)|))) (.cse44 (not (= |old(~p_dw_pc~0)| 1))) (.cse51 (+ |old(~c_num_read~0)| 1))) (let ((.cse31 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse34 (= |old(~c_num_read~0)| ~c_num_read~0)) (.cse25 (< |old(~p_num_write~0)| .cse51)) (.cse30 (< .cse51 |old(~p_num_write~0)|)) (.cse26 (or .cse43 .cse1 .cse45 .cse44)) (.cse9 (= ~q_write_ev~0 2)) (.cse17 (not (= 2 |old(~q_write_ev~0)|))) (.cse39 (< |old(~p_dw_st~0)| 2)) (.cse16 (and (= ~p_dw_st~0 2) .cse33 .cse6 .cse36 .cse19 .cse37 .cse8 .cse38 (= ~p_num_write~0 1) .cse20)) (.cse28 (not (= |old(~q_free~0)| 0))) (.cse42 (not (= 1 |old(~p_num_write~0)|))) (.cse14 (not (= 0 |old(~c_num_read~0)|))) (.cse24 (not (= 0 |old(~c_dr_pc~0)|))) (.cse15 (not (= 0 |old(~c_dr_st~0)|))) (.cse0 (and .cse49 .cse50 .cse33 .cse35 .cse5 .cse6 .cse48 .cse7 .cse36 .cse37)) (.cse18 (< |old(~q_read_ev~0)| 2)) (.cse27 (< |old(~q_write_ev~0)| 2)) (.cse40 (< |old(~p_num_write~0)| |old(~c_num_read~0)|)) (.cse22 (and .cse38 .cse46 .cse32 .cse33 .cse47 .cse6 .cse48 .cse7 .cse36 .cse19 .cse37)) (.cse21 (and .cse49 .cse50 .cse32 .cse33 .cse35 .cse6 .cse48 .cse7 .cse36 .cse37)) (.cse29 (< |old(~c_dr_st~0)| 2)) (.cse2 (and .cse38 .cse46 .cse32 .cse33 .cse35 .cse47 .cse6 .cse48 .cse7 .cse36 .cse37)) (.cse23 (not (= |old(~p_dw_st~0)| 0))) (.cse41 (< |old(~c_num_read~0)| |old(~p_num_write~0)|))) (and (let ((.cse4 (= ~q_free~0 1)) (.cse3 (= ~p_dw_pc~0 0)) (.cse10 (= ~p_last_write~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= ~q_buf_0~0 0)) (.cse13 (= 0 ~p_num_write~0))) (or .cse0 .cse1 (not (= |old(~q_free~0)| 1)) .cse2 (not (= 1 ~c_dr_i~0)) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~c_dr_st~0 2) .cse13) .cse14 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) .cse15 (not (= 0 |old(~p_last_write~0)|)) .cse16 .cse17 (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) .cse18 (and .cse4 .cse3 .cse6 .cse5 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12 .cse20 .cse13) .cse21 .cse22 .cse23 .cse24)) (or .cse25 .cse26 .cse18 .cse27 .cse28 .cse29 .cse30 (and .cse31 .cse32 .cse33 .cse34 .cse35 .cse6 .cse7 .cse36 .cse37 .cse38) .cse39) (or .cse26 .cse18 .cse27 .cse40 .cse29 (and .cse31 .cse32 .cse33 .cse34 .cse35 .cse6 .cse7 .cse36 .cse37) .cse41 .cse39) (or .cse0 .cse25 .cse26 .cse30 .cse2 .cse18 .cse27 .cse28 .cse22 .cse21 .cse39 .cse15) (or .cse26 .cse18 .cse29 .cse9 .cse42 .cse17 (not (= 1 |old(~c_num_read~0)|)) .cse39) (or .cse0 (not (= |old(~p_dw_st~0)| 2)) .cse1 .cse43 .cse16 .cse44 .cse2 .cse18 .cse27 .cse28 .cse22 .cse21 .cse42 .cse14 .cse24 .cse15) (or .cse0 .cse18 .cse27 .cse40 .cse22 .cse21 .cse29 .cse2 (or .cse43 .cse1 .cse45 .cse44 .cse23) .cse41))))) [2018-12-03 03:20:31,987 INFO L444 ceAbstractionStarter]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse12 (not (= ~p_dw_st~0 0))) (.cse9 (< ~q_write_ev~0 2)) (.cse10 (< ~p_num_write~0 ~c_num_read~0)) (.cse8 (= 0 is_do_read_c_triggered_~__retres1~1)) (.cse7 (not (= ~p_dw_pc~0 1))) (.cse11 (not (= ~q_free~0 1))) (.cse13 (< ~c_num_read~0 ~p_num_write~0)) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse6 (not (= 1 ~c_dr_pc~0))) (.cse3 (< ~c_dr_st~0 2)) (.cse4 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse5 (not (= ~p_dw_i~0 1))) (.cse20 (not (= ~p_dw_pc~0 0))) (.cse1 (< ~q_read_ev~0 2)) (.cse2 (not (= ~q_free~0 0))) (.cse18 (not (= 1 ~q_write_ev~0))) (.cse16 (not (= 1 ~p_num_write~0))) (.cse15 (= is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (not (= 0 ~c_num_read~0))) (.cse17 (not (= 0 ~c_dr_pc~0)))) (and (let ((.cse0 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse0) .cse1 .cse2 .cse3 (< .cse0 ~p_num_write~0) (<= 1 is_do_read_c_triggered_~__retres1~1) (or .cse4 .cse5 .cse6 .cse7) .cse8)) (or .cse9 .cse10 .cse4 .cse5 .cse6 .cse7 .cse11 .cse12 .cse8 .cse13 .cse14) (or .cse4 .cse5 .cse15 (not (= ~q_read_ev~0 1)) .cse7 .cse11 .cse9 .cse12 .cse16 (not (= 1 ~c_num_read~0)) .cse17 .cse14) (or .cse9 .cse10 .cse4 .cse5 .cse6 .cse8 .cse7 .cse11 .cse13 (< ~p_dw_st~0 2) .cse14) (or .cse1 .cse4 .cse5 .cse6 .cse2 (= is_do_read_c_triggered_~__retres1~1 1) .cse3 .cse18 .cse16 .cse19 .cse20) (or .cse4 .cse5 .cse20 .cse1 .cse2 .cse18 .cse16 .cse15 .cse19 .cse17 (not (= 0 ~c_dr_st~0))))) [2018-12-03 03:20:31,987 INFO L451 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2018-12-03 03:20:31,987 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 57) no Hoare annotation was computed. [2018-12-03 03:20:31,987 INFO L448 ceAbstractionStarter]: For program point L51(lines 51 60) no Hoare annotation was computed. [2018-12-03 03:20:31,987 INFO L448 ceAbstractionStarter]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2018-12-03 03:20:31,987 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2018-12-03 03:20:31,988 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2018-12-03 03:20:31,988 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 303 331) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (not (= 0 |old(~p_last_write~0)|)) (not (= |old(~q_free~0)| 1)) (not (= 2 |old(~q_write_ev~0)|)) (not (= 1 ~c_dr_i~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) (< |old(~q_read_ev~0)| 2) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (and (= ~p_dw_pc~0 0) (= ~q_free~0 1) (<= 2 ~q_read_ev~0) (= ~p_dw_st~0 0) (= ~c_dr_st~0 0) (= ~c_num_read~0 0) (= ~q_write_ev~0 2) (= ~p_last_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_buf_0~0 0) (= ~c_dr_pc~0 0) (= 0 ~p_num_write~0)) (not (= 0 |old(~c_dr_pc~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|))) [2018-12-03 03:20:31,988 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2018-12-03 03:20:31,988 INFO L448 ceAbstractionStarter]: For program point L318(line 318) no Hoare annotation was computed. [2018-12-03 03:20:31,989 INFO L444 ceAbstractionStarter]: At program point L317(line 317) the Hoare annotation is: (let ((.cse16 (+ ~c_num_read~0 1))) (let ((.cse9 (= ~q_free~0 0)) (.cse10 (<= .cse16 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 .cse16)) (.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse11 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse3 (<= 2 ~c_dr_st~0)) (.cse6 (= 1 ~c_dr_pc~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= 1 ~p_dw_pc~0)) (.cse5 (<= 2 ~q_read_ev~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_st~0 0)) (.cse14 (= ~c_num_read~0 0)) (.cse15 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= ~p_dw_i~0 1)) (not (= |old(~q_free~0)| 1)) (and .cse9 .cse10 .cse11 .cse2 .cse3 .cse12 .cse5 .cse6 .cse7 .cse8) (not (= 1 ~c_dr_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (not (= 0 |old(~p_last_write~0)|)) (and (= ~p_dw_st~0 2) .cse2 .cse5 .cse7 .cse13 .cse8 .cse14 .cse9 (= ~p_num_write~0 1) .cse15) (not (= 2 |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) (< |old(~q_read_ev~0)| 2) (and .cse9 .cse10 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse13 .cse8) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (not (= |old(~p_dw_st~0)| 0)) (and (= ~p_dw_pc~0 0) (= ~q_free~0 1) .cse5 .cse4 .cse13 .cse14 (= ~q_write_ev~0 2) (= ~p_last_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_buf_0~0 0) .cse15 (= 0 ~p_num_write~0)) (not (= 0 |old(~c_dr_pc~0)|))))) [2018-12-03 03:20:31,989 INFO L444 ceAbstractionStarter]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse13 (+ ~c_num_read~0 1))) (let ((.cse8 (= ~q_free~0 0)) (.cse9 (<= .cse13 ~p_num_write~0)) (.cse11 (<= ~p_num_write~0 .cse13)) (.cse12 (= ~c_dr_st~0 0)) (.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse10 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse3 (<= 2 ~c_dr_st~0)) (.cse4 (<= 2 ~q_read_ev~0)) (.cse5 (= 1 ~c_dr_pc~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 1 ~p_dw_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~p_dw_st~0 0) .cse4 .cse5 .cse6 .cse7) (not (= ~p_dw_i~0 1)) (not (= |old(~q_free~0)| 1)) (and .cse8 .cse9 .cse10 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7) (not (= 1 ~c_dr_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (not (= 0 |old(~p_last_write~0)|)) (and (= ~p_dw_st~0 2) .cse2 .cse4 .cse6 .cse12 .cse7 (= ~c_num_read~0 0) .cse8 (= ~p_num_write~0 1) (= ~c_dr_pc~0 0)) (not (= 2 |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) (< |old(~q_read_ev~0)| 2) (and .cse8 .cse9 .cse10 .cse2 .cse11 .cse4 .cse5 .cse6 .cse12 .cse7) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_dr_pc~0)|))))) [2018-12-03 03:20:31,989 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2018-12-03 03:20:31,990 INFO L448 ceAbstractionStarter]: For program point L314(line 314) no Hoare annotation was computed. [2018-12-03 03:20:31,990 INFO L444 ceAbstractionStarter]: At program point L313-1(lines 310 325) the Hoare annotation is: (let ((.cse16 (+ ~c_num_read~0 1))) (let ((.cse9 (= ~q_free~0 0)) (.cse10 (<= .cse16 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 .cse16)) (.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse11 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~q_write_ev~0)) (.cse3 (<= 2 ~c_dr_st~0)) (.cse6 (= 1 ~c_dr_pc~0)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= 1 ~p_dw_pc~0)) (.cse5 (<= 2 ~q_read_ev~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse13 (= ~c_dr_st~0 0)) (.cse14 (= ~c_num_read~0 0)) (.cse15 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= ~p_dw_i~0 1)) (not (= |old(~q_free~0)| 1)) (and .cse9 .cse10 .cse11 .cse2 .cse3 .cse12 .cse5 .cse6 .cse7 .cse8) (not (= 1 ~c_dr_i~0)) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|)) (not (= 0 |old(~p_last_write~0)|)) (and (= ~p_dw_st~0 2) .cse2 .cse5 .cse7 .cse13 .cse8 .cse14 .cse9 (= ~p_num_write~0 1) .cse15) (not (= 2 |old(~q_write_ev~0)|)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) (< |old(~q_read_ev~0)| 2) (and .cse9 .cse10 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse13 .cse8) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (not (= |old(~p_dw_st~0)| 0)) (and (= ~p_dw_pc~0 0) (= ~q_free~0 1) .cse5 .cse4 .cse13 .cse14 (= ~q_write_ev~0 2) (= ~p_last_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_buf_0~0 0) .cse15 (= 0 ~p_num_write~0)) (not (= 0 |old(~c_dr_pc~0)|))))) [2018-12-03 03:20:31,990 INFO L444 ceAbstractionStarter]: At program point L310(line 310) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (not (= 0 |old(~p_last_write~0)|)) (not (= |old(~q_free~0)| 1)) (not (= 2 |old(~q_write_ev~0)|)) (not (= 1 ~c_dr_i~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) (< |old(~q_read_ev~0)| 2) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_num_read~0)|)) (and (= ~p_dw_pc~0 0) (= ~q_free~0 1) (<= 2 ~q_read_ev~0) (= ~p_dw_st~0 0) (= ~c_dr_st~0 0) (= ~c_num_read~0 0) (= ~q_write_ev~0 2) (= ~p_last_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_buf_0~0 0) (= ~c_dr_pc~0 0) (= 0 ~p_num_write~0)) (not (= 0 |old(~c_dr_pc~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= 0 |old(~c_dr_st~0)|))) [2018-12-03 03:20:31,990 INFO L451 ceAbstractionStarter]: At program point L326(lines 303 331) the Hoare annotation is: true [2018-12-03 03:20:31,991 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 03:20:31,991 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~c_num_read~0 0) (= ~q_free~0 0) (= ~p_dw_pc~0 0) (= ~p_last_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~p_dw_st~0 0) (= ~q_buf_0~0 0) (not (= ~p_dw_i~0 1)) (= ~c_dr_pc~0 0) (= ~c_dr_st~0 0) (= 0 ~p_num_write~0)) [2018-12-03 03:20:31,991 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 03:20:31,991 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 03:20:31,991 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2018-12-03 03:20:31,991 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 41) no Hoare annotation was computed. [2018-12-03 03:20:31,992 INFO L448 ceAbstractionStarter]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2018-12-03 03:20:31,992 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2018-12-03 03:20:31,992 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2018-12-03 03:20:31,992 INFO L444 ceAbstractionStarter]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse3 (< ~c_dr_st~0 2)) (.cse12 (= is_do_write_p_triggered_~__retres1~0 0)) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse1 (< ~q_read_ev~0 2)) (.cse2 (not (= ~q_free~0 0))) (.cse8 (not (= 1 ~q_write_ev~0))) (.cse10 (not (= 0 ~c_num_read~0))) (.cse6 (not (= 1 ~c_dr_pc~0))) (.cse4 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse5 (not (= ~p_dw_i~0 1))) (.cse17 (not (= ~q_read_ev~0 1))) (.cse7 (not (= ~p_dw_pc~0 1))) (.cse15 (not (= ~q_free~0 1))) (.cse13 (not (= 0 ~c_dr_pc~0))) (.cse19 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse14 (= is_do_write_p_triggered_~__retres1~0 1)) (.cse9 (not (= 1 ~p_num_write~0))) (.cse18 (not (= 1 ~c_num_read~0))) (.cse16 (< ~p_dw_st~0 2))) (and (let ((.cse0 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse0) .cse1 .cse2 .cse3 (< .cse0 ~p_num_write~0) (or .cse4 .cse5 .cse6 .cse7) (= 0 is_do_write_p_triggered_~__retres1~0))) (or .cse1 .cse4 .cse5 .cse6 .cse2 .cse3 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse4 .cse5 .cse12 .cse11 .cse1 .cse2 .cse8 .cse9 .cse10 .cse13 (not (= 0 ~c_dr_st~0))) (or .cse4 .cse5 .cse14 .cse15 .cse9 .cse16 (or .cse6 .cse17 .cse7 (not (= 2 ~q_write_ev~0)) .cse18) .cse19) (or (or .cse4 .cse5 .cse17 .cse7 .cse15 .cse13 .cse19) .cse14 (< ~q_write_ev~0 2) .cse9 .cse18 .cse16))) [2018-12-03 03:20:31,992 INFO L451 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2018-12-03 03:20:31,993 INFO L448 ceAbstractionStarter]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2018-12-03 03:20:31,993 INFO L444 ceAbstractionStarter]: At program point L186(lines 135 191) the Hoare annotation is: (let ((.cse2 (not (= 0 |old(~c_num_read~0)|))) (.cse8 (not (= 0 |old(~c_dr_pc~0)|))) (.cse1 (< |old(~q_read_ev~0)| 2)) (.cse9 (< ~q_write_ev~0 2)) (.cse11 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse13 (not (= ~p_dw_pc~0 1))) (.cse12 (not (= |old(~q_free~0)| 0))) (.cse5 (= ~p_dw_st~0 0)) (.cse3 (= ~q_free~0 1)) (.cse10 (<= 2 ~c_dr_st~0)) (.cse4 (<= 2 ~q_read_ev~0)) (.cse6 (= 1 ~c_dr_pc~0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0))) (and (or .cse0 (not (= 0 ~p_last_write~0)) (not (= |old(~q_free~0)| 1)) (not (= 2 ~q_write_ev~0)) (not (= 1 ~c_dr_i~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_num_write~0)) .cse1 (not (= |old(~p_dw_st~0)| 0)) .cse2 (and .cse3 .cse4 .cse5 .cse6 (= ~c_num_read~0 0) .cse7 (= ~c_dr_st~0 2)) .cse8 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse1 .cse9 (and .cse3 .cse10 .cse4 .cse5 .cse6 (= ~c_num_read~0 1) .cse7) (not (= |old(~p_dw_st~0)| 2)) (or .cse11 .cse0 .cse12 .cse13 (not (= 1 ~p_num_write~0)) .cse2 .cse8)) (let ((.cse14 (+ |old(~c_num_read~0)| 1)) (.cse15 (<= ~p_num_write~0 ~c_num_read~0)) (.cse16 (<= ~c_num_read~0 ~p_num_write~0))) (or (< ~p_num_write~0 .cse14) .cse1 .cse9 (or .cse11 .cse0 (not (= 1 |old(~c_dr_pc~0)|)) .cse13) .cse12 (< .cse14 ~p_num_write~0) (and .cse15 .cse3 .cse10 .cse4 .cse5 .cse6 .cse16 .cse7) (and .cse15 .cse3 (<= 2 ~p_dw_st~0) .cse10 .cse4 .cse6 .cse16 .cse7) (< |old(~p_dw_st~0)| 2))))) [2018-12-03 03:20:31,993 INFO L448 ceAbstractionStarter]: For program point L151(lines 150 185) no Hoare annotation was computed. [2018-12-03 03:20:31,993 INFO L444 ceAbstractionStarter]: At program point L182(line 182) the Hoare annotation is: (let ((.cse1 (< ~q_write_ev~0 2)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse5 (not (= ~p_dw_pc~0 1))) (.cse4 (not (= |old(~q_free~0)| 0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse0 (< |old(~q_read_ev~0)| 2)) (.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse7 (not (= 0 |old(~c_dr_pc~0)|)))) (and (or .cse0 .cse1 (not (= |old(~p_dw_st~0)| 2)) (or .cse2 .cse3 .cse4 .cse5 (not (= 1 ~p_num_write~0)) .cse6 .cse7)) (let ((.cse8 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse8) .cse0 .cse1 (or .cse2 .cse3 (not (= 1 |old(~c_dr_pc~0)|)) .cse5) .cse4 (< .cse8 ~p_num_write~0) (< |old(~p_dw_st~0)| 2))) (or .cse3 (not (= 0 ~p_last_write~0)) (not (= |old(~q_free~0)| 1)) (not (= 2 ~q_write_ev~0)) (not (= 1 ~c_dr_i~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_num_write~0)) .cse0 (not (= |old(~p_dw_st~0)| 0)) .cse6 .cse7 (not (= |old(~c_last_read~0)| ~p_last_write~0))))) [2018-12-03 03:20:31,994 INFO L444 ceAbstractionStarter]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse7 (not (= |old(~q_free~0)| 1))) (.cse12 (not (= |old(~p_dw_st~0)| 0))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse10 (not (= 0 ~p_num_write~0))) (.cse18 (not (= |old(~q_free~0)| 0))) (.cse22 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse24 (not (= ~p_dw_pc~0 1)))) (let ((.cse16 (< ~q_write_ev~0 2)) (.cse1 (= ~q_free~0 1)) (.cse3 (= ~p_dw_st~0 0)) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (not (= 0 |old(~c_dr_pc~0)|))) (.cse2 (<= 2 ~q_read_ev~0)) (.cse6 (= ~c_dr_pc~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse8 (not (= 2 ~q_write_ev~0))) (.cse17 (or .cse22 .cse0 (not (= 1 |old(~c_dr_pc~0)|)) .cse24)) (.cse11 (< |old(~q_read_ev~0)| 2)) (.cse21 (and (or .cse7 .cse12 .cse9 .cse10) (or .cse18 .cse24 (not (= |old(~p_dw_st~0)| 2))))) (.cse23 (not (= 1 ~p_num_write~0))) (.cse13 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= 0 ~p_last_write~0)) .cse7 .cse8 (not (= 1 ~c_dr_i~0)) .cse9 (not (= 0 ~q_buf_0~0)) .cse10 .cse11 .cse12 .cse13 .cse14 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (let ((.cse15 (+ |old(~c_num_read~0)| 1)) (.cse19 (<= ~c_num_read~0 ~p_num_write~0)) (.cse20 (<= ~p_num_write~0 ~c_num_read~0))) (or (< ~p_num_write~0 .cse15) .cse11 .cse16 .cse17 .cse18 (< .cse15 ~p_num_write~0) (and .cse19 .cse20 .cse1 (<= 2 ~p_dw_st~0) .cse5 .cse2) (< |old(~p_dw_st~0)| 2) (and .cse19 .cse20 .cse1 .cse5 .cse2 .cse3))) (or .cse11 .cse16 .cse21 (and .cse1 .cse2 .cse3 (= ~c_num_read~0 1) .cse5 .cse6) (or .cse22 .cse0 .cse23 .cse13 .cse14) (and .cse2 (and (= ~q_free~0 0) .cse6) (and .cse4 (= ~p_dw_st~0 2)))) (or .cse8 .cse17 .cse11 .cse21 .cse23 (= ~c_dr_pc~0 1) .cse13)))) [2018-12-03 03:20:31,994 INFO L444 ceAbstractionStarter]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse4 (not (= ~p_dw_i~0 1))) (.cse10 (not (= |old(~q_free~0)| 1))) (.cse13 (not (= |old(~p_dw_st~0)| 0))) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse12 (not (= 0 ~p_num_write~0))) (.cse15 (not (= |old(~q_free~0)| 0))) (.cse16 (not (= ~p_dw_pc~0 1)))) (let ((.cse2 (and (or .cse10 .cse13 .cse11 .cse12) (or .cse15 .cse16 (not (= |old(~p_dw_st~0)| 2))))) (.cse5 (not (= 1 ~p_num_write~0))) (.cse8 (not (= 2 ~q_write_ev~0))) (.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse7 (not (= 0 |old(~c_dr_pc~0)|))) (.cse0 (< |old(~q_read_ev~0)| 2)) (.cse1 (< ~q_write_ev~0 2)) (.cse9 (or .cse3 .cse4 (not (= 1 |old(~c_dr_pc~0)|)) .cse16))) (and (or .cse0 .cse1 .cse2 (or .cse3 .cse4 .cse5 .cse6 .cse7)) (or .cse8 .cse9 .cse0 .cse2 .cse5 .cse6 (= ~p_dw_st~0 2)) (or .cse4 (not (= 0 ~p_last_write~0)) .cse10 .cse8 (not (= 1 ~c_dr_i~0)) .cse11 (not (= 0 ~q_buf_0~0)) .cse12 .cse0 .cse13 .cse6 .cse7 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (let ((.cse14 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse14) .cse0 .cse1 .cse9 (and (= 1 ~c_dr_pc~0) (= ~q_free~0 0) (<= 2 ~p_dw_st~0) (= |old(~c_num_read~0)| ~c_num_read~0) (<= 2 ~q_read_ev~0)) .cse15 (< .cse14 ~p_num_write~0) (< |old(~p_dw_st~0)| 2)))))) [2018-12-03 03:20:31,994 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 184) no Hoare annotation was computed. [2018-12-03 03:20:31,995 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 147) no Hoare annotation was computed. [2018-12-03 03:20:31,995 INFO L444 ceAbstractionStarter]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse3 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse4 (not (= ~p_dw_i~0 1))) (.cse15 (not (= |old(~q_free~0)| 1))) (.cse18 (not (= |old(~p_dw_st~0)| 0))) (.cse16 (not (= ~p_dw_pc~0 0))) (.cse17 (not (= 0 ~p_num_write~0))) (.cse20 (not (= |old(~q_free~0)| 0))) (.cse21 (not (= ~p_dw_pc~0 1)))) (let ((.cse2 (and (or .cse15 .cse18 .cse16 .cse17) (or .cse20 .cse21 (not (= |old(~p_dw_st~0)| 2))))) (.cse5 (not (= 1 ~p_num_write~0))) (.cse12 (= ~p_dw_st~0 2)) (.cse13 (not (= 2 ~q_write_ev~0))) (.cse11 (= ~c_num_read~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse7 (not (= 0 |old(~c_dr_pc~0)|))) (.cse0 (< |old(~q_read_ev~0)| 2)) (.cse1 (< ~q_write_ev~0 2)) (.cse14 (or .cse3 .cse4 (not (= 1 |old(~c_dr_pc~0)|)) .cse21)) (.cse9 (= ~q_free~0 0)) (.cse8 (<= 2 ~q_read_ev~0))) (and (or .cse0 .cse1 .cse2 (or .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 (and .cse9 .cse10) (and .cse11 .cse12))) (or .cse13 .cse14 .cse0 .cse2 .cse5 .cse6 .cse12) (or .cse4 (not (= 0 ~p_last_write~0)) .cse15 .cse13 (not (= 1 ~c_dr_i~0)) .cse16 (not (= 0 ~q_buf_0~0)) .cse17 .cse0 (and (= ~q_free~0 1) .cse8 (= ~p_dw_st~0 0) .cse11 (= ~c_last_read~0 ~p_last_write~0) .cse10) .cse18 .cse6 .cse7 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (let ((.cse19 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse19) .cse0 .cse1 .cse14 (and (= 1 ~c_dr_pc~0) .cse9 (<= 2 ~p_dw_st~0) (= |old(~c_num_read~0)| ~c_num_read~0) .cse8) .cse20 (< .cse19 ~p_num_write~0) (< |old(~p_dw_st~0)| 2)))))) [2018-12-03 03:20:31,995 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2018-12-03 03:20:31,995 INFO L444 ceAbstractionStarter]: At program point L177(line 177) the Hoare annotation is: (let ((.cse1 (< ~q_write_ev~0 2)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse5 (not (= ~p_dw_pc~0 1))) (.cse4 (not (= |old(~q_free~0)| 0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse0 (< |old(~q_read_ev~0)| 2)) (.cse6 (not (= 0 |old(~c_num_read~0)|))) (.cse7 (not (= 0 |old(~c_dr_pc~0)|)))) (and (or .cse0 .cse1 (not (= |old(~p_dw_st~0)| 2)) (or .cse2 .cse3 .cse4 .cse5 (not (= 1 ~p_num_write~0)) .cse6 .cse7)) (let ((.cse8 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse8) .cse0 .cse1 (or .cse2 .cse3 (not (= 1 |old(~c_dr_pc~0)|)) .cse5) .cse4 (< .cse8 ~p_num_write~0) (< |old(~p_dw_st~0)| 2))) (or .cse3 (not (= 0 ~p_last_write~0)) (not (= |old(~q_free~0)| 1)) (not (= 2 ~q_write_ev~0)) (not (= 1 ~c_dr_i~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_num_write~0)) .cse0 (not (= |old(~p_dw_st~0)| 0)) .cse6 .cse7 (not (= |old(~c_last_read~0)| ~p_last_write~0))))) [2018-12-03 03:20:31,996 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 146) no Hoare annotation was computed. [2018-12-03 03:20:31,996 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 179) no Hoare annotation was computed. [2018-12-03 03:20:31,996 INFO L444 ceAbstractionStarter]: At program point L169(line 169) the Hoare annotation is: (let ((.cse15 (not (= |old(~q_free~0)| 1))) (.cse19 (not (= |old(~p_dw_st~0)| 0))) (.cse17 (not (= ~p_dw_pc~0 0))) (.cse18 (not (= 0 ~p_num_write~0))) (.cse14 (not (= |old(~q_free~0)| 0))) (.cse7 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse8 (not (= ~p_dw_i~0 1))) (.cse20 (not (= ~p_dw_pc~0 1)))) (let ((.cse1 (< ~q_write_ev~0 2)) (.cse2 (= ~q_free~0 1)) (.cse5 (<= 2 ~p_dw_st~0)) (.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (not (= 0 |old(~c_dr_pc~0)|))) (.cse16 (not (= 2 ~q_write_ev~0))) (.cse13 (or .cse7 .cse8 (not (= 1 |old(~c_dr_pc~0)|)) .cse20)) (.cse0 (< |old(~q_read_ev~0)| 2)) (.cse4 (= ~q_read_ev~0 1)) (.cse6 (and (or .cse15 .cse19 .cse17 .cse18) (or .cse14 .cse20 (not (= |old(~p_dw_st~0)| 2))))) (.cse9 (not (= 1 ~p_num_write~0))) (.cse10 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 (and (and .cse2 .cse3 (= ~c_dr_pc~0 0) .cse4) .cse5 (= ~c_num_read~0 1)) .cse6 (or .cse7 .cse8 .cse9 .cse10 .cse11)) (let ((.cse12 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse12) .cse0 .cse1 .cse13 .cse14 (< .cse12 ~p_num_write~0) (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse2 .cse5 .cse3 (= 1 ~c_dr_pc~0)) (< |old(~p_dw_st~0)| 2))) (or .cse8 (not (= 0 ~p_last_write~0)) .cse15 .cse16 (not (= 1 ~c_dr_i~0)) .cse17 (not (= 0 ~q_buf_0~0)) .cse18 .cse0 .cse19 .cse10 .cse11 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse16 .cse13 .cse0 .cse4 .cse6 .cse9 .cse10)))) [2018-12-03 03:20:31,996 INFO L448 ceAbstractionStarter]: For program point L169-1(line 169) no Hoare annotation was computed. [2018-12-03 03:20:31,996 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2018-12-03 03:20:31,996 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2018-12-03 03:20:31,997 INFO L444 ceAbstractionStarter]: At program point init_modelENTRY(lines 332 348) the Hoare annotation is: (or (= |old(~p_dw_i~0)| 1) (and (= ~p_dw_pc~0 0) (not (= ~p_dw_i~0 1)) (= ~c_num_read~0 0) (= ~q_free~0 0) (= ~c_dr_pc~0 0) (= 0 ~p_num_write~0)) (not (= 0 ~p_last_write~0)) (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~q_free~0)| 0)) (not (= ~p_dw_st~0 0)) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~c_dr_pc~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= 0 ~c_dr_st~0))) [2018-12-03 03:20:32,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:20:32 BoogieIcfgContainer [2018-12-03 03:20:32,031 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 03:20:32,031 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 03:20:32,032 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 03:20:32,032 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 03:20:32,032 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:19:58" (3/4) ... [2018-12-03 03:20:32,035 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 03:20:32,040 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-12-03 03:20:32,040 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-12-03 03:20:32,040 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 03:20:32,040 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_write_p [2018-12-03 03:20:32,040 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-12-03 03:20:32,041 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2018-12-03 03:20:32,041 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 03:20:32,041 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-12-03 03:20:32,041 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-12-03 03:20:32,041 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2018-12-03 03:20:32,041 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-12-03 03:20:32,041 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2018-12-03 03:20:32,041 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_read_c [2018-12-03 03:20:32,041 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-12-03 03:20:32,046 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-12-03 03:20:32,047 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-03 03:20:32,070 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_st == 0) && 2 <= q_read_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) || !(p_dw_i == 1)) || !(\old(q_free) == 1)) || (((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(1 == c_dr_i)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || !(0 == \old(p_last_write))) || (((((((((p_dw_st == 2 && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && p_num_write == 1) && c_dr_pc == 0)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || \old(q_read_ev) < 2) || (((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || ((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0)) || (((((((((((p_dw_pc == 0 && q_free == 1) && 2 <= q_read_ev) && p_dw_st == 0) && c_dr_st == 0) && c_num_read == 0) && q_write_ev == 2) && p_last_write == 0) && c_last_read == p_last_write) && q_buf_0 == 0) && c_dr_pc == 0) && 0 == p_num_write)) || !(0 == \old(c_dr_pc)) [2018-12-03 03:20:32,071 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_st == 0) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) || !(p_dw_i == 1)) || !(\old(q_free) == 1)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(1 == c_dr_i)) || (((((((((((p_dw_pc == 0 && q_free == 1) && p_dw_st == 0) && 2 <= q_read_ev) && 1 == c_dr_pc) && c_num_read == 0) && q_write_ev == 2) && p_last_write == 0) && c_last_read == p_last_write) && q_buf_0 == 0) && c_dr_st == 2) && 0 == p_num_write)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || !(0 == \old(p_last_write))) || (((((((((p_dw_st == 2 && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && p_num_write == 1) && c_dr_pc == 0)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || \old(q_read_ev) < 2) || (((((((((((q_free == 1 && p_dw_pc == 0) && 2 <= q_read_ev) && p_dw_st == 0) && c_dr_st == 0) && c_num_read == 0) && q_write_ev == 2) && p_last_write == 0) && c_last_read == p_last_write) && q_buf_0 == 0) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_dr_pc))) && ((((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(q_read_ev) < 2) || \old(q_write_ev) < 2) || !(\old(q_free) == 0)) || \old(c_dr_st) < 2) || \old(c_num_read) + 1 < \old(p_num_write)) || (((((((((p_num_write == \old(p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && \old(c_num_read) == c_num_read) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0)) || \old(p_dw_st) < 2)) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(q_read_ev) < 2) || \old(q_write_ev) < 2) || \old(p_num_write) < \old(c_num_read)) || \old(c_dr_st) < 2) || ((((((((p_num_write == \old(p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && \old(c_num_read) == c_num_read) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) < \old(p_num_write)) || \old(p_dw_st) < 2)) && ((((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_st == 0) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) || \old(p_num_write) < \old(c_num_read) + 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(q_read_ev) < 2) || \old(q_write_ev) < 2) || !(\old(q_free) == 0)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) < 2) || !(0 == \old(c_dr_st)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(q_read_ev) < 2) || \old(c_dr_st) < 2) || q_write_ev == 2) || !(1 == \old(p_num_write))) || !(2 == \old(q_write_ev))) || !(1 == \old(c_num_read))) || \old(p_dw_st) < 2)) && ((((((((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_st == 0) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) || !(\old(p_dw_st) == 2)) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((((p_dw_st == 2 && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && p_num_write == 1) && c_dr_pc == 0)) || !(\old(p_dw_pc) == 1)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(q_read_ev) < 2) || \old(q_write_ev) < 2) || !(\old(q_free) == 0)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(1 == \old(p_num_write))) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || !(0 == \old(c_dr_st)))) && ((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_st == 0) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) || \old(q_read_ev) < 2) || \old(q_write_ev) < 2) || \old(p_num_write) < \old(c_num_read)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_dr_st) < 2) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || \old(c_num_read) < \old(p_num_write)) [2018-12-03 03:20:32,071 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_st == 0) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) || !(p_dw_i == 1)) || !(\old(q_free) == 1)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(1 == c_dr_i)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || !(0 == \old(p_last_write))) || (((((((((p_dw_st == 2 && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && p_num_write == 1) && c_dr_pc == 0)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || \old(q_read_ev) < 2) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_dr_pc))) && ((((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(q_read_ev) < 2) || \old(q_write_ev) < 2) || !(\old(q_free) == 0)) || \old(c_dr_st) < 2) || \old(c_num_read) + 1 < \old(p_num_write)) || (((((((((p_num_write == \old(p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && \old(c_num_read) == c_num_read) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0)) || \old(p_dw_st) < 2)) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(q_read_ev) < 2) || \old(q_write_ev) < 2) || \old(p_num_write) < \old(c_num_read)) || \old(c_dr_st) < 2) || ((((((((p_num_write == \old(p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && \old(c_num_read) == c_num_read) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) < \old(p_num_write)) || \old(p_dw_st) < 2)) && ((((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_st == 0) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) || \old(p_num_write) < \old(c_num_read) + 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(q_read_ev) < 2) || \old(q_write_ev) < 2) || !(\old(q_free) == 0)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) < 2) || !(0 == \old(c_dr_st)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(q_read_ev) < 2) || \old(c_dr_st) < 2) || q_write_ev == 2) || !(1 == \old(p_num_write))) || !(2 == \old(q_write_ev))) || !(1 == \old(c_num_read))) || \old(p_dw_st) < 2)) && ((((((((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_st == 0) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) || !(\old(p_dw_st) == 2)) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((((p_dw_st == 2 && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && p_num_write == 1) && c_dr_pc == 0)) || !(\old(p_dw_pc) == 1)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(q_read_ev) < 2) || \old(q_write_ev) < 2) || !(\old(q_free) == 0)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(1 == \old(p_num_write))) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || !(0 == \old(c_dr_st)))) && ((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_st == 0) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) || \old(q_read_ev) < 2) || \old(q_write_ev) < 2) || \old(p_num_write) < \old(c_num_read)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_dr_st) < 2) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || \old(c_num_read) < \old(p_num_write)) [2018-12-03 03:20:32,072 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(2 == \old(c_dr_st)) || !(2 == \old(q_write_ev))) || !(0 == \old(q_buf_0))) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == c_dr_pc)) || !(\old(q_free) == 1) || !(\old(p_dw_pc) == 0)) || ((((((q_write_ev == 2 && c_dr_st == 2) && p_dw_pc == 0) && q_free == 1) && p_last_write == q_buf_0) && c_last_read == p_last_write) && 0 == p_num_write)) || !(0 == \old(p_num_write))) || q_read_ev < 2) || (((((p_dw_pc == 0 && p_last_write == q_buf_0) && c_dr_st == 0) && q_free == 0) && q_write_ev == 2) && 1 == p_num_write)) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write))) && ((((((((((((((((((((p_dw_pc == 0 && q_free == 1) && c_dr_st == 0) && q_write_ev == 2) && c_last_read == p_last_write) && q_buf_0 == 0) && 0 == p_num_write) || !(p_dw_i == 1)) || !(0 == \old(p_last_write))) || !(\old(q_free) == 1)) || !(2 == \old(q_write_ev))) || !(1 == c_dr_i)) || (((((p_dw_pc == 0 && 2 <= q_write_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && q_free == 0) && p_num_write == 1)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || q_read_ev < 2) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(c_last_read == \old(p_last_write))) || !(0 == \old(c_dr_st)))) && (((((q_read_ev < 2 || \old(q_write_ev) < 2) || \old(c_dr_st) < 2) || ((((((2 <= q_write_ev && 2 <= c_dr_st) && \old(p_num_write) + 1 <= p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0) && p_num_write <= c_num_read + 1)) || ((((((2 <= q_write_ev && \old(p_num_write) + 1 <= p_num_write) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && q_free == 0) && p_num_write <= c_num_read + 1)) || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || \old(p_num_write) < c_num_read) || c_num_read < \old(p_num_write)) [2018-12-03 03:20:32,072 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(p_dw_i == 1) || ((((((2 <= q_write_ev && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && q_free == 0) && p_dw_st == 2) && p_num_write == 1)) || !(0 == \old(p_last_write))) || !(\old(q_free) == 1)) || !(2 == \old(q_write_ev))) || !(1 == c_dr_i)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || q_read_ev < 2) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(c_last_read == \old(p_last_write))) || !(0 == \old(c_dr_st))) && (((((q_read_ev < 2 || \old(q_write_ev) < 2) || (((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && 1 == p_dw_pc) && q_free == 0) && p_num_write <= c_num_read + 1)) || \old(c_dr_st) < 2) || (((((((2 <= p_dw_st && 2 <= q_write_ev) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && c_dr_st == 0) && 1 == p_dw_pc) && q_free == 0) && p_num_write <= c_num_read + 1)) || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || \old(p_num_write) < c_num_read) || c_num_read < \old(p_num_write))) && (((((((((((!(2 == \old(c_dr_st)) || !(2 == \old(q_write_ev))) || !(0 == \old(q_buf_0))) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == c_dr_pc)) || ((((((p_last_write == q_buf_0 && c_dr_st == 0) && 1 == p_dw_pc) && q_free == 0) && q_write_ev == 2) && 1 == p_num_write) && p_dw_st == 2)) || !(\old(q_free) == 1) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || q_read_ev < 2) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write))) [2018-12-03 03:20:32,072 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(2 == \old(c_dr_st)) || !(2 == \old(q_write_ev))) || !(0 == \old(q_buf_0))) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == c_dr_pc)) || !(\old(q_free) == 1) || !(\old(p_dw_pc) == 0)) || (((((p_dw_pc == 0 && q_free == 1) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 0 == p_num_write)) || !(0 == \old(p_num_write))) || q_read_ev < 2) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write))) && ((((q_read_ev < 2 || \old(q_write_ev) < 2) || \old(c_dr_st) < 2) || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || \old(p_num_write) < c_num_read) || c_num_read < \old(p_num_write)) || ((((p_last_write == q_buf_0 && 1 == p_dw_pc) && p_num_write == \old(p_num_write)) && 2 <= q_write_ev) && 2 <= c_dr_st))) && (((((((((((((!(p_dw_i == 1) || !(0 == \old(p_last_write))) || !(\old(q_free) == 1)) || !(2 == \old(q_write_ev))) || !(1 == c_dr_i)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || (((((p_last_write == q_buf_0 && p_dw_pc == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_st == 0) && 0 == p_num_write)) || q_read_ev < 2) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(c_last_read == \old(p_last_write))) || !(0 == \old(c_dr_st))) [2018-12-03 03:20:32,072 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(p_dw_i == 1) || (((((q_free == 1 && 2 <= q_read_ev) && p_dw_st == 0) && c_num_read == 0) && c_last_read == p_last_write) && c_dr_pc == 0)) || !(0 == p_last_write)) || !(\old(q_free) == 1)) || !(2 == q_write_ev)) || !(1 == c_dr_i)) || !(p_dw_pc == 0)) || !(0 == q_buf_0)) || !(0 == p_num_write)) || \old(q_read_ev) < 2) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || !(\old(c_last_read) == p_last_write)) && ((((((((p_num_write < \old(c_num_read) + 1 || \old(q_read_ev) < 2) || q_write_ev < 2) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && 2 <= q_read_ev)) || \old(p_dw_st) < 2) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && c_last_read == p_last_write) && 2 <= q_read_ev) && p_dw_st == 0))) && (((((\old(q_read_ev) < 2 || q_write_ev < 2) || ((((!(\old(q_free) == 1) || !(\old(p_dw_st) == 0)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) && ((!(\old(q_free) == 0) || !(p_dw_pc == 1)) || !(\old(p_dw_st) == 2)))) || (((((q_free == 1 && 2 <= q_read_ev) && p_dw_st == 0) && c_num_read == 1) && c_last_read == p_last_write) && c_dr_pc == 0)) || (((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || ((2 <= q_read_ev && q_free == 0 && c_dr_pc == 0) && c_num_read == 0 && p_dw_st == 2))) && ((((((!(2 == q_write_ev) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || \old(q_read_ev) < 2) || ((((!(\old(q_free) == 1) || !(\old(p_dw_st) == 0)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) && ((!(\old(q_free) == 0) || !(p_dw_pc == 1)) || !(\old(p_dw_st) == 2)))) || !(1 == p_num_write)) || c_dr_pc == 1) || !(0 == \old(c_num_read))) [2018-12-03 03:20:32,072 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(p_dw_i == 1) || !(0 == p_last_write)) || !(\old(q_free) == 1)) || !(2 == q_write_ev)) || !(1 == c_dr_i)) || !(p_dw_pc == 0)) || !(0 == q_buf_0)) || !(0 == p_num_write)) || \old(q_read_ev) < 2) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || ((((((q_free == 1 && 2 <= q_read_ev) && p_dw_st == 0) && 1 == c_dr_pc) && c_num_read == 0) && c_last_read == p_last_write) && c_dr_st == 2)) || !(0 == \old(c_dr_pc))) || !(\old(c_last_read) == p_last_write)) && ((((\old(q_read_ev) < 2 || q_write_ev < 2) || ((((((q_free == 1 && 2 <= c_dr_st) && 2 <= q_read_ev) && p_dw_st == 0) && 1 == c_dr_pc) && c_num_read == 1) && c_last_read == p_last_write)) || !(\old(p_dw_st) == 2)) || (((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc)))) && ((((((((p_num_write < \old(c_num_read) + 1 || \old(q_read_ev) < 2) || q_write_ev < 2) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || (((((((p_num_write <= c_num_read && q_free == 1) && 2 <= c_dr_st) && 2 <= q_read_ev) && p_dw_st == 0) && 1 == c_dr_pc) && c_num_read <= p_num_write) && c_last_read == p_last_write)) || (((((((p_num_write <= c_num_read && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == c_dr_pc) && c_num_read <= p_num_write) && c_last_read == p_last_write)) || \old(p_dw_st) < 2) [2018-12-03 03:20:32,072 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(q_read_ev) < 2 || q_write_ev < 2) || ((((!(\old(q_free) == 1) || !(\old(p_dw_st) == 0)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) && ((!(\old(q_free) == 0) || !(p_dw_pc == 1)) || !(\old(p_dw_st) == 2)))) || (((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) && ((((((!(2 == q_write_ev) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || \old(q_read_ev) < 2) || ((((!(\old(q_free) == 1) || !(\old(p_dw_st) == 0)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) && ((!(\old(q_free) == 0) || !(p_dw_pc == 1)) || !(\old(p_dw_st) == 2)))) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || p_dw_st == 2)) && ((((((((((((!(p_dw_i == 1) || !(0 == p_last_write)) || !(\old(q_free) == 1)) || !(2 == q_write_ev)) || !(1 == c_dr_i)) || !(p_dw_pc == 0)) || !(0 == q_buf_0)) || !(0 == p_num_write)) || \old(q_read_ev) < 2) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || !(\old(c_last_read) == p_last_write))) && (((((((p_num_write < \old(c_num_read) + 1 || \old(q_read_ev) < 2) || q_write_ev < 2) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || ((((1 == c_dr_pc && q_free == 0) && 2 <= p_dw_st) && \old(c_num_read) == c_num_read) && 2 <= q_read_ev)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || \old(p_dw_st) < 2) [2018-12-03 03:20:32,101 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a82ddc05-2609-4c98-bc31-2ef2922dafdc/bin-2019/utaipan/witness.graphml [2018-12-03 03:20:32,101 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 03:20:32,102 INFO L168 Benchmark]: Toolchain (without parser) took 34511.74 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 958.8 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 178.5 MB. Max. memory is 11.5 GB. [2018-12-03 03:20:32,102 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 03:20:32,102 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.43 ms. Allocated memory is still 1.0 GB. Free memory was 958.8 MB in the beginning and 942.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-03 03:20:32,102 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.17 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 03:20:32,103 INFO L168 Benchmark]: Boogie Preprocessor took 53.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -168.7 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-03 03:20:32,103 INFO L168 Benchmark]: RCFGBuilder took 228.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2018-12-03 03:20:32,103 INFO L168 Benchmark]: TraceAbstraction took 33980.33 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -933.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-03 03:20:32,103 INFO L168 Benchmark]: Witness Printer took 69.47 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 03:20:32,105 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 158.43 ms. Allocated memory is still 1.0 GB. Free memory was 958.8 MB in the beginning and 942.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.17 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -168.7 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 228.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33980.33 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -933.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 69.47 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_st == 0) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) || !(p_dw_i == 1)) || !(\old(q_free) == 1)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(1 == c_dr_i)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || !(0 == \old(p_last_write))) || (((((((((p_dw_st == 2 && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && p_num_write == 1) && c_dr_pc == 0)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || \old(q_read_ev) < 2) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_dr_pc))) && ((((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(q_read_ev) < 2) || \old(q_write_ev) < 2) || !(\old(q_free) == 0)) || \old(c_dr_st) < 2) || \old(c_num_read) + 1 < \old(p_num_write)) || (((((((((p_num_write == \old(p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && \old(c_num_read) == c_num_read) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0)) || \old(p_dw_st) < 2)) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(q_read_ev) < 2) || \old(q_write_ev) < 2) || \old(p_num_write) < \old(c_num_read)) || \old(c_dr_st) < 2) || ((((((((p_num_write == \old(p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && \old(c_num_read) == c_num_read) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) < \old(p_num_write)) || \old(p_dw_st) < 2)) && ((((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_st == 0) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) || \old(p_num_write) < \old(c_num_read) + 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(q_read_ev) < 2) || \old(q_write_ev) < 2) || !(\old(q_free) == 0)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) < 2) || !(0 == \old(c_dr_st)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(q_read_ev) < 2) || \old(c_dr_st) < 2) || q_write_ev == 2) || !(1 == \old(p_num_write))) || !(2 == \old(q_write_ev))) || !(1 == \old(c_num_read))) || \old(p_dw_st) < 2)) && ((((((((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_st == 0) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) || !(\old(p_dw_st) == 2)) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((((p_dw_st == 2 && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && p_num_write == 1) && c_dr_pc == 0)) || !(\old(p_dw_pc) == 1)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(q_read_ev) < 2) || \old(q_write_ev) < 2) || !(\old(q_free) == 0)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(1 == \old(p_num_write))) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || !(0 == \old(c_dr_st)))) && ((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_st == 0) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) || \old(q_read_ev) < 2) || \old(q_write_ev) < 2) || \old(p_num_write) < \old(c_num_read)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_dr_st) < 2) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || \old(c_num_read) < \old(p_num_write)) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((\old(q_read_ev) < 2 || q_write_ev < 2) || ((((!(\old(q_free) == 1) || !(\old(p_dw_st) == 0)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) && ((!(\old(q_free) == 0) || !(p_dw_pc == 1)) || !(\old(p_dw_st) == 2)))) || (((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) && ((((((!(2 == q_write_ev) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || \old(q_read_ev) < 2) || ((((!(\old(q_free) == 1) || !(\old(p_dw_st) == 0)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) && ((!(\old(q_free) == 0) || !(p_dw_pc == 1)) || !(\old(p_dw_st) == 2)))) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || p_dw_st == 2)) && ((((((((((((!(p_dw_i == 1) || !(0 == p_last_write)) || !(\old(q_free) == 1)) || !(2 == q_write_ev)) || !(1 == c_dr_i)) || !(p_dw_pc == 0)) || !(0 == q_buf_0)) || !(0 == p_num_write)) || \old(q_read_ev) < 2) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || !(\old(c_last_read) == p_last_write))) && (((((((p_num_write < \old(c_num_read) + 1 || \old(q_read_ev) < 2) || q_write_ev < 2) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || ((((1 == c_dr_pc && q_free == 0) && 2 <= p_dw_st) && \old(c_num_read) == c_num_read) && 2 <= q_read_ev)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || \old(p_dw_st) < 2) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((((!(2 == \old(c_dr_st)) || !(2 == \old(q_write_ev))) || !(0 == \old(q_buf_0))) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == c_dr_pc)) || !(\old(q_free) == 1) || !(\old(p_dw_pc) == 0)) || ((((((q_write_ev == 2 && c_dr_st == 2) && p_dw_pc == 0) && q_free == 1) && p_last_write == q_buf_0) && c_last_read == p_last_write) && 0 == p_num_write)) || !(0 == \old(p_num_write))) || q_read_ev < 2) || (((((p_dw_pc == 0 && p_last_write == q_buf_0) && c_dr_st == 0) && q_free == 0) && q_write_ev == 2) && 1 == p_num_write)) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write))) && ((((((((((((((((((((p_dw_pc == 0 && q_free == 1) && c_dr_st == 0) && q_write_ev == 2) && c_last_read == p_last_write) && q_buf_0 == 0) && 0 == p_num_write) || !(p_dw_i == 1)) || !(0 == \old(p_last_write))) || !(\old(q_free) == 1)) || !(2 == \old(q_write_ev))) || !(1 == c_dr_i)) || (((((p_dw_pc == 0 && 2 <= q_write_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && q_free == 0) && p_num_write == 1)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || q_read_ev < 2) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(c_last_read == \old(p_last_write))) || !(0 == \old(c_dr_st)))) && (((((q_read_ev < 2 || \old(q_write_ev) < 2) || \old(c_dr_st) < 2) || ((((((2 <= q_write_ev && 2 <= c_dr_st) && \old(p_num_write) + 1 <= p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0) && p_num_write <= c_num_read + 1)) || ((((((2 <= q_write_ev && \old(p_num_write) + 1 <= p_num_write) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && q_free == 0) && p_num_write <= c_num_read + 1)) || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || \old(p_num_write) < c_num_read) || c_num_read < \old(p_num_write)) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((((((((((!(p_dw_i == 1) || (((((q_free == 1 && 2 <= q_read_ev) && p_dw_st == 0) && c_num_read == 0) && c_last_read == p_last_write) && c_dr_pc == 0)) || !(0 == p_last_write)) || !(\old(q_free) == 1)) || !(2 == q_write_ev)) || !(1 == c_dr_i)) || !(p_dw_pc == 0)) || !(0 == q_buf_0)) || !(0 == p_num_write)) || \old(q_read_ev) < 2) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || !(\old(c_last_read) == p_last_write)) && ((((((((p_num_write < \old(c_num_read) + 1 || \old(q_read_ev) < 2) || q_write_ev < 2) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && 2 <= q_read_ev)) || \old(p_dw_st) < 2) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && q_free == 1) && c_last_read == p_last_write) && 2 <= q_read_ev) && p_dw_st == 0))) && (((((\old(q_read_ev) < 2 || q_write_ev < 2) || ((((!(\old(q_free) == 1) || !(\old(p_dw_st) == 0)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) && ((!(\old(q_free) == 0) || !(p_dw_pc == 1)) || !(\old(p_dw_st) == 2)))) || (((((q_free == 1 && 2 <= q_read_ev) && p_dw_st == 0) && c_num_read == 1) && c_last_read == p_last_write) && c_dr_pc == 0)) || (((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || ((2 <= q_read_ev && q_free == 0 && c_dr_pc == 0) && c_num_read == 0 && p_dw_st == 2))) && ((((((!(2 == q_write_ev) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || \old(q_read_ev) < 2) || ((((!(\old(q_free) == 1) || !(\old(p_dw_st) == 0)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) && ((!(\old(q_free) == 0) || !(p_dw_pc == 1)) || !(\old(p_dw_st) == 2)))) || !(1 == p_num_write)) || c_dr_pc == 1) || !(0 == \old(c_num_read))) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((((p_num_write < c_num_read + 1 || q_read_ev < 2) || !(q_free == 0)) || c_dr_st < 2) || c_num_read + 1 < p_num_write) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(p_dw_pc == 1)) || 0 == __retres1) && ((((((((((q_read_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_free == 0)) || c_dr_st < 2) || !(1 == q_write_ev)) || !(1 == p_num_write)) || !(0 == c_num_read)) || !(p_dw_pc == 0)) || __retres1 == 0)) && ((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || __retres1 == 0) || !(p_dw_pc == 0)) || q_read_ev < 2) || !(q_free == 0)) || !(1 == q_write_ev)) || !(1 == p_num_write)) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(0 == c_dr_st))) && (((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || __retres1 == 1) || !(q_free == 1)) || !(1 == p_num_write)) || p_dw_st < 2) || (((!(1 == c_dr_pc) || !(q_read_ev == 1)) || !(p_dw_pc == 1)) || !(2 == q_write_ev)) || !(1 == c_num_read)) || !(c_last_read == p_last_write))) && (((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(q_read_ev == 1)) || !(p_dw_pc == 1)) || !(q_free == 1)) || !(0 == c_dr_pc)) || !(c_last_read == p_last_write)) || __retres1 == 1) || q_write_ev < 2) || !(1 == p_num_write)) || !(1 == c_num_read)) || p_dw_st < 2) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_st == 0) && 2 <= q_read_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) || !(p_dw_i == 1)) || !(\old(q_free) == 1)) || (((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(1 == c_dr_i)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || !(0 == \old(p_last_write))) || (((((((((p_dw_st == 2 && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && p_num_write == 1) && c_dr_pc == 0)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || \old(q_read_ev) < 2) || (((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || ((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0)) || (((((((((((p_dw_pc == 0 && q_free == 1) && 2 <= q_read_ev) && p_dw_st == 0) && c_dr_st == 0) && c_num_read == 0) && q_write_ev == 2) && p_last_write == 0) && c_last_read == p_last_write) && q_buf_0 == 0) && c_dr_pc == 0) && 0 == p_num_write)) || !(0 == \old(c_dr_pc)) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_st == 0) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) || !(p_dw_i == 1)) || !(\old(q_free) == 1)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(1 == c_dr_i)) || (((((((((((p_dw_pc == 0 && q_free == 1) && p_dw_st == 0) && 2 <= q_read_ev) && 1 == c_dr_pc) && c_num_read == 0) && q_write_ev == 2) && p_last_write == 0) && c_last_read == p_last_write) && q_buf_0 == 0) && c_dr_st == 2) && 0 == p_num_write)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || !(0 == \old(p_last_write))) || (((((((((p_dw_st == 2 && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && p_num_write == 1) && c_dr_pc == 0)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || \old(q_read_ev) < 2) || (((((((((((q_free == 1 && p_dw_pc == 0) && 2 <= q_read_ev) && p_dw_st == 0) && c_dr_st == 0) && c_num_read == 0) && q_write_ev == 2) && p_last_write == 0) && c_last_read == p_last_write) && q_buf_0 == 0) && c_dr_pc == 0) && 0 == p_num_write)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_dr_pc))) && ((((((((\old(p_num_write) < \old(c_num_read) + 1 || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(q_read_ev) < 2) || \old(q_write_ev) < 2) || !(\old(q_free) == 0)) || \old(c_dr_st) < 2) || \old(c_num_read) + 1 < \old(p_num_write)) || (((((((((p_num_write == \old(p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && \old(c_num_read) == c_num_read) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) && q_free == 0)) || \old(p_dw_st) < 2)) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(q_read_ev) < 2) || \old(q_write_ev) < 2) || \old(p_num_write) < \old(c_num_read)) || \old(c_dr_st) < 2) || ((((((((p_num_write == \old(p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && \old(c_num_read) == c_num_read) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) < \old(p_num_write)) || \old(p_dw_st) < 2)) && ((((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_st == 0) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) || \old(p_num_write) < \old(c_num_read) + 1) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(c_num_read) + 1 < \old(p_num_write)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(q_read_ev) < 2) || \old(q_write_ev) < 2) || !(\old(q_free) == 0)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) < 2) || !(0 == \old(c_dr_st)))) && ((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(q_read_ev) < 2) || \old(c_dr_st) < 2) || q_write_ev == 2) || !(1 == \old(p_num_write))) || !(2 == \old(q_write_ev))) || !(1 == \old(c_num_read))) || \old(p_dw_st) < 2)) && ((((((((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_st == 0) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) || !(\old(p_dw_st) == 2)) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((((p_dw_st == 2 && 2 <= q_write_ev) && 2 <= q_read_ev) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && p_num_write == 1) && c_dr_pc == 0)) || !(\old(p_dw_pc) == 1)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(q_read_ev) < 2) || \old(q_write_ev) < 2) || !(\old(q_free) == 0)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(1 == \old(p_num_write))) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || !(0 == \old(c_dr_st)))) && ((((((((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_st == 0) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc) || \old(q_read_ev) < 2) || \old(q_write_ev) < 2) || \old(p_num_write) < \old(c_num_read)) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) || (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_dr_st) < 2) || ((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_num_write <= c_num_read + 1) && 2 <= q_read_ev) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || \old(c_num_read) < \old(p_num_write)) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((((((!(p_dw_i == 1) || ((((((2 <= q_write_ev && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && q_free == 0) && p_dw_st == 2) && p_num_write == 1)) || !(0 == \old(p_last_write))) || !(\old(q_free) == 1)) || !(2 == \old(q_write_ev))) || !(1 == c_dr_i)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || q_read_ev < 2) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(c_last_read == \old(p_last_write))) || !(0 == \old(c_dr_st))) && (((((q_read_ev < 2 || \old(q_write_ev) < 2) || (((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && 1 == p_dw_pc) && q_free == 0) && p_num_write <= c_num_read + 1)) || \old(c_dr_st) < 2) || (((((((2 <= p_dw_st && 2 <= q_write_ev) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && c_dr_st == 0) && 1 == p_dw_pc) && q_free == 0) && p_num_write <= c_num_read + 1)) || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || \old(p_num_write) < c_num_read) || c_num_read < \old(p_num_write))) && (((((((((((!(2 == \old(c_dr_st)) || !(2 == \old(q_write_ev))) || !(0 == \old(q_buf_0))) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == c_dr_pc)) || ((((((p_last_write == q_buf_0 && c_dr_st == 0) && 1 == p_dw_pc) && q_free == 0) && q_write_ev == 2) && 1 == p_num_write) && p_dw_st == 2)) || !(\old(q_free) == 1) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || q_read_ev < 2) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write))) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((((((p_num_write < c_num_read + 1 || q_read_ev < 2) || !(q_free == 0)) || c_dr_st < 2) || c_num_read + 1 < p_num_write) || 1 <= __retres1) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(p_dw_pc == 1)) || 0 == __retres1) && ((((((((((q_write_ev < 2 || p_num_write < c_num_read) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(p_dw_pc == 1)) || !(q_free == 1)) || !(p_dw_st == 0)) || 0 == __retres1) || c_num_read < p_num_write) || !(c_last_read == p_last_write))) && (((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || __retres1 == 0) || !(q_read_ev == 1)) || !(p_dw_pc == 1)) || !(q_free == 1)) || q_write_ev < 2) || !(p_dw_st == 0)) || !(1 == p_num_write)) || !(1 == c_num_read)) || !(0 == c_dr_pc)) || !(c_last_read == p_last_write))) && ((((((((((q_write_ev < 2 || p_num_write < c_num_read) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || 0 == __retres1) || !(p_dw_pc == 1)) || !(q_free == 1)) || c_num_read < p_num_write) || p_dw_st < 2) || !(c_last_read == p_last_write))) && ((((((((((q_read_ev < 2 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(q_free == 0)) || __retres1 == 1) || c_dr_st < 2) || !(1 == q_write_ev)) || !(1 == p_num_write)) || !(0 == c_num_read)) || !(p_dw_pc == 0))) && ((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(p_dw_pc == 0)) || q_read_ev < 2) || !(q_free == 0)) || !(1 == q_write_ev)) || !(1 == p_num_write)) || __retres1 == 0) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(0 == c_dr_st)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((!(p_dw_i == 1) || !(0 == p_last_write)) || !(\old(q_free) == 1)) || !(2 == q_write_ev)) || !(1 == c_dr_i)) || !(p_dw_pc == 0)) || !(0 == q_buf_0)) || !(0 == p_num_write)) || \old(q_read_ev) < 2) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || ((((((q_free == 1 && 2 <= q_read_ev) && p_dw_st == 0) && 1 == c_dr_pc) && c_num_read == 0) && c_last_read == p_last_write) && c_dr_st == 2)) || !(0 == \old(c_dr_pc))) || !(\old(c_last_read) == p_last_write)) && ((((\old(q_read_ev) < 2 || q_write_ev < 2) || ((((((q_free == 1 && 2 <= c_dr_st) && 2 <= q_read_ev) && p_dw_st == 0) && 1 == c_dr_pc) && c_num_read == 1) && c_last_read == p_last_write)) || !(\old(p_dw_st) == 2)) || (((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || !(p_dw_pc == 1)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc)))) && ((((((((p_num_write < \old(c_num_read) + 1 || \old(q_read_ev) < 2) || q_write_ev < 2) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || !(\old(q_free) == 0)) || \old(c_num_read) + 1 < p_num_write) || (((((((p_num_write <= c_num_read && q_free == 1) && 2 <= c_dr_st) && 2 <= q_read_ev) && p_dw_st == 0) && 1 == c_dr_pc) && c_num_read <= p_num_write) && c_last_read == p_last_write)) || (((((((p_num_write <= c_num_read && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && 2 <= q_read_ev) && 1 == c_dr_pc) && c_num_read <= p_num_write) && c_last_read == p_last_write)) || \old(p_dw_st) < 2) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: ((((((((((!(p_dw_i == 1) || !(0 == p_last_write)) || !(2 == q_write_ev)) || !(0 == q_buf_0)) || ((!(1 == c_dr_pc) || !(q_free == 1)) || !(p_dw_pc == 0)) || !(0 == p_num_write)) || q_read_ev < 2) || !(2 == c_dr_st)) || !(p_dw_st == 0)) || !(0 == c_num_read)) || __retres1 == 1) || !(c_last_read == p_last_write)) && ((((((((((((((!(p_dw_i == 1) || __retres1 == 1) || !(0 == p_last_write)) || !(q_free == 1)) || !(2 == q_write_ev)) || !(1 == c_dr_i)) || !(p_dw_pc == 0)) || !(0 == q_buf_0)) || !(0 == p_num_write)) || q_read_ev < 2) || !(p_dw_st == 0)) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(c_last_read == p_last_write)) || !(0 == c_dr_st)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((!(2 == \old(c_dr_st)) || !(2 == \old(q_write_ev))) || !(0 == \old(q_buf_0))) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == c_dr_pc)) || !(\old(q_free) == 1) || !(\old(p_dw_pc) == 0)) || (((((p_dw_pc == 0 && q_free == 1) && 2 <= q_write_ev) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 0 == p_num_write)) || !(0 == \old(p_num_write))) || q_read_ev < 2) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write))) && ((((q_read_ev < 2 || \old(q_write_ev) < 2) || \old(c_dr_st) < 2) || ((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || \old(p_num_write) < c_num_read) || c_num_read < \old(p_num_write)) || ((((p_last_write == q_buf_0 && 1 == p_dw_pc) && p_num_write == \old(p_num_write)) && 2 <= q_write_ev) && 2 <= c_dr_st))) && (((((((((((((!(p_dw_i == 1) || !(0 == \old(p_last_write))) || !(\old(q_free) == 1)) || !(2 == \old(q_write_ev))) || !(1 == c_dr_i)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || (((((p_last_write == q_buf_0 && p_dw_pc == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_st == 0) && 0 == p_num_write)) || q_read_ev < 2) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(c_last_read == \old(p_last_write))) || !(0 == \old(c_dr_st))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 107 locations, 1 error locations. SAFE Result, 33.8s OverallTime, 19 OverallIterations, 6 TraceHistogramMax, 10.3s AutomataDifference, 0.0s DeadEndRemovalTime, 16.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 3160 SDtfs, 3666 SDslu, 9274 SDs, 0 SdLazy, 6495 SolverSat, 1031 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 3416 GetRequests, 3124 SyntacticMatches, 27 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2964 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1309occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.0s AbstIntTime, 10 AbstIntIterations, 3 AbstIntStrong, 0.9784671973061027 AbsIntWeakeningRatio, 0.8211920529801324 AbsIntAvgWeakeningVarsNumRemoved, 12.490066225165563 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 401 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 4404 PreInvPairs, 4848 NumberOfFragments, 10281 HoareAnnotationTreeSize, 4404 FomulaSimplifications, 45513 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 45 FomulaSimplificationsInter, 41515 FormulaSimplificationTreeSizeReductionInter, 15.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 3946 NumberOfCodeBlocks, 3946 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 5366 ConstructedInterpolants, 0 QuantifiedInterpolants, 1470054 SizeOfPredicates, 10 NumberOfNonLiveVariables, 6765 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 33 InterpolantComputations, 17 PerfectInterpolantSequences, 4905/5183 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...