./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_3_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_60dc1366-fc3b-436b-926b-88d6a3c72f37/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_60dc1366-fc3b-436b-926b-88d6a3c72f37/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_60dc1366-fc3b-436b-926b-88d6a3c72f37/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_60dc1366-fc3b-436b-926b-88d6a3c72f37/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_3_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_60dc1366-fc3b-436b-926b-88d6a3c72f37/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_60dc1366-fc3b-436b-926b-88d6a3c72f37/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 0cd94be4ea5743b633f1f4a5c7ddfdb38e323c6d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 04:24:36,884 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:24:36,885 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:24:36,892 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:24:36,892 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:24:36,893 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:24:36,893 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:24:36,895 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:24:36,896 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:24:36,896 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:24:36,897 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:24:36,897 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:24:36,898 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:24:36,898 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:24:36,899 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:24:36,899 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:24:36,900 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:24:36,901 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:24:36,902 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:24:36,903 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:24:36,904 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:24:36,905 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:24:36,907 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:24:36,907 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:24:36,907 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:24:36,908 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:24:36,908 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:24:36,909 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:24:36,909 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:24:36,910 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:24:36,910 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:24:36,911 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:24:36,911 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:24:36,911 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:24:36,912 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:24:36,912 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:24:36,912 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_60dc1366-fc3b-436b-926b-88d6a3c72f37/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 04:24:36,922 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:24:36,922 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:24:36,923 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 04:24:36,923 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 04:24:36,923 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 04:24:36,923 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 04:24:36,924 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 04:24:36,924 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 04:24:36,924 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 04:24:36,924 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 04:24:36,924 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 04:24:36,924 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 04:24:36,924 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 04:24:36,925 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:24:36,925 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 04:24:36,925 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 04:24:36,925 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 04:24:36,926 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:24:36,926 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 04:24:36,926 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 04:24:36,926 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 04:24:36,926 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 04:24:36,926 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:24:36,926 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:24:36,927 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 04:24:36,927 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:24:36,927 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:24:36,927 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 04:24:36,927 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 04:24:36,927 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 04:24:36,927 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:24:36,928 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 04:24:36,928 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 04:24:36,928 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 04:24:36,928 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 04:24:36,928 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 04:24:36,928 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 04:24:36,928 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_60dc1366-fc3b-436b-926b-88d6a3c72f37/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 -> 0cd94be4ea5743b633f1f4a5c7ddfdb38e323c6d [2018-11-23 04:24:36,949 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:24:36,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:24:36,960 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:24:36,961 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:24:36,961 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:24:36,961 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_60dc1366-fc3b-436b-926b-88d6a3c72f37/bin-2019/utaipan/../../sv-benchmarks/c/systemc/pc_sfifo_3_true-unreach-call_false-termination.cil.c [2018-11-23 04:24:36,996 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_60dc1366-fc3b-436b-926b-88d6a3c72f37/bin-2019/utaipan/data/35367946d/3363156976d44bf5995a52ad523eaf79/FLAGcfaca6f7a [2018-11-23 04:24:37,420 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:24:37,420 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_60dc1366-fc3b-436b-926b-88d6a3c72f37/sv-benchmarks/c/systemc/pc_sfifo_3_true-unreach-call_false-termination.cil.c [2018-11-23 04:24:37,426 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_60dc1366-fc3b-436b-926b-88d6a3c72f37/bin-2019/utaipan/data/35367946d/3363156976d44bf5995a52ad523eaf79/FLAGcfaca6f7a [2018-11-23 04:24:37,434 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_60dc1366-fc3b-436b-926b-88d6a3c72f37/bin-2019/utaipan/data/35367946d/3363156976d44bf5995a52ad523eaf79 [2018-11-23 04:24:37,436 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:24:37,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:24:37,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:24:37,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:24:37,440 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:24:37,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:24:37" (1/1) ... [2018-11-23 04:24:37,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f3803e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:24:37, skipping insertion in model container [2018-11-23 04:24:37,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:24:37" (1/1) ... [2018-11-23 04:24:37,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:24:37,475 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:24:37,611 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:24:37,614 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:24:37,639 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:24:37,651 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:24:37,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:24:37 WrapperNode [2018-11-23 04:24:37,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:24:37,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:24:37,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:24:37,652 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:24:37,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:24:37" (1/1) ... [2018-11-23 04:24:37,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:24:37" (1/1) ... [2018-11-23 04:24:37,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:24:37,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:24:37,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:24:37,702 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:24:37,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:24:37" (1/1) ... [2018-11-23 04:24:37,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:24:37" (1/1) ... [2018-11-23 04:24:37,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:24:37" (1/1) ... [2018-11-23 04:24:37,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:24:37" (1/1) ... [2018-11-23 04:24:37,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:24:37" (1/1) ... [2018-11-23 04:24:37,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:24:37" (1/1) ... [2018-11-23 04:24:37,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:24:37" (1/1) ... [2018-11-23 04:24:37,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:24:37,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:24:37,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:24:37,728 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:24:37,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:24:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_60dc1366-fc3b-436b-926b-88d6a3c72f37/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-11-23 04:24:37,765 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-23 04:24:37,765 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-23 04:24:37,765 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-23 04:24:37,765 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-23 04:24:37,766 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2018-11-23 04:24:37,766 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2018-11-23 04:24:37,766 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-23 04:24:37,766 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-23 04:24:37,766 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-23 04:24:37,766 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-23 04:24:37,766 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 04:24:37,766 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 04:24:37,766 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2018-11-23 04:24:37,767 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2018-11-23 04:24:37,767 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-23 04:24:37,767 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-23 04:24:37,767 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-23 04:24:37,767 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-23 04:24:37,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 04:24:37,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 04:24:37,767 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-23 04:24:37,767 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-23 04:24:37,767 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-23 04:24:37,767 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-23 04:24:37,768 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2018-11-23 04:24:37,768 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2018-11-23 04:24:37,768 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-23 04:24:37,768 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-23 04:24:37,768 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-23 04:24:37,768 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-23 04:24:37,768 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-23 04:24:37,768 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-23 04:24:37,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:24:37,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:24:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2018-11-23 04:24:37,769 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2018-11-23 04:24:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-23 04:24:37,769 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-23 04:24:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2018-11-23 04:24:37,769 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2018-11-23 04:24:37,769 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-23 04:24:37,769 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-23 04:24:38,077 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:24:38,078 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 04:24:38,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:24:38 BoogieIcfgContainer [2018-11-23 04:24:38,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:24:38,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 04:24:38,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 04:24:38,081 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 04:24:38,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:24:37" (1/3) ... [2018-11-23 04:24:38,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e473408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:24:38, skipping insertion in model container [2018-11-23 04:24:38,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:24:37" (2/3) ... [2018-11-23 04:24:38,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e473408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:24:38, skipping insertion in model container [2018-11-23 04:24:38,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:24:38" (3/3) ... [2018-11-23 04:24:38,083 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3_true-unreach-call_false-termination.cil.c [2018-11-23 04:24:38,089 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 04:24:38,093 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 04:24:38,102 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 04:24:38,122 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 04:24:38,122 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 04:24:38,122 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 04:24:38,122 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:24:38,122 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:24:38,122 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 04:24:38,123 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:24:38,123 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 04:24:38,139 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2018-11-23 04:24:38,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 04:24:38,145 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:24:38,145 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:24:38,147 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:24:38,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:24:38,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1694540215, now seen corresponding path program 1 times [2018-11-23 04:24:38,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:24:38,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:24:38,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:24:38,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:24:38,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:24:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:24:38,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:24:38,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:24:38,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 04:24:38,371 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:24:38,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 04:24:38,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:24:38,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:24:38,388 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2018-11-23 04:24:38,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:24:38,939 INFO L93 Difference]: Finished difference Result 442 states and 645 transitions. [2018-11-23 04:24:38,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:24:38,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-11-23 04:24:38,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:24:38,950 INFO L225 Difference]: With dead ends: 442 [2018-11-23 04:24:38,950 INFO L226 Difference]: Without dead ends: 296 [2018-11-23 04:24:38,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:24:38,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-11-23 04:24:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 271. [2018-11-23 04:24:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-23 04:24:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 363 transitions. [2018-11-23 04:24:39,005 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 363 transitions. Word has length 78 [2018-11-23 04:24:39,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:24:39,005 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 363 transitions. [2018-11-23 04:24:39,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 04:24:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 363 transitions. [2018-11-23 04:24:39,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 04:24:39,008 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:24:39,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:24:39,008 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:24:39,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:24:39,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1173548937, now seen corresponding path program 1 times [2018-11-23 04:24:39,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:24:39,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:24:39,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:24:39,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:24:39,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:24:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:24:39,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:24:39,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:24:39,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 04:24:39,097 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:24:39,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 04:24:39,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 04:24:39,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:24:39,099 INFO L87 Difference]: Start difference. First operand 271 states and 363 transitions. Second operand 6 states. [2018-11-23 04:24:39,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:24:39,689 INFO L93 Difference]: Finished difference Result 737 states and 1016 transitions. [2018-11-23 04:24:39,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 04:24:39,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-23 04:24:39,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:24:39,694 INFO L225 Difference]: With dead ends: 737 [2018-11-23 04:24:39,694 INFO L226 Difference]: Without dead ends: 493 [2018-11-23 04:24:39,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 04:24:39,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2018-11-23 04:24:39,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 416. [2018-11-23 04:24:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-11-23 04:24:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 562 transitions. [2018-11-23 04:24:39,736 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 562 transitions. Word has length 78 [2018-11-23 04:24:39,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:24:39,736 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 562 transitions. [2018-11-23 04:24:39,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 04:24:39,737 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 562 transitions. [2018-11-23 04:24:39,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 04:24:39,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:24:39,739 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:24:39,743 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:24:39,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:24:39,743 INFO L82 PathProgramCache]: Analyzing trace with hash 213236473, now seen corresponding path program 1 times [2018-11-23 04:24:39,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:24:39,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:24:39,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:24:39,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:24:39,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:24:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:24:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:24:39,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:24:39,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:24:39,796 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:24:39,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 04:24:39,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 04:24:39,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:24:39,797 INFO L87 Difference]: Start difference. First operand 416 states and 562 transitions. Second operand 4 states. [2018-11-23 04:24:39,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:24:39,942 INFO L93 Difference]: Finished difference Result 1147 states and 1573 transitions. [2018-11-23 04:24:39,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 04:24:39,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-23 04:24:39,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:24:39,946 INFO L225 Difference]: With dead ends: 1147 [2018-11-23 04:24:39,946 INFO L226 Difference]: Without dead ends: 774 [2018-11-23 04:24:39,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:24:39,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2018-11-23 04:24:39,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 761. [2018-11-23 04:24:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-11-23 04:24:39,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1010 transitions. [2018-11-23 04:24:39,983 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1010 transitions. Word has length 78 [2018-11-23 04:24:39,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:24:39,984 INFO L480 AbstractCegarLoop]: Abstraction has 761 states and 1010 transitions. [2018-11-23 04:24:39,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 04:24:39,984 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1010 transitions. [2018-11-23 04:24:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 04:24:39,986 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:24:39,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:24:39,986 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:24:39,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:24:39,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1824352711, now seen corresponding path program 1 times [2018-11-23 04:24:39,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:24:39,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:24:39,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:24:39,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:24:39,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:24:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:24:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:24:40,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:24:40,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 04:24:40,048 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:24:40,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 04:24:40,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 04:24:40,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:24:40,049 INFO L87 Difference]: Start difference. First operand 761 states and 1010 transitions. Second operand 6 states. [2018-11-23 04:24:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:24:40,091 INFO L93 Difference]: Finished difference Result 1519 states and 2030 transitions. [2018-11-23 04:24:40,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:24:40,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-11-23 04:24:40,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:24:40,094 INFO L225 Difference]: With dead ends: 1519 [2018-11-23 04:24:40,094 INFO L226 Difference]: Without dead ends: 801 [2018-11-23 04:24:40,096 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-11-23 04:24:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-23 04:24:40,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 781. [2018-11-23 04:24:40,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2018-11-23 04:24:40,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1028 transitions. [2018-11-23 04:24:40,127 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1028 transitions. Word has length 79 [2018-11-23 04:24:40,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:24:40,127 INFO L480 AbstractCegarLoop]: Abstraction has 781 states and 1028 transitions. [2018-11-23 04:24:40,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 04:24:40,127 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1028 transitions. [2018-11-23 04:24:40,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 04:24:40,129 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:24:40,129 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:24:40,129 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:24:40,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:24:40,129 INFO L82 PathProgramCache]: Analyzing trace with hash 2072499205, now seen corresponding path program 1 times [2018-11-23 04:24:40,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:24:40,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:24:40,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:24:40,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:24:40,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:24:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:24:40,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:24:40,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:24:40,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:24:40,177 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:24:40,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 04:24:40,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 04:24:40,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:24:40,178 INFO L87 Difference]: Start difference. First operand 781 states and 1028 transitions. Second operand 4 states. [2018-11-23 04:24:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:24:40,317 INFO L93 Difference]: Finished difference Result 2202 states and 2963 transitions. [2018-11-23 04:24:40,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 04:24:40,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-11-23 04:24:40,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:24:40,321 INFO L225 Difference]: With dead ends: 2202 [2018-11-23 04:24:40,321 INFO L226 Difference]: Without dead ends: 751 [2018-11-23 04:24:40,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:24:40,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2018-11-23 04:24:40,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 711. [2018-11-23 04:24:40,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2018-11-23 04:24:40,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 923 transitions. [2018-11-23 04:24:40,348 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 923 transitions. Word has length 79 [2018-11-23 04:24:40,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:24:40,349 INFO L480 AbstractCegarLoop]: Abstraction has 711 states and 923 transitions. [2018-11-23 04:24:40,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 04:24:40,349 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 923 transitions. [2018-11-23 04:24:40,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 04:24:40,350 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:24:40,350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:24:40,350 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:24:40,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:24:40,351 INFO L82 PathProgramCache]: Analyzing trace with hash 917896100, now seen corresponding path program 1 times [2018-11-23 04:24:40,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:24:40,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:24:40,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:24:40,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:24:40,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:24:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:24:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:24:40,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:24:40,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 04:24:40,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:24:40,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 04:24:40,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 04:24:40,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:24:40,404 INFO L87 Difference]: Start difference. First operand 711 states and 923 transitions. Second operand 6 states. [2018-11-23 04:24:40,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:24:40,438 INFO L93 Difference]: Finished difference Result 1421 states and 1856 transitions. [2018-11-23 04:24:40,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:24:40,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-23 04:24:40,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:24:40,441 INFO L225 Difference]: With dead ends: 1421 [2018-11-23 04:24:40,441 INFO L226 Difference]: Without dead ends: 753 [2018-11-23 04:24:40,442 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-11-23 04:24:40,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2018-11-23 04:24:40,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 741. [2018-11-23 04:24:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-11-23 04:24:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 953 transitions. [2018-11-23 04:24:40,471 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 953 transitions. Word has length 80 [2018-11-23 04:24:40,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:24:40,472 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 953 transitions. [2018-11-23 04:24:40,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 04:24:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 953 transitions. [2018-11-23 04:24:40,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 04:24:40,473 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:24:40,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:24:40,473 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:24:40,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:24:40,473 INFO L82 PathProgramCache]: Analyzing trace with hash 845509542, now seen corresponding path program 1 times [2018-11-23 04:24:40,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:24:40,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:24:40,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:24:40,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:24:40,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:24:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:24:40,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:24:40,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:24:40,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 04:24:40,540 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:24:40,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 04:24:40,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 04:24:40,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:24:40,540 INFO L87 Difference]: Start difference. First operand 741 states and 953 transitions. Second operand 6 states. [2018-11-23 04:24:41,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:24:41,099 INFO L93 Difference]: Finished difference Result 1593 states and 2068 transitions. [2018-11-23 04:24:41,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 04:24:41,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-23 04:24:41,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:24:41,102 INFO L225 Difference]: With dead ends: 1593 [2018-11-23 04:24:41,102 INFO L226 Difference]: Without dead ends: 897 [2018-11-23 04:24:41,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 04:24:41,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-11-23 04:24:41,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 760. [2018-11-23 04:24:41,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-11-23 04:24:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 967 transitions. [2018-11-23 04:24:41,131 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 967 transitions. Word has length 80 [2018-11-23 04:24:41,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:24:41,132 INFO L480 AbstractCegarLoop]: Abstraction has 760 states and 967 transitions. [2018-11-23 04:24:41,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 04:24:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 967 transitions. [2018-11-23 04:24:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 04:24:41,133 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:24:41,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:24:41,133 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:24:41,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:24:41,134 INFO L82 PathProgramCache]: Analyzing trace with hash 336036452, now seen corresponding path program 1 times [2018-11-23 04:24:41,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:24:41,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:24:41,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:24:41,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:24:41,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:24:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:24:41,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:24:41,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:24:41,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:24:41,169 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:24:41,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:24:41,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:24:41,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:24:41,169 INFO L87 Difference]: Start difference. First operand 760 states and 967 transitions. Second operand 3 states. [2018-11-23 04:24:41,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:24:41,221 INFO L93 Difference]: Finished difference Result 2116 states and 2780 transitions. [2018-11-23 04:24:41,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:24:41,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-11-23 04:24:41,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:24:41,226 INFO L225 Difference]: With dead ends: 2116 [2018-11-23 04:24:41,226 INFO L226 Difference]: Without dead ends: 1435 [2018-11-23 04:24:41,228 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-11-23 04:24:41,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2018-11-23 04:24:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1423. [2018-11-23 04:24:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2018-11-23 04:24:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1848 transitions. [2018-11-23 04:24:41,278 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1848 transitions. Word has length 80 [2018-11-23 04:24:41,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:24:41,278 INFO L480 AbstractCegarLoop]: Abstraction has 1423 states and 1848 transitions. [2018-11-23 04:24:41,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:24:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1848 transitions. [2018-11-23 04:24:41,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 04:24:41,280 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:24:41,280 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:24:41,280 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:24:41,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:24:41,281 INFO L82 PathProgramCache]: Analyzing trace with hash 577439203, now seen corresponding path program 1 times [2018-11-23 04:24:41,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 04:24:41,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:24:41,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:24:41,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:24:41,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 04:24:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:24:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:24:41,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:24:41,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:24:41,321 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 04:24:41,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:24:41,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:24:41,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:24:41,322 INFO L87 Difference]: Start difference. First operand 1423 states and 1848 transitions. Second operand 3 states. [2018-11-23 04:24:41,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:24:41,373 INFO L93 Difference]: Finished difference Result 2666 states and 3520 transitions. [2018-11-23 04:24:41,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:24:41,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-11-23 04:24:41,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:24:41,374 INFO L225 Difference]: With dead ends: 2666 [2018-11-23 04:24:41,374 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 04:24:41,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-23 04:24:41,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 04:24:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 04:24:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 04:24:41,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 04:24:41,380 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2018-11-23 04:24:41,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:24:41,380 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 04:24:41,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:24:41,380 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 04:24:41,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 04:24:41,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 04:24:41,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:41,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:41,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:41,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:41,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:41,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:41,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:41,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:41,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:41,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:41,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:41,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 04:24:42,793 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 13 [2018-11-23 04:24:43,068 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 13 [2018-11-23 04:24:43,525 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 11 [2018-11-23 04:24:44,674 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 13 [2018-11-23 04:24:45,064 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 21 [2018-11-23 04:24:45,165 INFO L448 ceAbstractionStarter]: For program point L385(lines 385 389) no Hoare annotation was computed. [2018-11-23 04:24:45,165 INFO L448 ceAbstractionStarter]: For program point L383(line 383) no Hoare annotation was computed. [2018-11-23 04:24:45,165 INFO L448 ceAbstractionStarter]: For program point L385-2(lines 369 393) no Hoare annotation was computed. [2018-11-23 04:24:45,165 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 381) no Hoare annotation was computed. [2018-11-23 04:24:45,166 INFO L444 ceAbstractionStarter]: At program point L375(line 375) the Hoare annotation is: (or (= 1 ~c_dr_pc~0) (= ~p_dw_st~0 0) (not (= |old(~p_dw_st~0)| 0)) (= 2 ~c_dr_pc~0)) [2018-11-23 04:24:45,166 INFO L444 ceAbstractionStarter]: At program point L377-2(lines 377 381) the Hoare annotation is: (let ((.cse0 (= 2 ~c_dr_pc~0))) (and (or (= activate_threads_~tmp~1 0) (not (= ~q_read_ev~0 2)) (= ~p_dw_pc~0 1) .cse0) (or (= 1 ~c_dr_pc~0) (= ~p_dw_st~0 0) (not (= |old(~p_dw_st~0)| 0)) .cse0))) [2018-11-23 04:24:45,166 INFO L448 ceAbstractionStarter]: For program point L375-1(line 375) no Hoare annotation was computed. [2018-11-23 04:24:45,166 INFO L444 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 369 393) the Hoare annotation is: (or (= 1 ~c_dr_pc~0) (= ~p_dw_st~0 0) (not (= |old(~p_dw_st~0)| 0)) (= 2 ~c_dr_pc~0)) [2018-11-23 04:24:45,166 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 369 393) no Hoare annotation was computed. [2018-11-23 04:24:45,166 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 277 296) no Hoare annotation was computed. [2018-11-23 04:24:45,166 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 290) no Hoare annotation was computed. [2018-11-23 04:24:45,166 INFO L448 ceAbstractionStarter]: For program point L281(lines 281 291) no Hoare annotation was computed. [2018-11-23 04:24:45,166 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 277 296) the Hoare annotation is: true [2018-11-23 04:24:45,166 INFO L451 ceAbstractionStarter]: At program point L293(lines 280 295) the Hoare annotation is: true [2018-11-23 04:24:45,166 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 277 296) no Hoare annotation was computed. [2018-11-23 04:24:45,167 INFO L444 ceAbstractionStarter]: At program point update_fifo_qENTRY(lines 22 41) the Hoare annotation is: (or (and (= |old(~q_write_ev~0)| ~q_write_ev~0) (= |old(~q_read_ev~0)| ~q_read_ev~0)) (= 2 ~c_dr_pc~0)) [2018-11-23 04:24:45,167 INFO L448 ceAbstractionStarter]: For program point L31-1(lines 31 35) no Hoare annotation was computed. [2018-11-23 04:24:45,167 INFO L448 ceAbstractionStarter]: For program point update_fifo_qEXIT(lines 22 41) no Hoare annotation was computed. [2018-11-23 04:24:45,167 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 25 40) no Hoare annotation was computed. [2018-11-23 04:24:45,167 INFO L448 ceAbstractionStarter]: For program point update_fifo_qFINAL(lines 22 41) no Hoare annotation was computed. [2018-11-23 04:24:45,167 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 315 332) no Hoare annotation was computed. [2018-11-23 04:24:45,167 INFO L448 ceAbstractionStarter]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2018-11-23 04:24:45,167 INFO L444 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 315 332) the Hoare annotation is: (or (and (= |old(~q_write_ev~0)| ~q_write_ev~0) (= |old(~q_read_ev~0)| ~q_read_ev~0)) (= 2 ~c_dr_pc~0)) [2018-11-23 04:24:45,167 INFO L448 ceAbstractionStarter]: For program point L324-1(lines 315 332) no Hoare annotation was computed. [2018-11-23 04:24:45,167 INFO L448 ceAbstractionStarter]: For program point L268-1(lines 259 276) no Hoare annotation was computed. [2018-11-23 04:24:45,167 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 259 276) no Hoare annotation was computed. [2018-11-23 04:24:45,167 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 259 276) the Hoare annotation is: (or (= 1 ~c_dr_pc~0) (= ~p_dw_st~0 0) (not (= |old(~p_dw_st~0)| 0)) (= ~p_dw_pc~0 1) (= 2 ~c_dr_pc~0)) [2018-11-23 04:24:45,167 INFO L448 ceAbstractionStarter]: For program point L263-1(lines 262 275) no Hoare annotation was computed. [2018-11-23 04:24:45,168 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 544 555) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and (not (= ~c_dr_pc~0 1)) (not (= ~p_dw_pc~0 1)) (= |old(~q_read_ev~0)| ~q_read_ev~0) (not (= 2 ~c_dr_pc~0)) (= ~p_dw_st~0 0) (= ~q_read_ev~0 ~q_write_ev~0))) [2018-11-23 04:24:45,168 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 544 555) no Hoare annotation was computed. [2018-11-23 04:24:45,168 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 544 555) no Hoare annotation was computed. [2018-11-23 04:24:45,168 INFO L448 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-23 04:24:45,168 INFO L444 ceAbstractionStarter]: At program point L549(line 549) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and (not (= ~c_dr_pc~0 1)) (not (= ~p_dw_pc~0 1)) (= |old(~q_read_ev~0)| ~q_read_ev~0) (not (= 2 ~c_dr_pc~0)) (= ~p_dw_st~0 0) (= ~q_read_ev~0 ~q_write_ev~0))) [2018-11-23 04:24:45,168 INFO L444 ceAbstractionStarter]: At program point L549-1(line 549) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~p_dw_st~0)| 0)) (and (not (= ~c_dr_pc~0 1)) (not (= ~p_dw_pc~0 1)) (not (= 2 ~c_dr_pc~0)) (= ~p_dw_st~0 0) (= ~q_read_ev~0 ~q_write_ev~0) (= 2 ~q_read_ev~0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2018-11-23 04:24:45,168 INFO L451 ceAbstractionStarter]: At program point L161(lines 138 182) the Hoare annotation is: true [2018-11-23 04:24:45,168 INFO L444 ceAbstractionStarter]: At program point do_write_pENTRY(lines 135 183) the Hoare annotation is: (let ((.cse0 (= |old(~p_dw_pc~0)| 1)) (.cse1 (= 2 ~c_dr_pc~0))) (and (or .cse0 (not (= ~p_dw_pc~0 1)) .cse1) (or (not .cse0) (= 1 ~p_dw_pc~0) .cse1))) [2018-11-23 04:24:45,168 INFO L448 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2018-11-23 04:24:45,168 INFO L444 ceAbstractionStarter]: At program point L178(lines 135 183) the Hoare annotation is: (or (= 1 ~p_dw_pc~0) (= |old(~p_dw_pc~0)| 1) (= 2 ~c_dr_pc~0)) [2018-11-23 04:24:45,168 INFO L448 ceAbstractionStarter]: For program point L145(lines 145 149) no Hoare annotation was computed. [2018-11-23 04:24:45,168 INFO L444 ceAbstractionStarter]: At program point L143(lines 138 182) the Hoare annotation is: (let ((.cse0 (= 2 ~c_dr_pc~0))) (and (or (= |old(~p_dw_pc~0)| 1) .cse0) (or (= 1 ~p_dw_pc~0) .cse0))) [2018-11-23 04:24:45,169 INFO L448 ceAbstractionStarter]: For program point do_write_pEXIT(lines 135 183) no Hoare annotation was computed. [2018-11-23 04:24:45,169 INFO L451 ceAbstractionStarter]: At program point L154-1(lines 138 182) the Hoare annotation is: true [2018-11-23 04:24:45,169 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 150) no Hoare annotation was computed. [2018-11-23 04:24:45,169 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2018-11-23 04:24:45,169 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2018-11-23 04:24:45,169 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2018-11-23 04:24:45,169 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2018-11-23 04:24:45,169 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 335 350) no Hoare annotation was computed. [2018-11-23 04:24:45,169 INFO L451 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 335 350) the Hoare annotation is: true [2018-11-23 04:24:45,169 INFO L448 ceAbstractionStarter]: For program point L339-1(lines 335 350) no Hoare annotation was computed. [2018-11-23 04:24:45,169 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 04:24:45,169 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~q_write_ev~0)| ~q_write_ev~0) (= |old(~q_read_ev~0)| ~q_read_ev~0)) [2018-11-23 04:24:45,169 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 04:24:45,169 INFO L451 ceAbstractionStarter]: At program point L462(lines 451 464) the Hoare annotation is: true [2018-11-23 04:24:45,170 INFO L448 ceAbstractionStarter]: For program point L455(lines 455 460) no Hoare annotation was computed. [2018-11-23 04:24:45,170 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 447 465) no Hoare annotation was computed. [2018-11-23 04:24:45,170 INFO L451 ceAbstractionStarter]: At program point L453(line 453) the Hoare annotation is: true [2018-11-23 04:24:45,170 INFO L448 ceAbstractionStarter]: For program point L453-1(line 453) no Hoare annotation was computed. [2018-11-23 04:24:45,170 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 447 465) the Hoare annotation is: true [2018-11-23 04:24:45,170 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 447 465) no Hoare annotation was computed. [2018-11-23 04:24:45,170 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 394 446) the Hoare annotation is: (let ((.cse6 (= |old(~p_dw_pc~0)| 1)) (.cse0 (= 1 |old(~c_dr_pc~0)|))) (let ((.cse2 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= 2 ~c_dr_pc~0))) (.cse5 (= 2 |old(~c_dr_pc~0)|)) (.cse7 (not (= ~p_dw_pc~0 1))) (.cse8 (not .cse0)) (.cse9 (= 1 ~c_dr_pc~0)) (.cse4 (= 1 ~p_dw_pc~0)) (.cse1 (not .cse6))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4) .cse5) (or .cse0 .cse6 (and .cse2 .cse7 .cse3) .cse5) (or .cse0 (= ~p_dw_st~0 0) (not (= |old(~p_dw_st~0)| 0)) .cse5) (or .cse8 (and .cse7 .cse9) .cse6) (or .cse8 (and .cse9 .cse4) .cse1)))) [2018-11-23 04:24:45,170 INFO L444 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (and (or (not (= 1 |old(~c_dr_pc~0)|)) (= 1 ~c_dr_pc~0)) (or (not (= 2 ~c_dr_pc~0)) (= 2 |old(~c_dr_pc~0)|))) [2018-11-23 04:24:45,170 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 409) no Hoare annotation was computed. [2018-11-23 04:24:45,170 INFO L448 ceAbstractionStarter]: For program point L405-1(lines 400 440) no Hoare annotation was computed. [2018-11-23 04:24:45,170 INFO L448 ceAbstractionStarter]: For program point L403(line 403) no Hoare annotation was computed. [2018-11-23 04:24:45,170 INFO L444 ceAbstractionStarter]: At program point L401(line 401) the Hoare annotation is: (and (or (not (= 1 |old(~c_dr_pc~0)|)) (= 1 ~c_dr_pc~0)) (or (not (= 2 ~c_dr_pc~0)) (= 2 |old(~c_dr_pc~0)|))) [2018-11-23 04:24:45,171 INFO L444 ceAbstractionStarter]: At program point L432(line 432) the Hoare annotation is: (and (or (not (= 1 |old(~c_dr_pc~0)|)) (= 1 ~c_dr_pc~0)) (or (not (= 2 ~c_dr_pc~0)) (= 2 |old(~c_dr_pc~0)|))) [2018-11-23 04:24:45,171 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 421) no Hoare annotation was computed. [2018-11-23 04:24:45,171 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 394 446) no Hoare annotation was computed. [2018-11-23 04:24:45,171 INFO L448 ceAbstractionStarter]: For program point L410(lines 400 440) no Hoare annotation was computed. [2018-11-23 04:24:45,171 INFO L444 ceAbstractionStarter]: At program point L441(lines 394 446) the Hoare annotation is: (and (or (not (= 1 |old(~c_dr_pc~0)|)) (= 1 ~c_dr_pc~0)) (or (not (= 2 ~c_dr_pc~0)) (= 2 |old(~c_dr_pc~0)|))) [2018-11-23 04:24:45,171 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 436) no Hoare annotation was computed. [2018-11-23 04:24:45,171 INFO L444 ceAbstractionStarter]: At program point L425(lines 400 440) the Hoare annotation is: (and (or (not (= 1 |old(~c_dr_pc~0)|)) (= 1 ~c_dr_pc~0)) (or (not (= 2 ~c_dr_pc~0)) (= 2 |old(~c_dr_pc~0)|))) [2018-11-23 04:24:45,171 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 101) no Hoare annotation was computed. [2018-11-23 04:24:45,171 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 95 104) no Hoare annotation was computed. [2018-11-23 04:24:45,171 INFO L451 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 81 109) the Hoare annotation is: true [2018-11-23 04:24:45,171 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 91) no Hoare annotation was computed. [2018-11-23 04:24:45,171 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 94) no Hoare annotation was computed. [2018-11-23 04:24:45,171 INFO L448 ceAbstractionStarter]: For program point L85-2(lines 84 108) no Hoare annotation was computed. [2018-11-23 04:24:45,171 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 81 109) no Hoare annotation was computed. [2018-11-23 04:24:45,171 INFO L444 ceAbstractionStarter]: At program point L106(lines 84 108) the Hoare annotation is: (or (= 1 ~c_dr_pc~0) (= 0 is_do_read_c_triggered_~__retres1~1) (= 2 ~c_dr_pc~0)) [2018-11-23 04:24:45,172 INFO L448 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 81 109) no Hoare annotation was computed. [2018-11-23 04:24:45,172 INFO L444 ceAbstractionStarter]: At program point L481-1(lines 478 518) the Hoare annotation is: (or (not (= 2 ~c_dr_pc~0)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2018-11-23 04:24:45,172 INFO L444 ceAbstractionStarter]: At program point L477(line 477) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 1)) (not (= ~p_dw_pc~0 1)) (not (= 2 ~c_dr_pc~0))) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2018-11-23 04:24:45,172 INFO L444 ceAbstractionStarter]: At program point L475(line 475) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 1)) (not (= ~p_dw_pc~0 1)) (not (= 2 ~c_dr_pc~0))) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2018-11-23 04:24:45,172 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 466 524) no Hoare annotation was computed. [2018-11-23 04:24:45,172 INFO L444 ceAbstractionStarter]: At program point L504(line 504) the Hoare annotation is: (or (not (= 2 ~c_dr_pc~0)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2018-11-23 04:24:45,172 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 509) no Hoare annotation was computed. [2018-11-23 04:24:45,172 INFO L444 ceAbstractionStarter]: At program point L500-1(lines 500 509) the Hoare annotation is: (or (not (= 2 ~c_dr_pc~0)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2018-11-23 04:24:45,172 INFO L448 ceAbstractionStarter]: For program point L498(line 498) no Hoare annotation was computed. [2018-11-23 04:24:45,172 INFO L444 ceAbstractionStarter]: At program point L494(line 494) the Hoare annotation is: (or (not (= 2 ~c_dr_pc~0)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2018-11-23 04:24:45,172 INFO L451 ceAbstractionStarter]: At program point L519(lines 466 524) the Hoare annotation is: true [2018-11-23 04:24:45,172 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-23 04:24:45,173 INFO L448 ceAbstractionStarter]: For program point L513(lines 513 517) no Hoare annotation was computed. [2018-11-23 04:24:45,173 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 466 524) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 1)) (not (= ~p_dw_pc~0 1)) (not (= 2 ~c_dr_pc~0)) (= ~p_dw_st~0 0) (= ~q_read_ev~0 ~q_write_ev~0) (= 2 ~q_read_ev~0)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2018-11-23 04:24:45,173 INFO L448 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-23 04:24:45,173 INFO L444 ceAbstractionStarter]: At program point L476(line 476) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 1)) (not (= ~p_dw_pc~0 1)) (not (= 2 ~c_dr_pc~0))) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2018-11-23 04:24:45,173 INFO L444 ceAbstractionStarter]: At program point L474(line 474) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 1)) (not (= ~p_dw_pc~0 1)) (not (= 2 ~c_dr_pc~0)) (= ~p_dw_st~0 0) (= ~q_read_ev~0 ~q_write_ev~0) (= 2 ~q_read_ev~0)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2018-11-23 04:24:45,173 INFO L444 ceAbstractionStarter]: At program point L474-1(line 474) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 1)) (not (= ~p_dw_pc~0 1)) (not (= 2 ~c_dr_pc~0)) (= ~p_dw_st~0 0)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2018-11-23 04:24:45,173 INFO L444 ceAbstractionStarter]: At program point L503(line 503) the Hoare annotation is: (or (not (= 2 ~c_dr_pc~0)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2018-11-23 04:24:45,173 INFO L444 ceAbstractionStarter]: At program point L503-1(line 503) the Hoare annotation is: (or (not (= 2 ~c_dr_pc~0)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2018-11-23 04:24:45,173 INFO L444 ceAbstractionStarter]: At program point L495(line 495) the Hoare annotation is: (or (not (= 2 ~c_dr_pc~0)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2018-11-23 04:24:45,173 INFO L444 ceAbstractionStarter]: At program point L493(line 493) the Hoare annotation is: (or (not (= 2 ~c_dr_pc~0)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2018-11-23 04:24:45,173 INFO L444 ceAbstractionStarter]: At program point L493-1(line 493) the Hoare annotation is: (or (not (= 2 ~c_dr_pc~0)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2018-11-23 04:24:45,174 INFO L444 ceAbstractionStarter]: At program point L489(line 489) the Hoare annotation is: (or (not (= 2 ~c_dr_pc~0)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2018-11-23 04:24:45,174 INFO L448 ceAbstractionStarter]: For program point L489-1(line 489) no Hoare annotation was computed. [2018-11-23 04:24:45,174 INFO L444 ceAbstractionStarter]: At program point L485(line 485) the Hoare annotation is: (or (not (= 2 ~c_dr_pc~0)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2018-11-23 04:24:45,174 INFO L448 ceAbstractionStarter]: For program point L485-1(line 485) no Hoare annotation was computed. [2018-11-23 04:24:45,174 INFO L444 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 297 314) the Hoare annotation is: (or (and (= |old(~q_write_ev~0)| ~q_write_ev~0) (= |old(~q_read_ev~0)| ~q_read_ev~0)) (= 2 ~c_dr_pc~0)) [2018-11-23 04:24:45,174 INFO L448 ceAbstractionStarter]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2018-11-23 04:24:45,174 INFO L448 ceAbstractionStarter]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2018-11-23 04:24:45,174 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 297 314) no Hoare annotation was computed. [2018-11-23 04:24:45,174 INFO L444 ceAbstractionStarter]: At program point update_channelsENTRY(lines 244 258) the Hoare annotation is: (or (and (= |old(~q_write_ev~0)| ~q_write_ev~0) (= |old(~q_read_ev~0)| ~q_read_ev~0)) (= 2 ~c_dr_pc~0)) [2018-11-23 04:24:45,174 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 244 258) no Hoare annotation was computed. [2018-11-23 04:24:45,174 INFO L444 ceAbstractionStarter]: At program point L250(line 250) the Hoare annotation is: (or (and (= |old(~q_write_ev~0)| ~q_write_ev~0) (= |old(~q_read_ev~0)| ~q_read_ev~0)) (= 2 ~c_dr_pc~0)) [2018-11-23 04:24:45,174 INFO L448 ceAbstractionStarter]: For program point L248(lines 244 258) no Hoare annotation was computed. [2018-11-23 04:24:45,174 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 04:24:45,175 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~c_dr_pc~0 1)) (not (= ~p_dw_pc~0 1)) (not (= 2 ~c_dr_pc~0)) (= ~p_dw_st~0 0) (= ~q_read_ev~0 ~q_write_ev~0)) [2018-11-23 04:24:45,175 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 04:24:45,175 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 04:24:45,175 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 66 75) no Hoare annotation was computed. [2018-11-23 04:24:45,175 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 62) no Hoare annotation was computed. [2018-11-23 04:24:45,175 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 65) no Hoare annotation was computed. [2018-11-23 04:24:45,175 INFO L448 ceAbstractionStarter]: For program point L56-2(lines 55 79) no Hoare annotation was computed. [2018-11-23 04:24:45,175 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 52 80) no Hoare annotation was computed. [2018-11-23 04:24:45,175 INFO L448 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 52 80) no Hoare annotation was computed. [2018-11-23 04:24:45,175 INFO L444 ceAbstractionStarter]: At program point L77(lines 55 79) the Hoare annotation is: (or (= 0 is_do_write_p_triggered_~__retres1~0) (not (= ~q_read_ev~0 2)) (= ~p_dw_pc~0 1) (= 2 ~c_dr_pc~0)) [2018-11-23 04:24:45,175 INFO L451 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 52 80) the Hoare annotation is: true [2018-11-23 04:24:45,175 INFO L448 ceAbstractionStarter]: For program point L67(lines 67 72) no Hoare annotation was computed. [2018-11-23 04:24:45,175 INFO L448 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 351 368) no Hoare annotation was computed. [2018-11-23 04:24:45,175 INFO L448 ceAbstractionStarter]: For program point L360-1(lines 351 368) no Hoare annotation was computed. [2018-11-23 04:24:45,175 INFO L451 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 351 368) the Hoare annotation is: true [2018-11-23 04:24:45,175 INFO L448 ceAbstractionStarter]: For program point L355-1(lines 354 367) no Hoare annotation was computed. [2018-11-23 04:24:45,176 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 231) no Hoare annotation was computed. [2018-11-23 04:24:45,176 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 196) no Hoare annotation was computed. [2018-11-23 04:24:45,176 INFO L448 ceAbstractionStarter]: For program point do_read_cEXIT(lines 185 243) no Hoare annotation was computed. [2018-11-23 04:24:45,176 INFO L444 ceAbstractionStarter]: At program point L238(lines 185 243) the Hoare annotation is: (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (= 1 ~c_dr_pc~0))) (and (or (not .cse0) .cse1) (or .cse0 (and (not (= ~p_dw_pc~0 1)) (= ~q_read_ev~0 ~q_write_ev~0) .cse1 (= 2 ~q_read_ev~0)) (= 2 |old(~c_dr_pc~0)|)))) [2018-11-23 04:24:45,176 INFO L444 ceAbstractionStarter]: At program point L234(line 234) the Hoare annotation is: (= 2 |old(~c_dr_pc~0)|) [2018-11-23 04:24:45,176 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-11-23 04:24:45,176 INFO L448 ceAbstractionStarter]: For program point $Ultimate##10(lines 208 218) no Hoare annotation was computed. [2018-11-23 04:24:45,176 INFO L444 ceAbstractionStarter]: At program point L234-1(lines 188 242) the Hoare annotation is: (let ((.cse0 (= 1 |old(~c_dr_pc~0)|))) (and (or .cse0 (and (not (= ~c_dr_pc~0 1)) (not (= ~p_dw_pc~0 1)) (= ~q_read_ev~0 ~q_write_ev~0) (= 2 ~q_read_ev~0)) (= 2 |old(~c_dr_pc~0)|)) (or (not .cse0) (= 1 ~c_dr_pc~0)))) [2018-11-23 04:24:45,176 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 208 218) no Hoare annotation was computed. [2018-11-23 04:24:45,176 INFO L444 ceAbstractionStarter]: At program point L193(lines 188 242) the Hoare annotation is: (= 2 |old(~c_dr_pc~0)|) [2018-11-23 04:24:45,176 INFO L448 ceAbstractionStarter]: For program point L224(lines 224 236) no Hoare annotation was computed. [2018-11-23 04:24:45,176 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 197) no Hoare annotation was computed. [2018-11-23 04:24:45,176 INFO L444 ceAbstractionStarter]: At program point do_read_cENTRY(lines 185 243) the Hoare annotation is: (let ((.cse0 (= 1 |old(~c_dr_pc~0)|))) (and (or (not .cse0) (= 1 ~c_dr_pc~0)) (or .cse0 (and (not (= 2 ~c_dr_pc~0)) (not (= ~c_dr_pc~0 1))) (= 2 |old(~c_dr_pc~0)|)))) [2018-11-23 04:24:45,176 INFO L448 ceAbstractionStarter]: For program point L208-1(lines 208 218) no Hoare annotation was computed. [2018-11-23 04:24:45,177 INFO L444 ceAbstractionStarter]: At program point L229(line 229) the Hoare annotation is: (= 2 |old(~c_dr_pc~0)|) [2018-11-23 04:24:45,177 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 525 543) no Hoare annotation was computed. [2018-11-23 04:24:45,177 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 525 543) no Hoare annotation was computed. [2018-11-23 04:24:45,177 INFO L444 ceAbstractionStarter]: At program point init_modelENTRY(lines 525 543) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= ~p_dw_st~0 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) (and (not (= ~c_dr_pc~0 1)) (not (= ~p_dw_pc~0 1)) (= |old(~q_read_ev~0)| ~q_read_ev~0) (not (= 2 ~c_dr_pc~0)) (= ~q_read_ev~0 ~q_write_ev~0))) [2018-11-23 04:24:45,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:24:45 BoogieIcfgContainer [2018-11-23 04:24:45,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 04:24:45,192 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 04:24:45,192 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 04:24:45,192 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 04:24:45,192 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:24:38" (3/4) ... [2018-11-23 04:24:45,195 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 04:24:45,200 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-23 04:24:45,200 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-23 04:24:45,200 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_fifo_q [2018-11-23 04:24:45,200 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-23 04:24:45,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-23 04:24:45,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 04:24:45,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_write_p [2018-11-23 04:24:45,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-23 04:24:45,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_time_events [2018-11-23 04:24:45,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 04:24:45,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-23 04:24:45,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-23 04:24:45,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2018-11-23 04:24:45,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-23 04:24:45,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-23 04:24:45,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-23 04:24:45,202 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2018-11-23 04:24:45,202 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_time_events [2018-11-23 04:24:45,202 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_read_c [2018-11-23 04:24:45,202 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-23 04:24:45,209 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2018-11-23 04:24:45,209 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 04:24:45,228 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(2 == c_dr_pc) || 1 == \old(c_dr_pc)) || !(\old(q_read_ev) == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || 2 == \old(c_dr_pc)) || !(\old(q_read_ev) == \old(q_write_ev)) [2018-11-23 04:24:45,229 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(1 == \old(c_dr_pc)) || 1 == c_dr_pc) && (!(2 == c_dr_pc) || 2 == \old(c_dr_pc)) [2018-11-23 04:24:45,229 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(1 == \old(c_dr_pc)) || 1 == c_dr_pc) && (!(2 == c_dr_pc) || 2 == \old(c_dr_pc)) [2018-11-23 04:24:45,230 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1 == p_dw_pc || \old(p_dw_pc) == 1) || 2 == c_dr_pc [2018-11-23 04:24:45,230 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(p_dw_pc) == 1 || 2 == c_dr_pc) && (1 == p_dw_pc || 2 == c_dr_pc) [2018-11-23 04:24:45,230 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \old(c_dr_pc) || (((!(c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == q_write_ev) && 2 == q_read_ev)) || 2 == \old(c_dr_pc)) && (!(1 == \old(c_dr_pc)) || 1 == c_dr_pc) [2018-11-23 04:24:45,231 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(1 == \old(c_dr_pc)) || 1 == c_dr_pc) && ((1 == \old(c_dr_pc) || (((!(p_dw_pc == 1) && q_read_ev == q_write_ev) && 1 == c_dr_pc) && 2 == q_read_ev)) || 2 == \old(c_dr_pc)) [2018-11-23 04:24:45,231 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: 2 == \old(c_dr_pc) [2018-11-23 04:24:45,271 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_60dc1366-fc3b-436b-926b-88d6a3c72f37/bin-2019/utaipan/witness.graphml [2018-11-23 04:24:45,271 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 04:24:45,272 INFO L168 Benchmark]: Toolchain (without parser) took 7835.23 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 416.8 MB). Free memory was 959.1 MB in the beginning and 1.4 GB in the end (delta: -412.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 11.5 GB. [2018-11-23 04:24:45,272 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:24:45,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.03 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 943.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 04:24:45,272 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 943.0 MB in the beginning and 1.2 GB in the end (delta: -217.0 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 04:24:45,273 INFO L168 Benchmark]: Boogie Preprocessor took 25.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-23 04:24:45,273 INFO L168 Benchmark]: RCFGBuilder took 350.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. [2018-11-23 04:24:45,273 INFO L168 Benchmark]: TraceAbstraction took 7112.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 255.3 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -269.6 MB). Peak memory consumption was 521.4 MB. Max. memory is 11.5 GB. [2018-11-23 04:24:45,273 INFO L168 Benchmark]: Witness Printer took 79.24 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 11.5 GB. [2018-11-23 04:24:45,275 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 214.03 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 943.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 943.0 MB in the beginning and 1.2 GB in the end (delta: -217.0 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 350.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7112.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 255.3 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -269.6 MB). Peak memory consumption was 521.4 MB. Max. memory is 11.5 GB. * Witness Printer took 79.24 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. 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: 466]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: 2 == \old(c_dr_pc) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((0 == __retres1 || !(q_read_ev == 2)) || p_dw_pc == 1) || 2 == c_dr_pc - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (!(1 == \old(c_dr_pc)) || 1 == c_dr_pc) && (!(2 == c_dr_pc) || 2 == \old(c_dr_pc)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (1 == p_dw_pc || \old(p_dw_pc) == 1) || 2 == c_dr_pc - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: ((1 == \old(c_dr_pc) || (((!(c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == q_write_ev) && 2 == q_read_ev)) || 2 == \old(c_dr_pc)) && (!(1 == \old(c_dr_pc)) || 1 == c_dr_pc) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (\old(p_dw_pc) == 1 || 2 == c_dr_pc) && (1 == p_dw_pc || 2 == c_dr_pc) - InvariantResult [Line: 478]: Loop Invariant Derived loop invariant: (((((!(2 == c_dr_pc) || 1 == \old(c_dr_pc)) || !(\old(q_read_ev) == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || 2 == \old(c_dr_pc)) || !(\old(q_read_ev) == \old(q_write_ev)) - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: (!(1 == \old(c_dr_pc)) || 1 == c_dr_pc) && (!(2 == c_dr_pc) || 2 == \old(c_dr_pc)) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (1 == c_dr_pc || 0 == __retres1) || 2 == c_dr_pc - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (!(1 == \old(c_dr_pc)) || 1 == c_dr_pc) && ((1 == \old(c_dr_pc) || (((!(p_dw_pc == 1) && q_read_ev == q_write_ev) && 1 == c_dr_pc) && 2 == q_read_ev)) || 2 == \old(c_dr_pc)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 151 locations, 1 error locations. SAFE Result, 7.0s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 3.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 2054 SDtfs, 2196 SDslu, 2591 SDs, 0 SdLazy, 2170 SolverSat, 483 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1423occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 336 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 63 LocationsWithAnnotation, 2670 PreInvPairs, 3769 NumberOfFragments, 1188 HoareAnnotationTreeSize, 2670 FomulaSimplifications, 19294 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 63 FomulaSimplificationsInter, 32819 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 713 NumberOfCodeBlocks, 713 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 704 ConstructedInterpolants, 0 QuantifiedInterpolants, 82582 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...