./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_46147246-2b33-47bf-a566-99ec498ba490/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_46147246-2b33-47bf-a566-99ec498ba490/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_46147246-2b33-47bf-a566-99ec498ba490/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_46147246-2b33-47bf-a566-99ec498ba490/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_46147246-2b33-47bf-a566-99ec498ba490/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_46147246-2b33-47bf-a566-99ec498ba490/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-08 19:49:47,249 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 19:49:47,250 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 19:49:47,256 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 19:49:47,256 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 19:49:47,256 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 19:49:47,257 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 19:49:47,258 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 19:49:47,259 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 19:49:47,259 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 19:49:47,259 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 19:49:47,260 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 19:49:47,260 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 19:49:47,260 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 19:49:47,261 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 19:49:47,261 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 19:49:47,262 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 19:49:47,262 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 19:49:47,263 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 19:49:47,264 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 19:49:47,264 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 19:49:47,265 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 19:49:47,266 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 19:49:47,266 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 19:49:47,266 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 19:49:47,267 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 19:49:47,267 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 19:49:47,268 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 19:49:47,268 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 19:49:47,268 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 19:49:47,269 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 19:49:47,269 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 19:49:47,269 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 19:49:47,269 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 19:49:47,270 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 19:49:47,270 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 19:49:47,270 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_46147246-2b33-47bf-a566-99ec498ba490/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 19:49:47,277 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 19:49:47,277 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 19:49:47,278 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 19:49:47,278 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 19:49:47,278 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 19:49:47,278 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 19:49:47,278 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 19:49:47,278 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 19:49:47,278 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 19:49:47,278 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 19:49:47,278 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 19:49:47,278 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 19:49:47,279 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 19:49:47,279 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 19:49:47,279 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 19:49:47,279 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 19:49:47,279 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 19:49:47,279 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 19:49:47,279 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 19:49:47,279 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 19:49:47,280 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 19:49:47,280 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 19:49:47,280 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 19:49:47,280 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 19:49:47,280 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 19:49:47,280 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 19:49:47,280 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 19:49:47,280 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 19:49:47,280 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 19:49:47,280 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 19:49:47,281 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 19:49:47,281 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 19:49:47,281 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 19:49:47,281 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 19:49:47,281 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 19:49:47,281 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 19:49:47,281 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_46147246-2b33-47bf-a566-99ec498ba490/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-08 19:49:47,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 19:49:47,305 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 19:49:47,307 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 19:49:47,308 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 19:49:47,308 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 19:49:47,308 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_46147246-2b33-47bf-a566-99ec498ba490/bin-2019/utaipan/../../sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-12-08 19:49:47,343 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_46147246-2b33-47bf-a566-99ec498ba490/bin-2019/utaipan/data/4a7ac5285/007528ada3a64477b4f5c7c68cea5ef9/FLAG80bf2f629 [2018-12-08 19:49:47,624 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 19:49:47,624 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_46147246-2b33-47bf-a566-99ec498ba490/sv-benchmarks/c/systemc/pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-12-08 19:49:47,628 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_46147246-2b33-47bf-a566-99ec498ba490/bin-2019/utaipan/data/4a7ac5285/007528ada3a64477b4f5c7c68cea5ef9/FLAG80bf2f629 [2018-12-08 19:49:47,636 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_46147246-2b33-47bf-a566-99ec498ba490/bin-2019/utaipan/data/4a7ac5285/007528ada3a64477b4f5c7c68cea5ef9 [2018-12-08 19:49:47,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 19:49:47,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 19:49:47,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 19:49:47,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 19:49:47,642 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 19:49:47,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:49:47" (1/1) ... [2018-12-08 19:49:47,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537737cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:47, skipping insertion in model container [2018-12-08 19:49:47,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:49:47" (1/1) ... [2018-12-08 19:49:47,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 19:49:47,664 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 19:49:47,761 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 19:49:47,764 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 19:49:47,785 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 19:49:47,793 INFO L195 MainTranslator]: Completed translation [2018-12-08 19:49:47,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:47 WrapperNode [2018-12-08 19:49:47,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 19:49:47,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 19:49:47,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 19:49:47,794 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 19:49:47,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:47" (1/1) ... [2018-12-08 19:49:47,803 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:47" (1/1) ... [2018-12-08 19:49:47,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 19:49:47,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 19:49:47,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 19:49:47,808 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 19:49:47,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:47" (1/1) ... [2018-12-08 19:49:47,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:47" (1/1) ... [2018-12-08 19:49:47,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:47" (1/1) ... [2018-12-08 19:49:47,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:47" (1/1) ... [2018-12-08 19:49:47,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:47" (1/1) ... [2018-12-08 19:49:47,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:47" (1/1) ... [2018-12-08 19:49:47,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:47" (1/1) ... [2018-12-08 19:49:47,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 19:49:47,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 19:49:47,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 19:49:47,855 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 19:49:47,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46147246-2b33-47bf-a566-99ec498ba490/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-08 19:49:47,886 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-12-08 19:49:47,886 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-12-08 19:49:47,886 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-12-08 19:49:47,887 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-12-08 19:49:47,887 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 19:49:47,887 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 19:49:47,887 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2018-12-08 19:49:47,887 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2018-12-08 19:49:47,887 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-12-08 19:49:47,887 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-12-08 19:49:47,887 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2018-12-08 19:49:47,887 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2018-12-08 19:49:47,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 19:49:47,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 19:49:47,888 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-12-08 19:49:47,888 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-12-08 19:49:47,888 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-12-08 19:49:47,888 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-12-08 19:49:47,888 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2018-12-08 19:49:47,888 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2018-12-08 19:49:47,888 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-12-08 19:49:47,888 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-12-08 19:49:47,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 19:49:47,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 19:49:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2018-12-08 19:49:47,889 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2018-12-08 19:49:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2018-12-08 19:49:47,889 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2018-12-08 19:49:47,889 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-12-08 19:49:47,889 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-12-08 19:49:48,079 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 19:49:48,079 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-08 19:49:48,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:49:48 BoogieIcfgContainer [2018-12-08 19:49:48,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 19:49:48,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 19:49:48,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 19:49:48,082 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 19:49:48,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 07:49:47" (1/3) ... [2018-12-08 19:49:48,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150c2a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 07:49:48, skipping insertion in model container [2018-12-08 19:49:48,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:49:47" (2/3) ... [2018-12-08 19:49:48,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150c2a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 07:49:48, skipping insertion in model container [2018-12-08 19:49:48,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:49:48" (3/3) ... [2018-12-08 19:49:48,084 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1_true-unreach-call_false-termination.cil.c [2018-12-08 19:49:48,091 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 19:49:48,096 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 19:49:48,109 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 19:49:48,135 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 19:49:48,136 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 19:49:48,136 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 19:49:48,136 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 19:49:48,136 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 19:49:48,136 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 19:49:48,136 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 19:49:48,136 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 19:49:48,148 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2018-12-08 19:49:48,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 19:49:48,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:49:48,153 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-08 19:49:48,155 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:49:48,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:49:48,158 INFO L82 PathProgramCache]: Analyzing trace with hash 489843548, now seen corresponding path program 1 times [2018-12-08 19:49:48,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:49:48,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:48,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:49:48,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:48,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:49:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:49:48,318 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-08 19:49:48,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:49:48,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:49:48,320 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:49:48,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:49:48,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:49:48,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:49:48,333 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 3 states. [2018-12-08 19:49:48,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:49:48,394 INFO L93 Difference]: Finished difference Result 279 states and 395 transitions. [2018-12-08 19:49:48,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:49:48,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-08 19:49:48,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:49:48,405 INFO L225 Difference]: With dead ends: 279 [2018-12-08 19:49:48,405 INFO L226 Difference]: Without dead ends: 175 [2018-12-08 19:49:48,408 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-08 19:49:48,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-08 19:49:48,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2018-12-08 19:49:48,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-08 19:49:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2018-12-08 19:49:48,451 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 65 [2018-12-08 19:49:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:49:48,452 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2018-12-08 19:49:48,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:49:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2018-12-08 19:49:48,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 19:49:48,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:49:48,455 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-08 19:49:48,455 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:49:48,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:49:48,455 INFO L82 PathProgramCache]: Analyzing trace with hash 343031424, now seen corresponding path program 1 times [2018-12-08 19:49:48,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:49:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:48,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:49:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:48,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:49:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:49:48,538 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-08 19:49:48,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:49:48,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:49:48,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:49:48,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:49:48,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:49:48,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:49:48,540 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 4 states. [2018-12-08 19:49:48,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:49:48,638 INFO L93 Difference]: Finished difference Result 469 states and 653 transitions. [2018-12-08 19:49:48,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 19:49:48,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-08 19:49:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:49:48,641 INFO L225 Difference]: With dead ends: 469 [2018-12-08 19:49:48,641 INFO L226 Difference]: Without dead ends: 318 [2018-12-08 19:49:48,642 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-08 19:49:48,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-08 19:49:48,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2018-12-08 19:49:48,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-12-08 19:49:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 411 transitions. [2018-12-08 19:49:48,663 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 411 transitions. Word has length 66 [2018-12-08 19:49:48,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:49:48,663 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 411 transitions. [2018-12-08 19:49:48,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:49:48,664 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 411 transitions. [2018-12-08 19:49:48,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 19:49:48,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:49:48,665 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-08 19:49:48,666 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:49:48,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:49:48,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1783380965, now seen corresponding path program 1 times [2018-12-08 19:49:48,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:49:48,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:48,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:49:48,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:48,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:49:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:49:48,694 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-08 19:49:48,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:49:48,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:49:48,694 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:49:48,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:49:48,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:49:48,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:49:48,695 INFO L87 Difference]: Start difference. First operand 314 states and 411 transitions. Second operand 4 states. [2018-12-08 19:49:48,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:49:48,741 INFO L93 Difference]: Finished difference Result 565 states and 734 transitions. [2018-12-08 19:49:48,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 19:49:48,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-08 19:49:48,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:49:48,743 INFO L225 Difference]: With dead ends: 565 [2018-12-08 19:49:48,743 INFO L226 Difference]: Without dead ends: 268 [2018-12-08 19:49:48,744 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-08 19:49:48,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-12-08 19:49:48,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-12-08 19:49:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-08 19:49:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 341 transitions. [2018-12-08 19:49:48,759 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 341 transitions. Word has length 66 [2018-12-08 19:49:48,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:49:48,760 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 341 transitions. [2018-12-08 19:49:48,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:49:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 341 transitions. [2018-12-08 19:49:48,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 19:49:48,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:49:48,761 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-08 19:49:48,761 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:49:48,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:49:48,762 INFO L82 PathProgramCache]: Analyzing trace with hash 229644767, now seen corresponding path program 1 times [2018-12-08 19:49:48,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:49:48,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:48,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:49:48,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:48,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:49:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:49:48,814 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-08 19:49:48,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:49:48,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:49:48,815 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:49:48,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:49:48,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:49:48,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:49:48,815 INFO L87 Difference]: Start difference. First operand 268 states and 341 transitions. Second operand 6 states. [2018-12-08 19:49:48,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:49:48,842 INFO L93 Difference]: Finished difference Result 529 states and 694 transitions. [2018-12-08 19:49:48,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 19:49:48,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-08 19:49:48,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:49:48,844 INFO L225 Difference]: With dead ends: 529 [2018-12-08 19:49:48,844 INFO L226 Difference]: Without dead ends: 278 [2018-12-08 19:49:48,845 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-08 19:49:48,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-08 19:49:48,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-12-08 19:49:48,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-08 19:49:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 349 transitions. [2018-12-08 19:49:48,859 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 349 transitions. Word has length 66 [2018-12-08 19:49:48,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:49:48,859 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 349 transitions. [2018-12-08 19:49:48,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:49:48,859 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 349 transitions. [2018-12-08 19:49:48,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 19:49:48,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:49:48,860 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-08 19:49:48,860 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:49:48,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:49:48,861 INFO L82 PathProgramCache]: Analyzing trace with hash -791423587, now seen corresponding path program 1 times [2018-12-08 19:49:48,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:49:48,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:48,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:49:48,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:48,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:49:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:49:48,904 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-08 19:49:48,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:49:48,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:49:48,905 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:49:48,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:49:48,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:49:48,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:49:48,905 INFO L87 Difference]: Start difference. First operand 278 states and 349 transitions. Second operand 6 states. [2018-12-08 19:49:49,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:49:49,273 INFO L93 Difference]: Finished difference Result 850 states and 1130 transitions. [2018-12-08 19:49:49,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:49:49,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-08 19:49:49,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:49:49,276 INFO L225 Difference]: With dead ends: 850 [2018-12-08 19:49:49,276 INFO L226 Difference]: Without dead ends: 589 [2018-12-08 19:49:49,277 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-08 19:49:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-12-08 19:49:49,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 577. [2018-12-08 19:49:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-12-08 19:49:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 713 transitions. [2018-12-08 19:49:49,297 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 713 transitions. Word has length 66 [2018-12-08 19:49:49,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:49:49,297 INFO L480 AbstractCegarLoop]: Abstraction has 577 states and 713 transitions. [2018-12-08 19:49:49,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:49:49,298 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 713 transitions. [2018-12-08 19:49:49,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 19:49:49,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:49:49,299 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-08 19:49:49,299 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:49:49,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:49:49,299 INFO L82 PathProgramCache]: Analyzing trace with hash -2070748322, now seen corresponding path program 1 times [2018-12-08 19:49:49,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:49:49,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:49,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:49:49,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:49,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:49:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:49:49,352 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-08 19:49:49,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:49:49,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:49:49,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:49:49,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:49:49,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:49:49,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:49:49,353 INFO L87 Difference]: Start difference. First operand 577 states and 713 transitions. Second operand 6 states. [2018-12-08 19:49:49,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:49:49,384 INFO L93 Difference]: Finished difference Result 1140 states and 1459 transitions. [2018-12-08 19:49:49,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 19:49:49,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-08 19:49:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:49:49,387 INFO L225 Difference]: With dead ends: 1140 [2018-12-08 19:49:49,387 INFO L226 Difference]: Without dead ends: 616 [2018-12-08 19:49:49,388 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-08 19:49:49,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-12-08 19:49:49,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 604. [2018-12-08 19:49:49,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-12-08 19:49:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 735 transitions. [2018-12-08 19:49:49,407 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 735 transitions. Word has length 66 [2018-12-08 19:49:49,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:49:49,407 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 735 transitions. [2018-12-08 19:49:49,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:49:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 735 transitions. [2018-12-08 19:49:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 19:49:49,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:49:49,408 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-08 19:49:49,409 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:49:49,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:49:49,409 INFO L82 PathProgramCache]: Analyzing trace with hash -295740960, now seen corresponding path program 1 times [2018-12-08 19:49:49,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:49:49,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:49,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:49:49,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:49,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:49:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:49:49,462 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-08 19:49:49,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:49:49,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:49:49,463 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:49:49,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:49:49,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:49:49,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:49:49,463 INFO L87 Difference]: Start difference. First operand 604 states and 735 transitions. Second operand 4 states. [2018-12-08 19:49:49,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:49:49,548 INFO L93 Difference]: Finished difference Result 842 states and 1059 transitions. [2018-12-08 19:49:49,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 19:49:49,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-08 19:49:49,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:49:49,552 INFO L225 Difference]: With dead ends: 842 [2018-12-08 19:49:49,552 INFO L226 Difference]: Without dead ends: 839 [2018-12-08 19:49:49,553 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-08 19:49:49,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2018-12-08 19:49:49,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 675. [2018-12-08 19:49:49,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-12-08 19:49:49,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 829 transitions. [2018-12-08 19:49:49,593 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 829 transitions. Word has length 66 [2018-12-08 19:49:49,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:49:49,593 INFO L480 AbstractCegarLoop]: Abstraction has 675 states and 829 transitions. [2018-12-08 19:49:49,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:49:49,593 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 829 transitions. [2018-12-08 19:49:49,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 19:49:49,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:49:49,595 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-08 19:49:49,595 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:49:49,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:49:49,595 INFO L82 PathProgramCache]: Analyzing trace with hash -578339491, now seen corresponding path program 1 times [2018-12-08 19:49:49,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:49:49,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:49,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:49:49,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:49,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:49:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:49:49,633 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-08 19:49:49,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:49:49,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:49:49,633 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:49:49,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:49:49,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:49:49,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:49:49,634 INFO L87 Difference]: Start difference. First operand 675 states and 829 transitions. Second operand 3 states. [2018-12-08 19:49:49,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:49:49,667 INFO L93 Difference]: Finished difference Result 1249 states and 1576 transitions. [2018-12-08 19:49:49,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:49:49,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-08 19:49:49,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:49:49,669 INFO L225 Difference]: With dead ends: 1249 [2018-12-08 19:49:49,670 INFO L226 Difference]: Without dead ends: 655 [2018-12-08 19:49:49,671 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-08 19:49:49,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-12-08 19:49:49,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 567. [2018-12-08 19:49:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-12-08 19:49:49,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 677 transitions. [2018-12-08 19:49:49,691 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 677 transitions. Word has length 67 [2018-12-08 19:49:49,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:49:49,691 INFO L480 AbstractCegarLoop]: Abstraction has 567 states and 677 transitions. [2018-12-08 19:49:49,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:49:49,691 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 677 transitions. [2018-12-08 19:49:49,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 19:49:49,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:49:49,693 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-08 19:49:49,693 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:49:49,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:49:49,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1082734469, now seen corresponding path program 1 times [2018-12-08 19:49:49,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:49:49,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:49,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:49:49,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:49,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:49:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:49:49,737 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-08 19:49:49,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:49:49,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 19:49:49,738 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 88 with the following transitions: [2018-12-08 19:49:49,740 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-08 19:49:49,764 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 19:49:49,765 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 19:49:49,930 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 19:49:49,931 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-08 19:49:49,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:49:49,937 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 19:49:50,068 INFO L227 lantSequenceWeakener]: Weakened 55 states. On average, predicates are now at 70.68% of their original sizes. [2018-12-08 19:49:50,068 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 19:49:50,293 INFO L418 sIntCurrentIteration]: We unified 86 AI predicates to 86 [2018-12-08 19:49:50,293 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 19:49:50,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 19:49:50,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [6] total 25 [2018-12-08 19:49:50,294 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:49:50,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 19:49:50,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 19:49:50,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-12-08 19:49:50,295 INFO L87 Difference]: Start difference. First operand 567 states and 677 transitions. Second operand 21 states. [2018-12-08 19:49:51,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:49:51,551 INFO L93 Difference]: Finished difference Result 1058 states and 1276 transitions. [2018-12-08 19:49:51,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 19:49:51,551 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2018-12-08 19:49:51,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:49:51,554 INFO L225 Difference]: With dead ends: 1058 [2018-12-08 19:49:51,554 INFO L226 Difference]: Without dead ends: 506 [2018-12-08 19:49:51,556 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-08 19:49:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-12-08 19:49:51,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 498. [2018-12-08 19:49:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-12-08 19:49:51,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 588 transitions. [2018-12-08 19:49:51,583 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 588 transitions. Word has length 87 [2018-12-08 19:49:51,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:49:51,584 INFO L480 AbstractCegarLoop]: Abstraction has 498 states and 588 transitions. [2018-12-08 19:49:51,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 19:49:51,584 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 588 transitions. [2018-12-08 19:49:51,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 19:49:51,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:49:51,585 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-08 19:49:51,586 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:49:51,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:49:51,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1369387122, now seen corresponding path program 1 times [2018-12-08 19:49:51,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:49:51,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:51,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:49:51,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:51,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:49:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:49:51,654 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-08 19:49:51,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:49:51,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 19:49:51,655 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 100 with the following transitions: [2018-12-08 19:49:51,655 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-08 19:49:51,657 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 19:49:51,657 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 19:49:51,688 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 19:49:51,688 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-08 19:49:51,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:49:51,692 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 19:49:51,751 INFO L227 lantSequenceWeakener]: Weakened 95 states. On average, predicates are now at 81.95% of their original sizes. [2018-12-08 19:49:51,751 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 19:49:52,101 INFO L418 sIntCurrentIteration]: We unified 98 AI predicates to 98 [2018-12-08 19:49:52,101 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 19:49:52,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 19:49:52,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [6] total 42 [2018-12-08 19:49:52,102 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:49:52,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-08 19:49:52,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-08 19:49:52,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2018-12-08 19:49:52,103 INFO L87 Difference]: Start difference. First operand 498 states and 588 transitions. Second operand 38 states. [2018-12-08 19:49:54,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:49:54,910 INFO L93 Difference]: Finished difference Result 1061 states and 1307 transitions. [2018-12-08 19:49:54,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-08 19:49:54,910 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 99 [2018-12-08 19:49:54,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:49:54,912 INFO L225 Difference]: With dead ends: 1061 [2018-12-08 19:49:54,912 INFO L226 Difference]: Without dead ends: 656 [2018-12-08 19:49:54,913 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-08 19:49:54,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-12-08 19:49:54,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 622. [2018-12-08 19:49:54,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-12-08 19:49:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 746 transitions. [2018-12-08 19:49:54,933 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 746 transitions. Word has length 99 [2018-12-08 19:49:54,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:49:54,934 INFO L480 AbstractCegarLoop]: Abstraction has 622 states and 746 transitions. [2018-12-08 19:49:54,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-08 19:49:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 746 transitions. [2018-12-08 19:49:54,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-08 19:49:54,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:49:54,935 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-08 19:49:54,935 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:49:54,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:49:54,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1957952781, now seen corresponding path program 1 times [2018-12-08 19:49:54,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:49:54,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:54,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:49:54,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:49:54,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:49:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:49:55,003 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-08 19:49:55,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:49:55,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 19:49:55,003 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 120 with the following transitions: [2018-12-08 19:49:55,004 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-08 19:49:55,005 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 19:49:55,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 19:49:55,088 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 19:49:55,088 INFO L272 AbstractInterpreter]: Visited 81 different actions 259 times. Merged at 23 different actions 35 times. Never widened. Performed 3061 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3061 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-08 19:49:55,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:49:55,089 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 19:49:55,178 INFO L227 lantSequenceWeakener]: Weakened 105 states. On average, predicates are now at 81.83% of their original sizes. [2018-12-08 19:49:55,178 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 19:49:55,627 INFO L418 sIntCurrentIteration]: We unified 118 AI predicates to 118 [2018-12-08 19:49:55,627 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 19:49:55,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 19:49:55,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [8] total 52 [2018-12-08 19:49:55,627 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:49:55,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-08 19:49:55,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-08 19:49:55,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1903, Unknown=0, NotChecked=0, Total=2070 [2018-12-08 19:49:55,628 INFO L87 Difference]: Start difference. First operand 622 states and 746 transitions. Second operand 46 states. [2018-12-08 19:50:02,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:02,998 INFO L93 Difference]: Finished difference Result 1338 states and 1747 transitions. [2018-12-08 19:50:02,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-08 19:50:02,998 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 119 [2018-12-08 19:50:02,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:03,002 INFO L225 Difference]: With dead ends: 1338 [2018-12-08 19:50:03,002 INFO L226 Difference]: Without dead ends: 1101 [2018-12-08 19:50:03,006 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 207 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5876 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1264, Invalid=16826, Unknown=0, NotChecked=0, Total=18090 [2018-12-08 19:50:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2018-12-08 19:50:03,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 894. [2018-12-08 19:50:03,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2018-12-08 19:50:03,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1116 transitions. [2018-12-08 19:50:03,052 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1116 transitions. Word has length 119 [2018-12-08 19:50:03,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:03,053 INFO L480 AbstractCegarLoop]: Abstraction has 894 states and 1116 transitions. [2018-12-08 19:50:03,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-08 19:50:03,053 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1116 transitions. [2018-12-08 19:50:03,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-08 19:50:03,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:03,054 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-08 19:50:03,054 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:03,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:03,054 INFO L82 PathProgramCache]: Analyzing trace with hash -93324102, now seen corresponding path program 1 times [2018-12-08 19:50:03,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:03,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:03,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:03,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:03,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:03,107 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-08 19:50:03,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:50:03,108 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 19:50:03,108 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 121 with the following transitions: [2018-12-08 19:50:03,108 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-08 19:50:03,110 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 19:50:03,110 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 19:50:03,181 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 19:50:03,181 INFO L272 AbstractInterpreter]: Visited 90 different actions 241 times. Merged at 31 different actions 41 times. Never widened. Performed 2765 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2765 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-08 19:50:03,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:03,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 19:50:03,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:50:03,183 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46147246-2b33-47bf-a566-99ec498ba490/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-08 19:50:03,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:03,190 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 19:50:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:03,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 19:50:03,347 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-08 19:50:03,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 19:50:03,481 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-08 19:50:03,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 19:50:03,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 7] total 17 [2018-12-08 19:50:03,506 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 19:50:03,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 19:50:03,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 19:50:03,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-12-08 19:50:03,507 INFO L87 Difference]: Start difference. First operand 894 states and 1116 transitions. Second operand 14 states. [2018-12-08 19:50:04,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:04,852 INFO L93 Difference]: Finished difference Result 1980 states and 2969 transitions. [2018-12-08 19:50:04,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-08 19:50:04,852 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2018-12-08 19:50:04,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:04,860 INFO L225 Difference]: With dead ends: 1980 [2018-12-08 19:50:04,860 INFO L226 Difference]: Without dead ends: 1977 [2018-12-08 19:50:04,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 241 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2018-12-08 19:50:04,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2018-12-08 19:50:04,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1910. [2018-12-08 19:50:04,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2018-12-08 19:50:04,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2852 transitions. [2018-12-08 19:50:04,958 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2852 transitions. Word has length 120 [2018-12-08 19:50:04,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:04,959 INFO L480 AbstractCegarLoop]: Abstraction has 1910 states and 2852 transitions. [2018-12-08 19:50:04,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 19:50:04,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2852 transitions. [2018-12-08 19:50:04,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-08 19:50:04,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:04,961 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 19:50:04,961 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:04,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:04,962 INFO L82 PathProgramCache]: Analyzing trace with hash -18801004, now seen corresponding path program 1 times [2018-12-08 19:50:04,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:04,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:04,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:04,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:04,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:05,029 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 20 proven. 20 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-08 19:50:05,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:50:05,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 19:50:05,030 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 174 with the following transitions: [2018-12-08 19:50:05,030 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], [84], [86], [87], [88], [89], [91], [96], [98], [99], [100], [109], [112], [115], [117], [121], [124], [134], [137], [140], [148], [149], [159], [161], [163], [164], [165], [175], [177], [180], [185], [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], [271], [272], [273], [274], [275], [276], [277], [279], [280], [281], [282], [283], [284], [285], [286], [287], [289], [290], [291] [2018-12-08 19:50:05,031 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 19:50:05,032 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 19:50:05,053 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 19:50:05,053 INFO L272 AbstractInterpreter]: Visited 82 different actions 113 times. Merged at 4 different actions 4 times. Never widened. Performed 803 root evaluator evaluations with a maximum evaluation depth of 3. Performed 803 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 36 variables. [2018-12-08 19:50:05,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:05,055 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 19:50:05,119 INFO L227 lantSequenceWeakener]: Weakened 150 states. On average, predicates are now at 79.12% of their original sizes. [2018-12-08 19:50:05,119 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 19:50:05,690 INFO L418 sIntCurrentIteration]: We unified 172 AI predicates to 172 [2018-12-08 19:50:05,690 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 19:50:05,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 19:50:05,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [56] imperfect sequences [8] total 62 [2018-12-08 19:50:05,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:05,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-08 19:50:05,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-08 19:50:05,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2818, Unknown=0, NotChecked=0, Total=3080 [2018-12-08 19:50:05,691 INFO L87 Difference]: Start difference. First operand 1910 states and 2852 transitions. Second operand 56 states. [2018-12-08 19:50:08,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:08,371 INFO L93 Difference]: Finished difference Result 3043 states and 4521 transitions. [2018-12-08 19:50:08,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-08 19:50:08,371 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 173 [2018-12-08 19:50:08,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:08,375 INFO L225 Difference]: With dead ends: 3043 [2018-12-08 19:50:08,375 INFO L226 Difference]: Without dead ends: 1590 [2018-12-08 19:50:08,380 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 197 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2107 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=547, Invalid=5933, Unknown=0, NotChecked=0, Total=6480 [2018-12-08 19:50:08,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2018-12-08 19:50:08,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1573. [2018-12-08 19:50:08,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-12-08 19:50:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2289 transitions. [2018-12-08 19:50:08,449 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2289 transitions. Word has length 173 [2018-12-08 19:50:08,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:08,449 INFO L480 AbstractCegarLoop]: Abstraction has 1573 states and 2289 transitions. [2018-12-08 19:50:08,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-08 19:50:08,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2289 transitions. [2018-12-08 19:50:08,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-08 19:50:08,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:08,451 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-08 19:50:08,451 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:08,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:08,451 INFO L82 PathProgramCache]: Analyzing trace with hash -131156192, now seen corresponding path program 1 times [2018-12-08 19:50:08,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:08,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:08,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:08,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:08,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:08,509 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-08 19:50:08,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:50:08,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 19:50:08,509 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-12-08 19:50:08,509 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-08 19:50:08,510 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 19:50:08,511 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 19:50:08,745 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 19:50:08,745 INFO L272 AbstractInterpreter]: Visited 92 different actions 937 times. Merged at 43 different actions 289 times. Never widened. Performed 8003 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8003 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 51 fixpoints after 10 different actions. Largest state had 36 variables. [2018-12-08 19:50:08,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:08,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 19:50:08,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:50:08,747 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46147246-2b33-47bf-a566-99ec498ba490/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-08 19:50:08,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:08,753 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 19:50:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:08,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 19:50:08,819 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-08 19:50:08,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 19:50:08,880 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-08 19:50:08,894 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 19:50:08,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [7] total 9 [2018-12-08 19:50:08,895 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:08,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:50:08,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:50:08,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-08 19:50:08,895 INFO L87 Difference]: Start difference. First operand 1573 states and 2289 transitions. Second operand 3 states. [2018-12-08 19:50:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:08,951 INFO L93 Difference]: Finished difference Result 2300 states and 3639 transitions. [2018-12-08 19:50:08,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:50:08,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-12-08 19:50:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:08,956 INFO L225 Difference]: With dead ends: 2300 [2018-12-08 19:50:08,956 INFO L226 Difference]: Without dead ends: 1549 [2018-12-08 19:50:08,959 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-08 19:50:08,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2018-12-08 19:50:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1549. [2018-12-08 19:50:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1549 states. [2018-12-08 19:50:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 2253 transitions. [2018-12-08 19:50:09,027 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 2253 transitions. Word has length 147 [2018-12-08 19:50:09,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:09,027 INFO L480 AbstractCegarLoop]: Abstraction has 1549 states and 2253 transitions. [2018-12-08 19:50:09,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:50:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 2253 transitions. [2018-12-08 19:50:09,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-08 19:50:09,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:09,029 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-08 19:50:09,029 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:09,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:09,029 INFO L82 PathProgramCache]: Analyzing trace with hash 702795309, now seen corresponding path program 1 times [2018-12-08 19:50:09,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:09,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:09,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:09,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:09,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:09,075 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-08 19:50:09,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:50:09,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 19:50:09,075 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-12-08 19:50:09,075 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-08 19:50:09,076 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 19:50:09,076 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 19:50:09,321 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 19:50:09,321 INFO L272 AbstractInterpreter]: Visited 91 different actions 1198 times. Merged at 42 different actions 331 times. Never widened. Performed 10050 root evaluator evaluations with a maximum evaluation depth of 3. Performed 10050 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 78 fixpoints after 13 different actions. Largest state had 36 variables. [2018-12-08 19:50:09,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:09,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 19:50:09,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:50:09,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46147246-2b33-47bf-a566-99ec498ba490/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-08 19:50:09,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:09,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 19:50:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:09,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 19:50:09,390 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-08 19:50:09,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 19:50:09,441 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-08 19:50:09,456 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 19:50:09,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2018-12-08 19:50:09,456 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:09,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:50:09,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:50:09,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-08 19:50:09,457 INFO L87 Difference]: Start difference. First operand 1549 states and 2253 transitions. Second operand 3 states. [2018-12-08 19:50:09,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:09,546 INFO L93 Difference]: Finished difference Result 2680 states and 4406 transitions. [2018-12-08 19:50:09,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:50:09,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-12-08 19:50:09,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:09,554 INFO L225 Difference]: With dead ends: 2680 [2018-12-08 19:50:09,554 INFO L226 Difference]: Without dead ends: 1693 [2018-12-08 19:50:09,559 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-08 19:50:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2018-12-08 19:50:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1693. [2018-12-08 19:50:09,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1693 states. [2018-12-08 19:50:09,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2531 transitions. [2018-12-08 19:50:09,668 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2531 transitions. Word has length 148 [2018-12-08 19:50:09,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:09,669 INFO L480 AbstractCegarLoop]: Abstraction has 1693 states and 2531 transitions. [2018-12-08 19:50:09,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:50:09,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2531 transitions. [2018-12-08 19:50:09,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-08 19:50:09,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:09,672 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-08 19:50:09,672 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:09,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:09,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1764454047, now seen corresponding path program 1 times [2018-12-08 19:50:09,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:09,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:09,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:09,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:09,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:09,719 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-08 19:50:09,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:50:09,720 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 19:50:09,720 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2018-12-08 19:50:09,720 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], [100], [109], [112], [115], [121], [124], [127], [134], [137], [140], [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-08 19:50:09,720 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 19:50:09,721 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 19:50:09,798 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 19:50:09,798 INFO L272 AbstractInterpreter]: Visited 93 different actions 364 times. Merged at 34 different actions 65 times. Never widened. Performed 3419 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3419 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 11 fixpoints after 6 different actions. Largest state had 36 variables. [2018-12-08 19:50:09,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:09,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 19:50:09,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:50:09,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46147246-2b33-47bf-a566-99ec498ba490/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-08 19:50:09,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:09,805 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 19:50:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:09,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 19:50:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-08 19:50:09,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 19:50:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-08 19:50:09,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 19:50:09,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 9 [2018-12-08 19:50:09,958 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:09,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:50:09,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:50:09,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-08 19:50:09,959 INFO L87 Difference]: Start difference. First operand 1693 states and 2531 transitions. Second operand 3 states. [2018-12-08 19:50:10,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:10,004 INFO L93 Difference]: Finished difference Result 2319 states and 3528 transitions. [2018-12-08 19:50:10,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:50:10,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2018-12-08 19:50:10,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:10,006 INFO L225 Difference]: With dead ends: 2319 [2018-12-08 19:50:10,006 INFO L226 Difference]: Without dead ends: 742 [2018-12-08 19:50:10,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 326 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-08 19:50:10,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-12-08 19:50:10,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 736. [2018-12-08 19:50:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-12-08 19:50:10,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 880 transitions. [2018-12-08 19:50:10,039 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 880 transitions. Word has length 164 [2018-12-08 19:50:10,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:10,039 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 880 transitions. [2018-12-08 19:50:10,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:50:10,040 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 880 transitions. [2018-12-08 19:50:10,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-12-08 19:50:10,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:10,041 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-08 19:50:10,041 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:10,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:10,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1074618033, now seen corresponding path program 1 times [2018-12-08 19:50:10,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:10,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:10,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:10,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:10,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 40 proven. 59 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2018-12-08 19:50:10,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:50:10,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 19:50:10,109 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 251 with the following transitions: [2018-12-08 19:50:10,109 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], [130], [134], [137], [140], [148], [149], [152], [155], [157], [159], [161], [163], [164], [165], [175], [177], [180], [185], [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], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285], [286], [287], [289], [290], [291] [2018-12-08 19:50:10,110 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 19:50:10,110 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 19:50:10,296 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 19:50:10,296 INFO L272 AbstractInterpreter]: Visited 99 different actions 809 times. Merged at 49 different actions 215 times. Never widened. Performed 7090 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7090 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 48 fixpoints after 15 different actions. Largest state had 36 variables. [2018-12-08 19:50:10,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:10,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 19:50:10,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:50:10,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_46147246-2b33-47bf-a566-99ec498ba490/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-08 19:50:10,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:10,305 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 19:50:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:10,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 19:50:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-12-08 19:50:10,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 19:50:10,542 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 66 proven. 20 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-12-08 19:50:10,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 19:50:10,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 4] total 10 [2018-12-08 19:50:10,557 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:10,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:50:10,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:50:10,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-08 19:50:10,558 INFO L87 Difference]: Start difference. First operand 736 states and 880 transitions. Second operand 3 states. [2018-12-08 19:50:10,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:10,586 INFO L93 Difference]: Finished difference Result 1099 states and 1375 transitions. [2018-12-08 19:50:10,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:50:10,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2018-12-08 19:50:10,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:10,588 INFO L225 Difference]: With dead ends: 1099 [2018-12-08 19:50:10,588 INFO L226 Difference]: Without dead ends: 721 [2018-12-08 19:50:10,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 495 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-08 19:50:10,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-12-08 19:50:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-12-08 19:50:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-12-08 19:50:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 859 transitions. [2018-12-08 19:50:10,617 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 859 transitions. Word has length 250 [2018-12-08 19:50:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:10,617 INFO L480 AbstractCegarLoop]: Abstraction has 721 states and 859 transitions. [2018-12-08 19:50:10,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:50:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 859 transitions. [2018-12-08 19:50:10,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-08 19:50:10,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:50:10,619 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-08 19:50:10,619 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:50:10,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:50:10,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1141168378, now seen corresponding path program 1 times [2018-12-08 19:50:10,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:50:10,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:10,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:50:10,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:50:10,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:50:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:50:10,650 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-08 19:50:10,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:50:10,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:50:10,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:50:10,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:50:10,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:50:10,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:50:10,650 INFO L87 Difference]: Start difference. First operand 721 states and 859 transitions. Second operand 3 states. [2018-12-08 19:50:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:50:10,679 INFO L93 Difference]: Finished difference Result 915 states and 1114 transitions. [2018-12-08 19:50:10,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:50:10,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2018-12-08 19:50:10,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:50:10,680 INFO L225 Difference]: With dead ends: 915 [2018-12-08 19:50:10,680 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 19:50:10,682 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-08 19:50:10,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 19:50:10,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 19:50:10,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 19:50:10,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 19:50:10,682 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2018-12-08 19:50:10,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:50:10,683 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 19:50:10,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:50:10,683 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 19:50:10,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 19:50:10,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 19:50:10,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:10,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:10,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:10,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:10,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:10,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:10,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:10,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:10,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:10,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:10,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:10,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:10,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:10,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:10,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 19:50:11,987 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 82 [2018-12-08 19:50:12,240 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 90 [2018-12-08 19:50:12,401 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 86 [2018-12-08 19:50:12,799 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 93 [2018-12-08 19:50:13,157 WARN L180 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 92 [2018-12-08 19:50:13,350 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 80 [2018-12-08 19:50:13,531 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 90 [2018-12-08 19:50:13,738 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 74 [2018-12-08 19:50:13,936 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 90 [2018-12-08 19:50:14,732 WARN L180 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 135 [2018-12-08 19:50:14,853 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2018-12-08 19:50:15,073 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 97 [2018-12-08 19:50:15,283 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 95 [2018-12-08 19:50:15,801 WARN L180 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 57 [2018-12-08 19:50:16,106 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 1 [2018-12-08 19:50:16,790 WARN L180 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 125 [2018-12-08 19:50:17,274 WARN L180 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 135 [2018-12-08 19:50:17,908 WARN L180 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 126 [2018-12-08 19:50:18,214 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 104 [2018-12-08 19:50:18,318 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2018-12-08 19:50:18,536 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 98 [2018-12-08 19:50:20,338 WARN L180 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 196 DAG size of output: 135 [2018-12-08 19:50:20,602 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 91 [2018-12-08 19:50:20,911 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 96 [2018-12-08 19:50:21,228 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 74 [2018-12-08 19:50:22,337 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 181 DAG size of output: 119 [2018-12-08 19:50:22,953 WARN L180 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 80 [2018-12-08 19:50:23,164 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 92 [2018-12-08 19:50:23,166 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2018-12-08 19:50:23,166 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 223) no Hoare annotation was computed. [2018-12-08 19:50:23,166 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 224) no Hoare annotation was computed. [2018-12-08 19:50:23,166 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2018-12-08 19:50:23,167 INFO L444 ceAbstractionStarter]: At program point L226(lines 213 228) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_i~0 1))) (.cse7 (= exists_runnable_thread_~__retres1~2 1)) (.cse1 (not (= 0 ~p_last_write~0))) (.cse3 (not (= 2 ~q_write_ev~0))) (.cse4 (not (= ~p_dw_pc~0 0))) (.cse5 (not (= 0 ~q_buf_0~0))) (.cse2 (not (= ~q_free~0 1))) (.cse6 (not (= 0 ~p_num_write~0))) (.cse8 (not (= ~p_dw_st~0 0))) (.cse9 (not (= 0 ~c_num_read~0))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 (not (= ~q_read_ev~0 2)) .cse2 .cse3 (not (= 1 ~c_dr_i~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 0 ~c_dr_pc~0)) .cse10 (not (= 0 ~c_dr_st~0))) (or .cse0 .cse7 .cse1 .cse3 .cse4 .cse5 (or (not (= 1 ~c_dr_pc~0)) .cse2) .cse6 (< ~q_read_ev~0 2) (not (= 2 ~c_dr_st~0)) .cse8 .cse9 .cse10))) [2018-12-08 19:50:23,167 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2018-12-08 19:50:23,167 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2018-12-08 19:50:23,167 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2018-12-08 19:50:23,167 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 192 209) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (and (= ~p_dw_st~0 0) (= ~c_dr_st~0 0)) (not (= 0 ~p_last_write~0)) (not (= ~q_read_ev~0 2)) (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)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 ~c_num_read~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-08 19:50:23,167 INFO L448 ceAbstractionStarter]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2018-12-08 19:50:23,167 INFO L444 ceAbstractionStarter]: At program point L354-1(line 354) the Hoare annotation is: (or (= |old(~p_dw_i~0)| 1) (and (= ~q_read_ev~0 2) (= ~p_dw_pc~0 0) (= ~q_free~0 1) (= ~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(~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-08 19:50:23,167 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 349 360) the Hoare annotation is: (or (= |old(~p_dw_i~0)| 1) (not (= 0 |old(~p_last_write~0)|)) (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 (= |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-08 19:50:23,167 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2018-12-08 19:50:23,167 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2018-12-08 19:50:23,167 INFO L448 ceAbstractionStarter]: For program point L355(line 355) no Hoare annotation was computed. [2018-12-08 19:50:23,167 INFO L444 ceAbstractionStarter]: At program point L354(line 354) the Hoare annotation is: (or (= |old(~p_dw_i~0)| 1) (not (= 0 |old(~p_last_write~0)|)) (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 (= |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-08 19:50:23,168 INFO L444 ceAbstractionStarter]: At program point L128(lines 91 133) the Hoare annotation is: (let ((.cse4 (not (= 0 |old(~q_buf_0~0)|))) (.cse2 (not (= 2 |old(~q_write_ev~0)|))) (.cse3 (not (= |old(~p_dw_pc~0)| 0))) (.cse5 (not (= 0 |old(~p_num_write~0)|))) (.cse1 (not (= |old(~q_free~0)| 1))) (.cse11 (not (= 0 ~c_num_read~0))) (.cse12 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse7 (= ~c_dr_st~0 0)) (.cse10 (= ~q_write_ev~0 2)) (.cse15 (< ~q_read_ev~0 2)) (.cse13 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse14 (not (= 1 ~c_dr_pc~0))) (.cse16 (<= 2 ~p_dw_st~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= 1 ~p_dw_pc~0)) (.cse9 (= ~q_free~0 0))) (and (or .cse0 (not (= 0 |old(~p_last_write~0)|)) (not (= ~q_read_ev~0 2)) .cse1 .cse2 (not (= 1 ~c_dr_i~0)) .cse3 .cse4 .cse5 (and (= ~p_dw_st~0 2) .cse6 .cse7 .cse8 .cse9 .cse10 (= ~p_num_write~0 1)) .cse11 (not (= 0 ~c_dr_pc~0)) .cse12 (not (= 0 |old(~c_dr_st~0)|))) (or (or (not (= 2 |old(~c_dr_st~0)|)) .cse4) .cse0 .cse13 .cse14 .cse2 .cse3 .cse5 .cse15 (or .cse1 .cse11) .cse12 (and .cse16 (= (mod ~p_dw_st~0 2) 0) .cse6 .cse7 .cse8 .cse9 .cse10 (= 1 ~p_num_write~0))) (let ((.cse17 (<= 2 ~q_write_ev~0))) (or .cse15 (< |old(~q_write_ev~0)| 2) (< |old(~c_dr_st~0)| 2) (or (or .cse13 .cse0 .cse14 (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 .cse16 .cse17 (<= 2 ~c_dr_st~0) .cse6 .cse8) (and .cse16 .cse17 .cse6 (<= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse8 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))))) [2018-12-08 19:50:23,168 INFO L444 ceAbstractionStarter]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse10 (not (= 0 |old(~q_buf_0~0)|))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse15 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse16 (not (= 1 ~c_dr_pc~0))) (.cse8 (not (= 2 |old(~q_write_ev~0)|))) (.cse9 (not (= |old(~p_dw_pc~0)| 0))) (.cse11 (not (= 0 |old(~p_num_write~0)|))) (.cse14 (< ~q_read_ev~0 2)) (.cse3 (= ~q_free~0 1)) (.cse4 (= ~q_write_ev~0 2)) (.cse2 (= ~p_dw_pc~0 0)) (.cse6 (= ~q_buf_0~0 0)) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (= 0 ~p_num_write~0)) (.cse1 (not (= |old(~q_free~0)| 1))) (.cse12 (not (= 0 ~c_num_read~0))) (.cse13 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or .cse0 (not (= 0 |old(~p_last_write~0)|)) (not (= ~q_read_ev~0 2)) .cse1 (and .cse2 .cse3 (= ~c_dr_st~0 0) .cse4 .cse5 .cse6 .cse7) .cse8 (not (= 1 ~c_dr_i~0)) .cse9 .cse10 .cse11 .cse12 (not (= 0 ~c_dr_pc~0)) .cse13 (not (= 0 |old(~c_dr_st~0)|))) (or .cse14 (< |old(~q_write_ev~0)| 2) (< |old(~c_dr_st~0)| 2) (or (or .cse15 .cse0 .cse16 (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 (<= 2 ~q_write_ev~0) (<= 2 ~c_dr_st~0) (and (= ~p_num_write~0 |old(~p_num_write~0)|) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~p_dw_pc~0)))) (or (or (not (= 2 |old(~c_dr_st~0)|)) .cse10) .cse0 .cse15 .cse16 .cse8 .cse9 .cse11 .cse14 (and .cse3 .cse4 (and .cse2 .cse6 (= ~c_dr_st~0 2)) .cse5 .cse7) (or .cse1 .cse12) .cse13))) [2018-12-08 19:50:23,168 INFO L444 ceAbstractionStarter]: At program point L124(line 124) the Hoare annotation is: (let ((.cse5 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (not (= 1 ~c_dr_pc~0))) (.cse0 (< ~q_read_ev~0 2)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse6 (not (= ~p_dw_i~0 1))) (.cse14 (not (= |old(~q_free~0)| 1))) (.cse9 (not (= 2 |old(~q_write_ev~0)|))) (.cse12 (= ~p_dw_pc~0 0)) (.cse13 (= ~q_write_ev~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 0)) (.cse10 (not (= |old(~p_dw_pc~0)| 0))) (.cse8 (not (= 0 |old(~q_buf_0~0)|))) (.cse11 (not (= 0 |old(~p_num_write~0)|))) (.cse15 (not (= 0 ~c_num_read~0))) (.cse16 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or .cse0 (< |old(~q_write_ev~0)| 2) (< |old(~c_dr_st~0)| 2) (let ((.cse3 (+ |old(~p_num_write~0)| 1))) (and .cse1 .cse2 (<= .cse3 ~p_num_write~0) .cse4 (= 1 ~p_dw_pc~0) (<= ~p_num_write~0 .cse3))) (or (or .cse5 .cse6 .cse7 (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) .cse6 .cse5 .cse7 .cse9 .cse10 .cse11 .cse0 (and .cse12 .cse13 .cse2 .cse4 .cse1 (= 1 ~p_num_write~0)) (or .cse14 .cse15) .cse16) (or .cse6 (not (= 0 |old(~p_last_write~0)|)) (not (= ~q_read_ev~0 2)) .cse14 .cse9 (and .cse12 .cse13 .cse4 (= ~c_dr_st~0 0) .cse1 (= ~p_num_write~0 1)) (not (= 1 ~c_dr_i~0)) .cse10 .cse8 .cse11 .cse15 (not (= 0 ~c_dr_pc~0)) .cse16 (not (= 0 |old(~c_dr_st~0)|))))) [2018-12-08 19:50:23,168 INFO L448 ceAbstractionStarter]: For program point L124-1(line 124) no Hoare annotation was computed. [2018-12-08 19:50:23,168 INFO L448 ceAbstractionStarter]: For program point L108(lines 107 127) no Hoare annotation was computed. [2018-12-08 19:50:23,168 INFO L448 ceAbstractionStarter]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2018-12-08 19:50:23,168 INFO L444 ceAbstractionStarter]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse11 (= ~p_dw_pc~0 0)) (.cse12 (= ~q_free~0 1)) (.cse15 (= ~q_write_ev~0 2)) (.cse16 (= 0 ~p_num_write~0)) (.cse8 (not (= |old(~q_free~0)| 1))) (.cse4 (not (= 2 |old(~q_write_ev~0)|))) (.cse5 (not (= |old(~p_dw_pc~0)| 0))) (.cse0 (not (= 0 |old(~q_buf_0~0)|))) (.cse6 (not (= 0 |old(~p_num_write~0)|))) (.cse9 (not (= 0 ~c_num_read~0))) (.cse10 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse7 (< ~q_read_ev~0 2)) (.cse14 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (<= 2 ~c_dr_st~0)) (.cse2 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse3 (not (= 1 ~c_dr_pc~0)))) (and (or (or (not (= 2 |old(~c_dr_st~0)|)) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (or .cse8 .cse9) .cse10 (and (= (mod ~c_dr_st~0 2) 0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)) (or (and .cse11 .cse12 .cse14 (= ~c_dr_st~0 0) .cse15 .cse16) .cse1 (not (= 0 |old(~p_last_write~0)|)) (not (= ~q_read_ev~0 2)) .cse8 .cse4 (not (= 1 ~c_dr_i~0)) .cse5 .cse0 .cse6 .cse9 (not (= 0 ~c_dr_pc~0)) .cse10 (not (= 0 |old(~c_dr_st~0)|))) (or .cse7 (< |old(~q_write_ev~0)| 2) (and (and (and .cse14 (= 1 ~p_dw_pc~0)) (= ~p_num_write~0 |old(~p_num_write~0)|)) (<= 2 ~q_write_ev~0) .cse13) (< |old(~c_dr_st~0)| 2) (or (or .cse2 .cse1 .cse3 (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-08 19:50:23,168 INFO L444 ceAbstractionStarter]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse5 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (not (= 1 ~c_dr_pc~0))) (.cse4 (= 1 ~p_dw_pc~0)) (.cse0 (< ~q_read_ev~0 2)) (.cse6 (not (= ~p_dw_i~0 1))) (.cse20 (not (= |old(~q_free~0)| 1))) (.cse16 (= ~q_free~0 1)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~q_buf_0~0 0)) (.cse19 (= 0 ~p_num_write~0)) (.cse13 (not (= 2 |old(~q_write_ev~0)|))) (.cse11 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse1 (= ~q_free~0 0)) (.cse10 (= ~q_write_ev~0 2)) (.cse14 (not (= |old(~p_dw_pc~0)| 0))) (.cse9 (not (= 0 |old(~q_buf_0~0)|))) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse21 (not (= 0 ~c_num_read~0))) (.cse22 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (let ((.cse2 (<= 2 ~q_write_ev~0))) (or .cse0 (< |old(~q_write_ev~0)| 2) (and .cse1 (and .cse2 (<= 2 ~c_dr_st~0) .cse3 .cse4)) (< |old(~c_dr_st~0)| 2) (or (or .cse5 .cse6 .cse7 (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)|)) (let ((.cse8 (+ |old(~p_num_write~0)| 1))) (and .cse1 .cse2 (<= .cse8 ~p_num_write~0) .cse3 .cse4 (<= ~p_num_write~0 .cse8))))) (or (or (not (= 2 |old(~c_dr_st~0)|)) .cse9) .cse6 .cse5 .cse7 (and (or (and .cse1 .cse10 .cse11 .cse3 .cse12) (and .cse1 .cse10 .cse3 .cse12 .cse4)) (= 1 ~p_num_write~0)) .cse13 .cse14 .cse15 .cse0 (and .cse16 .cse10 (and .cse11 .cse17 (= ~c_dr_st~0 2)) .cse18 .cse19) (or .cse20 .cse21) .cse22) (or .cse6 (not (= 0 |old(~p_last_write~0)|)) (not (= ~q_read_ev~0 2)) .cse20 (and .cse11 .cse16 .cse12 .cse10 .cse18 .cse17 .cse19) .cse13 (not (= 1 ~c_dr_i~0)) (and .cse11 .cse3 .cse12 .cse1 .cse10 (= ~p_num_write~0 1)) .cse14 .cse9 .cse15 .cse21 (not (= 0 ~c_dr_pc~0)) .cse22 (not (= 0 |old(~c_dr_st~0)|))))) [2018-12-08 19:50:23,169 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 103) no Hoare annotation was computed. [2018-12-08 19:50:23,169 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2018-12-08 19:50:23,169 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2018-12-08 19:50:23,169 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2018-12-08 19:50:23,169 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2018-12-08 19:50:23,169 INFO L444 ceAbstractionStarter]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse4 (not (= 1 ~q_write_ev~0))) (.cse6 (not (= 0 ~c_num_read~0))) (.cse2 (not (= ~p_dw_pc~0 0))) (.cse14 (< ~q_read_ev~0 2)) (.cse3 (not (= ~q_free~0 0))) (.cse16 (< |old(~c_dr_st~0)| 2)) (.cse8 (not (= 1 ~c_dr_pc~0))) (.cse15 (<= 2 ~c_dr_st~0)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse11 (not (= ~q_free~0 1))) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse9 (<= 2 ~p_dw_st~0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse5 (not (= 1 ~p_num_write~0))) (.cse7 (not (= 0 ~c_dr_pc~0))) (.cse12 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 (not (= ~q_read_ev~0 2)) .cse2 .cse3 .cse4 .cse5 (= ~c_dr_st~0 0) .cse6 .cse7 (not (= 0 |old(~c_dr_st~0)|))) (or (< ~q_write_ev~0 2) (< ~p_num_write~0 ~c_num_read~0) .cse1 .cse0 .cse8 .cse9 .cse10 .cse11 (< ~c_num_read~0 ~p_num_write~0) .cse12 .cse13) (or .cse14 .cse1 .cse0 .cse15 .cse8 .cse3 .cse16 .cse4 .cse5 .cse6 .cse2) (let ((.cse17 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse17) .cse14 .cse3 .cse16 (< .cse17 ~p_num_write~0) (or .cse1 .cse0 .cse8 .cse10) .cse15)) (or (or .cse1 .cse0 .cse11 .cse13) .cse9 (not (= ~q_read_ev~0 1)) .cse10 .cse5 (not (= 2 ~q_write_ev~0)) (not (= 1 ~c_num_read~0)) .cse7 .cse12))) [2018-12-08 19:50:23,169 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 86) no Hoare annotation was computed. [2018-12-08 19:50:23,169 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-12-08 19:50:23,169 INFO L448 ceAbstractionStarter]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2018-12-08 19:50:23,169 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 78) no Hoare annotation was computed. [2018-12-08 19:50:23,169 INFO L448 ceAbstractionStarter]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2018-12-08 19:50:23,169 INFO L444 ceAbstractionStarter]: At program point L72(line 72) the Hoare annotation is: (let ((.cse4 (not (= 1 ~q_write_ev~0))) (.cse6 (not (= 0 ~c_num_read~0))) (.cse2 (not (= ~p_dw_pc~0 0))) (.cse14 (< ~q_read_ev~0 2)) (.cse3 (not (= ~q_free~0 0))) (.cse16 (< |old(~c_dr_st~0)| 2)) (.cse8 (not (= 1 ~c_dr_pc~0))) (.cse15 (<= 2 ~c_dr_st~0)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse11 (not (= ~q_free~0 1))) (.cse13 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse9 (<= 2 ~p_dw_st~0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse5 (not (= 1 ~p_num_write~0))) (.cse7 (not (= 0 ~c_dr_pc~0))) (.cse12 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 (not (= ~q_read_ev~0 2)) .cse2 .cse3 .cse4 .cse5 (= ~c_dr_st~0 0) .cse6 .cse7 (not (= 0 |old(~c_dr_st~0)|))) (or (< ~q_write_ev~0 2) (< ~p_num_write~0 ~c_num_read~0) .cse1 .cse0 .cse8 .cse9 .cse10 .cse11 (< ~c_num_read~0 ~p_num_write~0) .cse12 .cse13) (or .cse14 .cse1 .cse0 .cse15 .cse8 .cse3 .cse16 .cse4 .cse5 .cse6 .cse2) (let ((.cse17 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse17) .cse14 .cse3 .cse16 (< .cse17 ~p_num_write~0) (or .cse1 .cse0 .cse8 .cse10) .cse15)) (or (or .cse1 .cse0 .cse11 .cse13) .cse9 (not (= ~q_read_ev~0 1)) .cse10 .cse5 (not (= 2 ~q_write_ev~0)) (not (= 1 ~c_num_read~0)) .cse7 .cse12))) [2018-12-08 19:50:23,169 INFO L444 ceAbstractionStarter]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse10 (< ~q_read_ev~0 2)) (.cse2 (not (= 1 ~c_dr_pc~0))) (.cse13 (< |old(~c_dr_st~0)| 2)) (.cse11 (<= 2 ~c_dr_st~0)) (.cse4 (not (= ~q_free~0 1))) (.cse8 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse14 (not (= ~q_read_ev~0 1))) (.cse3 (not (= ~p_dw_pc~0 1))) (.cse5 (= ~p_dw_st~0 0)) (.cse16 (= immediate_notify_threads_~tmp~0 1)) (.cse15 (not (= 2 ~q_write_ev~0))) (.cse18 (not (= 1 ~c_num_read~0))) (.cse7 (< |old(~p_dw_st~0)| 2)) (.cse1 (not (= ~p_dw_i~0 1))) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse6 (= immediate_notify_threads_~tmp~0 0)) (.cse21 (not (= ~p_dw_pc~0 0))) (.cse12 (not (= ~q_free~0 0))) (.cse19 (not (= 1 ~q_write_ev~0))) (.cse17 (not (= 1 ~p_num_write~0))) (.cse20 (not (= 0 ~c_num_read~0))) (.cse22 (not (= 0 ~c_dr_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< ~q_write_ev~0 2) (< ~p_num_write~0 ~c_num_read~0) (< ~c_num_read~0 ~p_num_write~0) (and (<= 2 ~p_dw_st~0) .cse6) .cse7 .cse8) (let ((.cse9 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse9) .cse10 (and (or .cse5 .cse6) .cse11) .cse12 .cse13 (< .cse9 ~p_num_write~0) (or .cse0 .cse1 .cse2 .cse3))) (or .cse1 .cse0 .cse2 .cse14 .cse4 .cse3 .cse15 (or .cse16 .cse6) .cse17 .cse18 .cse7 .cse8) (or .cse10 .cse0 .cse1 .cse2 .cse12 .cse13 .cse19 .cse17 .cse20 (and .cse11 .cse6) .cse21) (or (or .cse0 .cse1 .cse4 .cse8) .cse14 .cse3 (and .cse5 .cse16) .cse17 .cse15 .cse18 .cse22 .cse7) (or .cse1 .cse0 (and (= ~c_dr_st~0 0) .cse6) (not (= ~q_read_ev~0 2)) .cse21 .cse12 .cse19 .cse17 .cse20 .cse22 (not (= 0 |old(~c_dr_st~0)|))))) [2018-12-08 19:50:23,170 INFO L448 ceAbstractionStarter]: For program point L72-1(line 72) no Hoare annotation was computed. [2018-12-08 19:50:23,170 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-08 19:50:23,170 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-08 19:50:23,170 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 19:50:23,170 INFO L448 ceAbstractionStarter]: For program point L290-1(line 290) no Hoare annotation was computed. [2018-12-08 19:50:23,170 INFO L451 ceAbstractionStarter]: At program point L299(lines 288 301) the Hoare annotation is: true [2018-12-08 19:50:23,170 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2018-12-08 19:50:23,170 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 297) no Hoare annotation was computed. [2018-12-08 19:50:23,170 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2018-12-08 19:50:23,170 INFO L451 ceAbstractionStarter]: At program point L290(line 290) the Hoare annotation is: true [2018-12-08 19:50:23,170 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2018-12-08 19:50:23,170 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse34 (not (= |old(~p_dw_st~0)| 0))) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse0 (not (= ~p_dw_i~0 1))) (.cse35 (not (= 1 |old(~c_dr_pc~0)|))) (.cse4 (not (= |old(~p_dw_pc~0)| 1)))) (let ((.cse10 (= ~q_free~0 0)) (.cse23 (<= 2 ~p_dw_st~0)) (.cse13 (not (= |old(~q_free~0)| 0))) (.cse19 (or .cse1 .cse0 .cse35 .cse4)) (.cse28 (< |old(~p_dw_st~0)| 2)) (.cse21 (< |old(~q_write_ev~0)| 2)) (.cse22 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse24 (<= 2 ~q_write_ev~0)) (.cse25 (= |old(~c_num_read~0)| ~c_num_read~0)) (.cse30 (<= 2 ~c_dr_st~0)) (.cse26 (<= 2 ~q_read_ev~0)) (.cse27 (= 1 ~c_dr_pc~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= 1 ~p_dw_pc~0)) (.cse20 (< |old(~q_read_ev~0)| 2)) (.cse29 (< |old(~c_dr_st~0)| 2)) (.cse33 (or .cse1 .cse0 .cse35 .cse4 .cse34)) (.cse14 (not (= 1 |old(~p_num_write~0)|))) (.cse31 (not (= 1 |old(~c_num_read~0)|))) (.cse5 (= ~q_read_ev~0 2)) (.cse32 (= ~p_dw_st~0 0)) (.cse7 (= ~c_dr_st~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse11 (= ~q_write_ev~0 2)) (.cse12 (= ~c_dr_pc~0 0)) (.cse3 (not (= |old(~q_read_ev~0)| 2))) (.cse2 (not (= 2 |old(~q_write_ev~0)|))) (.cse15 (not (= 0 |old(~c_num_read~0)|))) (.cse16 (not (= 0 |old(~c_dr_pc~0)|))) (.cse17 (not (= 0 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 (or .cse3 .cse4 (not (= |old(~p_dw_st~0)| 2))) (and .cse5 (= ~p_dw_st~0 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~p_num_write~0 1) .cse12) .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse18 (+ |old(~c_num_read~0)| 1))) (or (< |old(~p_num_write~0)| .cse18) .cse19 .cse20 .cse21 .cse13 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse6 .cse8 .cse10) (< .cse18 |old(~p_num_write~0)|) .cse28)) (or .cse19 .cse21 .cse29 .cse28 (and .cse22 .cse23 .cse24 .cse25 .cse30 .cse27 .cse6 .cse8)) (or .cse19 .cse2 .cse20 .cse13 (and (= (mod ~p_dw_st~0 2) 0) .cse7 .cse11) (not (= 0 (mod |old(~p_dw_st~0)| 2))) .cse14 .cse15 .cse28 .cse17) (or .cse19 .cse29 .cse14 .cse2 .cse31 .cse11 .cse28) (or .cse20 .cse21 (< |old(~p_num_write~0)| |old(~c_num_read~0)|) .cse29 (and .cse22 .cse24 .cse25 .cse30 .cse32 .cse26 .cse27 .cse6 .cse8) .cse33 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (or .cse20 .cse11 .cse29 .cse33 .cse14 .cse2 .cse31) (or (and .cse5 (= ~p_dw_pc~0 0) (= ~q_free~0 1) .cse32 .cse7 .cse9 .cse11 (= ~p_last_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_buf_0~0 0) .cse12 (= 0 ~p_num_write~0)) .cse0 (not (= 0 |old(~p_last_write~0)|)) .cse3 (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)|)) .cse34 .cse15 .cse16 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) .cse17)))) [2018-12-08 19:50:23,171 INFO L444 ceAbstractionStarter]: At program point L254(line 254) the Hoare annotation is: (let ((.cse28 (= ~p_dw_i~0 1))) (let ((.cse23 (<= 2 ~q_read_ev~0)) (.cse24 (= 1 ~c_dr_pc~0)) (.cse8 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (not .cse28)) (.cse27 (not (= 1 |old(~c_dr_pc~0)|))) (.cse11 (not (= |old(~p_dw_pc~0)| 1)))) (let ((.cse4 (not (= |old(~q_free~0)| 0))) (.cse10 (not (= |old(~q_read_ev~0)| 2))) (.cse9 (not (= 2 |old(~q_write_ev~0)|))) (.cse12 (not (= 0 |old(~c_num_read~0)|))) (.cse13 (not (= 0 |old(~c_dr_pc~0)|))) (.cse14 (not (= 0 |old(~c_dr_st~0)|))) (.cse1 (or .cse8 .cse7 .cse27 .cse11)) (.cse6 (< |old(~p_dw_st~0)| 2)) (.cse2 (< |old(~q_read_ev~0)| 2)) (.cse3 (< |old(~q_write_ev~0)| 2)) (.cse26 (< |old(~c_dr_st~0)| 2)) (.cse25 (not (= |old(~p_dw_st~0)| 0))) (.cse5 (and (<= 2 ~q_write_ev~0) (<= 2 ~c_dr_st~0) .cse23 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse28 .cse24 (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~p_dw_pc~0))))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (< |old(~p_num_write~0)| .cse0) .cse1 .cse2 .cse3 .cse4 (< .cse0 |old(~p_num_write~0)|) .cse5 .cse6)) (or .cse7 .cse8 .cse9 (or .cse10 .cse11 (not (= |old(~p_dw_st~0)| 2))) .cse4 (not (= 1 |old(~p_num_write~0)|)) .cse12 .cse13 .cse5 .cse14) (let ((.cse16 (= ~q_free~0 1)) (.cse17 (= ~c_num_read~0 0)) (.cse18 (= ~q_write_ev~0 2)) (.cse15 (= ~p_dw_pc~0 0)) (.cse19 (= ~p_last_write~0 0)) (.cse21 (= ~q_buf_0~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse22 (= 0 ~p_num_write~0))) (or .cse7 (not (= 0 |old(~p_last_write~0)|)) .cse10 (not (= |old(~q_free~0)| 1)) (and (= ~q_read_ev~0 2) .cse15 .cse16 (= ~c_dr_st~0 0) .cse17 .cse18 .cse19 .cse20 .cse21 (= ~c_dr_pc~0 0) .cse22) .cse9 (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)|)) (and .cse16 .cse23 .cse24 .cse17 .cse18 (and .cse15 .cse19 .cse21 (= ~c_dr_st~0 2)) .cse20 .cse22) .cse25 .cse12 .cse13 .cse5 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) .cse14)) (or .cse1 .cse3 .cse26 .cse6) (or .cse2 .cse3 (< |old(~p_num_write~0)| |old(~c_num_read~0)|) .cse26 (or .cse8 .cse7 .cse27 .cse11 .cse25) (< |old(~c_num_read~0)| |old(~p_num_write~0)|) .cse5))))) [2018-12-08 19:50:23,171 INFO L448 ceAbstractionStarter]: For program point L242(lines 242 246) no Hoare annotation was computed. [2018-12-08 19:50:23,171 INFO L448 ceAbstractionStarter]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2018-12-08 19:50:23,171 INFO L448 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2018-12-08 19:50:23,171 INFO L444 ceAbstractionStarter]: At program point L238(line 238) the Hoare annotation is: (let ((.cse43 (= ~p_dw_i~0 1))) (let ((.cse18 (<= 2 ~p_dw_st~0)) (.cse19 (<= 2 ~q_write_ev~0)) (.cse20 (<= 2 ~c_dr_st~0)) (.cse30 (= ~p_dw_st~0 0)) (.cse39 (<= 2 ~q_read_ev~0)) (.cse21 (= 1 ~c_dr_pc~0)) (.cse3 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not .cse43)) (.cse24 (not (= 1 |old(~c_dr_pc~0)|))) (.cse8 (not (= |old(~p_dw_pc~0)| 1))) (.cse27 (= ~q_read_ev~0 2)) (.cse22 (= ~p_last_write~0 ~q_buf_0~0)) (.cse31 (= ~c_dr_st~0 0)) (.cse23 (= 1 ~p_dw_pc~0)) (.cse32 (= ~c_num_read~0 0)) (.cse41 (= ~q_free~0 0)) (.cse33 (= ~q_write_ev~0 2)) (.cse37 (= ~c_dr_pc~0 0))) (let ((.cse12 (and .cse27 (= ~p_dw_st~0 2) .cse22 .cse31 .cse23 .cse32 .cse41 .cse33 (= ~p_num_write~0 1) .cse37)) (.cse10 (not (= 0 |old(~c_num_read~0)|))) (.cse11 (not (= 0 |old(~c_dr_st~0)|))) (.cse7 (not (= |old(~q_read_ev~0)| 2))) (.cse25 (not (= |old(~p_dw_st~0)| 0))) (.cse13 (not (= 0 |old(~c_dr_pc~0)|))) (.cse16 (< |old(~c_dr_st~0)| 2)) (.cse9 (not (= 1 |old(~p_num_write~0)|))) (.cse5 (not (= 2 |old(~q_write_ev~0)|))) (.cse14 (or .cse3 .cse1 .cse24 .cse8)) (.cse0 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse19 .cse20 .cse30 .cse39 .cse43 .cse21 .cse22 .cse23)) (.cse4 (and .cse18 .cse19 .cse20 .cse43 .cse21 .cse22 .cse23)) (.cse26 (< |old(~q_read_ev~0)| 2)) (.cse15 (< |old(~q_write_ev~0)| 2)) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse2 (let ((.cse42 (+ ~c_num_read~0 1))) (and .cse41 (<= .cse42 ~p_num_write~0) .cse18 .cse19 (<= ~p_num_write~0 .cse42) .cse39 .cse43 .cse21 .cse22 .cse23))) (.cse17 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or .cse6 .cse7 .cse8 .cse9 (not (= |old(~p_dw_st~0)| 2)) .cse10 .cse11) .cse12 .cse13) (or .cse14 .cse15 .cse16 .cse17 (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse18 .cse19 (= |old(~c_num_read~0)| ~c_num_read~0) .cse20 .cse21 .cse22 .cse23)) (or .cse0 .cse4 (or .cse3 .cse1 .cse24 .cse8 .cse25) .cse26 .cse15 (< |old(~p_num_write~0)| |old(~c_num_read~0)|) .cse16 .cse2 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (let ((.cse28 (= ~p_dw_pc~0 0)) (.cse29 (= ~q_free~0 1)) (.cse34 (= ~p_last_write~0 0)) (.cse35 (= ~c_last_read~0 ~p_last_write~0)) (.cse36 (= ~q_buf_0~0 0)) (.cse38 (= 0 ~p_num_write~0))) (or .cse0 .cse1 (not (= |old(~q_free~0)| 1)) (not (= 1 ~c_dr_i~0)) .cse12 .cse2 .cse10 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) .cse11 (and .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) .cse4 (not (= 0 |old(~p_last_write~0)|)) .cse7 .cse5 (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse28 .cse29 .cse30 .cse39 .cse21 .cse32 .cse33 .cse34 .cse35 .cse36 (= ~c_dr_st~0 2) .cse38) .cse25 .cse13)) (or .cse14 .cse16 .cse9 .cse5 (not (= 1 |old(~c_num_read~0)|)) .cse33 .cse17) (let ((.cse40 (+ |old(~c_num_read~0)| 1))) (or (< |old(~p_num_write~0)| .cse40) .cse14 .cse0 .cse4 (< .cse40 |old(~p_num_write~0)|) .cse26 .cse15 .cse6 .cse2 .cse17)))))) [2018-12-08 19:50:23,171 INFO L444 ceAbstractionStarter]: At program point L269(line 269) the Hoare annotation is: (let ((.cse32 (+ ~c_num_read~0 1)) (.cse29 (= ~p_dw_i~0 1)) (.cse30 (= ~p_last_write~0 ~q_buf_0~0)) (.cse31 (= 1 ~p_dw_pc~0))) (let ((.cse19 (= ~q_write_ev~0 2)) (.cse20 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_num_read~0 0)) (.cse15 (and (not (= ~p_dw_st~0 1)) .cse29 (= 1 ~c_dr_pc~0) .cse30 .cse31)) (.cse11 (= ~q_free~0 0)) (.cse12 (<= .cse32 ~p_num_write~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse14 (<= 2 ~q_write_ev~0)) (.cse16 (<= ~p_num_write~0 .cse32)) (.cse17 (<= 2 ~q_read_ev~0)) (.cse26 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (not .cse29)) (.cse27 (not (= 1 |old(~c_dr_pc~0)|))) (.cse28 (not (= |old(~p_dw_pc~0)| 1)))) (let ((.cse1 (or .cse26 .cse7 .cse27 .cse28)) (.cse6 (< |old(~p_dw_st~0)| 2)) (.cse2 (< |old(~q_read_ev~0)| 2)) (.cse3 (< |old(~q_write_ev~0)| 2)) (.cse25 (< |old(~c_dr_st~0)| 2)) (.cse21 (not (= |old(~p_dw_st~0)| 0))) (.cse5 (and .cse15 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17)) (.cse10 (not (= 2 |old(~q_write_ev~0)|))) (.cse9 (not (= |old(~q_read_ev~0)| 2))) (.cse8 (and .cse19 .cse13 (= (mod ~p_dw_st~0 2) 0) .cse17 .cse20 (and .cse18 .cse11 (= ~p_num_write~0 1) .cse29 .cse30 .cse31))) (.cse4 (not (= |old(~q_free~0)| 0))) (.cse22 (not (= 0 |old(~c_num_read~0)|))) (.cse23 (not (= 0 |old(~c_dr_pc~0)|))) (.cse24 (not (= 0 |old(~c_dr_st~0)|)))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (< |old(~p_num_write~0)| .cse0) .cse1 .cse2 .cse3 .cse4 (< .cse0 |old(~p_num_write~0)|) .cse5 .cse6)) (or .cse7 .cse8 (not (= 0 |old(~p_last_write~0)|)) .cse9 (not (= |old(~q_free~0)| 1)) .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (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)|)) (and (= ~q_read_ev~0 2) (= ~p_dw_pc~0 0) (= ~q_free~0 1) (= ~p_dw_st~0 0) .cse18 .cse19 (= ~p_last_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_buf_0~0 0) .cse20 (= 0 ~p_num_write~0)) .cse21 .cse22 .cse23 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) .cse24) (or .cse1 .cse3 .cse25 .cse6) (or .cse2 .cse3 (< |old(~p_num_write~0)| |old(~c_num_read~0)|) .cse25 .cse5 (or .cse26 .cse7 .cse27 .cse28 .cse21) (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (or .cse7 .cse26 .cse5 .cse10 (or .cse9 .cse28 (not (= |old(~p_dw_st~0)| 2))) .cse8 .cse4 (not (= 1 |old(~p_num_write~0)|)) .cse22 .cse23 .cse24))))) [2018-12-08 19:50:23,171 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2018-12-08 19:50:23,171 INFO L448 ceAbstractionStarter]: For program point L251(lines 251 258) no Hoare annotation was computed. [2018-12-08 19:50:23,171 INFO L448 ceAbstractionStarter]: For program point L247(lines 237 277) no Hoare annotation was computed. [2018-12-08 19:50:23,172 INFO L444 ceAbstractionStarter]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse32 (= ~p_dw_i~0 1))) (let ((.cse19 (<= 2 ~p_dw_st~0)) (.cse20 (<= 2 ~q_write_ev~0)) (.cse21 (<= 2 ~c_dr_st~0)) (.cse31 (<= 2 ~q_read_ev~0)) (.cse22 (= 1 ~c_dr_pc~0)) (.cse11 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not .cse32)) (.cse25 (not (= 1 |old(~c_dr_pc~0)|))) (.cse13 (not (= |old(~p_dw_pc~0)| 1))) (.cse23 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (= 1 ~p_dw_pc~0)) (.cse29 (= ~q_free~0 0)) (.cse27 (= ~q_write_ev~0 2))) (let ((.cse7 (not (= |old(~q_read_ev~0)| 2))) (.cse4 (not (= 0 |old(~c_num_read~0)|))) (.cse5 (not (= 0 |old(~c_dr_st~0)|))) (.cse2 (and (= ~q_read_ev~0 2) (= ~p_dw_st~0 2) .cse23 (= ~c_dr_st~0 0) .cse24 (= ~c_num_read~0 0) .cse29 .cse27 (= ~p_num_write~0 1) (= ~c_dr_pc~0 0))) (.cse10 (not (= 0 |old(~c_dr_pc~0)|))) (.cse9 (not (= |old(~p_dw_st~0)| 0))) (.cse17 (< |old(~c_dr_st~0)| 2)) (.cse14 (not (= 1 |old(~p_num_write~0)|))) (.cse8 (not (= 2 |old(~q_write_ev~0)|))) (.cse15 (or .cse11 .cse1 .cse25 .cse13)) (.cse0 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse20 .cse21 (= ~p_dw_st~0 0) .cse31 .cse32 .cse22 .cse23 .cse24)) (.cse6 (and .cse19 .cse20 .cse21 .cse32 .cse22 .cse23 .cse24)) (.cse26 (< |old(~q_read_ev~0)| 2)) (.cse16 (< |old(~q_write_ev~0)| 2)) (.cse12 (not (= |old(~q_free~0)| 0))) (.cse3 (let ((.cse30 (+ ~c_num_read~0 1))) (and .cse29 (<= .cse30 ~p_num_write~0) .cse19 .cse20 (<= ~p_num_write~0 .cse30) .cse31 .cse32 .cse22 .cse23 .cse24))) (.cse18 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 (not (= |old(~q_free~0)| 1)) (not (= 1 ~c_dr_i~0)) .cse2 .cse3 .cse4 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) .cse5 .cse6 (not (= 0 |old(~p_last_write~0)|)) .cse7 .cse8 (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) .cse9 .cse10) (or .cse0 .cse1 .cse3 .cse11 .cse6 .cse8 (or .cse12 .cse7 .cse13 .cse14 (not (= |old(~p_dw_st~0)| 2)) .cse4 .cse5) .cse2 .cse10) (or .cse15 .cse16 .cse17 .cse18 (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse19 .cse20 (= |old(~c_num_read~0)| ~c_num_read~0) .cse21 .cse22 .cse23 .cse24)) (or .cse0 .cse6 (or .cse11 .cse1 .cse25 .cse13 .cse9) .cse26 .cse16 (< |old(~p_num_write~0)| |old(~c_num_read~0)|) .cse17 .cse3 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (or .cse15 .cse17 .cse14 .cse8 (not (= 1 |old(~c_num_read~0)|)) .cse27 .cse18) (let ((.cse28 (+ |old(~c_num_read~0)| 1))) (or (< |old(~p_num_write~0)| .cse28) .cse15 .cse0 .cse6 (< .cse28 |old(~p_num_write~0)|) .cse26 .cse16 .cse12 .cse3 .cse18)))))) [2018-12-08 19:50:23,172 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 273) no Hoare annotation was computed. [2018-12-08 19:50:23,172 INFO L444 ceAbstractionStarter]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse43 (= ~p_dw_i~0 1))) (let ((.cse18 (<= 2 ~p_dw_st~0)) (.cse19 (<= 2 ~q_write_ev~0)) (.cse20 (<= 2 ~c_dr_st~0)) (.cse30 (= ~p_dw_st~0 0)) (.cse39 (<= 2 ~q_read_ev~0)) (.cse21 (= 1 ~c_dr_pc~0)) (.cse3 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not .cse43)) (.cse24 (not (= 1 |old(~c_dr_pc~0)|))) (.cse8 (not (= |old(~p_dw_pc~0)| 1))) (.cse27 (= ~q_read_ev~0 2)) (.cse22 (= ~p_last_write~0 ~q_buf_0~0)) (.cse31 (= ~c_dr_st~0 0)) (.cse23 (= 1 ~p_dw_pc~0)) (.cse32 (= ~c_num_read~0 0)) (.cse41 (= ~q_free~0 0)) (.cse33 (= ~q_write_ev~0 2)) (.cse37 (= ~c_dr_pc~0 0))) (let ((.cse12 (and .cse27 (= ~p_dw_st~0 2) .cse22 .cse31 .cse23 .cse32 .cse41 .cse33 (= ~p_num_write~0 1) .cse37)) (.cse10 (not (= 0 |old(~c_num_read~0)|))) (.cse11 (not (= 0 |old(~c_dr_st~0)|))) (.cse7 (not (= |old(~q_read_ev~0)| 2))) (.cse25 (not (= |old(~p_dw_st~0)| 0))) (.cse13 (not (= 0 |old(~c_dr_pc~0)|))) (.cse16 (< |old(~c_dr_st~0)| 2)) (.cse9 (not (= 1 |old(~p_num_write~0)|))) (.cse5 (not (= 2 |old(~q_write_ev~0)|))) (.cse14 (or .cse3 .cse1 .cse24 .cse8)) (.cse0 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse19 .cse20 .cse30 .cse39 .cse43 .cse21 .cse22 .cse23)) (.cse4 (and .cse18 .cse19 .cse20 .cse43 .cse21 .cse22 .cse23)) (.cse26 (< |old(~q_read_ev~0)| 2)) (.cse15 (< |old(~q_write_ev~0)| 2)) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse2 (let ((.cse42 (+ ~c_num_read~0 1))) (and .cse41 (<= .cse42 ~p_num_write~0) .cse18 .cse19 (<= ~p_num_write~0 .cse42) .cse39 .cse43 .cse21 .cse22 .cse23))) (.cse17 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or .cse6 .cse7 .cse8 .cse9 (not (= |old(~p_dw_st~0)| 2)) .cse10 .cse11) .cse12 .cse13) (or .cse14 .cse15 .cse16 .cse17 (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse18 .cse19 (= |old(~c_num_read~0)| ~c_num_read~0) .cse20 .cse21 .cse22 .cse23)) (or .cse0 .cse4 (or .cse3 .cse1 .cse24 .cse8 .cse25) .cse26 .cse15 (< |old(~p_num_write~0)| |old(~c_num_read~0)|) .cse16 .cse2 (< |old(~c_num_read~0)| |old(~p_num_write~0)|)) (let ((.cse28 (= ~p_dw_pc~0 0)) (.cse29 (= ~q_free~0 1)) (.cse34 (= ~p_last_write~0 0)) (.cse35 (= ~c_last_read~0 ~p_last_write~0)) (.cse36 (= ~q_buf_0~0 0)) (.cse38 (= 0 ~p_num_write~0))) (or .cse0 .cse1 (not (= |old(~q_free~0)| 1)) (not (= 1 ~c_dr_i~0)) .cse12 .cse2 .cse10 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) .cse11 (and .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) .cse4 (not (= 0 |old(~p_last_write~0)|)) .cse7 .cse5 (not (= |old(~p_dw_pc~0)| 0)) (not (= 0 |old(~q_buf_0~0)|)) (not (= 0 |old(~p_num_write~0)|)) (and .cse28 .cse29 .cse30 .cse39 .cse21 .cse32 .cse33 .cse34 .cse35 .cse36 (= ~c_dr_st~0 2) .cse38) .cse25 .cse13)) (or .cse14 .cse16 .cse9 .cse5 (not (= 1 |old(~c_num_read~0)|)) .cse33 .cse17) (let ((.cse40 (+ |old(~c_num_read~0)| 1))) (or (< |old(~p_num_write~0)| .cse40) .cse14 .cse0 .cse4 (< .cse40 |old(~p_num_write~0)|) .cse26 .cse15 .cse6 .cse2 .cse17)))))) [2018-12-08 19:50:23,172 INFO L444 ceAbstractionStarter]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse0 (< ~q_write_ev~0 2)) (.cse1 (< ~p_num_write~0 ~c_num_read~0)) (.cse8 (= 0 is_do_read_c_triggered_~__retres1~1)) (.cse9 (< ~c_num_read~0 ~p_num_write~0)) (.cse6 (not (= ~q_free~0 1))) (.cse5 (not (= ~p_dw_pc~0 1))) (.cse17 (= is_do_read_c_triggered_~__retres1~1 0)) (.cse7 (not (= ~p_dw_st~0 0))) (.cse16 (not (= 0 ~c_dr_pc~0))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse4 (not (= 1 ~c_dr_pc~0))) (.cse12 (not (= ~q_free~0 0))) (.cse13 (not (= 1 ~q_write_ev~0))) (.cse14 (not (= 1 ~p_num_write~0))) (.cse15 (not (= 0 ~c_num_read~0))) (.cse11 (not (= ~p_dw_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse3 .cse2 (not (= ~q_read_ev~0 2)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 0 ~c_dr_st~0)) .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse5 .cse6 .cse9 (< ~p_dw_st~0 2) .cse10) (or .cse3 .cse2 (not (= ~q_read_ev~0 1)) .cse6 .cse5 (not (= 2 ~q_write_ev~0)) .cse17 .cse7 .cse14 (not (= 1 ~c_num_read~0)) .cse16 .cse10) (or (< ~q_read_ev~0 2) .cse2 .cse3 .cse4 .cse12 (< ~c_dr_st~0 2) .cse13 .cse14 .cse15 (= is_do_read_c_triggered_~__retres1~1 1) .cse11))) [2018-12-08 19:50:23,172 INFO L451 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2018-12-08 19:50:23,172 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 57) no Hoare annotation was computed. [2018-12-08 19:50:23,172 INFO L448 ceAbstractionStarter]: For program point L51(lines 51 60) no Hoare annotation was computed. [2018-12-08 19:50:23,172 INFO L448 ceAbstractionStarter]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2018-12-08 19:50:23,172 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2018-12-08 19:50:23,172 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2018-12-08 19:50:23,172 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 303 331) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (and (= ~q_read_ev~0 2) (= ~p_dw_pc~0 0) (= ~q_free~0 1) (= ~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(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (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)|)) (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-08 19:50:23,172 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2018-12-08 19:50:23,172 INFO L448 ceAbstractionStarter]: For program point L318(line 318) no Hoare annotation was computed. [2018-12-08 19:50:23,173 INFO L444 ceAbstractionStarter]: At program point L317(line 317) the Hoare annotation is: (let ((.cse10 (= ~q_free~0 0)) (.cse3 (<= 2 ~q_read_ev~0)) (.cse7 (= ~q_read_ev~0 2)) (.cse2 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_st~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse11 (= ~q_write_ev~0 2)) (.cse12 (= ~c_dr_pc~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse0 (<= 2 ~q_write_ev~0)) (.cse1 (<= 2 ~c_dr_st~0)) (.cse4 (= 1 ~c_dr_pc~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~p_dw_pc~0))) (or (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~p_dw_i~0 1)) (not (= |old(~q_free~0)| 1)) (not (= 1 ~c_dr_i~0)) (and .cse7 (= ~p_dw_st~0 2) .cse5 .cse8 .cse6 .cse9 .cse10 .cse11 (= ~p_num_write~0 1) .cse12) (let ((.cse13 (+ ~c_num_read~0 1))) (and .cse10 (<= .cse13 ~p_num_write~0) .cse14 .cse0 (<= ~p_num_write~0 .cse13) .cse3 .cse4 .cse5 .cse6)) (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)|)) (and .cse7 (= ~p_dw_pc~0 0) (= ~q_free~0 1) .cse2 .cse8 .cse9 .cse11 (= ~p_last_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_buf_0~0 0) .cse12 (= 0 ~p_num_write~0)) (and .cse14 .cse0 .cse1 .cse4 .cse5 .cse6) (not (= 0 |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (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)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_dr_pc~0)|)))) [2018-12-08 19:50:23,173 INFO L444 ceAbstractionStarter]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse6 (= ~q_free~0 0)) (.cse2 (<= 2 ~q_read_ev~0)) (.cse8 (<= 2 ~p_dw_st~0)) (.cse0 (<= 2 ~q_write_ev~0)) (.cse1 (<= 2 ~c_dr_st~0)) (.cse3 (= 1 ~c_dr_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0))) (or (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse0 .cse1 (= ~p_dw_st~0 0) .cse2 .cse3 .cse4 .cse5) (not (= ~p_dw_i~0 1)) (not (= |old(~q_free~0)| 1)) (not (= 1 ~c_dr_i~0)) (and (= ~q_read_ev~0 2) (= ~p_dw_st~0 2) .cse4 (= ~c_dr_st~0 0) .cse5 (= ~c_num_read~0 0) .cse6 (= ~q_write_ev~0 2) (= ~p_num_write~0 1) (= ~c_dr_pc~0 0)) (let ((.cse7 (+ ~c_num_read~0 1))) (and .cse6 (<= .cse7 ~p_num_write~0) .cse8 .cse0 (<= ~p_num_write~0 .cse7) .cse2 .cse3 .cse4 .cse5)) (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)|)) (and .cse8 .cse0 .cse1 .cse3 .cse4 .cse5) (not (= 0 |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (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)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_dr_pc~0)|)))) [2018-12-08 19:50:23,173 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2018-12-08 19:50:23,173 INFO L448 ceAbstractionStarter]: For program point L314(line 314) no Hoare annotation was computed. [2018-12-08 19:50:23,173 INFO L444 ceAbstractionStarter]: At program point L313-1(lines 310 325) the Hoare annotation is: (let ((.cse10 (= ~q_free~0 0)) (.cse3 (<= 2 ~q_read_ev~0)) (.cse7 (= ~q_read_ev~0 2)) (.cse2 (= ~p_dw_st~0 0)) (.cse8 (= ~c_dr_st~0 0)) (.cse9 (= ~c_num_read~0 0)) (.cse11 (= ~q_write_ev~0 2)) (.cse12 (= ~c_dr_pc~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse0 (<= 2 ~q_write_ev~0)) (.cse1 (<= 2 ~c_dr_st~0)) (.cse4 (= 1 ~c_dr_pc~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~p_dw_pc~0))) (or (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~p_dw_i~0 1)) (not (= |old(~q_free~0)| 1)) (not (= 1 ~c_dr_i~0)) (and .cse7 (= ~p_dw_st~0 2) .cse5 .cse8 .cse6 .cse9 .cse10 .cse11 (= ~p_num_write~0 1) .cse12) (let ((.cse13 (+ ~c_num_read~0 1))) (and .cse10 (<= .cse13 ~p_num_write~0) .cse14 .cse0 (<= ~p_num_write~0 .cse13) .cse3 .cse4 .cse5 .cse6)) (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)|)) (and .cse7 (= ~p_dw_pc~0 0) (= ~q_free~0 1) .cse2 .cse8 .cse9 .cse11 (= ~p_last_write~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_buf_0~0 0) .cse12 (= 0 ~p_num_write~0)) (and .cse14 .cse0 .cse1 .cse4 .cse5 .cse6) (not (= 0 |old(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (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)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= 0 |old(~c_dr_pc~0)|)))) [2018-12-08 19:50:23,173 INFO L444 ceAbstractionStarter]: At program point L310(line 310) the Hoare annotation is: (or (not (= ~p_dw_i~0 1)) (and (= ~q_read_ev~0 2) (= ~p_dw_pc~0 0) (= ~q_free~0 1) (= ~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(~p_last_write~0)|)) (not (= |old(~q_read_ev~0)| 2)) (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)|)) (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-08 19:50:23,173 INFO L451 ceAbstractionStarter]: At program point L326(lines 303 331) the Hoare annotation is: true [2018-12-08 19:50:23,173 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 19:50:23,173 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-08 19:50:23,173 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 19:50:23,173 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 19:50:23,173 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2018-12-08 19:50:23,173 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 41) no Hoare annotation was computed. [2018-12-08 19:50:23,173 INFO L448 ceAbstractionStarter]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2018-12-08 19:50:23,173 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2018-12-08 19:50:23,174 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2018-12-08 19:50:23,174 INFO L444 ceAbstractionStarter]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse13 (< ~q_read_ev~0 2)) (.cse15 (< ~c_dr_st~0 2)) (.cse2 (not (= 1 ~c_dr_pc~0))) (.cse4 (not (= ~q_free~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse9 (= is_do_write_p_triggered_~__retres1~0 1)) (.cse3 (not (= ~q_read_ev~0 1))) (.cse5 (not (= ~p_dw_pc~0 1))) (.cse6 (not (= 2 ~q_write_ev~0))) (.cse8 (not (= 1 ~c_num_read~0))) (.cse11 (< ~p_dw_st~0 2)) (.cse0 (not (= ~p_dw_i~0 1))) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse18 (not (= ~p_dw_pc~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse16 (not (= 1 ~q_write_ev~0))) (.cse7 (not (= 1 ~p_num_write~0))) (.cse17 (not (= 0 ~c_num_read~0))) (.cse10 (= is_do_write_p_triggered_~__retres1~0 0)) (.cse20 (not (= 0 ~c_dr_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or .cse9 .cse10) .cse11 .cse12) (or .cse13 .cse1 .cse0 .cse2 .cse14 .cse15 .cse16 .cse7 .cse17 .cse18 .cse10) (let ((.cse19 (+ ~c_num_read~0 1))) (or (< ~p_num_write~0 .cse19) .cse13 .cse14 .cse15 (< .cse19 ~p_num_write~0) (or .cse1 .cse0 .cse2 .cse5) (= 0 is_do_write_p_triggered_~__retres1~0))) (or (or .cse1 .cse0 .cse4 .cse12) .cse9 .cse3 .cse5 .cse7 .cse6 .cse8 .cse20 .cse11) (or .cse0 .cse1 (not (= ~q_read_ev~0 2)) .cse18 .cse14 .cse16 .cse7 .cse17 .cse10 .cse20 (not (= 0 ~c_dr_st~0))))) [2018-12-08 19:50:23,174 INFO L451 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2018-12-08 19:50:23,174 INFO L448 ceAbstractionStarter]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2018-12-08 19:50:23,174 INFO L444 ceAbstractionStarter]: At program point L186(lines 135 191) the Hoare annotation is: (let ((.cse1 (< |old(~q_read_ev~0)| 2)) (.cse6 (= ~q_free~0 1)) (.cse7 (<= 2 ~c_dr_st~0)) (.cse12 (<= 2 ~q_read_ev~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse8 (= 1 ~c_dr_pc~0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (not (= 2 ~q_write_ev~0))) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse11 (not (= |old(~q_free~0)| 0))) (.cse4 (not (= ~p_dw_pc~0 1))) (.cse16 (not (= 0 |old(~c_num_read~0)|))) (.cse17 (not (= 0 |old(~c_dr_pc~0)|))) (.cse14 (< |old(~p_dw_st~0)| 2))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1)) (.cse5 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0))) (or (< ~p_num_write~0 .cse0) .cse1 (< ~q_write_ev~0 2) (or .cse2 .cse3 (not (= 1 |old(~c_dr_pc~0)|)) .cse4) (and .cse5 .cse6 (<= 2 ~p_dw_st~0) .cse7 .cse8 .cse9 .cse10) .cse11 (< .cse0 ~p_num_write~0) (and .cse5 .cse6 .cse7 .cse12 .cse13 .cse8 .cse9 .cse10) .cse14)) (or .cse3 (not (= 0 ~p_last_write~0)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_free~0)| 1)) (and .cse6 .cse12 .cse13 .cse8 (= ~c_num_read~0 0) .cse10 (= ~c_dr_st~0 2)) .cse15 (not (= 1 ~c_dr_i~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) .cse16 .cse17 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse1 (and .cse6 .cse7 .cse12 .cse13 .cse8 (= ~c_num_read~0 1) .cse10) (not (= 0 (mod |old(~p_dw_st~0)| 2))) .cse15 (or .cse2 .cse3 .cse11 .cse4 (not (= 1 ~p_num_write~0)) .cse16) .cse17 .cse14))) [2018-12-08 19:50:23,174 INFO L448 ceAbstractionStarter]: For program point L151(lines 150 185) no Hoare annotation was computed. [2018-12-08 19:50:23,174 INFO L444 ceAbstractionStarter]: At program point L182(line 182) the Hoare annotation is: (let ((.cse1 (< |old(~q_read_ev~0)| 2)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse5 (not (= |old(~q_free~0)| 0))) (.cse4 (not (= ~p_dw_pc~0 1))) (.cse6 (< |old(~p_dw_st~0)| 2)) (.cse3 (not (= ~p_dw_i~0 1))) (.cse7 (not (= 2 ~q_write_ev~0))) (.cse8 (not (= 0 |old(~c_num_read~0)|))) (.cse9 (not (= 0 |old(~c_dr_pc~0)|)))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse0) .cse1 (< ~q_write_ev~0 2) (or .cse2 .cse3 (not (= 1 |old(~c_dr_pc~0)|)) .cse4) .cse5 (< .cse0 ~p_num_write~0) .cse6)) (or .cse1 (not (= 0 (mod |old(~p_dw_st~0)| 2))) .cse7 (or .cse2 .cse3 .cse5 .cse4 (not (= 1 ~p_num_write~0)) .cse8) .cse9 .cse6) (or .cse3 (not (= 0 ~p_last_write~0)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_free~0)| 1)) .cse7 (not (= 1 ~c_dr_i~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) .cse8 .cse9 (not (= |old(~c_last_read~0)| ~p_last_write~0))))) [2018-12-08 19:50:23,174 INFO L444 ceAbstractionStarter]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse14 (not (= 2 ~q_write_ev~0))) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse4 (not (= ~p_dw_pc~0 1))) (.cse8 (= ~q_free~0 1)) (.cse13 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse1 (< |old(~q_read_ev~0)| 2)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse12 (<= 2 ~q_read_ev~0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_num_read~0 0)) (.cse5 (not (= |old(~q_free~0)| 0))) (.cse15 (not (= 0 |old(~c_num_read~0)|))) (.cse18 (not (= 0 |old(~c_dr_pc~0)|))) (.cse11 (< |old(~p_dw_st~0)| 2))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1)) (.cse6 (<= ~c_num_read~0 ~p_num_write~0)) (.cse7 (<= ~p_num_write~0 ~c_num_read~0))) (or (< ~p_num_write~0 .cse0) .cse1 (< ~q_write_ev~0 2) (or .cse2 .cse3 (not (= 1 |old(~c_dr_pc~0)|)) .cse4) .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10) (< .cse0 ~p_num_write~0) .cse11 (and .cse6 .cse7 .cse8 .cse10 .cse12 .cse13))) (or .cse3 (not (= 0 ~p_last_write~0)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_free~0)| 1)) .cse14 (not (= 1 ~c_dr_i~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) .cse15 (and (= ~q_read_ev~0 2) .cse8 .cse13 .cse16 .cse10 .cse17) .cse18 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (or .cse14 (or .cse2 .cse3 .cse4) (and .cse8 .cse12 .cse13 (= ~c_num_read~0 1) .cse10 .cse17) .cse1 (and .cse9 (= (mod ~p_dw_st~0 2) 0) .cse12 .cse17 (and .cse16 (= ~q_free~0 0))) .cse5 (not (= 0 (mod |old(~p_dw_st~0)| 2))) (not (= 1 ~p_num_write~0)) .cse15 .cse18 .cse11))) [2018-12-08 19:50:23,174 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))) (.cse6 (not (= ~p_dw_pc~0 1)))) (let ((.cse9 (not (= 0 |old(~c_dr_pc~0)|))) (.cse12 (or .cse3 .cse4 (not (= 1 |old(~c_dr_pc~0)|)) .cse6)) (.cse0 (< |old(~q_read_ev~0)| 2)) (.cse5 (not (= |old(~q_free~0)| 0))) (.cse1 (not (= 0 (mod |old(~p_dw_st~0)| 2)))) (.cse7 (not (= 1 ~p_num_write~0))) (.cse2 (not (= 2 ~q_write_ev~0))) (.cse8 (not (= 0 |old(~c_num_read~0)|))) (.cse10 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10) (or .cse4 (not (= 0 ~p_last_write~0)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_free~0)| 1)) .cse2 (not (= 1 ~c_dr_i~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) .cse8 .cse9 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (let ((.cse11 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse11) .cse0 (< ~q_write_ev~0 2) .cse12 (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)) .cse5 (< .cse11 ~p_num_write~0) .cse10)) (or .cse12 .cse0 .cse5 .cse1 .cse7 .cse2 .cse8 (= (mod ~p_dw_st~0 2) 0) .cse10)))) [2018-12-08 19:50:23,175 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 184) no Hoare annotation was computed. [2018-12-08 19:50:23,175 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 147) no Hoare annotation was computed. [2018-12-08 19:50:23,175 INFO L444 ceAbstractionStarter]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse9 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse10 (not (= ~p_dw_i~0 1))) (.cse12 (not (= ~p_dw_pc~0 1)))) (let ((.cse5 (= ~c_num_read~0 0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse15 (not (= 0 |old(~c_dr_pc~0)|))) (.cse6 (= ~q_free~0 0)) (.cse1 (<= 2 ~p_dw_st~0)) (.cse3 (<= 2 ~q_read_ev~0)) (.cse18 (or .cse9 .cse10 (not (= 1 |old(~c_dr_pc~0)|)) .cse12)) (.cse0 (< |old(~q_read_ev~0)| 2)) (.cse11 (not (= |old(~q_free~0)| 0))) (.cse7 (not (= 0 (mod |old(~p_dw_st~0)| 2)))) (.cse13 (not (= 1 ~p_num_write~0))) (.cse8 (not (= 2 ~q_write_ev~0))) (.cse14 (not (= 0 |old(~c_num_read~0)|))) (.cse2 (= (mod ~p_dw_st~0 2) 0)) (.cse16 (< |old(~p_dw_st~0)| 2))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6)) .cse7 .cse8 (or .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16) (or .cse10 (not (= 0 ~p_last_write~0)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_free~0)| 1)) .cse8 (not (= 1 ~c_dr_i~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_num_write~0)) (and (= ~q_read_ev~0 2) (= ~q_free~0 1) (= ~p_dw_st~0 0) .cse5 (= ~c_last_read~0 ~p_last_write~0) .cse4) (not (= |old(~p_dw_st~0)| 0)) .cse14 .cse15 (not (= |old(~c_last_read~0)| ~p_last_write~0))) (let ((.cse17 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse17) .cse0 (< ~q_write_ev~0 2) .cse18 (and (= 1 ~c_dr_pc~0) .cse6 .cse1 (= |old(~c_num_read~0)| ~c_num_read~0) .cse3) .cse11 (< .cse17 ~p_num_write~0) .cse16)) (or .cse18 .cse0 .cse11 .cse7 .cse13 .cse8 .cse14 .cse2 .cse16)))) [2018-12-08 19:50:23,175 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2018-12-08 19:50:23,175 INFO L444 ceAbstractionStarter]: At program point L177(line 177) the Hoare annotation is: (let ((.cse1 (< |old(~q_read_ev~0)| 2)) (.cse2 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse5 (not (= |old(~q_free~0)| 0))) (.cse4 (not (= ~p_dw_pc~0 1))) (.cse6 (< |old(~p_dw_st~0)| 2)) (.cse3 (not (= ~p_dw_i~0 1))) (.cse7 (not (= 2 ~q_write_ev~0))) (.cse8 (not (= 0 |old(~c_num_read~0)|))) (.cse9 (not (= 0 |old(~c_dr_pc~0)|)))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse0) .cse1 (< ~q_write_ev~0 2) (or .cse2 .cse3 (not (= 1 |old(~c_dr_pc~0)|)) .cse4) .cse5 (< .cse0 ~p_num_write~0) .cse6)) (or .cse1 (not (= 0 (mod |old(~p_dw_st~0)| 2))) .cse7 (or .cse2 .cse3 .cse5 .cse4 (not (= 1 ~p_num_write~0)) .cse8) .cse9 .cse6) (or .cse3 (not (= 0 ~p_last_write~0)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_free~0)| 1)) .cse7 (not (= 1 ~c_dr_i~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) .cse8 .cse9 (not (= |old(~c_last_read~0)| ~p_last_write~0))))) [2018-12-08 19:50:23,175 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 146) no Hoare annotation was computed. [2018-12-08 19:50:23,175 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 179) no Hoare annotation was computed. [2018-12-08 19:50:23,175 INFO L444 ceAbstractionStarter]: At program point L169(line 169) the Hoare annotation is: (let ((.cse13 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse14 (not (= ~p_dw_i~0 1))) (.cse15 (not (= ~p_dw_pc~0 1)))) (let ((.cse2 (or .cse13 .cse14 (not (= 1 |old(~c_dr_pc~0)|)) .cse15)) (.cse1 (< |old(~q_read_ev~0)| 2)) (.cse4 (= ~q_free~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (<= 2 ~p_dw_st~0)) (.cse9 (= ~q_read_ev~0 1)) (.cse8 (not (= 0 (mod |old(~p_dw_st~0)| 2)))) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse10 (not (= 1 ~p_num_write~0))) (.cse7 (< |old(~p_dw_st~0)| 2)) (.cse11 (not (= 2 ~q_write_ev~0))) (.cse12 (not (= 0 |old(~c_num_read~0)|))) (.cse16 (not (= 0 |old(~c_dr_pc~0)|)))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (< ~p_num_write~0 .cse0) .cse1 (< ~q_write_ev~0 2) .cse2 .cse3 (< .cse0 ~p_num_write~0) (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse4 .cse5 .cse6 (= 1 ~c_dr_pc~0)) .cse7)) (or .cse2 .cse1 .cse3 .cse8 .cse9 .cse10 .cse11 .cse12 .cse7) (or .cse1 (and (and .cse4 .cse6) .cse5 (= ~c_dr_pc~0 0) .cse9 (= ~c_num_read~0 1)) .cse8 .cse11 (or .cse13 .cse14 .cse3 .cse15 .cse10 .cse12) .cse16 .cse7) (or .cse14 (not (= 0 ~p_last_write~0)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~q_free~0)| 1)) .cse11 (not (= 1 ~c_dr_i~0)) (not (= ~p_dw_pc~0 0)) (not (= 0 ~q_buf_0~0)) (not (= 0 ~p_num_write~0)) (not (= |old(~p_dw_st~0)| 0)) .cse12 .cse16 (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2018-12-08 19:50:23,175 INFO L448 ceAbstractionStarter]: For program point L169-1(line 169) no Hoare annotation was computed. [2018-12-08 19:50:23,175 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2018-12-08 19:50:23,175 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2018-12-08 19:50:23,175 INFO L444 ceAbstractionStarter]: At program point init_modelENTRY(lines 332 348) the Hoare annotation is: (or (= |old(~p_dw_i~0)| 1) (not (= 0 ~p_last_write~0)) (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 (= |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-08 19:50:23,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 07:50:23 BoogieIcfgContainer [2018-12-08 19:50:23,206 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 19:50:23,206 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 19:50:23,206 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 19:50:23,206 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 19:50:23,207 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:49:48" (3/4) ... [2018-12-08 19:50:23,209 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 19:50:23,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-12-08 19:50:23,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-12-08 19:50:23,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 19:50:23,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_write_p [2018-12-08 19:50:23,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-12-08 19:50:23,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2018-12-08 19:50:23,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 19:50:23,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-12-08 19:50:23,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-12-08 19:50:23,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2018-12-08 19:50:23,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-12-08 19:50:23,214 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2018-12-08 19:50:23,214 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_read_c [2018-12-08 19:50:23,214 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-12-08 19:50:23,218 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-12-08 19:50:23,218 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-08 19:50:23,234 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)) || !(1 == c_dr_i)) || (((((((((q_read_ev == 2 && p_dw_st == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && q_write_ev == 2) && p_num_write == 1) && c_dr_pc == 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) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || (((((((((((q_read_ev == 2 && p_dw_pc == 0) && q_free == 1) && 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)) || (((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(p_last_write))) || !(\old(q_read_ev) == 2)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_dr_pc)) [2018-12-08 19:50:23,235 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)) || (((((((((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) && 1 == p_dw_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(2 == \old(q_write_ev))) || (((((!(\old(q_free) == 0) || !(\old(q_read_ev) == 2)) || !(\old(p_dw_pc) == 1)) || !(1 == \old(p_num_write))) || !(\old(p_dw_st) == 2)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_st))) || (((((((((q_read_ev == 2 && p_dw_st == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && q_write_ev == 2) && p_num_write == 1) && c_dr_pc == 0)) || !(0 == \old(c_dr_pc))) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(q_write_ev) < 2) || \old(c_dr_st) < 2) || \old(p_dw_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) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && (((((((((((((((((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) || ((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && 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(q_read_ev) < 2) || \old(q_write_ev) < 2) || \old(p_num_write) < \old(c_num_read)) || \old(c_dr_st) < 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) && 1 == p_dw_pc)) || \old(c_num_read) < \old(p_num_write))) && ((((((((((((((((((((((((((((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)) || !(1 == c_dr_i)) || (((((((((q_read_ev == 2 && p_dw_st == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && q_write_ev == 2) && p_num_write == 1) && c_dr_pc == 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) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || (((((((((((q_read_ev == 2 && p_dw_pc == 0) && q_free == 1) && 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)) || ((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(p_last_write))) || !(\old(q_read_ev) == 2)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || (((((((((((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)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_dr_pc)))) && (((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(c_dr_st) < 2) || !(1 == \old(p_num_write))) || !(2 == \old(q_write_ev))) || !(1 == \old(c_num_read))) || q_write_ev == 2) || \old(p_dw_st) < 2)) && (((((((((\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)) || (((((((((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)) || ((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) + 1 < \old(p_num_write)) || \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) && 1 == p_dw_pc)) || \old(p_dw_st) < 2) [2018-12-08 19:50:23,235 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)) || !(1 == c_dr_i)) || (((((((((q_read_ev == 2 && p_dw_st == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && q_write_ev == 2) && p_num_write == 1) && c_dr_pc == 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) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || ((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(p_last_write))) || !(\old(q_read_ev) == 2)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_dr_pc))) && (((((((((((((((((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)) || (((((((((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) && 1 == p_dw_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(2 == \old(q_write_ev))) || (((((!(\old(q_free) == 0) || !(\old(q_read_ev) == 2)) || !(\old(p_dw_pc) == 1)) || !(1 == \old(p_num_write))) || !(\old(p_dw_st) == 2)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_st))) || (((((((((q_read_ev == 2 && p_dw_st == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && q_write_ev == 2) && p_num_write == 1) && c_dr_pc == 0)) || !(0 == \old(c_dr_pc)))) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(q_write_ev) < 2) || \old(c_dr_st) < 2) || \old(p_dw_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) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && (((((((((((((((((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) || ((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && 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(q_read_ev) < 2) || \old(q_write_ev) < 2) || \old(p_num_write) < \old(c_num_read)) || \old(c_dr_st) < 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) && 1 == p_dw_pc)) || \old(c_num_read) < \old(p_num_write))) && (((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(c_dr_st) < 2) || !(1 == \old(p_num_write))) || !(2 == \old(q_write_ev))) || !(1 == \old(c_num_read))) || q_write_ev == 2) || \old(p_dw_st) < 2)) && (((((((((\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)) || (((((((((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)) || ((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) + 1 < \old(p_num_write)) || \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) && 1 == p_dw_pc)) || \old(p_dw_st) < 2) [2018-12-08 19:50:23,235 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((q_read_ev < 2 || \old(q_write_ev) < 2) || (q_free == 0 && ((2 <= q_write_ev && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \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)) || (((((q_free == 0 && 2 <= q_write_ev) && \old(p_num_write) + 1 <= p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc) && p_num_write <= \old(p_num_write) + 1)) && ((((((((((((!(2 == \old(c_dr_st)) || !(0 == \old(q_buf_0))) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == c_dr_pc)) || ((((((q_free == 0 && q_write_ev == 2) && p_dw_pc == 0) && p_last_write == q_buf_0) && c_dr_st == 0) || ((((q_free == 0 && q_write_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) && 1 == p_num_write)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || q_read_ev < 2) || ((((q_free == 1 && q_write_ev == 2) && (p_dw_pc == 0 && q_buf_0 == 0) && c_dr_st == 2) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(q_free) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && ((((((((((((((!(p_dw_i == 1) || !(0 == \old(p_last_write))) || !(q_read_ev == 2)) || !(\old(q_free) == 1)) || ((((((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)) || !(2 == \old(q_write_ev))) || !(1 == c_dr_i)) || (((((p_dw_pc == 0 && p_last_write == q_buf_0) && c_dr_st == 0) && q_free == 0) && q_write_ev == 2) && p_num_write == 1)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(c_last_read == \old(p_last_write))) || !(0 == \old(c_dr_st))) [2018-12-08 19:50:23,235 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(p_dw_i == 1) || !(0 == \old(p_last_write))) || !(q_read_ev == 2)) || !(\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_dw_st == 2 && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && q_free == 0) && q_write_ev == 2) && p_num_write == 1)) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(c_last_read == \old(p_last_write))) || !(0 == \old(c_dr_st))) && (((((((((((!(2 == \old(c_dr_st)) || !(0 == \old(q_buf_0))) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == c_dr_pc)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || q_read_ev < 2) || !(\old(q_free) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write))) || (((((((2 <= p_dw_st && p_dw_st % 2 == 0) && 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))) && (((((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)) || ((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((2 <= p_dw_st && 2 <= q_write_ev) && 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)) [2018-12-08 19:50:23,235 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(2 == \old(c_dr_st)) || !(0 == \old(q_buf_0))) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == c_dr_pc)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || q_read_ev < 2) || !(\old(q_free) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write))) || ((((((c_dr_st % 2 == 0 && p_dw_pc == 0) && q_free == 1) && 2 <= c_dr_st) && p_last_write == q_buf_0) && q_write_ev == 2) && 0 == p_num_write)) && ((((((((((((((((((p_dw_pc == 0 && q_free == 1) && p_last_write == q_buf_0) && c_dr_st == 0) && q_write_ev == 2) && 0 == p_num_write) || !(p_dw_i == 1)) || !(0 == \old(p_last_write))) || !(q_read_ev == 2)) || !(\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))) || !(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) || ((((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)) || \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)) [2018-12-08 19:50:23,235 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((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)) || ((((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)) || \old(c_num_read) + 1 < p_num_write) || \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)) && (((((((((((((!(p_dw_i == 1) || !(0 == p_last_write)) || !(\old(q_read_ev) == 2)) || !(\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(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || (((((q_read_ev == 2 && q_free == 1) && p_dw_st == 0) && c_num_read == 0) && c_last_read == p_last_write) && c_dr_pc == 0)) || !(0 == \old(c_dr_pc))) || !(\old(c_last_read) == p_last_write))) && ((((((((((!(2 == q_write_ev) || (!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(p_dw_pc == 1)) || (((((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)) || \old(q_read_ev) < 2) || ((((2 <= p_dw_st && p_dw_st % 2 == 0) && 2 <= q_read_ev) && c_dr_pc == 0) && c_num_read == 0 && q_free == 0)) || !(\old(q_free) == 0)) || !(0 == \old(p_dw_st) % 2)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || \old(p_dw_st) < 2) [2018-12-08 19:50:23,236 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((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)) || ((((((p_num_write <= c_num_read && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && 1 == c_dr_pc) && c_num_read <= p_num_write) && c_last_read == p_last_write)) || !(\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)) || \old(p_dw_st) < 2) && (((((((((((((!(p_dw_i == 1) || !(0 == p_last_write)) || !(\old(q_read_ev) == 2)) || !(\old(q_free) == 1)) || ((((((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)) || !(2 == q_write_ev)) || !(1 == c_dr_i)) || !(p_dw_pc == 0)) || !(0 == q_buf_0)) || !(0 == p_num_write)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || !(\old(c_last_read) == p_last_write))) && ((((((\old(q_read_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)) || !(0 == \old(p_dw_st) % 2)) || !(2 == q_write_ev)) || ((((!(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))) || \old(p_dw_st) < 2) [2018-12-08 19:50:23,236 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\old(q_read_ev) < 2 || !(0 == \old(p_dw_st) % 2)) || !(2 == q_write_ev)) || ((((!(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))) || \old(p_dw_st) < 2) && ((((((((((((!(p_dw_i == 1) || !(0 == p_last_write)) || !(\old(q_read_ev) == 2)) || !(\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(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)) && (((((((((((!(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) == 0)) || !(0 == \old(p_dw_st) % 2)) || !(1 == p_num_write)) || !(2 == q_write_ev)) || !(0 == \old(c_num_read))) || p_dw_st % 2 == 0) || \old(p_dw_st) < 2) [2018-12-08 19:50:23,255 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_46147246-2b33-47bf-a566-99ec498ba490/bin-2019/utaipan/witness.graphml [2018-12-08 19:50:23,255 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 19:50:23,256 INFO L168 Benchmark]: Toolchain (without parser) took 35617.42 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 946.3 MB). Free memory was 953.3 MB in the beginning and 1.8 GB in the end (delta: -833.1 MB). Peak memory consumption was 113.2 MB. Max. memory is 11.5 GB. [2018-12-08 19:50:23,256 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 19:50:23,256 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.51 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 939.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-08 19:50:23,257 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.07 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 19:50:23,257 INFO L168 Benchmark]: Boogie Preprocessor took 46.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-08 19:50:23,257 INFO L168 Benchmark]: RCFGBuilder took 224.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2018-12-08 19:50:23,257 INFO L168 Benchmark]: TraceAbstraction took 35125.69 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 825.2 MB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -696.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2018-12-08 19:50:23,257 INFO L168 Benchmark]: Witness Printer took 49.39 ms. Allocated memory is still 2.0 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 19:50:23,258 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 154.51 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 939.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.07 ms. Allocated memory is still 1.0 GB. Free memory is still 939.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 224.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35125.69 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 825.2 MB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -696.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 49.39 ms. Allocated memory is still 2.0 GB. Free memory is still 1.8 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)) || !(1 == c_dr_i)) || (((((((((q_read_ev == 2 && p_dw_st == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && q_write_ev == 2) && p_num_write == 1) && c_dr_pc == 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) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || ((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(p_last_write))) || !(\old(q_read_ev) == 2)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_dr_pc))) && (((((((((((((((((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)) || (((((((((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) && 1 == p_dw_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(2 == \old(q_write_ev))) || (((((!(\old(q_free) == 0) || !(\old(q_read_ev) == 2)) || !(\old(p_dw_pc) == 1)) || !(1 == \old(p_num_write))) || !(\old(p_dw_st) == 2)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_st))) || (((((((((q_read_ev == 2 && p_dw_st == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && q_write_ev == 2) && p_num_write == 1) && c_dr_pc == 0)) || !(0 == \old(c_dr_pc)))) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(q_write_ev) < 2) || \old(c_dr_st) < 2) || \old(p_dw_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) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && (((((((((((((((((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) || ((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && 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(q_read_ev) < 2) || \old(q_write_ev) < 2) || \old(p_num_write) < \old(c_num_read)) || \old(c_dr_st) < 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) && 1 == p_dw_pc)) || \old(c_num_read) < \old(p_num_write))) && (((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(c_dr_st) < 2) || !(1 == \old(p_num_write))) || !(2 == \old(q_write_ev))) || !(1 == \old(c_num_read))) || q_write_ev == 2) || \old(p_dw_st) < 2)) && (((((((((\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)) || (((((((((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)) || ((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) + 1 < \old(p_num_write)) || \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) && 1 == p_dw_pc)) || \old(p_dw_st) < 2) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((\old(q_read_ev) < 2 || !(0 == \old(p_dw_st) % 2)) || !(2 == q_write_ev)) || ((((!(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))) || \old(p_dw_st) < 2) && ((((((((((((!(p_dw_i == 1) || !(0 == p_last_write)) || !(\old(q_read_ev) == 2)) || !(\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(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)) && (((((((((((!(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) == 0)) || !(0 == \old(p_dw_st) % 2)) || !(1 == p_num_write)) || !(2 == q_write_ev)) || !(0 == \old(c_num_read))) || p_dw_st % 2 == 0) || \old(p_dw_st) < 2) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((q_read_ev < 2 || \old(q_write_ev) < 2) || (q_free == 0 && ((2 <= q_write_ev && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \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)) || (((((q_free == 0 && 2 <= q_write_ev) && \old(p_num_write) + 1 <= p_num_write) && p_last_write == q_buf_0) && 1 == p_dw_pc) && p_num_write <= \old(p_num_write) + 1)) && ((((((((((((!(2 == \old(c_dr_st)) || !(0 == \old(q_buf_0))) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == c_dr_pc)) || ((((((q_free == 0 && q_write_ev == 2) && p_dw_pc == 0) && p_last_write == q_buf_0) && c_dr_st == 0) || ((((q_free == 0 && q_write_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc)) && 1 == p_num_write)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || q_read_ev < 2) || ((((q_free == 1 && q_write_ev == 2) && (p_dw_pc == 0 && q_buf_0 == 0) && c_dr_st == 2) && c_last_read == p_last_write) && 0 == p_num_write)) || !(\old(q_free) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && ((((((((((((((!(p_dw_i == 1) || !(0 == \old(p_last_write))) || !(q_read_ev == 2)) || !(\old(q_free) == 1)) || ((((((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)) || !(2 == \old(q_write_ev))) || !(1 == c_dr_i)) || (((((p_dw_pc == 0 && p_last_write == q_buf_0) && c_dr_st == 0) && q_free == 0) && q_write_ev == 2) && p_num_write == 1)) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(c_last_read == \old(p_last_write))) || !(0 == \old(c_dr_st))) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((((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)) || ((((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)) || \old(c_num_read) + 1 < p_num_write) || \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)) && (((((((((((((!(p_dw_i == 1) || !(0 == p_last_write)) || !(\old(q_read_ev) == 2)) || !(\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(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || (((((q_read_ev == 2 && q_free == 1) && p_dw_st == 0) && c_num_read == 0) && c_last_read == p_last_write) && c_dr_pc == 0)) || !(0 == \old(c_dr_pc))) || !(\old(c_last_read) == p_last_write))) && ((((((((((!(2 == q_write_ev) || (!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(p_dw_pc == 1)) || (((((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)) || \old(q_read_ev) < 2) || ((((2 <= p_dw_st && p_dw_st % 2 == 0) && 2 <= q_read_ev) && c_dr_pc == 0) && c_num_read == 0 && q_free == 0)) || !(\old(q_free) == 0)) || !(0 == \old(p_dw_st) % 2)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || \old(p_dw_st) < 2) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(1 == c_dr_pc)) || !(q_read_ev == 1)) || !(q_free == 1)) || !(p_dw_pc == 1)) || !(2 == q_write_ev)) || !(1 == p_num_write)) || !(1 == c_num_read)) || __retres1 == 1 || __retres1 == 0) || 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)) || c_dr_st < 2) || !(1 == q_write_ev)) || !(1 == p_num_write)) || !(0 == c_num_read)) || !(p_dw_pc == 0)) || __retres1 == 0)) && ((((((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_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || __retres1 == 1) || !(q_read_ev == 1)) || !(p_dw_pc == 1)) || !(1 == p_num_write)) || !(2 == q_write_ev)) || !(1 == c_num_read)) || !(0 == c_dr_pc)) || p_dw_st < 2)) && ((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 0)) || !(q_free == 0)) || !(1 == q_write_ev)) || !(1 == p_num_write)) || !(0 == c_num_read)) || __retres1 == 0) || !(0 == c_dr_pc)) || !(0 == c_dr_st)) - 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)) || !(1 == c_dr_i)) || (((((((((q_read_ev == 2 && p_dw_st == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && q_write_ev == 2) && p_num_write == 1) && c_dr_pc == 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) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || (((((((((((q_read_ev == 2 && p_dw_pc == 0) && q_free == 1) && 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)) || (((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(p_last_write))) || !(\old(q_read_ev) == 2)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || !(\old(p_dw_st) == 0)) || !(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)) || (((((((((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) && 1 == p_dw_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(2 == \old(q_write_ev))) || (((((!(\old(q_free) == 0) || !(\old(q_read_ev) == 2)) || !(\old(p_dw_pc) == 1)) || !(1 == \old(p_num_write))) || !(\old(p_dw_st) == 2)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_st))) || (((((((((q_read_ev == 2 && p_dw_st == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && q_write_ev == 2) && p_num_write == 1) && c_dr_pc == 0)) || !(0 == \old(c_dr_pc))) && (((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(q_write_ev) < 2) || \old(c_dr_st) < 2) || \old(p_dw_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) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && (((((((((((((((((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) || ((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && 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(q_read_ev) < 2) || \old(q_write_ev) < 2) || \old(p_num_write) < \old(c_num_read)) || \old(c_dr_st) < 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) && 1 == p_dw_pc)) || \old(c_num_read) < \old(p_num_write))) && ((((((((((((((((((((((((((((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)) || !(1 == c_dr_i)) || (((((((((q_read_ev == 2 && p_dw_st == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && c_num_read == 0) && q_free == 0) && q_write_ev == 2) && p_num_write == 1) && c_dr_pc == 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) && 1 == p_dw_pc)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || !(0 == \old(c_dr_st))) || (((((((((((q_read_ev == 2 && p_dw_pc == 0) && q_free == 1) && 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)) || ((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(p_last_write))) || !(\old(q_read_ev) == 2)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(q_buf_0))) || !(0 == \old(p_num_write))) || (((((((((((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)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_dr_pc)))) && (((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || \old(c_dr_st) < 2) || !(1 == \old(p_num_write))) || !(2 == \old(q_write_ev))) || !(1 == \old(c_num_read))) || q_write_ev == 2) || \old(p_dw_st) < 2)) && (((((((((\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)) || (((((((((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)) || ((((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && p_dw_i == 1) && 1 == c_dr_pc) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(c_num_read) + 1 < \old(p_num_write)) || \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) && 1 == p_dw_pc)) || \old(p_dw_st) < 2) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((((((!(p_dw_i == 1) || !(0 == \old(p_last_write))) || !(q_read_ev == 2)) || !(\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_dw_st == 2 && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && q_free == 0) && q_write_ev == 2) && p_num_write == 1)) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(c_last_read == \old(p_last_write))) || !(0 == \old(c_dr_st))) && (((((((((((!(2 == \old(c_dr_st)) || !(0 == \old(q_buf_0))) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == c_dr_pc)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || q_read_ev < 2) || !(\old(q_free) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write))) || (((((((2 <= p_dw_st && p_dw_st % 2 == 0) && 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))) && (((((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)) || ((((2 <= p_dw_st && 2 <= q_write_ev) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((2 <= p_dw_st && 2 <= q_write_ev) && 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)) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((((((((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)) && ((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 2)) || !(p_dw_pc == 0)) || !(q_free == 0)) || !(1 == q_write_ev)) || !(1 == p_num_write)) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(0 == c_dr_st)) || __retres1 == 0)) && ((((((((((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))) && (((((((((((!(p_dw_i == 1) || !(q_buf_0 == p_last_write)) || !(q_read_ev == 1)) || !(q_free == 1)) || !(p_dw_pc == 1)) || !(2 == q_write_ev)) || __retres1 == 0) || !(p_dw_st == 0)) || !(1 == p_num_write)) || !(1 == c_num_read)) || !(0 == c_dr_pc)) || !(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)) || c_dr_st < 2) || !(1 == q_write_ev)) || !(1 == p_num_write)) || !(0 == c_num_read)) || __retres1 == 1) || !(p_dw_pc == 0)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((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)) || ((((((p_num_write <= c_num_read && q_free == 1) && 2 <= p_dw_st) && 2 <= c_dr_st) && 1 == c_dr_pc) && c_num_read <= p_num_write) && c_last_read == p_last_write)) || !(\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)) || \old(p_dw_st) < 2) && (((((((((((((!(p_dw_i == 1) || !(0 == p_last_write)) || !(\old(q_read_ev) == 2)) || !(\old(q_free) == 1)) || ((((((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)) || !(2 == q_write_ev)) || !(1 == c_dr_i)) || !(p_dw_pc == 0)) || !(0 == q_buf_0)) || !(0 == p_num_write)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(0 == \old(c_dr_pc))) || !(\old(c_last_read) == p_last_write))) && ((((((\old(q_read_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)) || !(0 == \old(p_dw_st) % 2)) || !(2 == q_write_ev)) || ((((!(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))) || \old(p_dw_st) < 2) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: ((((((((((((((!(p_dw_i == 1) || !(0 == p_last_write)) || !(q_read_ev == 2)) || !(q_free == 1)) || !(2 == q_write_ev)) || !(1 == c_dr_i)) || !(p_dw_pc == 0)) || !(0 == q_buf_0)) || !(0 == p_num_write)) || __retres1 == 1) || !(p_dw_st == 0)) || !(0 == c_num_read)) || !(0 == c_dr_pc)) || !(c_last_read == p_last_write)) || !(0 == c_dr_st)) && ((((((((((((!(p_dw_i == 1) || __retres1 == 1) || !(0 == p_last_write)) || !(2 == q_write_ev)) || !(p_dw_pc == 0)) || !(0 == q_buf_0)) || !(1 == c_dr_pc) || !(q_free == 1)) || !(0 == p_num_write)) || q_read_ev < 2) || !(2 == c_dr_st)) || !(p_dw_st == 0)) || !(0 == c_num_read)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((!(2 == \old(c_dr_st)) || !(0 == \old(q_buf_0))) || !(p_dw_i == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(1 == c_dr_pc)) || !(2 == \old(q_write_ev))) || !(\old(p_dw_pc) == 0)) || !(0 == \old(p_num_write))) || q_read_ev < 2) || !(\old(q_free) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write))) || ((((((c_dr_st % 2 == 0 && p_dw_pc == 0) && q_free == 1) && 2 <= c_dr_st) && p_last_write == q_buf_0) && q_write_ev == 2) && 0 == p_num_write)) && ((((((((((((((((((p_dw_pc == 0 && q_free == 1) && p_last_write == q_buf_0) && c_dr_st == 0) && q_write_ev == 2) && 0 == p_num_write) || !(p_dw_i == 1)) || !(0 == \old(p_last_write))) || !(q_read_ev == 2)) || !(\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))) || !(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) || ((((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)) || \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)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 107 locations, 1 error locations. SAFE Result, 35.0s OverallTime, 18 OverallIterations, 5 TraceHistogramMax, 16.5s AutomataDifference, 0.0s DeadEndRemovalTime, 12.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 3213 SDtfs, 4667 SDslu, 12844 SDs, 0 SdLazy, 9441 SolverSat, 1617 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 2413 GetRequests, 1997 SyntacticMatches, 23 SemanticMatches, 393 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9428 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1910occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 9 AbstIntIterations, 4 AbstIntStrong, 0.9778688842331261 AbsIntWeakeningRatio, 0.7932489451476793 AbsIntAvgWeakeningVarsNumRemoved, 14.609704641350211 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 623 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 3989 PreInvPairs, 4595 NumberOfFragments, 8824 HoareAnnotationTreeSize, 3989 FomulaSimplifications, 69740 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 45 FomulaSimplificationsInter, 43202 FormulaSimplificationTreeSizeReductionInter, 11.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2871 NumberOfCodeBlocks, 2871 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3672 ConstructedInterpolants, 0 QuantifiedInterpolants, 947983 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4130 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 28 InterpolantComputations, 15 PerfectInterpolantSequences, 2228/2409 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...