./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9977e37c-a1a4-4697-b21b-e51082d09ad6/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9977e37c-a1a4-4697-b21b-e51082d09ad6/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9977e37c-a1a4-4697-b21b-e51082d09ad6/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9977e37c-a1a4-4697-b21b-e51082d09ad6/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_9977e37c-a1a4-4697-b21b-e51082d09ad6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9977e37c-a1a4-4697-b21b-e51082d09ad6/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-1dbac8b [2018-10-26 21:02:39,335 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:02:39,336 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:02:39,348 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:02:39,349 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:02:39,349 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:02:39,350 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:02:39,352 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:02:39,353 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:02:39,354 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:02:39,355 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:02:39,355 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:02:39,356 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:02:39,357 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:02:39,358 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:02:39,359 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:02:39,359 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:02:39,362 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:02:39,364 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:02:39,365 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:02:39,374 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:02:39,375 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:02:39,376 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:02:39,376 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:02:39,377 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:02:39,377 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:02:39,378 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:02:39,379 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:02:39,380 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:02:39,380 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:02:39,380 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:02:39,381 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:02:39,381 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:02:39,381 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:02:39,387 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:02:39,387 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:02:39,388 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9977e37c-a1a4-4697-b21b-e51082d09ad6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 21:02:39,404 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:02:39,407 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:02:39,408 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:02:39,408 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 21:02:39,408 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 21:02:39,408 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 21:02:39,408 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 21:02:39,408 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 21:02:39,408 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 21:02:39,409 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 21:02:39,409 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 21:02:39,409 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:02:39,409 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 21:02:39,409 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:02:39,410 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 21:02:39,410 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:02:39,410 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:02:39,410 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:02:39,410 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:02:39,410 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 21:02:39,410 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:02:39,410 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:02:39,410 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:02:39,410 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:02:39,410 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:02:39,411 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:02:39,411 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:02:39,411 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:02:39,411 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:02:39,411 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:02:39,411 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 21:02:39,411 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:02:39,411 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:02:39,411 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:02:39,411 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_9977e37c-a1a4-4697-b21b-e51082d09ad6/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-10-26 21:02:39,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:02:39,449 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:02:39,451 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:02:39,453 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:02:39,453 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:02:39,454 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9977e37c-a1a4-4697-b21b-e51082d09ad6/bin-2019/utaipan/../../sv-benchmarks/c/systemc/pc_sfifo_3_true-unreach-call_false-termination.cil.c [2018-10-26 21:02:39,501 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9977e37c-a1a4-4697-b21b-e51082d09ad6/bin-2019/utaipan/data/f35cb043e/b30195aac1134690877034ad800a0d1f/FLAG3d02fb20b [2018-10-26 21:02:39,860 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:02:39,861 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9977e37c-a1a4-4697-b21b-e51082d09ad6/sv-benchmarks/c/systemc/pc_sfifo_3_true-unreach-call_false-termination.cil.c [2018-10-26 21:02:39,870 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9977e37c-a1a4-4697-b21b-e51082d09ad6/bin-2019/utaipan/data/f35cb043e/b30195aac1134690877034ad800a0d1f/FLAG3d02fb20b [2018-10-26 21:02:39,879 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9977e37c-a1a4-4697-b21b-e51082d09ad6/bin-2019/utaipan/data/f35cb043e/b30195aac1134690877034ad800a0d1f [2018-10-26 21:02:39,882 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:02:39,883 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 21:02:39,884 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:02:39,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:02:39,892 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:02:39,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:02:39" (1/1) ... [2018-10-26 21:02:39,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63143b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:02:39, skipping insertion in model container [2018-10-26 21:02:39,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:02:39" (1/1) ... [2018-10-26 21:02:39,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:02:39,927 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:02:40,083 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:02:40,087 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:02:40,120 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:02:40,134 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:02:40,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:02:40 WrapperNode [2018-10-26 21:02:40,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:02:40,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:02:40,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:02:40,135 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:02:40,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:02:40" (1/1) ... [2018-10-26 21:02:40,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:02:40" (1/1) ... [2018-10-26 21:02:40,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:02:40,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:02:40,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:02:40,158 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:02:40,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:02:40" (1/1) ... [2018-10-26 21:02:40,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:02:40" (1/1) ... [2018-10-26 21:02:40,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:02:40" (1/1) ... [2018-10-26 21:02:40,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:02:40" (1/1) ... [2018-10-26 21:02:40,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:02:40" (1/1) ... [2018-10-26 21:02:40,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:02:40" (1/1) ... [2018-10-26 21:02:40,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:02:40" (1/1) ... [2018-10-26 21:02:40,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:02:40,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:02:40,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:02:40,209 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:02:40,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:02:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9977e37c-a1a4-4697-b21b-e51082d09ad6/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-10-26 21:02:40,325 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-10-26 21:02:40,326 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-10-26 21:02:40,326 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-10-26 21:02:40,326 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-10-26 21:02:40,326 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2018-10-26 21:02:40,326 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2018-10-26 21:02:40,326 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-10-26 21:02:40,326 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-10-26 21:02:40,326 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-10-26 21:02:40,327 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-10-26 21:02:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 21:02:40,327 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 21:02:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2018-10-26 21:02:40,327 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2018-10-26 21:02:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-10-26 21:02:40,327 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-10-26 21:02:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 21:02:40,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 21:02:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-10-26 21:02:40,328 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-10-26 21:02:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-10-26 21:02:40,328 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-10-26 21:02:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-10-26 21:02:40,328 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-10-26 21:02:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2018-10-26 21:02:40,328 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2018-10-26 21:02:40,328 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-10-26 21:02:40,329 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-10-26 21:02:40,329 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-10-26 21:02:40,329 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-10-26 21:02:40,329 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-10-26 21:02:40,329 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-10-26 21:02:40,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:02:40,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:02:40,329 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2018-10-26 21:02:40,333 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2018-10-26 21:02:40,333 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-10-26 21:02:40,333 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-10-26 21:02:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2018-10-26 21:02:40,334 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2018-10-26 21:02:40,334 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-10-26 21:02:40,334 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-10-26 21:02:41,038 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:02:41,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:02:41 BoogieIcfgContainer [2018-10-26 21:02:41,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:02:41,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:02:41,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:02:41,042 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:02:41,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:02:39" (1/3) ... [2018-10-26 21:02:41,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d0a82c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:02:41, skipping insertion in model container [2018-10-26 21:02:41,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:02:40" (2/3) ... [2018-10-26 21:02:41,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d0a82c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:02:41, skipping insertion in model container [2018-10-26 21:02:41,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:02:41" (3/3) ... [2018-10-26 21:02:41,045 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3_true-unreach-call_false-termination.cil.c [2018-10-26 21:02:41,055 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:02:41,060 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:02:41,072 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:02:41,099 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:02:41,099 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:02:41,100 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:02:41,100 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:02:41,100 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:02:41,100 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:02:41,100 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:02:41,100 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:02:41,117 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2018-10-26 21:02:41,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 21:02:41,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:02:41,126 INFO L375 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-10-26 21:02:41,128 INFO L424 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:02:41,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:02:41,133 INFO L82 PathProgramCache]: Analyzing trace with hash -884600743, now seen corresponding path program 1 times [2018-10-26 21:02:41,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:02:41,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:02:41,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:02:41,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:02:41,174 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:02:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:41,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:41,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:02:41,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:02:41,542 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:02:41,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:02:41,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:02:41,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:02:41,560 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 5 states. [2018-10-26 21:02:43,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:02:43,003 INFO L93 Difference]: Finished difference Result 455 states and 658 transitions. [2018-10-26 21:02:43,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:02:43,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-10-26 21:02:43,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:02:43,016 INFO L225 Difference]: With dead ends: 455 [2018-10-26 21:02:43,016 INFO L226 Difference]: Without dead ends: 305 [2018-10-26 21:02:43,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:02:43,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-26 21:02:43,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 279. [2018-10-26 21:02:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-26 21:02:43,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 371 transitions. [2018-10-26 21:02:43,097 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 371 transitions. Word has length 80 [2018-10-26 21:02:43,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:02:43,097 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 371 transitions. [2018-10-26 21:02:43,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:02:43,097 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 371 transitions. [2018-10-26 21:02:43,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 21:02:43,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:02:43,100 INFO L375 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-10-26 21:02:43,100 INFO L424 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:02:43,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:02:43,101 INFO L82 PathProgramCache]: Analyzing trace with hash 250728217, now seen corresponding path program 1 times [2018-10-26 21:02:43,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:02:43,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:02:43,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:02:43,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:02:43,103 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:02:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:43,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:02:43,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 21:02:43,228 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:02:43,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:02:43,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:02:43,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:02:43,230 INFO L87 Difference]: Start difference. First operand 279 states and 371 transitions. Second operand 6 states. [2018-10-26 21:02:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:02:44,172 INFO L93 Difference]: Finished difference Result 759 states and 1038 transitions. [2018-10-26 21:02:44,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 21:02:44,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-10-26 21:02:44,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:02:44,178 INFO L225 Difference]: With dead ends: 759 [2018-10-26 21:02:44,178 INFO L226 Difference]: Without dead ends: 507 [2018-10-26 21:02:44,181 INFO L605 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-10-26 21:02:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-10-26 21:02:44,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 428. [2018-10-26 21:02:44,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-26 21:02:44,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 574 transitions. [2018-10-26 21:02:44,243 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 574 transitions. Word has length 80 [2018-10-26 21:02:44,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:02:44,244 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 574 transitions. [2018-10-26 21:02:44,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:02:44,244 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 574 transitions. [2018-10-26 21:02:44,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 21:02:44,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:02:44,248 INFO L375 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-10-26 21:02:44,248 INFO L424 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:02:44,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:02:44,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1511645467, now seen corresponding path program 1 times [2018-10-26 21:02:44,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:02:44,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:02:44,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:02:44,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:02:44,250 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:02:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:44,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:02:44,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:02:44,395 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:02:44,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:02:44,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:02:44,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:02:44,396 INFO L87 Difference]: Start difference. First operand 428 states and 574 transitions. Second operand 4 states. [2018-10-26 21:02:44,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:02:44,817 INFO L93 Difference]: Finished difference Result 1183 states and 1609 transitions. [2018-10-26 21:02:44,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:02:44,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-10-26 21:02:44,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:02:44,822 INFO L225 Difference]: With dead ends: 1183 [2018-10-26 21:02:44,822 INFO L226 Difference]: Without dead ends: 798 [2018-10-26 21:02:44,825 INFO L605 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-10-26 21:02:44,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2018-10-26 21:02:44,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 782. [2018-10-26 21:02:44,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-10-26 21:02:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1031 transitions. [2018-10-26 21:02:44,882 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1031 transitions. Word has length 80 [2018-10-26 21:02:44,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:02:44,882 INFO L481 AbstractCegarLoop]: Abstraction has 782 states and 1031 transitions. [2018-10-26 21:02:44,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:02:44,882 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1031 transitions. [2018-10-26 21:02:44,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-26 21:02:44,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:02:44,885 INFO L375 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-10-26 21:02:44,885 INFO L424 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:02:44,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:02:44,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1969586028, now seen corresponding path program 1 times [2018-10-26 21:02:44,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:02:44,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:02:44,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:02:44,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:02:44,888 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:02:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:44,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:02:44,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 21:02:44,984 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:02:44,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:02:44,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:02:44,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:02:44,985 INFO L87 Difference]: Start difference. First operand 782 states and 1031 transitions. Second operand 6 states. [2018-10-26 21:02:45,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:02:45,071 INFO L93 Difference]: Finished difference Result 1561 states and 2072 transitions. [2018-10-26 21:02:45,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:02:45,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-10-26 21:02:45,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:02:45,077 INFO L225 Difference]: With dead ends: 1561 [2018-10-26 21:02:45,078 INFO L226 Difference]: Without dead ends: 822 [2018-10-26 21:02:45,080 INFO L605 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-10-26 21:02:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2018-10-26 21:02:45,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 802. [2018-10-26 21:02:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2018-10-26 21:02:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1049 transitions. [2018-10-26 21:02:45,128 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1049 transitions. Word has length 81 [2018-10-26 21:02:45,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:02:45,129 INFO L481 AbstractCegarLoop]: Abstraction has 802 states and 1049 transitions. [2018-10-26 21:02:45,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:02:45,129 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1049 transitions. [2018-10-26 21:02:45,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-26 21:02:45,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:02:45,131 INFO L375 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-10-26 21:02:45,131 INFO L424 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:02:45,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:02:45,131 INFO L82 PathProgramCache]: Analyzing trace with hash 275993426, now seen corresponding path program 1 times [2018-10-26 21:02:45,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:02:45,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:02:45,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:02:45,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:02:45,132 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:02:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:45,363 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-26 21:02:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:45,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:02:45,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:02:45,498 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:02:45,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:02:45,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:02:45,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:02:45,500 INFO L87 Difference]: Start difference. First operand 802 states and 1049 transitions. Second operand 4 states. [2018-10-26 21:02:46,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:02:46,851 INFO L93 Difference]: Finished difference Result 2265 states and 3026 transitions. [2018-10-26 21:02:46,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:02:46,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-10-26 21:02:46,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:02:46,855 INFO L225 Difference]: With dead ends: 2265 [2018-10-26 21:02:46,855 INFO L226 Difference]: Without dead ends: 766 [2018-10-26 21:02:46,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:02:46,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2018-10-26 21:02:46,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 726. [2018-10-26 21:02:46,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-10-26 21:02:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 938 transitions. [2018-10-26 21:02:46,896 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 938 transitions. Word has length 81 [2018-10-26 21:02:46,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:02:46,897 INFO L481 AbstractCegarLoop]: Abstraction has 726 states and 938 transitions. [2018-10-26 21:02:46,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:02:46,897 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 938 transitions. [2018-10-26 21:02:46,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-26 21:02:46,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:02:46,899 INFO L375 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, 1] [2018-10-26 21:02:46,900 INFO L424 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:02:46,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:02:46,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1258610725, now seen corresponding path program 1 times [2018-10-26 21:02:46,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:02:46,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:02:46,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:02:46,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:02:46,901 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:02:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:47,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:02:47,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 21:02:47,017 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:02:47,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:02:47,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:02:47,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:02:47,018 INFO L87 Difference]: Start difference. First operand 726 states and 938 transitions. Second operand 6 states. [2018-10-26 21:02:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:02:47,089 INFO L93 Difference]: Finished difference Result 1451 states and 1886 transitions. [2018-10-26 21:02:47,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:02:47,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-10-26 21:02:47,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:02:47,097 INFO L225 Difference]: With dead ends: 1451 [2018-10-26 21:02:47,098 INFO L226 Difference]: Without dead ends: 768 [2018-10-26 21:02:47,100 INFO L605 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-10-26 21:02:47,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-10-26 21:02:47,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 756. [2018-10-26 21:02:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2018-10-26 21:02:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 968 transitions. [2018-10-26 21:02:47,139 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 968 transitions. Word has length 82 [2018-10-26 21:02:47,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:02:47,139 INFO L481 AbstractCegarLoop]: Abstraction has 756 states and 968 transitions. [2018-10-26 21:02:47,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:02:47,140 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 968 transitions. [2018-10-26 21:02:47,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-26 21:02:47,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:02:47,142 INFO L375 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, 1] [2018-10-26 21:02:47,142 INFO L424 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:02:47,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:02:47,142 INFO L82 PathProgramCache]: Analyzing trace with hash 414605223, now seen corresponding path program 1 times [2018-10-26 21:02:47,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:02:47,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:02:47,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:02:47,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:02:47,143 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:02:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:47,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:47,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:02:47,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 21:02:47,626 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:02:47,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:02:47,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:02:47,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:02:47,627 INFO L87 Difference]: Start difference. First operand 756 states and 968 transitions. Second operand 6 states. [2018-10-26 21:02:49,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:02:49,175 INFO L93 Difference]: Finished difference Result 1625 states and 2100 transitions. [2018-10-26 21:02:49,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 21:02:49,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-10-26 21:02:49,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:02:49,179 INFO L225 Difference]: With dead ends: 1625 [2018-10-26 21:02:49,179 INFO L226 Difference]: Without dead ends: 914 [2018-10-26 21:02:49,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-10-26 21:02:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2018-10-26 21:02:49,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 775. [2018-10-26 21:02:49,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2018-10-26 21:02:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 982 transitions. [2018-10-26 21:02:49,223 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 982 transitions. Word has length 82 [2018-10-26 21:02:49,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:02:49,224 INFO L481 AbstractCegarLoop]: Abstraction has 775 states and 982 transitions. [2018-10-26 21:02:49,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:02:49,224 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 982 transitions. [2018-10-26 21:02:49,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-26 21:02:49,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:02:49,225 INFO L375 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, 1] [2018-10-26 21:02:49,227 INFO L424 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:02:49,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:02:49,227 INFO L82 PathProgramCache]: Analyzing trace with hash 437237477, now seen corresponding path program 1 times [2018-10-26 21:02:49,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:02:49,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:02:49,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:02:49,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:02:49,228 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:02:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:49,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:02:49,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:02:49,321 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:02:49,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:02:49,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:02:49,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:02:49,322 INFO L87 Difference]: Start difference. First operand 775 states and 982 transitions. Second operand 3 states. [2018-10-26 21:02:49,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:02:49,555 INFO L93 Difference]: Finished difference Result 2158 states and 2822 transitions. [2018-10-26 21:02:49,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:02:49,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-10-26 21:02:49,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:02:49,565 INFO L225 Difference]: With dead ends: 2158 [2018-10-26 21:02:49,565 INFO L226 Difference]: Without dead ends: 1462 [2018-10-26 21:02:49,568 INFO L605 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-10-26 21:02:49,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2018-10-26 21:02:49,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1450. [2018-10-26 21:02:49,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2018-10-26 21:02:49,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 1875 transitions. [2018-10-26 21:02:49,656 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 1875 transitions. Word has length 82 [2018-10-26 21:02:49,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:02:49,656 INFO L481 AbstractCegarLoop]: Abstraction has 1450 states and 1875 transitions. [2018-10-26 21:02:49,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:02:49,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 1875 transitions. [2018-10-26 21:02:49,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-26 21:02:49,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:02:49,660 INFO L375 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, 1, 1] [2018-10-26 21:02:49,660 INFO L424 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:02:49,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:02:49,661 INFO L82 PathProgramCache]: Analyzing trace with hash -934789653, now seen corresponding path program 1 times [2018-10-26 21:02:49,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 21:02:49,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:02:49,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:02:49,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:02:49,662 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 21:02:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:02:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:02:49,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:02:49,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:02:49,752 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 21:02:49,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:02:49,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:02:49,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:02:49,753 INFO L87 Difference]: Start difference. First operand 1450 states and 1875 transitions. Second operand 3 states. [2018-10-26 21:02:49,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:02:49,894 INFO L93 Difference]: Finished difference Result 2720 states and 3574 transitions. [2018-10-26 21:02:49,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:02:49,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-10-26 21:02:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:02:49,896 INFO L225 Difference]: With dead ends: 2720 [2018-10-26 21:02:49,896 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 21:02:49,903 INFO L605 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-10-26 21:02:49,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 21:02:49,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 21:02:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 21:02:49,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 21:02:49,904 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2018-10-26 21:02:49,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:02:49,904 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 21:02:49,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:02:49,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 21:02:49,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 21:02:49,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 21:02:49,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:49,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:49,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:49,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:50,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:50,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:50,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:50,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:50,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:50,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:50,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:50,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:02:51,970 WARN L179 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2018-10-26 21:02:52,714 WARN L179 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2018-10-26 21:02:53,022 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-26 21:02:53,178 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-26 21:02:54,518 WARN L179 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 67 DAG size of output: 13 [2018-10-26 21:02:54,910 WARN L179 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 1 [2018-10-26 21:02:55,101 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 13 [2018-10-26 21:02:55,645 WARN L179 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 11 [2018-10-26 21:02:55,788 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 11 [2018-10-26 21:02:56,405 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 13 [2018-10-26 21:02:56,595 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 11 [2018-10-26 21:02:56,873 WARN L179 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 1 [2018-10-26 21:02:56,981 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 13 [2018-10-26 21:02:57,266 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 13 [2018-10-26 21:02:57,798 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 21 [2018-10-26 21:02:57,919 INFO L425 ceAbstractionStarter]: For program point L385(lines 385 389) no Hoare annotation was computed. [2018-10-26 21:02:57,919 INFO L425 ceAbstractionStarter]: For program point L383(line 383) no Hoare annotation was computed. [2018-10-26 21:02:57,919 INFO L425 ceAbstractionStarter]: For program point L385-2(lines 369 393) no Hoare annotation was computed. [2018-10-26 21:02:57,919 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 381) no Hoare annotation was computed. [2018-10-26 21:02:57,920 INFO L421 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-10-26 21:02:57,920 INFO L421 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-10-26 21:02:57,920 INFO L425 ceAbstractionStarter]: For program point L375-1(line 375) no Hoare annotation was computed. [2018-10-26 21:02:57,920 INFO L421 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-10-26 21:02:57,920 INFO L425 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 369 393) no Hoare annotation was computed. [2018-10-26 21:02:57,920 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 277 296) no Hoare annotation was computed. [2018-10-26 21:02:57,920 INFO L425 ceAbstractionStarter]: For program point L285(lines 285 290) no Hoare annotation was computed. [2018-10-26 21:02:57,920 INFO L425 ceAbstractionStarter]: For program point L281(lines 281 291) no Hoare annotation was computed. [2018-10-26 21:02:57,920 INFO L428 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 277 296) the Hoare annotation is: true [2018-10-26 21:02:57,920 INFO L428 ceAbstractionStarter]: At program point L293(lines 280 295) the Hoare annotation is: true [2018-10-26 21:02:57,921 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 277 296) no Hoare annotation was computed. [2018-10-26 21:02:57,921 INFO L421 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-10-26 21:02:57,921 INFO L425 ceAbstractionStarter]: For program point L31-1(lines 31 35) no Hoare annotation was computed. [2018-10-26 21:02:57,921 INFO L425 ceAbstractionStarter]: For program point update_fifo_qEXIT(lines 22 41) no Hoare annotation was computed. [2018-10-26 21:02:57,921 INFO L425 ceAbstractionStarter]: For program point L26-1(lines 25 40) no Hoare annotation was computed. [2018-10-26 21:02:57,921 INFO L425 ceAbstractionStarter]: For program point update_fifo_qFINAL(lines 22 41) no Hoare annotation was computed. [2018-10-26 21:02:57,921 INFO L425 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 315 332) no Hoare annotation was computed. [2018-10-26 21:02:57,921 INFO L425 ceAbstractionStarter]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2018-10-26 21:02:57,921 INFO L421 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-10-26 21:02:57,921 INFO L425 ceAbstractionStarter]: For program point L324-1(lines 315 332) no Hoare annotation was computed. [2018-10-26 21:02:57,921 INFO L425 ceAbstractionStarter]: For program point L268-1(lines 259 276) no Hoare annotation was computed. [2018-10-26 21:02:57,921 INFO L425 ceAbstractionStarter]: For program point init_threadsEXIT(lines 259 276) no Hoare annotation was computed. [2018-10-26 21:02:57,921 INFO L421 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-10-26 21:02:57,921 INFO L425 ceAbstractionStarter]: For program point L263-1(lines 262 275) no Hoare annotation was computed. [2018-10-26 21:02:57,922 INFO L421 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-10-26 21:02:57,922 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 544 555) no Hoare annotation was computed. [2018-10-26 21:02:57,922 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 544 555) no Hoare annotation was computed. [2018-10-26 21:02:57,922 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-26 21:02:57,922 INFO L421 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-10-26 21:02:57,922 INFO L421 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-10-26 21:02:57,922 INFO L428 ceAbstractionStarter]: At program point L161(lines 138 182) the Hoare annotation is: true [2018-10-26 21:02:57,922 INFO L421 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-10-26 21:02:57,922 INFO L425 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2018-10-26 21:02:57,923 INFO L421 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-10-26 21:02:57,923 INFO L425 ceAbstractionStarter]: For program point L145(lines 145 149) no Hoare annotation was computed. [2018-10-26 21:02:57,923 INFO L421 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-10-26 21:02:57,923 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 177) no Hoare annotation was computed. [2018-10-26 21:02:57,923 INFO L425 ceAbstractionStarter]: For program point do_write_pEXIT(lines 135 183) no Hoare annotation was computed. [2018-10-26 21:02:57,923 INFO L428 ceAbstractionStarter]: At program point L154-2(lines 138 182) the Hoare annotation is: true [2018-10-26 21:02:57,923 INFO L425 ceAbstractionStarter]: For program point L142(lines 142 150) no Hoare annotation was computed. [2018-10-26 21:02:57,923 INFO L425 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2018-10-26 21:02:57,923 INFO L425 ceAbstractionStarter]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2018-10-26 21:02:57,923 INFO L428 ceAbstractionStarter]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2018-10-26 21:02:57,923 INFO L425 ceAbstractionStarter]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2018-10-26 21:02:57,923 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-26 21:02:57,924 INFO L421 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-10-26 21:02:57,924 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 21:02:57,924 INFO L425 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 335 350) no Hoare annotation was computed. [2018-10-26 21:02:57,924 INFO L428 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 335 350) the Hoare annotation is: true [2018-10-26 21:02:57,924 INFO L425 ceAbstractionStarter]: For program point L339-1(lines 335 350) no Hoare annotation was computed. [2018-10-26 21:02:57,924 INFO L421 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-10-26 21:02:57,924 INFO L421 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-10-26 21:02:57,924 INFO L425 ceAbstractionStarter]: For program point L405(lines 405 409) no Hoare annotation was computed. [2018-10-26 21:02:57,924 INFO L425 ceAbstractionStarter]: For program point L405-1(lines 400 440) no Hoare annotation was computed. [2018-10-26 21:02:57,924 INFO L425 ceAbstractionStarter]: For program point L403(line 403) no Hoare annotation was computed. [2018-10-26 21:02:57,924 INFO L421 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-10-26 21:02:57,924 INFO L421 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-10-26 21:02:57,925 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 421) no Hoare annotation was computed. [2018-10-26 21:02:57,925 INFO L425 ceAbstractionStarter]: For program point evalEXIT(lines 394 446) no Hoare annotation was computed. [2018-10-26 21:02:57,925 INFO L425 ceAbstractionStarter]: For program point L410(lines 400 440) no Hoare annotation was computed. [2018-10-26 21:02:57,925 INFO L421 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-10-26 21:02:57,925 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 400 440) no Hoare annotation was computed. [2018-10-26 21:02:57,925 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 436) no Hoare annotation was computed. [2018-10-26 21:02:57,925 INFO L421 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-10-26 21:02:57,925 INFO L428 ceAbstractionStarter]: At program point L462(lines 451 464) the Hoare annotation is: true [2018-10-26 21:02:57,925 INFO L425 ceAbstractionStarter]: For program point L455(lines 455 460) no Hoare annotation was computed. [2018-10-26 21:02:57,925 INFO L425 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 447 465) no Hoare annotation was computed. [2018-10-26 21:02:57,925 INFO L428 ceAbstractionStarter]: At program point L453(line 453) the Hoare annotation is: true [2018-10-26 21:02:57,925 INFO L425 ceAbstractionStarter]: For program point L453-1(line 453) no Hoare annotation was computed. [2018-10-26 21:02:57,925 INFO L428 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 447 465) the Hoare annotation is: true [2018-10-26 21:02:57,925 INFO L425 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 447 465) no Hoare annotation was computed. [2018-10-26 21:02:57,926 INFO L425 ceAbstractionStarter]: For program point L96(lines 96 101) no Hoare annotation was computed. [2018-10-26 21:02:57,926 INFO L425 ceAbstractionStarter]: For program point L95-1(lines 95 104) no Hoare annotation was computed. [2018-10-26 21:02:57,926 INFO L428 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 81 109) the Hoare annotation is: true [2018-10-26 21:02:57,926 INFO L425 ceAbstractionStarter]: For program point L86(lines 86 91) no Hoare annotation was computed. [2018-10-26 21:02:57,926 INFO L425 ceAbstractionStarter]: For program point L85(lines 85 94) no Hoare annotation was computed. [2018-10-26 21:02:57,926 INFO L425 ceAbstractionStarter]: For program point L85-2(lines 84 108) no Hoare annotation was computed. [2018-10-26 21:02:57,926 INFO L425 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 81 109) no Hoare annotation was computed. [2018-10-26 21:02:57,926 INFO L421 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-10-26 21:02:57,926 INFO L425 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 81 109) no Hoare annotation was computed. [2018-10-26 21:02:57,926 INFO L421 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-10-26 21:02:57,926 INFO L425 ceAbstractionStarter]: For program point update_channelsEXIT(lines 244 258) no Hoare annotation was computed. [2018-10-26 21:02:57,926 INFO L421 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-10-26 21:02:57,926 INFO L425 ceAbstractionStarter]: For program point L248(lines 244 258) no Hoare annotation was computed. [2018-10-26 21:02:57,926 INFO L421 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-10-26 21:02:57,927 INFO L425 ceAbstractionStarter]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2018-10-26 21:02:57,927 INFO L425 ceAbstractionStarter]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2018-10-26 21:02:57,927 INFO L425 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 297 314) no Hoare annotation was computed. [2018-10-26 21:02:57,927 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 518) no Hoare annotation was computed. [2018-10-26 21:02:57,927 INFO L421 ceAbstractionStarter]: At program point L481-2(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-10-26 21:02:57,927 INFO L421 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-10-26 21:02:57,927 INFO L421 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-10-26 21:02:57,927 INFO L425 ceAbstractionStarter]: For program point start_simulationEXIT(lines 466 524) no Hoare annotation was computed. [2018-10-26 21:02:57,927 INFO L421 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-10-26 21:02:57,927 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 509) no Hoare annotation was computed. [2018-10-26 21:02:57,927 INFO L421 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-10-26 21:02:57,927 INFO L425 ceAbstractionStarter]: For program point L498(line 498) no Hoare annotation was computed. [2018-10-26 21:02:57,927 INFO L421 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-10-26 21:02:57,928 INFO L428 ceAbstractionStarter]: At program point L519(lines 466 524) the Hoare annotation is: true [2018-10-26 21:02:57,928 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-26 21:02:57,928 INFO L425 ceAbstractionStarter]: For program point L513(lines 513 517) no Hoare annotation was computed. [2018-10-26 21:02:57,928 INFO L421 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-10-26 21:02:57,928 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-26 21:02:57,928 INFO L421 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-10-26 21:02:57,928 INFO L421 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-10-26 21:02:57,928 INFO L421 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-10-26 21:02:57,928 INFO L421 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-10-26 21:02:57,928 INFO L421 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-10-26 21:02:57,928 INFO L421 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-10-26 21:02:57,929 INFO L421 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-10-26 21:02:57,929 INFO L421 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-10-26 21:02:57,929 INFO L421 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-10-26 21:02:57,929 INFO L425 ceAbstractionStarter]: For program point L489-1(line 489) no Hoare annotation was computed. [2018-10-26 21:02:57,929 INFO L421 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-10-26 21:02:57,929 INFO L425 ceAbstractionStarter]: For program point L485-1(line 485) no Hoare annotation was computed. [2018-10-26 21:02:57,929 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 21:02:57,929 INFO L421 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-10-26 21:02:57,929 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 21:02:57,929 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 21:02:57,929 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 66 75) no Hoare annotation was computed. [2018-10-26 21:02:57,929 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 62) no Hoare annotation was computed. [2018-10-26 21:02:57,929 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 65) no Hoare annotation was computed. [2018-10-26 21:02:57,930 INFO L425 ceAbstractionStarter]: For program point L56-2(lines 55 79) no Hoare annotation was computed. [2018-10-26 21:02:57,930 INFO L425 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 52 80) no Hoare annotation was computed. [2018-10-26 21:02:57,930 INFO L425 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 52 80) no Hoare annotation was computed. [2018-10-26 21:02:57,930 INFO L421 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-10-26 21:02:57,930 INFO L428 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 52 80) the Hoare annotation is: true [2018-10-26 21:02:57,930 INFO L425 ceAbstractionStarter]: For program point L67(lines 67 72) no Hoare annotation was computed. [2018-10-26 21:02:57,930 INFO L425 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 351 368) no Hoare annotation was computed. [2018-10-26 21:02:57,930 INFO L425 ceAbstractionStarter]: For program point L360-1(lines 351 368) no Hoare annotation was computed. [2018-10-26 21:02:57,930 INFO L428 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 351 368) the Hoare annotation is: true [2018-10-26 21:02:57,930 INFO L425 ceAbstractionStarter]: For program point L355-1(lines 354 367) no Hoare annotation was computed. [2018-10-26 21:02:57,930 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 231) no Hoare annotation was computed. [2018-10-26 21:02:57,930 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 196) no Hoare annotation was computed. [2018-10-26 21:02:57,930 INFO L425 ceAbstractionStarter]: For program point do_read_cEXIT(lines 185 243) no Hoare annotation was computed. [2018-10-26 21:02:57,931 INFO L421 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 .cse0 (and (= ~q_read_ev~0 ~q_write_ev~0) .cse1 (= 2 ~q_read_ev~0) (= 1 ~p_dw_pc~0)) (= 2 |old(~c_dr_pc~0)|)) (or (not .cse0) .cse1))) [2018-10-26 21:02:57,931 INFO L421 ceAbstractionStarter]: At program point L234(line 234) the Hoare annotation is: (= 2 |old(~c_dr_pc~0)|) [2018-10-26 21:02:57,931 INFO L425 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-10-26 21:02:57,931 INFO L425 ceAbstractionStarter]: For program point $Ultimate##10(lines 208 218) no Hoare annotation was computed. [2018-10-26 21:02:57,931 INFO L421 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)) (= ~q_read_ev~0 ~q_write_ev~0) (= 2 ~q_read_ev~0) (= 1 ~p_dw_pc~0)) (= 2 |old(~c_dr_pc~0)|)) (or (not .cse0) (= 1 ~c_dr_pc~0)))) [2018-10-26 21:02:57,931 INFO L425 ceAbstractionStarter]: For program point $Ultimate##11(lines 208 218) no Hoare annotation was computed. [2018-10-26 21:02:57,931 INFO L421 ceAbstractionStarter]: At program point L193(lines 188 242) the Hoare annotation is: (= 2 |old(~c_dr_pc~0)|) [2018-10-26 21:02:57,931 INFO L425 ceAbstractionStarter]: For program point L224(lines 224 236) no Hoare annotation was computed. [2018-10-26 21:02:57,931 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 197) no Hoare annotation was computed. [2018-10-26 21:02:57,931 INFO L421 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-10-26 21:02:57,931 INFO L425 ceAbstractionStarter]: For program point L208-1(lines 208 218) no Hoare annotation was computed. [2018-10-26 21:02:57,932 INFO L425 ceAbstractionStarter]: For program point L200(lines 200 237) no Hoare annotation was computed. [2018-10-26 21:02:57,932 INFO L421 ceAbstractionStarter]: At program point L229(line 229) the Hoare annotation is: (= 2 |old(~c_dr_pc~0)|) [2018-10-26 21:02:57,932 INFO L425 ceAbstractionStarter]: For program point init_modelFINAL(lines 525 543) no Hoare annotation was computed. [2018-10-26 21:02:57,932 INFO L425 ceAbstractionStarter]: For program point init_modelEXIT(lines 525 543) no Hoare annotation was computed. [2018-10-26 21:02:57,932 INFO L421 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-10-26 21:02:57,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:02:57 BoogieIcfgContainer [2018-10-26 21:02:57,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:02:57,954 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 21:02:57,954 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 21:02:57,954 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 21:02:57,955 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:02:41" (3/4) ... [2018-10-26 21:02:57,957 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 21:02:57,962 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-10-26 21:02:57,962 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-10-26 21:02:57,962 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_fifo_q [2018-10-26 21:02:57,962 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-10-26 21:02:57,962 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-10-26 21:02:57,962 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 21:02:57,962 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure do_write_p [2018-10-26 21:02:57,962 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-10-26 21:02:57,962 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 21:02:57,963 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_time_events [2018-10-26 21:02:57,963 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-10-26 21:02:57,963 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-10-26 21:02:57,963 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2018-10-26 21:02:57,963 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-10-26 21:02:57,963 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-10-26 21:02:57,963 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-10-26 21:02:57,963 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2018-10-26 21:02:57,963 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_time_events [2018-10-26 21:02:57,963 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure do_read_c [2018-10-26 21:02:57,964 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-10-26 21:02:57,969 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2018-10-26 21:02:57,970 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-26 21:02:57,994 WARN L220 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-10-26 21:02:57,995 WARN L220 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-10-26 21:02:57,995 WARN L220 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-10-26 21:02:57,996 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1 == p_dw_pc || \old(p_dw_pc) == 1) || 2 == c_dr_pc [2018-10-26 21:02:57,996 WARN L220 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-10-26 21:02:57,996 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \old(c_dr_pc) || (((!(c_dr_pc == 1) && q_read_ev == q_write_ev) && 2 == q_read_ev) && 1 == p_dw_pc)) || 2 == \old(c_dr_pc)) && (!(1 == \old(c_dr_pc)) || 1 == c_dr_pc) [2018-10-26 21:02:57,997 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \old(c_dr_pc) || (((q_read_ev == q_write_ev && 1 == c_dr_pc) && 2 == q_read_ev) && 1 == p_dw_pc)) || 2 == \old(c_dr_pc)) && (!(1 == \old(c_dr_pc)) || 1 == c_dr_pc) [2018-10-26 21:02:57,997 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: 2 == \old(c_dr_pc) [2018-10-26 21:02:58,051 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9977e37c-a1a4-4697-b21b-e51082d09ad6/bin-2019/utaipan/witness.graphml [2018-10-26 21:02:58,051 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 21:02:58,052 INFO L168 Benchmark]: Toolchain (without parser) took 18169.60 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 377.0 MB). Free memory was 961.3 MB in the beginning and 1.3 GB in the end (delta: -339.9 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-10-26 21:02:58,053 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:02:58,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.46 ms. Allocated memory is still 1.0 GB. Free memory was 961.3 MB in the beginning and 945.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-26 21:02:58,053 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.01 ms. Allocated memory is still 1.0 GB. Free memory is still 945.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 21:02:58,053 INFO L168 Benchmark]: Boogie Preprocessor took 50.03 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 939.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 21:02:58,055 INFO L168 Benchmark]: RCFGBuilder took 829.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.2 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -195.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-10-26 21:02:58,056 INFO L168 Benchmark]: TraceAbstraction took 16914.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -177.1 MB). Peak memory consumption was 486.5 MB. Max. memory is 11.5 GB. [2018-10-26 21:02:58,056 INFO L168 Benchmark]: Witness Printer took 97.55 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. [2018-10-26 21:02:58,058 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 250.46 ms. Allocated memory is still 1.0 GB. Free memory was 961.3 MB in the beginning and 945.2 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 23.01 ms. Allocated memory is still 1.0 GB. Free memory is still 945.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.03 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 939.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 829.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.2 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -195.6 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16914.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 199.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -177.1 MB). Peak memory consumption was 486.5 MB. Max. memory is 11.5 GB. * Witness Printer took 97.55 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 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) && q_read_ev == q_write_ev) && 2 == q_read_ev) && 1 == p_dw_pc)) || 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: 280]: Loop Invariant Derived loop invariant: 1 - 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: 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) || (((q_read_ev == q_write_ev && 1 == c_dr_pc) && 2 == q_read_ev) && 1 == p_dw_pc)) || 2 == \old(c_dr_pc)) && (!(1 == \old(c_dr_pc)) || 1 == c_dr_pc) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 155 locations, 1 error locations. SAFE Result, 16.8s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 6.3s AutomataDifference, 0.0s DeadEndRemovalTime, 8.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2096 SDtfs, 2252 SDslu, 2649 SDs, 0 SdLazy, 2187 SolverSat, 483 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1450occurred 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.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 344 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 63 LocationsWithAnnotation, 2670 PreInvPairs, 3769 NumberOfFragments, 1186 HoareAnnotationTreeSize, 2670 FomulaSimplifications, 19294 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 63 FomulaSimplificationsInter, 32819 FormulaSimplificationTreeSizeReductionInter, 6.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 731 NumberOfCodeBlocks, 731 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 722 ConstructedInterpolants, 0 QuantifiedInterpolants, 86628 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...