./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1547b617-5b10-402f-84a4-d4b059841fc5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1547b617-5b10-402f-84a4-d4b059841fc5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1547b617-5b10-402f-84a4-d4b059841fc5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1547b617-5b10-402f-84a4-d4b059841fc5/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1547b617-5b10-402f-84a4-d4b059841fc5/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1547b617-5b10-402f-84a4-d4b059841fc5/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2216fd6115b2bb44c4633e353be739828d7cac46 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 14:54:55,714 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:54:55,715 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:54:55,722 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:54:55,722 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:54:55,723 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:54:55,724 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:54:55,725 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:54:55,726 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:54:55,726 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:54:55,727 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:54:55,727 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:54:55,728 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:54:55,728 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:54:55,729 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:54:55,730 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:54:55,730 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:54:55,731 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:54:55,733 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:54:55,734 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:54:55,734 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:54:55,735 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:54:55,737 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:54:55,737 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:54:55,737 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:54:55,738 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:54:55,738 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:54:55,739 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:54:55,739 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:54:55,740 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:54:55,740 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:54:55,741 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:54:55,741 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:54:55,741 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:54:55,741 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:54:55,742 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:54:55,742 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1547b617-5b10-402f-84a4-d4b059841fc5/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 14:54:55,751 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:54:55,751 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:54:55,752 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 14:54:55,752 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 14:54:55,753 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 14:54:55,753 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 14:54:55,753 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 14:54:55,753 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:54:55,753 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:54:55,753 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:54:55,753 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:54:55,754 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:54:55,754 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 14:54:55,754 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 14:54:55,754 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 14:54:55,754 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:54:55,754 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:54:55,754 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:54:55,754 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 14:54:55,755 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:54:55,755 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:54:55,755 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 14:54:55,755 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 14:54:55,755 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:54:55,755 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:54:55,755 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 14:54:55,756 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 14:54:55,756 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 14:54:55,756 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 14:54:55,756 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 14:54:55,756 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_1547b617-5b10-402f-84a4-d4b059841fc5/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2216fd6115b2bb44c4633e353be739828d7cac46 [2018-11-18 14:54:55,779 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:54:55,788 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:54:55,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:54:55,792 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:54:55,792 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:54:55,792 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1547b617-5b10-402f-84a4-d4b059841fc5/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c [2018-11-18 14:54:55,830 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1547b617-5b10-402f-84a4-d4b059841fc5/bin-2019/uautomizer/data/8ddce6a43/12310943ea2240888faa3d2ea0673d99/FLAG5cf5182fe [2018-11-18 14:54:56,243 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:54:56,244 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1547b617-5b10-402f-84a4-d4b059841fc5/sv-benchmarks/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c [2018-11-18 14:54:56,251 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1547b617-5b10-402f-84a4-d4b059841fc5/bin-2019/uautomizer/data/8ddce6a43/12310943ea2240888faa3d2ea0673d99/FLAG5cf5182fe [2018-11-18 14:54:56,263 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1547b617-5b10-402f-84a4-d4b059841fc5/bin-2019/uautomizer/data/8ddce6a43/12310943ea2240888faa3d2ea0673d99 [2018-11-18 14:54:56,265 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:54:56,266 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 14:54:56,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:54:56,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:54:56,270 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:54:56,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:54:56" (1/1) ... [2018-11-18 14:54:56,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58ae4871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:54:56, skipping insertion in model container [2018-11-18 14:54:56,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:54:56" (1/1) ... [2018-11-18 14:54:56,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:54:56,307 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:54:56,430 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:54:56,434 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:54:56,457 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:54:56,468 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:54:56,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:54:56 WrapperNode [2018-11-18 14:54:56,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:54:56,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:54:56,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:54:56,469 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:54:56,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:54:56" (1/1) ... [2018-11-18 14:54:56,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:54:56" (1/1) ... [2018-11-18 14:54:56,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:54:56" (1/1) ... [2018-11-18 14:54:56,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:54:56" (1/1) ... [2018-11-18 14:54:56,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:54:56" (1/1) ... [2018-11-18 14:54:56,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:54:56" (1/1) ... [2018-11-18 14:54:56,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:54:56" (1/1) ... [2018-11-18 14:54:56,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:54:56,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:54:56,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:54:56,534 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:54:56,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:54:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1547b617-5b10-402f-84a4-d4b059841fc5/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:54:56,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 14:54:56,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:54:56,568 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-18 14:54:56,568 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-11-18 14:54:56,568 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-11-18 14:54:56,568 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-11-18 14:54:56,568 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-11-18 14:54:56,568 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-18 14:54:56,568 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-18 14:54:56,569 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-18 14:54:56,569 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-18 14:54:56,569 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-18 14:54:56,569 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-18 14:54:56,569 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-18 14:54:56,569 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-18 14:54:56,569 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-18 14:54:56,569 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-18 14:54:56,569 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-18 14:54:56,569 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-18 14:54:56,570 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-18 14:54:56,570 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 14:54:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 14:54:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-18 14:54:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-11-18 14:54:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-11-18 14:54:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-18 14:54:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 14:54:56,570 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-11-18 14:54:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-11-18 14:54:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-18 14:54:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-18 14:54:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-18 14:54:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-18 14:54:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-18 14:54:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-18 14:54:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-18 14:54:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-18 14:54:56,571 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-18 14:54:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-18 14:54:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-18 14:54:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-18 14:54:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 14:54:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 14:54:56,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:54:56,856 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:54:56,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:54:56 BoogieIcfgContainer [2018-11-18 14:54:56,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:54:56,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 14:54:56,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 14:54:56,860 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 14:54:56,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:54:56" (1/3) ... [2018-11-18 14:54:56,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba37086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:54:56, skipping insertion in model container [2018-11-18 14:54:56,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:54:56" (2/3) ... [2018-11-18 14:54:56,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba37086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:54:56, skipping insertion in model container [2018-11-18 14:54:56,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:54:56" (3/3) ... [2018-11-18 14:54:56,862 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01_true-unreach-call_false-termination.cil.c [2018-11-18 14:54:56,868 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 14:54:56,873 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 14:54:56,881 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 14:54:56,900 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 14:54:56,900 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 14:54:56,900 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 14:54:56,900 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 14:54:56,900 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:54:56,901 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:54:56,901 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 14:54:56,901 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:54:56,901 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 14:54:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2018-11-18 14:54:56,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 14:54:56,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:54:56,922 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] [2018-11-18 14:54:56,923 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:54:56,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:54:56,927 INFO L82 PathProgramCache]: Analyzing trace with hash -762370105, now seen corresponding path program 1 times [2018-11-18 14:54:56,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:54:56,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:54:56,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:56,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:54:56,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:54:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:54:57,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:54:57,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:54:57,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:54:57,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:54:57,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:54:57,163 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 5 states. [2018-11-18 14:54:57,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:54:57,570 INFO L93 Difference]: Finished difference Result 307 states and 433 transitions. [2018-11-18 14:54:57,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:54:57,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-11-18 14:54:57,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:54:57,580 INFO L225 Difference]: With dead ends: 307 [2018-11-18 14:54:57,580 INFO L226 Difference]: Without dead ends: 166 [2018-11-18 14:54:57,583 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:54:57,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-18 14:54:57,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 139. [2018-11-18 14:54:57,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 14:54:57,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 180 transitions. [2018-11-18 14:54:57,630 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 180 transitions. Word has length 79 [2018-11-18 14:54:57,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:54:57,630 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 180 transitions. [2018-11-18 14:54:57,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:54:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 180 transitions. [2018-11-18 14:54:57,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 14:54:57,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:54:57,633 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] [2018-11-18 14:54:57,633 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:54:57,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:54:57,633 INFO L82 PathProgramCache]: Analyzing trace with hash -328641019, now seen corresponding path program 1 times [2018-11-18 14:54:57,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:54:57,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:54:57,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:57,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:54:57,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:54:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:54:57,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:54:57,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:54:57,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:54:57,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:54:57,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:54:57,719 INFO L87 Difference]: Start difference. First operand 139 states and 180 transitions. Second operand 5 states. [2018-11-18 14:54:57,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:54:57,956 INFO L93 Difference]: Finished difference Result 286 states and 385 transitions. [2018-11-18 14:54:57,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:54:57,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-11-18 14:54:57,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:54:57,959 INFO L225 Difference]: With dead ends: 286 [2018-11-18 14:54:57,959 INFO L226 Difference]: Without dead ends: 166 [2018-11-18 14:54:57,961 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:54:57,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-18 14:54:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 139. [2018-11-18 14:54:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 14:54:57,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 179 transitions. [2018-11-18 14:54:57,978 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 179 transitions. Word has length 79 [2018-11-18 14:54:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:54:57,978 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 179 transitions. [2018-11-18 14:54:57,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:54:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 179 transitions. [2018-11-18 14:54:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 14:54:57,980 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:54:57,980 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] [2018-11-18 14:54:57,980 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:54:57,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:54:57,981 INFO L82 PathProgramCache]: Analyzing trace with hash 932276231, now seen corresponding path program 1 times [2018-11-18 14:54:57,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:54:57,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:54:57,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:57,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:54:57,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:54:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:54:58,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:54:58,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:54:58,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:54:58,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:54:58,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:54:58,057 INFO L87 Difference]: Start difference. First operand 139 states and 179 transitions. Second operand 5 states. [2018-11-18 14:54:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:54:58,248 INFO L93 Difference]: Finished difference Result 302 states and 407 transitions. [2018-11-18 14:54:58,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:54:58,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-11-18 14:54:58,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:54:58,250 INFO L225 Difference]: With dead ends: 302 [2018-11-18 14:54:58,250 INFO L226 Difference]: Without dead ends: 182 [2018-11-18 14:54:58,251 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:54:58,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-18 14:54:58,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 139. [2018-11-18 14:54:58,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 14:54:58,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 178 transitions. [2018-11-18 14:54:58,271 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 178 transitions. Word has length 79 [2018-11-18 14:54:58,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:54:58,271 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 178 transitions. [2018-11-18 14:54:58,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:54:58,272 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 178 transitions. [2018-11-18 14:54:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 14:54:58,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:54:58,273 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] [2018-11-18 14:54:58,273 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:54:58,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:54:58,274 INFO L82 PathProgramCache]: Analyzing trace with hash 972950981, now seen corresponding path program 1 times [2018-11-18 14:54:58,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:54:58,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:54:58,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:58,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:54:58,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:54:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:54:58,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:54:58,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:54:58,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:54:58,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:54:58,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:54:58,345 INFO L87 Difference]: Start difference. First operand 139 states and 178 transitions. Second operand 5 states. [2018-11-18 14:54:58,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:54:58,532 INFO L93 Difference]: Finished difference Result 295 states and 395 transitions. [2018-11-18 14:54:58,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:54:58,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-11-18 14:54:58,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:54:58,534 INFO L225 Difference]: With dead ends: 295 [2018-11-18 14:54:58,534 INFO L226 Difference]: Without dead ends: 175 [2018-11-18 14:54:58,535 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:54:58,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-18 14:54:58,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 139. [2018-11-18 14:54:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 14:54:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 177 transitions. [2018-11-18 14:54:58,549 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 177 transitions. Word has length 79 [2018-11-18 14:54:58,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:54:58,549 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 177 transitions. [2018-11-18 14:54:58,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:54:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 177 transitions. [2018-11-18 14:54:58,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 14:54:58,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:54:58,551 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] [2018-11-18 14:54:58,551 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:54:58,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:54:58,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1935230905, now seen corresponding path program 1 times [2018-11-18 14:54:58,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:54:58,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:54:58,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:58,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:54:58,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:54:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:54:58,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:54:58,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 14:54:58,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:54:58,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:54:58,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:54:58,600 INFO L87 Difference]: Start difference. First operand 139 states and 177 transitions. Second operand 6 states. [2018-11-18 14:54:58,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:54:58,621 INFO L93 Difference]: Finished difference Result 268 states and 354 transitions. [2018-11-18 14:54:58,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:54:58,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-11-18 14:54:58,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:54:58,623 INFO L225 Difference]: With dead ends: 268 [2018-11-18 14:54:58,623 INFO L226 Difference]: Without dead ends: 149 [2018-11-18 14:54:58,623 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:54:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-18 14:54:58,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2018-11-18 14:54:58,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-18 14:54:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 182 transitions. [2018-11-18 14:54:58,639 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 182 transitions. Word has length 79 [2018-11-18 14:54:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:54:58,639 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 182 transitions. [2018-11-18 14:54:58,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:54:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 182 transitions. [2018-11-18 14:54:58,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 14:54:58,641 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:54:58,641 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] [2018-11-18 14:54:58,641 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:54:58,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:54:58,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1687084411, now seen corresponding path program 1 times [2018-11-18 14:54:58,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:54:58,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:54:58,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:58,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:54:58,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:54:58,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:54:58,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:54:58,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 14:54:58,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 14:54:58,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 14:54:58,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:54:58,692 INFO L87 Difference]: Start difference. First operand 144 states and 182 transitions. Second operand 4 states. [2018-11-18 14:54:58,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:54:58,823 INFO L93 Difference]: Finished difference Result 385 states and 506 transitions. [2018-11-18 14:54:58,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:54:58,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-11-18 14:54:58,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:54:58,825 INFO L225 Difference]: With dead ends: 385 [2018-11-18 14:54:58,825 INFO L226 Difference]: Without dead ends: 261 [2018-11-18 14:54:58,826 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:54:58,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-11-18 14:54:58,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 255. [2018-11-18 14:54:58,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-18 14:54:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 321 transitions. [2018-11-18 14:54:58,844 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 321 transitions. Word has length 79 [2018-11-18 14:54:58,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:54:58,845 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 321 transitions. [2018-11-18 14:54:58,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 14:54:58,845 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 321 transitions. [2018-11-18 14:54:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 14:54:58,846 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:54:58,846 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] [2018-11-18 14:54:58,846 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:54:58,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:54:58,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1650954502, now seen corresponding path program 1 times [2018-11-18 14:54:58,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:54:58,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:54:58,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:58,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:54:58,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:54:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:54:58,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:54:58,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 14:54:58,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:54:58,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:54:58,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:54:58,887 INFO L87 Difference]: Start difference. First operand 255 states and 321 transitions. Second operand 6 states. [2018-11-18 14:54:58,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:54:58,926 INFO L93 Difference]: Finished difference Result 497 states and 643 transitions. [2018-11-18 14:54:58,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:54:58,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-11-18 14:54:58,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:54:58,928 INFO L225 Difference]: With dead ends: 497 [2018-11-18 14:54:58,929 INFO L226 Difference]: Without dead ends: 262 [2018-11-18 14:54:58,930 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:54:58,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-18 14:54:58,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-11-18 14:54:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-18 14:54:58,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 325 transitions. [2018-11-18 14:54:58,949 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 325 transitions. Word has length 79 [2018-11-18 14:54:58,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:54:58,949 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 325 transitions. [2018-11-18 14:54:58,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:54:58,949 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 325 transitions. [2018-11-18 14:54:58,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 14:54:58,950 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:54:58,950 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] [2018-11-18 14:54:58,950 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:54:58,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:54:58,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1578567944, now seen corresponding path program 1 times [2018-11-18 14:54:58,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:54:58,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:54:58,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:58,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:54:58,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:54:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:54:59,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:54:59,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:54:59,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:54:59,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:54:59,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:54:59,005 INFO L87 Difference]: Start difference. First operand 260 states and 325 transitions. Second operand 5 states. [2018-11-18 14:54:59,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:54:59,206 INFO L93 Difference]: Finished difference Result 603 states and 763 transitions. [2018-11-18 14:54:59,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:54:59,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-11-18 14:54:59,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:54:59,209 INFO L225 Difference]: With dead ends: 603 [2018-11-18 14:54:59,209 INFO L226 Difference]: Without dead ends: 364 [2018-11-18 14:54:59,210 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:54:59,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-11-18 14:54:59,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 320. [2018-11-18 14:54:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-11-18 14:54:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 389 transitions. [2018-11-18 14:54:59,228 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 389 transitions. Word has length 79 [2018-11-18 14:54:59,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:54:59,228 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 389 transitions. [2018-11-18 14:54:59,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:54:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 389 transitions. [2018-11-18 14:54:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 14:54:59,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:54:59,229 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] [2018-11-18 14:54:59,229 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:54:59,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:54:59,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1330195958, now seen corresponding path program 1 times [2018-11-18 14:54:59,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:54:59,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:54:59,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:59,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:54:59,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:54:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:54:59,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:54:59,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:54:59,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:54:59,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:54:59,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:54:59,282 INFO L87 Difference]: Start difference. First operand 320 states and 389 transitions. Second operand 5 states. [2018-11-18 14:54:59,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:54:59,432 INFO L93 Difference]: Finished difference Result 619 states and 756 transitions. [2018-11-18 14:54:59,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:54:59,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-11-18 14:54:59,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:54:59,434 INFO L225 Difference]: With dead ends: 619 [2018-11-18 14:54:59,434 INFO L226 Difference]: Without dead ends: 320 [2018-11-18 14:54:59,435 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:54:59,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-11-18 14:54:59,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-11-18 14:54:59,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-11-18 14:54:59,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 385 transitions. [2018-11-18 14:54:59,453 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 385 transitions. Word has length 79 [2018-11-18 14:54:59,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:54:59,453 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 385 transitions. [2018-11-18 14:54:59,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:54:59,453 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 385 transitions. [2018-11-18 14:54:59,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 14:54:59,454 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:54:59,454 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] [2018-11-18 14:54:59,455 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:54:59,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:54:59,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1839669048, now seen corresponding path program 1 times [2018-11-18 14:54:59,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:54:59,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:54:59,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:59,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:54:59,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:54:59,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:54:59,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:54:59,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:54:59,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:54:59,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:54:59,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:54:59,510 INFO L87 Difference]: Start difference. First operand 320 states and 385 transitions. Second operand 5 states. [2018-11-18 14:54:59,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:54:59,750 INFO L93 Difference]: Finished difference Result 731 states and 928 transitions. [2018-11-18 14:54:59,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:54:59,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-11-18 14:54:59,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:54:59,753 INFO L225 Difference]: With dead ends: 731 [2018-11-18 14:54:59,753 INFO L226 Difference]: Without dead ends: 432 [2018-11-18 14:54:59,754 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:54:59,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-11-18 14:54:59,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 367. [2018-11-18 14:54:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-11-18 14:54:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 433 transitions. [2018-11-18 14:54:59,775 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 433 transitions. Word has length 79 [2018-11-18 14:54:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:54:59,775 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 433 transitions. [2018-11-18 14:54:59,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:54:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 433 transitions. [2018-11-18 14:54:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 14:54:59,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:54:59,776 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] [2018-11-18 14:54:59,777 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:54:59,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:54:59,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1777629434, now seen corresponding path program 1 times [2018-11-18 14:54:59,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:54:59,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:54:59,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:59,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:54:59,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:54:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 14:54:59,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:54:59,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 14:54:59,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:54:59,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:54:59,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:54:59,804 INFO L87 Difference]: Start difference. First operand 367 states and 433 transitions. Second operand 3 states. [2018-11-18 14:54:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:54:59,851 INFO L93 Difference]: Finished difference Result 1015 states and 1251 transitions. [2018-11-18 14:54:59,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:54:59,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-11-18 14:54:59,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:54:59,854 INFO L225 Difference]: With dead ends: 1015 [2018-11-18 14:54:59,854 INFO L226 Difference]: Without dead ends: 668 [2018-11-18 14:54:59,855 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:54:59,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-11-18 14:54:59,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 666. [2018-11-18 14:54:59,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-11-18 14:54:59,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 797 transitions. [2018-11-18 14:54:59,887 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 797 transitions. Word has length 79 [2018-11-18 14:54:59,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:54:59,887 INFO L480 AbstractCegarLoop]: Abstraction has 666 states and 797 transitions. [2018-11-18 14:54:59,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:54:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 797 transitions. [2018-11-18 14:54:59,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-18 14:54:59,889 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:54:59,890 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:54:59,890 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:54:59,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:54:59,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1914530701, now seen corresponding path program 1 times [2018-11-18 14:54:59,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:54:59,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:54:59,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:59,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:54:59,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:54:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:54:59,940 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 14:54:59,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:54:59,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 14:54:59,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 14:54:59,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 14:54:59,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:54:59,941 INFO L87 Difference]: Start difference. First operand 666 states and 797 transitions. Second operand 4 states. [2018-11-18 14:55:00,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:55:00,100 INFO L93 Difference]: Finished difference Result 1855 states and 2269 transitions. [2018-11-18 14:55:00,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:55:00,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-11-18 14:55:00,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:55:00,104 INFO L225 Difference]: With dead ends: 1855 [2018-11-18 14:55:00,104 INFO L226 Difference]: Without dead ends: 969 [2018-11-18 14:55:00,106 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:55:00,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2018-11-18 14:55:00,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 940. [2018-11-18 14:55:00,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2018-11-18 14:55:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1104 transitions. [2018-11-18 14:55:00,150 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1104 transitions. Word has length 125 [2018-11-18 14:55:00,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:55:00,150 INFO L480 AbstractCegarLoop]: Abstraction has 940 states and 1104 transitions. [2018-11-18 14:55:00,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 14:55:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1104 transitions. [2018-11-18 14:55:00,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-18 14:55:00,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:55:00,153 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:55:00,153 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:55:00,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:55:00,153 INFO L82 PathProgramCache]: Analyzing trace with hash -805869112, now seen corresponding path program 1 times [2018-11-18 14:55:00,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:55:00,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:55:00,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:55:00,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:55:00,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:55:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:55:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 33 proven. 26 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-11-18 14:55:00,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:55:00,240 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1547b617-5b10-402f-84a4-d4b059841fc5/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:55:00,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:55:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:55:00,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:55:00,442 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-18 14:55:00,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:55:00,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2018-11-18 14:55:00,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 14:55:00,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 14:55:00,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-18 14:55:00,461 INFO L87 Difference]: Start difference. First operand 940 states and 1104 transitions. Second operand 12 states. [2018-11-18 14:55:00,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:55:00,575 INFO L93 Difference]: Finished difference Result 1817 states and 2157 transitions. [2018-11-18 14:55:00,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 14:55:00,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 265 [2018-11-18 14:55:00,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:55:00,579 INFO L225 Difference]: With dead ends: 1817 [2018-11-18 14:55:00,579 INFO L226 Difference]: Without dead ends: 898 [2018-11-18 14:55:00,580 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 263 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-11-18 14:55:00,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2018-11-18 14:55:00,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 850. [2018-11-18 14:55:00,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-11-18 14:55:00,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 982 transitions. [2018-11-18 14:55:00,624 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 982 transitions. Word has length 265 [2018-11-18 14:55:00,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:55:00,625 INFO L480 AbstractCegarLoop]: Abstraction has 850 states and 982 transitions. [2018-11-18 14:55:00,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 14:55:00,625 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 982 transitions. [2018-11-18 14:55:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-18 14:55:00,627 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:55:00,627 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:55:00,628 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:55:00,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:55:00,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1937848437, now seen corresponding path program 1 times [2018-11-18 14:55:00,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:55:00,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:55:00,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:55:00,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:55:00,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:55:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:55:00,737 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-18 14:55:00,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:55:00,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 14:55:00,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:55:00,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:55:00,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:55:00,738 INFO L87 Difference]: Start difference. First operand 850 states and 982 transitions. Second operand 6 states. [2018-11-18 14:55:01,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:55:01,279 INFO L93 Difference]: Finished difference Result 2445 states and 2927 transitions. [2018-11-18 14:55:01,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 14:55:01,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2018-11-18 14:55:01,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:55:01,286 INFO L225 Difference]: With dead ends: 2445 [2018-11-18 14:55:01,286 INFO L226 Difference]: Without dead ends: 1651 [2018-11-18 14:55:01,288 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 14:55:01,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2018-11-18 14:55:01,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1501. [2018-11-18 14:55:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1501 states. [2018-11-18 14:55:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1771 transitions. [2018-11-18 14:55:01,363 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1771 transitions. Word has length 183 [2018-11-18 14:55:01,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:55:01,364 INFO L480 AbstractCegarLoop]: Abstraction has 1501 states and 1771 transitions. [2018-11-18 14:55:01,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:55:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1771 transitions. [2018-11-18 14:55:01,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-11-18 14:55:01,366 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:55:01,367 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:55:01,367 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:55:01,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:55:01,367 INFO L82 PathProgramCache]: Analyzing trace with hash 20267968, now seen corresponding path program 1 times [2018-11-18 14:55:01,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:55:01,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:55:01,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:55:01,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:55:01,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:55:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:55:01,429 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-18 14:55:01,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:55:01,429 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1547b617-5b10-402f-84a4-d4b059841fc5/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:55:01,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:55:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:55:01,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:55:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 91 proven. 21 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-18 14:55:01,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:55:01,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-18 14:55:01,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 14:55:01,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 14:55:01,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:55:01,589 INFO L87 Difference]: Start difference. First operand 1501 states and 1771 transitions. Second operand 7 states. [2018-11-18 14:55:01,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:55:01,890 INFO L93 Difference]: Finished difference Result 2489 states and 3023 transitions. [2018-11-18 14:55:01,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 14:55:01,890 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 207 [2018-11-18 14:55:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:55:01,894 INFO L225 Difference]: With dead ends: 2489 [2018-11-18 14:55:01,894 INFO L226 Difference]: Without dead ends: 1041 [2018-11-18 14:55:01,897 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-18 14:55:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2018-11-18 14:55:01,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1021. [2018-11-18 14:55:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1021 states. [2018-11-18 14:55:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 1166 transitions. [2018-11-18 14:55:01,955 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 1166 transitions. Word has length 207 [2018-11-18 14:55:01,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:55:01,955 INFO L480 AbstractCegarLoop]: Abstraction has 1021 states and 1166 transitions. [2018-11-18 14:55:01,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 14:55:01,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 1166 transitions. [2018-11-18 14:55:01,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-18 14:55:01,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:55:01,958 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:55:01,958 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:55:01,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:55:01,958 INFO L82 PathProgramCache]: Analyzing trace with hash -171530172, now seen corresponding path program 2 times [2018-11-18 14:55:01,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 14:55:01,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 14:55:01,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:55:01,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:55:01,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:55:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:55:02,007 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-11-18 14:55:02,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:55:02,007 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1547b617-5b10-402f-84a4-d4b059841fc5/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:55:02,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 14:55:02,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 14:55:02,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 14:55:02,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:55:02,106 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-18 14:55:02,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:55:02,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-11-18 14:55:02,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 14:55:02,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 14:55:02,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:55:02,124 INFO L87 Difference]: Start difference. First operand 1021 states and 1166 transitions. Second operand 3 states. [2018-11-18 14:55:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:55:02,203 INFO L93 Difference]: Finished difference Result 1993 states and 2296 transitions. [2018-11-18 14:55:02,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 14:55:02,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2018-11-18 14:55:02,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:55:02,204 INFO L225 Difference]: With dead ends: 1993 [2018-11-18 14:55:02,204 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 14:55:02,207 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 14:55:02,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 14:55:02,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 14:55:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 14:55:02,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 14:55:02,210 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 233 [2018-11-18 14:55:02,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:55:02,210 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 14:55:02,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 14:55:02,210 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 14:55:02,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 14:55:02,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 14:55:02,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:55:02,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:55:02,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:55:02,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:55:02,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 14:55:03,725 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2018-11-18 14:55:04,366 WARN L180 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 46 [2018-11-18 14:55:04,549 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2018-11-18 14:55:04,709 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2018-11-18 14:55:04,890 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2018-11-18 14:55:05,132 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2018-11-18 14:55:05,284 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2018-11-18 14:55:05,526 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2018-11-18 14:55:05,874 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 91 [2018-11-18 14:55:06,106 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2018-11-18 14:55:06,726 WARN L180 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 64 [2018-11-18 14:55:06,863 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2018-11-18 14:55:07,278 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 57 [2018-11-18 14:55:07,596 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2018-11-18 14:55:08,198 WARN L180 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 94 [2018-11-18 14:55:08,393 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2018-11-18 14:55:09,115 WARN L180 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 107 [2018-11-18 14:55:09,392 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 52 [2018-11-18 14:55:10,115 WARN L180 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 107 [2018-11-18 14:55:10,278 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2018-11-18 14:55:10,427 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2018-11-18 14:55:10,933 WARN L180 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2018-11-18 14:55:11,177 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2018-11-18 14:55:11,422 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2018-11-18 14:55:11,615 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2018-11-18 14:55:11,790 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2018-11-18 14:55:11,980 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 43 [2018-11-18 14:55:12,377 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2018-11-18 14:55:12,567 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2018-11-18 14:55:13,100 WARN L180 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2018-11-18 14:55:13,226 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 50 [2018-11-18 14:55:13,394 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2018-11-18 14:55:13,863 WARN L180 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 57 [2018-11-18 14:55:14,028 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 44 [2018-11-18 14:55:14,256 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2018-11-18 14:55:14,502 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2018-11-18 14:55:14,694 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2018-11-18 14:55:14,950 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2018-11-18 14:55:14,994 INFO L425 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2018-11-18 14:55:14,994 INFO L421 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse5 (< ~local~0 ~token~0)) (.cse8 (< ~token~0 ~local~0)) (.cse0 (< |old(~t1_st~0)| 2)) (.cse4 (< ~E_M~0 2)) (.cse3 (<= 2 ~t1_st~0)) (.cse1 (= ~T1_E~0 1)) (.cse2 (= ~T1_E~0 0)) (.cse13 (= 1 ~E_1~0)) (.cse6 (= 0 ~E_1~0)) (.cse7 (not (= ~t1_pc~0 1))) (.cse15 (<= 2 ~m_st~0)) (.cse12 (< |old(~m_st~0)| 2)) (.cse9 (= 0 ~M_E~0)) (.cse11 (= 1 ~m_pc~0)) (.cse10 (= 1 ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse2 .cse5 .cse8 .cse9 .cse10 .cse0 .cse1 .cse4 .cse6 .cse3 .cse11) (let ((.cse14 (+ ~local~0 1))) (or (not (= 1 ~E_M~0)) .cse2 .cse7 .cse12 .cse9 .cse10 .cse1 .cse13 (< ~token~0 .cse14) .cse15 .cse6 (< .cse14 ~token~0))) (or .cse1 .cse2 .cse13 .cse6 .cse7 (= 0 ~E_M~0) .cse15 .cse12 .cse9 .cse11 .cse10))) [2018-11-18 14:55:14,994 INFO L425 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2018-11-18 14:55:14,994 INFO L425 ceAbstractionStarter]: For program point L89(lines 89 102) no Hoare annotation was computed. [2018-11-18 14:55:14,995 INFO L421 ceAbstractionStarter]: At program point L89-2(lines 77 108) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 1)) (.cse1 (= ~T1_E~0 0)) (.cse16 (<= 2 ~m_st~0))) (let ((.cse3 (and (not .cse0) (and (not .cse1) (not (= ~E_M~0 0))) .cse16 (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)))) (.cse5 (< |old(~m_st~0)| 2)) (.cse9 (< ~local~0 |old(~token~0)|)) (.cse11 (< |old(~token~0)| ~local~0)) (.cse14 (= ~m_st~0 0)) (.cse18 (<= ~token~0 ~local~0)) (.cse19 (= ~E_M~0 |old(~E_M~0)|)) (.cse20 (<= ~local~0 ~token~0)) (.cse10 (= |old(~t1_pc~0)| 1)) (.cse6 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0)) (.cse2 (= 1 ~E_1~0)) (.cse17 (< |old(~E_M~0)| 2)) (.cse4 (= 0 ~E_1~0)) (.cse7 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 |old(~E_M~0)|) .cse5 .cse6 .cse7 .cse8) (let ((.cse12 (<= 2 ~E_M~0)) (.cse13 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse15 (<= (+ ~local~0 1) ~token~0))) (or .cse1 .cse3 .cse9 (not .cse10) .cse11 (and .cse12 .cse13 .cse14 .cse15) .cse5 .cse6 .cse8 .cse0 (and .cse12 .cse13 .cse15 .cse16) .cse2 .cse17 .cse4)) (or .cse1 .cse9 .cse11 .cse10 .cse5 .cse6 .cse8 .cse0 .cse2 .cse17 .cse4 (and .cse16 .cse18 .cse19 .cse20)) (or .cse1 .cse9 .cse11 (and .cse14 .cse18 .cse19 .cse20) .cse10 .cse6 .cse8 .cse0 (not (= 0 |old(~m_st~0)|)) .cse2 .cse17 .cse4 .cse7)))) [2018-11-18 14:55:14,995 INFO L425 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2018-11-18 14:55:14,996 INFO L421 ceAbstractionStarter]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse8 (= |old(~t1_pc~0)| 1))) (let ((.cse7 (= 0 |old(~E_M~0)|)) (.cse11 (= 1 ~m_pc~0)) (.cse14 (= 1 ~t1_pc~0)) (.cse13 (not .cse8)) (.cse1 (= ~T1_E~0 0)) (.cse15 (< ~local~0 |old(~token~0)|)) (.cse16 (< |old(~token~0)| ~local~0)) (.cse9 (< |old(~m_st~0)| 2)) (.cse10 (= 0 ~M_E~0)) (.cse12 (= 1 ~M_E~0)) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (<= 2 ~m_st~0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse5 (= |old(~E_M~0)| ~E_M~0)) (.cse0 (= ~T1_E~0 1)) (.cse2 (= 1 ~E_1~0)) (.cse19 (< |old(~E_M~0)| 2)) (.cse6 (= 0 ~E_1~0))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse6 .cse13 .cse7 (and .cse14 .cse4 .cse5) .cse9 .cse10 .cse11 .cse12) (or .cse1 .cse15 .cse16 .cse8 (and .cse3 (= ~m_st~0 0) .cse17 .cse18 .cse5) .cse10 .cse12 .cse0 (not (= 0 |old(~m_st~0)|)) .cse2 .cse19 .cse6 .cse11) (or (and .cse14 .cse4 .cse17 .cse18 .cse5) .cse1 .cse15 .cse13 .cse16 .cse9 .cse10 .cse12 .cse0 .cse2 .cse19 .cse6) (or .cse1 .cse15 .cse16 .cse8 .cse9 .cse10 .cse12 (and .cse3 .cse4 .cse17 .cse18 .cse5) .cse0 .cse2 .cse19 .cse6)))) [2018-11-18 14:55:14,996 INFO L425 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-11-18 14:55:14,996 INFO L421 ceAbstractionStarter]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (= |old(~E_M~0)| ~E_M~0)) (.cse4 (= 0 |old(~E_M~0)|)) (.cse8 (< |old(~m_st~0)| 2)) (.cse1 (= ~T1_E~0 0)) (.cse12 (< ~local~0 |old(~token~0)|)) (.cse13 (< |old(~token~0)| ~local~0)) (.cse15 (= |old(~t1_pc~0)| 1)) (.cse9 (= 0 ~M_E~0)) (.cse11 (= 1 ~M_E~0)) (.cse0 (= ~T1_E~0 1)) (.cse2 (= 1 ~E_1~0)) (.cse14 (< |old(~E_M~0)| 2)) (.cse3 (= 0 ~E_1~0)) (.cse10 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or (and .cse5 .cse6 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse7) .cse1 .cse12 .cse13 .cse8 .cse9 .cse11 .cse0 .cse2 .cse14 .cse3) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse14 .cse12 .cse3 .cse13 .cse15 .cse8 .cse9 .cse11) (or .cse1 .cse12 .cse13 .cse15 .cse9 .cse11 .cse0 (not (= 0 |old(~m_st~0)|)) .cse2 .cse14 .cse3 .cse10))) [2018-11-18 14:55:14,996 INFO L425 ceAbstractionStarter]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2018-11-18 14:55:14,996 INFO L421 ceAbstractionStarter]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse4 (= 1 ~t1_pc~0)) (.cse12 (= ~T1_E~0 1)) (.cse22 (<= 2 ~m_st~0)) (.cse0 (= ~T1_E~0 0))) (let ((.cse16 (= 1 ~m_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse17 (and .cse4 (not .cse12) .cse22 (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) (not .cse0) (not (= ~M_E~0 1)) (not (= ~E_1~0 0)))) (.cse1 (< ~local~0 |old(~token~0)|)) (.cse2 (< |old(~token~0)| ~local~0)) (.cse3 (= |old(~t1_pc~0)| 1)) (.cse18 (< |old(~m_st~0)| 2)) (.cse6 (<= 2 ~t1_st~0)) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (= ~E_M~0 |old(~E_M~0)|)) (.cse9 (<= ~local~0 ~token~0)) (.cse10 (= 0 ~M_E~0)) (.cse11 (= 1 ~M_E~0)) (.cse13 (= 1 ~E_1~0)) (.cse14 (< |old(~E_M~0)| 2)) (.cse15 (= 0 ~E_1~0))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 (not (= 0 |old(~m_st~0)|)) .cse13 .cse14 .cse15 .cse16) (or .cse12 .cse0 .cse13 .cse15 .cse17 (= 0 |old(~E_M~0)|) .cse18 .cse10 .cse16 .cse11) (let ((.cse19 (<= 2 ~E_M~0)) (.cse20 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse21 (<= (+ ~local~0 1) ~token~0))) (or .cse0 .cse1 (not .cse3) .cse2 .cse18 (and .cse4 .cse5 .cse6 .cse19 .cse20 .cse21) .cse10 .cse11 .cse12 .cse13 (and .cse4 .cse22 .cse6 .cse19 .cse20 .cse21) .cse14 .cse15 .cse17)) (or .cse0 .cse1 .cse2 .cse3 .cse18 (and .cse4 .cse22 .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2018-11-18 14:55:14,996 INFO L421 ceAbstractionStarter]: At program point L99(line 99) the Hoare annotation is: (let ((.cse9 (= 1 ~t1_pc~0)) (.cse10 (<= 2 ~m_st~0)) (.cse12 (= 0 |old(~E_M~0)|)) (.cse3 (< |old(~m_st~0)| 2)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< ~local~0 |old(~token~0)|)) (.cse2 (< |old(~token~0)| ~local~0)) (.cse13 (= |old(~t1_pc~0)| 1)) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (= ~T1_E~0 1)) (.cse7 (= 1 ~E_1~0)) (.cse8 (< |old(~E_M~0)| 2)) (.cse11 (= 0 ~E_1~0)) (.cse14 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0) (= 1 ~E_M~0)) .cse11) (or .cse6 .cse0 .cse7 .cse11 .cse12 .cse13 .cse3 .cse4 .cse14 .cse5) (or .cse6 .cse0 .cse7 (and .cse9 .cse10 (not (= ~E_M~0 0))) .cse11 .cse12 .cse3 .cse4 .cse14 .cse5) (or .cse6 .cse0 .cse7 .cse8 .cse1 .cse11 .cse2 .cse13 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse13 .cse4 .cse5 .cse6 (not (= 0 |old(~m_st~0)|)) .cse7 .cse8 .cse11 .cse14))) [2018-11-18 14:55:14,996 INFO L425 ceAbstractionStarter]: For program point L99-1(line 99) no Hoare annotation was computed. [2018-11-18 14:55:14,997 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 321) no Hoare annotation was computed. [2018-11-18 14:55:14,997 INFO L425 ceAbstractionStarter]: For program point L315(line 315) no Hoare annotation was computed. [2018-11-18 14:55:14,997 INFO L425 ceAbstractionStarter]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2018-11-18 14:55:14,997 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 313) no Hoare annotation was computed. [2018-11-18 14:55:14,997 INFO L421 ceAbstractionStarter]: At program point L307(line 307) the Hoare annotation is: (let ((.cse18 (+ ~local~0 1)) (.cse16 (= ~t1_pc~0 1))) (let ((.cse17 (= 1 ~m_pc~0)) (.cse12 (not .cse16)) (.cse13 (= 1 ~M_E~0)) (.cse14 (< ~token~0 .cse18)) (.cse1 (<= 2 ~m_st~0)) (.cse15 (< .cse18 ~token~0)) (.cse2 (= ~T1_E~0 0)) (.cse5 (< ~local~0 ~token~0)) (.cse7 (< ~token~0 ~local~0)) (.cse8 (< |old(~m_st~0)| 2)) (.cse11 (<= 2 ~t1_st~0)) (.cse9 (= 0 ~M_E~0)) (.cse10 (< |old(~t1_st~0)| 2)) (.cse0 (= ~T1_E~0 1)) (.cse3 (= 1 ~E_1~0)) (.cse4 (< ~E_M~0 2)) (.cse6 (= 0 ~E_1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse2 .cse11 .cse4 .cse5 .cse6 .cse12 .cse7 .cse9 .cse13) (or .cse2 .cse12 .cse8 .cse9 (and .cse1 .cse11) .cse10 .cse0 .cse3 .cse14 .cse4 .cse6 .cse15) (or .cse2 .cse5 .cse7 .cse16 (= ~m_st~0 0) .cse9 .cse13 .cse0 (not (= 0 |old(~m_st~0)|)) .cse3 .cse4 .cse6 .cse17) (or .cse2 .cse5 .cse7 .cse9 .cse13 .cse10 .cse0 .cse4 .cse6 .cse11 .cse17) (or .cse0 .cse2 .cse3 .cse1 .cse6 (= 0 ~E_M~0) .cse8 .cse9 .cse17) (or (not (= 1 ~E_M~0)) .cse2 .cse12 .cse8 .cse9 .cse13 .cse0 .cse3 .cse14 .cse1 .cse6 .cse15) (or .cse2 .cse5 .cse7 .cse8 .cse11 .cse9 .cse10 .cse0 .cse3 .cse4 .cse6)))) [2018-11-18 14:55:14,997 INFO L421 ceAbstractionStarter]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse21 (+ ~local~0 1)) (.cse14 (= ~t1_pc~0 1)) (.cse1 (= ~T1_E~0 1)) (.cse18 (<= 2 ~m_st~0)) (.cse20 (not (= ~m_pc~0 1))) (.cse2 (= ~T1_E~0 0))) (let ((.cse11 (and (not .cse1) .cse18 (not (= ~E_1~0 1)) .cse20 (not .cse2))) (.cse16 (= 1 ~m_pc~0)) (.cse0 (< |old(~t1_st~0)| 2)) (.cse3 (<= 2 ~t1_st~0)) (.cse5 (< ~local~0 ~token~0)) (.cse8 (< ~token~0 ~local~0)) (.cse4 (< ~E_M~0 2)) (.cse7 (not .cse14)) (.cse12 (< |old(~m_st~0)| 2)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 ~M_E~0)) (.cse13 (= 1 ~E_1~0)) (.cse17 (< ~token~0 .cse21)) (.cse6 (= 0 ~E_1~0)) (.cse15 (= ~m_st~0 0)) (.cse19 (< .cse21 ~token~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse2 .cse11 .cse5 .cse8 .cse12 .cse9 .cse0 .cse1 .cse13 .cse4 .cse6 .cse3) (or .cse2 .cse5 .cse8 .cse14 .cse15 .cse9 .cse10 .cse1 (not (= 0 |old(~m_st~0)|)) .cse13 .cse4 .cse6 .cse16) (or .cse1 .cse2 .cse13 .cse11 .cse6 (= 0 ~E_M~0) .cse12 .cse9 .cse16) (or .cse2 .cse5 .cse8 .cse9 .cse10 .cse0 .cse1 .cse4 .cse6 .cse3 .cse16) (or .cse2 .cse7 .cse12 .cse9 .cse0 .cse1 .cse13 .cse17 (and .cse18 .cse3) .cse4 .cse6 .cse19 .cse20) (or .cse2 .cse5 .cse8 .cse12 .cse9 .cse1 .cse13 .cse4 .cse6 .cse18) (or (not (= 1 ~E_M~0)) .cse2 .cse18 .cse7 .cse12 .cse9 .cse10 .cse1 .cse13 .cse17 .cse6 .cse15 .cse19)))) [2018-11-18 14:55:14,997 INFO L425 ceAbstractionStarter]: For program point L307-1(line 307) no Hoare annotation was computed. [2018-11-18 14:55:14,998 INFO L421 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse18 (+ ~local~0 1)) (.cse16 (= ~t1_pc~0 1))) (let ((.cse17 (= 1 ~m_pc~0)) (.cse12 (not .cse16)) (.cse13 (= 1 ~M_E~0)) (.cse14 (< ~token~0 .cse18)) (.cse1 (<= 2 ~m_st~0)) (.cse15 (< .cse18 ~token~0)) (.cse2 (= ~T1_E~0 0)) (.cse5 (< ~local~0 ~token~0)) (.cse7 (< ~token~0 ~local~0)) (.cse8 (< |old(~m_st~0)| 2)) (.cse11 (<= 2 ~t1_st~0)) (.cse9 (= 0 ~M_E~0)) (.cse10 (< |old(~t1_st~0)| 2)) (.cse0 (= ~T1_E~0 1)) (.cse3 (= 1 ~E_1~0)) (.cse4 (< ~E_M~0 2)) (.cse6 (= 0 ~E_1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse2 .cse11 .cse4 .cse5 .cse6 .cse12 .cse7 .cse9 .cse13) (or .cse2 .cse12 .cse8 .cse9 (and .cse1 .cse11) .cse10 .cse0 .cse3 .cse14 .cse4 .cse6 .cse15) (or .cse2 .cse5 .cse7 .cse16 (= ~m_st~0 0) .cse9 .cse13 .cse0 (not (= 0 |old(~m_st~0)|)) .cse3 .cse4 .cse6 .cse17) (or .cse2 .cse5 .cse7 .cse9 .cse13 .cse10 .cse0 .cse4 .cse6 .cse11 .cse17) (or .cse0 .cse2 .cse3 .cse1 .cse6 (= 0 ~E_M~0) .cse8 .cse9 .cse17) (or (not (= 1 ~E_M~0)) .cse2 .cse12 .cse8 .cse9 .cse13 .cse0 .cse3 .cse14 .cse1 .cse6 .cse15) (or .cse2 .cse5 .cse7 .cse8 .cse11 .cse9 .cse10 .cse0 .cse3 .cse4 .cse6)))) [2018-11-18 14:55:14,998 INFO L425 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2018-11-18 14:55:14,998 INFO L421 ceAbstractionStarter]: At program point L190(lines 177 192) the Hoare annotation is: (let ((.cse5 (< ~t1_st~0 2)) (.cse0 (= ~T1_E~0 0)) (.cse12 (< ~local~0 ~token~0)) (.cse13 (< ~token~0 ~local~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= 0 ~M_E~0)) (.cse3 (= 1 ~M_E~0)) (.cse6 (= ~T1_E~0 1)) (.cse7 (not (= 0 ~m_st~0))) (.cse4 (= exists_runnable_thread_~__retres1~2 1)) (.cse9 (= 1 ~E_1~0)) (.cse10 (< ~E_M~0 2)) (.cse11 (= 0 ~E_1~0)) (.cse14 (= 1 ~m_pc~0))) (and (let ((.cse8 (+ ~local~0 1))) (or .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< ~token~0 .cse8) .cse9 .cse10 .cse11 (< .cse8 ~token~0))) (or .cse0 .cse12 .cse13 .cse2 .cse4 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse14) (or .cse0 .cse12 .cse13 .cse1 .cse2 .cse3 .cse6 .cse7 .cse4 .cse9 .cse10 .cse11 .cse14))) [2018-11-18 14:55:14,998 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2018-11-18 14:55:14,998 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 187) no Hoare annotation was computed. [2018-11-18 14:55:14,998 INFO L428 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2018-11-18 14:55:14,998 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 188) no Hoare annotation was computed. [2018-11-18 14:55:14,998 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2018-11-18 14:55:14,998 INFO L425 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2018-11-18 14:55:14,998 INFO L428 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2018-11-18 14:55:14,998 INFO L425 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2018-11-18 14:55:14,998 INFO L421 ceAbstractionStarter]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse18 (+ ~local~0 1)) (.cse16 (= ~t1_pc~0 1))) (let ((.cse9 (< ~t1_st~0 2)) (.cse7 (= 1 ~m_pc~0)) (.cse11 (< ~E_M~0 2)) (.cse13 (< ~local~0 ~token~0)) (.cse14 (< ~token~0 ~local~0)) (.cse17 (not (= 1 ~E_M~0))) (.cse1 (= ~T1_E~0 0)) (.cse8 (not .cse16)) (.cse5 (< ~m_st~0 2)) (.cse6 (= 0 ~M_E~0)) (.cse15 (= 1 ~M_E~0)) (.cse0 (= ~T1_E~0 1)) (.cse2 (= 1 ~E_1~0)) (.cse10 (< ~token~0 .cse18)) (.cse4 (= 0 ~E_1~0)) (.cse3 (= 0 is_transmit1_triggered_~__retres1~1)) (.cse12 (< .cse18 ~token~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~E_M~0) .cse5 .cse6 .cse7) (or .cse1 .cse8 .cse5 .cse6 .cse9 .cse0 .cse3 .cse2 .cse10 .cse11 .cse4 .cse12) (or .cse1 .cse3 .cse13 .cse8 .cse14 .cse2 .cse6 .cse15 .cse9 .cse0 .cse11 .cse4) (or .cse0 .cse1 .cse11 .cse13 .cse4 .cse14 .cse3 .cse16 .cse6 .cse7 .cse15) (or .cse17 .cse1 .cse8 .cse6 .cse15 (not (= 0 ~m_st~0)) .cse0 .cse2 .cse10 .cse4 .cse12 .cse3) (or .cse0 .cse3 .cse1 .cse2 .cse11 .cse13 .cse4 .cse14 .cse5 .cse6) (or .cse17 .cse1 .cse8 .cse5 .cse6 .cse15 .cse0 .cse2 .cse10 .cse4 .cse3 .cse12)))) [2018-11-18 14:55:14,999 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 139) no Hoare annotation was computed. [2018-11-18 14:55:14,999 INFO L425 ceAbstractionStarter]: For program point L133(lines 133 142) no Hoare annotation was computed. [2018-11-18 14:55:14,999 INFO L425 ceAbstractionStarter]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2018-11-18 14:55:14,999 INFO L425 ceAbstractionStarter]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2018-11-18 14:55:14,999 INFO L425 ceAbstractionStarter]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2018-11-18 14:55:14,999 INFO L425 ceAbstractionStarter]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2018-11-18 14:55:14,999 INFO L421 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse4 (< ~m_st~0 2)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse2 (< ~local~0 ~token~0)) (.cse3 (< ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (= |old(~E_M~0)| ~E_M~0))) (.cse5 (= 0 |old(~M_E~0)|)) (.cse6 (= 1 |old(~M_E~0)|)) (.cse7 (= |old(~T1_E~0)| 1)) (.cse8 (= 1 |old(~E_1~0)|)) (.cse9 (< |old(~E_M~0)| 2)) (.cse10 (= 0 |old(~E_1~0)|)) (.cse11 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse7 .cse1 .cse8 .cse0 .cse10 (= 0 |old(~E_M~0)|) .cse4 .cse5 .cse11 .cse6) (let ((.cse13 (+ ~local~0 1))) (or .cse1 (not .cse12) .cse4 .cse5 .cse6 (< ~t1_st~0 2) .cse7 (< ~token~0 .cse13) .cse8 .cse0 .cse9 .cse10 (< .cse13 ~token~0))) (or .cse1 .cse2 .cse3 .cse12 .cse0 .cse5 .cse6 .cse7 (not (= 0 ~m_st~0)) .cse8 .cse9 .cse10 .cse11))) [2018-11-18 14:55:14,999 INFO L425 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2018-11-18 14:55:14,999 INFO L425 ceAbstractionStarter]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2018-11-18 14:55:14,999 INFO L425 ceAbstractionStarter]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2018-11-18 14:55:14,999 INFO L425 ceAbstractionStarter]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2018-11-18 14:55:14,999 INFO L421 ceAbstractionStarter]: At program point init_threadsENTRY(lines 156 173) the Hoare annotation is: (or (= ~T1_E~0 0) (< ~local~0 ~token~0) (< ~token~0 ~local~0) (= ~t1_pc~0 1) (= ~m_st~0 0) (= 0 ~M_E~0) (= 1 ~M_E~0) (= ~T1_E~0 1) (not (= 0 |old(~m_st~0)|)) (= 1 ~E_1~0) (< ~E_M~0 2) (= 0 ~E_1~0) (= 1 ~m_pc~0)) [2018-11-18 14:55:15,000 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2018-11-18 14:55:15,000 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 462 473) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0) (= |old(~E_M~0)| ~E_M~0)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 14:55:15,000 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2018-11-18 14:55:15,000 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2018-11-18 14:55:15,000 INFO L425 ceAbstractionStarter]: For program point L468(line 468) no Hoare annotation was computed. [2018-11-18 14:55:15,000 INFO L421 ceAbstractionStarter]: At program point L467(line 467) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0) (= |old(~E_M~0)| ~E_M~0)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 14:55:15,000 INFO L421 ceAbstractionStarter]: At program point L467-1(line 467) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0) (= |old(~E_M~0)| ~E_M~0)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 14:55:15,000 INFO L425 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-11-18 14:55:15,000 INFO L425 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-18 14:55:15,000 INFO L428 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-11-18 14:55:15,000 INFO L425 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-11-18 14:55:15,001 INFO L425 ceAbstractionStarter]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2018-11-18 14:55:15,001 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-18 14:55:15,001 INFO L421 ceAbstractionStarter]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1))) (let ((.cse5 (< |old(~t1_st~0)| 2)) (.cse6 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse7 (= 1 |old(~E_1~0)|)) (.cse10 (= 0 |old(~E_1~0)|)) (.cse2 (not .cse11)) (.cse3 (= 0 ~M_E~0)) (.cse12 (= 1 |old(~m_pc~0)|)) (.cse4 (= 1 ~M_E~0)) (.cse9 (< ~E_M~0 2))) (and (let ((.cse8 (+ |old(~local~0)| 1))) (or .cse0 (let ((.cse1 (+ ~local~0 1))) (and (<= ~token~0 .cse1) (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (<= 2 ~t1_st~0) (<= .cse1 ~token~0))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< |old(~token~0)| .cse8) .cse9 .cse10 (< .cse8 |old(~token~0)|))) (or .cse6 .cse0 .cse7 .cse9 (< |old(~local~0)| |old(~token~0)|) .cse10 (< |old(~token~0)| |old(~local~0)|) .cse11 .cse3 .cse12 .cse4) (or .cse5 (or .cse6 .cse0 .cse7 .cse10 .cse2 .cse3 .cse12 .cse4) .cse9)))) [2018-11-18 14:55:15,001 INFO L421 ceAbstractionStarter]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse3 (= ~t1_pc~0 1)) (.cse7 (= ~T1_E~0 1)) (.cse15 (<= 2 ~m_st~0)) (.cse16 (not (= ~E_1~0 1))) (.cse0 (= ~T1_E~0 0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (not (= ~E_1~0 0))) (.cse19 (<= ~local~0 ~token~0))) (let ((.cse1 (< |old(~local~0)| |old(~token~0)|)) (.cse2 (< |old(~token~0)| |old(~local~0)|)) (.cse6 (< |old(~t1_st~0)| 2)) (.cse12 (and (= 1 ~t1_pc~0) (not .cse7) (not (= ~M_E~0 0)) .cse15 .cse16 (not .cse0) (not (= ~M_E~0 1)) .cse17 .cse18 .cse19)) (.cse8 (= 1 |old(~E_1~0)|)) (.cse10 (= 0 |old(~E_1~0)|)) (.cse13 (not .cse3)) (.cse4 (= 0 ~M_E~0)) (.cse11 (= 1 |old(~m_pc~0)|)) (.cse5 (= 1 ~M_E~0)) (.cse9 (< ~E_M~0 2))) (and (or .cse0 (<= 2 ~t1_st~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (let ((.cse14 (+ |old(~local~0)| 1))) (or .cse0 .cse12 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 (< |old(~token~0)| .cse14) .cse9 .cse10 (< .cse14 |old(~token~0)|))) (or .cse0 .cse1 .cse2 .cse3 (and .cse15 .cse16 .cse17 .cse18 .cse19) .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse6 .cse12 (or .cse7 .cse0 .cse8 .cse10 .cse13 .cse4 .cse11 .cse5) .cse9)))) [2018-11-18 14:55:15,001 INFO L421 ceAbstractionStarter]: At program point L61(line 61) the Hoare annotation is: (let ((.cse10 (= ~t1_pc~0 1))) (let ((.cse0 (< |old(~t1_st~0)| 2)) (.cse1 (= ~T1_E~0 1)) (.cse2 (= ~T1_E~0 0)) (.cse3 (= 1 |old(~E_1~0)|)) (.cse6 (= 0 |old(~E_1~0)|)) (.cse7 (not .cse10)) (.cse8 (= 0 ~M_E~0)) (.cse11 (= 1 |old(~m_pc~0)|)) (.cse9 (= 1 ~M_E~0)) (.cse5 (< ~E_M~0 2))) (and (let ((.cse4 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 (< |old(~token~0)| .cse4) .cse5 .cse6 .cse7 (< .cse4 |old(~token~0)|) .cse8 .cse9)) (or .cse1 .cse2 .cse3 .cse5 (< |old(~local~0)| |old(~token~0)|) .cse6 (< |old(~token~0)| |old(~local~0)|) .cse10 .cse8 .cse11 .cse9) (or .cse0 (or .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse11 .cse9) .cse5)))) [2018-11-18 14:55:15,001 INFO L421 ceAbstractionStarter]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse2 (= ~T1_E~0 1)) (.cse14 (= |old(~E_1~0)| ~E_1~0)) (.cse15 (= ~token~0 |old(~token~0)|)) (.cse18 (<= 2 ~t1_st~0)) (.cse16 (not (= ~m_pc~0 1))) (.cse3 (= ~T1_E~0 0)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse6 (not .cse13)) (.cse1 (and (= 1 ~t1_pc~0) (not .cse2) .cse14 .cse15 (not (= ~M_E~0 0)) .cse18 (not (= ~E_1~0 1)) .cse16 (not .cse3) (not (= ~M_E~0 1)) (not (= ~E_1~0 0)))) (.cse11 (< |old(~local~0)| |old(~token~0)|)) (.cse12 (< |old(~token~0)| |old(~local~0)|)) (.cse7 (= 0 ~M_E~0)) (.cse9 (= 1 ~M_E~0)) (.cse0 (< |old(~t1_st~0)| 2)) (.cse4 (= 1 |old(~E_1~0)|)) (.cse10 (< ~E_M~0 2)) (.cse5 (= 0 |old(~E_1~0)|)) (.cse8 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (or .cse3 .cse11 .cse12 .cse13 .cse7 .cse9 .cse2 .cse4 (and .cse14 .cse15 .cse16 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)) .cse10 .cse5 .cse8) (let ((.cse19 (+ |old(~local~0)| 1))) (or .cse3 (let ((.cse17 (+ ~local~0 1))) (and (<= ~token~0 .cse17) .cse14 .cse15 .cse18 (<= .cse17 ~token~0))) .cse6 .cse7 .cse9 .cse0 .cse2 .cse4 (< |old(~token~0)| .cse19) .cse1 .cse10 .cse5 (< .cse19 |old(~token~0)|))) (or .cse18 .cse3 .cse11 .cse12 .cse7 .cse9 .cse0 .cse2 .cse4 .cse10 .cse5 .cse8)))) [2018-11-18 14:55:15,002 INFO L421 ceAbstractionStarter]: At program point L51(line 51) the Hoare annotation is: (let ((.cse7 (= ~t1_pc~0 1))) (let ((.cse1 (< |old(~local~0)| |old(~token~0)|)) (.cse2 (< |old(~token~0)| |old(~local~0)|)) (.cse15 (<= 2 ~t1_st~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse5 (not (= ~E_1~0 0))) (.cse6 (<= ~local~0 ~token~0)) (.cse16 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse11 (= 1 |old(~E_1~0)|)) (.cse13 (= 0 |old(~E_1~0)|)) (.cse17 (not .cse7)) (.cse8 (= 0 ~M_E~0)) (.cse14 (= 1 |old(~m_pc~0)|)) (.cse9 (= 1 ~M_E~0)) (.cse12 (< ~E_M~0 2))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse8 .cse9 .cse15 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse18 (+ |old(~local~0)| 1))) (or .cse0 (and .cse15 .cse4 .cse5 .cse6) .cse17 .cse8 .cse9 .cse16 .cse10 .cse11 (< |old(~token~0)| .cse18) .cse12 .cse13 (< .cse18 |old(~token~0)|))) (or (and .cse15 .cse3 .cse4 .cse5 .cse6) .cse16 (or .cse10 .cse0 .cse11 .cse13 .cse17 .cse8 .cse14 .cse9) .cse12)))) [2018-11-18 14:55:15,002 INFO L425 ceAbstractionStarter]: For program point L51-1(line 51) no Hoare annotation was computed. [2018-11-18 14:55:15,002 INFO L425 ceAbstractionStarter]: For program point L45(lines 45 66) no Hoare annotation was computed. [2018-11-18 14:55:15,002 INFO L421 ceAbstractionStarter]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse18 (= ~t1_pc~0 1))) (let ((.cse5 (not .cse18)) (.cse2 (= |old(~E_1~0)| ~E_1~0)) (.cse3 (= ~token~0 |old(~token~0)|)) (.cse14 (not (= ~m_pc~0 1))) (.cse4 (<= 2 ~t1_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse16 (< |old(~local~0)| |old(~token~0)|)) (.cse17 (< |old(~token~0)| |old(~local~0)|)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (< |old(~t1_st~0)| 2)) (.cse9 (= ~T1_E~0 1)) (.cse10 (= 1 |old(~E_1~0)|)) (.cse12 (< ~E_M~0 2)) (.cse13 (= 0 |old(~E_1~0)|)) (.cse15 (= 1 |old(~m_pc~0)|))) (and (let ((.cse11 (+ |old(~local~0)| 1))) (or .cse0 (let ((.cse1 (+ ~local~0 1))) (and (<= ~token~0 .cse1) .cse2 .cse3 .cse4 (<= .cse1 ~token~0))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< |old(~token~0)| .cse11) .cse12 .cse13 (< .cse11 |old(~token~0)|))) (or .cse8 (and .cse2 .cse3 .cse4 .cse14) (or .cse9 .cse0 .cse10 .cse13 .cse5 .cse6 .cse15 .cse7) .cse12) (or .cse0 .cse16 .cse17 .cse18 .cse6 .cse7 .cse9 .cse10 (and .cse2 .cse3 .cse14 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)) .cse12 .cse13 .cse15) (or .cse4 .cse0 .cse16 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15)))) [2018-11-18 14:55:15,002 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-18 14:55:15,002 INFO L425 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2018-11-18 14:55:15,002 INFO L421 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse7 (< ~E_M~0 2)) (.cse5 (= ~T1_E~0 1)) (.cse1 (= ~T1_E~0 0)) (.cse6 (= 1 ~E_1~0)) (.cse0 (= |old(~M_E~0)| ~M_E~0)) (.cse8 (= 0 ~E_1~0)) (.cse2 (< ~m_st~0 2)) (.cse3 (= 0 |old(~M_E~0)|)) (.cse4 (= 1 |old(~M_E~0)|))) (and (or .cse0 .cse1 (< ~local~0 ~token~0) (< ~token~0 ~local~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse9 (+ ~local~0 1))) (or .cse1 (not (= ~t1_pc~0 1)) .cse2 .cse3 .cse4 (< ~t1_st~0 2) .cse5 (< ~token~0 .cse9) .cse6 .cse0 .cse7 .cse8 (< .cse9 ~token~0))) (or .cse5 .cse1 .cse6 .cse0 .cse8 (= 0 ~E_M~0) .cse2 .cse3 (= 1 ~m_pc~0) .cse4))) [2018-11-18 14:55:15,002 INFO L425 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2018-11-18 14:55:15,002 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 14:55:15,002 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T1_E~0)| ~T1_E~0) (= ~token~0 |old(~token~0)|) (= |old(~M_E~0)| ~M_E~0) (= |old(~E_M~0)| ~E_M~0)) [2018-11-18 14:55:15,003 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 14:55:15,003 INFO L421 ceAbstractionStarter]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse3 (= |old(~t1_pc~0)| 1))) (let ((.cse18 (< |old(~t1_st~0)| 2)) (.cse19 (<= 2 ~t1_st~0)) (.cse20 (not (= 0 |old(~m_st~0)|))) (.cse24 (= 1 ~t1_pc~0)) (.cse9 (= ~token~0 |old(~token~0)|)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse1 (< |old(~local~0)| |old(~token~0)|)) (.cse22 (not .cse3)) (.cse2 (< |old(~token~0)| |old(~local~0)|)) (.cse16 (< |old(~E_M~0)| 2)) (.cse14 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse15 (= 1 |old(~E_1~0)|)) (.cse7 (not (= ~t1_pc~0 1))) (.cse8 (= |old(~E_1~0)| ~E_1~0)) (.cse10 (<= 2 ~m_st~0)) (.cse27 (not (= ~m_pc~0 1))) (.cse13 (= |old(~E_M~0)| ~E_M~0)) (.cse17 (= 0 |old(~E_1~0)|)) (.cse26 (= 0 |old(~E_M~0)|)) (.cse4 (< |old(~m_st~0)| 2)) (.cse5 (= 0 ~M_E~0)) (.cse21 (= 1 |old(~m_pc~0)|)) (.cse6 (= 1 ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse18 .cse14 .cse15 .cse16 .cse17 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse18 .cse14 .cse20 .cse15 .cse16 .cse17 .cse19 .cse21) (let ((.cse23 (+ |old(~local~0)| 1))) (or .cse0 .cse22 .cse4 .cse5 .cse6 .cse18 .cse14 (< |old(~token~0)| .cse23) .cse15 (let ((.cse25 (+ ~local~0 1))) (and .cse24 (<= ~token~0 .cse25) .cse8 .cse9 .cse10 .cse19 (<= .cse25 ~token~0) .cse13)) .cse16 .cse17 (< .cse23 |old(~token~0)|))) (or .cse14 .cse0 .cse15 .cse17 .cse22 .cse26 (and .cse24 .cse8 .cse10 .cse27 .cse13) .cse4 .cse5 .cse21 .cse6) (or .cse0 .cse1 .cse2 .cse3 (and .cse7 .cse8 .cse9 (= ~m_st~0 0) .cse27 .cse11 .cse12 .cse13) .cse5 .cse6 .cse14 .cse20 .cse15 .cse16 .cse17 .cse21) (or (and .cse24 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse0 .cse1 .cse22 .cse2 .cse4 .cse5 .cse6 .cse14 .cse15 .cse16 .cse17) (or .cse14 .cse0 .cse15 (and .cse7 .cse8 .cse10 .cse27 .cse13) .cse17 .cse26 .cse3 .cse4 .cse5 .cse21 .cse6)))) [2018-11-18 14:55:15,003 INFO L425 ceAbstractionStarter]: For program point L213(lines 213 220) no Hoare annotation was computed. [2018-11-18 14:55:15,003 INFO L425 ceAbstractionStarter]: For program point L205(lines 205 209) no Hoare annotation was computed. [2018-11-18 14:55:15,003 INFO L425 ceAbstractionStarter]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2018-11-18 14:55:15,003 INFO L425 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2018-11-18 14:55:15,004 INFO L421 ceAbstractionStarter]: At program point L201(line 201) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse7 (= ~T1_E~0 1))) (let ((.cse40 (not .cse7)) (.cse29 (and (not .cse0) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse41 (not (= ~M_E~0 1))) (.cse31 (not (= ~E_1~0 1)))) (let ((.cse39 (= 1 ~t1_pc~0)) (.cse43 (+ ~local~0 1)) (.cse37 (and (not (= ~t1_pc~0 1)) .cse40 .cse29 .cse41 .cse31)) (.cse38 (<= 2 ~m_st~0))) (let ((.cse19 (= |old(~t1_pc~0)| 1)) (.cse24 (= ~token~0 |old(~token~0)|)) (.cse26 (= ~E_M~0 |old(~E_M~0)|)) (.cse28 (and .cse37 .cse38)) (.cse34 (<= ~token~0 .cse43)) (.cse36 (<= .cse43 ~token~0)) (.cse17 (<= 2 ~t1_st~0)) (.cse42 (<= 2 ~E_M~0)) (.cse35 (and .cse39 .cse40 .cse29 .cse41 .cse38 .cse31)) (.cse25 (<= ~token~0 ~local~0)) (.cse27 (<= ~local~0 ~token~0)) (.cse30 (= ~m_st~0 0)) (.cse32 (not (= ~m_pc~0 1)))) (let ((.cse18 (and .cse37 .cse30 .cse32)) (.cse20 (not (= 0 |old(~m_st~0)|))) (.cse12 (and .cse42 .cse35 .cse25 .cse27)) (.cse13 (and .cse42 .cse34 .cse35 .cse36 .cse17)) (.cse14 (and .cse42 .cse17 (and .cse34 .cse36 (and .cse39 .cse40 .cse29 .cse41 .cse30 .cse31)))) (.cse21 (and .cse17 .cse28)) (.cse1 (< |old(~local~0)| |old(~token~0)|)) (.cse3 (< |old(~token~0)| |old(~local~0)|)) (.cse16 (and .cse35 .cse24 .cse25 .cse17 .cse26 .cse27)) (.cse2 (not .cse19)) (.cse15 (< |old(~t1_st~0)| 2)) (.cse10 (< |old(~E_M~0)| 2)) (.cse8 (and .cse39 .cse40 .cse29 .cse41 .cse38 .cse31 .cse32)) (.cse9 (= 1 |old(~E_1~0)|)) (.cse11 (= 0 |old(~E_1~0)|)) (.cse23 (= 0 |old(~E_M~0)|)) (.cse4 (< |old(~m_st~0)| 2)) (.cse5 (= 0 ~M_E~0)) (.cse22 (= 1 |old(~m_pc~0)|)) (.cse6 (= 1 ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse15 .cse7 .cse16 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse3 (and .cse17 .cse18) .cse19 .cse5 .cse6 .cse8 .cse15 .cse7 .cse20 .cse9 .cse21 .cse10 .cse11 .cse22) (or .cse8 .cse7 .cse0 .cse9 .cse11 .cse2 .cse23 .cse4 .cse5 .cse22 .cse6) (or .cse0 (and .cse24 .cse25 .cse18 .cse26 .cse27) .cse1 .cse3 .cse19 (and .cse25 .cse28 .cse26 .cse27) .cse5 .cse6 .cse8 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 (and .cse24 .cse25 (and .cse29 .cse30 .cse31 .cse32) .cse17 .cse26 .cse27) .cse13 .cse14 .cse22) (or .cse0 .cse1 .cse3 .cse19 .cse4 .cse5 .cse6 .cse21 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse3 (and .cse24 .cse25 .cse28 .cse26 .cse27) .cse19 .cse4 .cse5 .cse6 .cse8 .cse7 .cse16 .cse9 .cse10 .cse11) (let ((.cse33 (+ |old(~local~0)| 1))) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 (< |old(~token~0)| .cse33) .cse9 (and .cse34 .cse35 .cse24 .cse36 .cse17 .cse26) .cse10 .cse11 (< .cse33 |old(~token~0)|))) (or .cse8 .cse7 .cse0 .cse9 .cse11 .cse23 .cse4 (and .cse37 .cse38 .cse32) .cse5 .cse22 .cse6))))))) [2018-11-18 14:55:15,004 INFO L421 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse8 (= ~T1_E~0 1))) (let ((.cse28 (not .cse8)) (.cse29 (and (not .cse0) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse30 (not (= ~M_E~0 1))) (.cse31 (not (= ~E_1~0 1)))) (let ((.cse17 (not (= ~m_pc~0 1))) (.cse14 (<= ~token~0 ~local~0)) (.cse27 (= 1 ~t1_pc~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse3 (= |old(~t1_pc~0)| 1)) (.cse13 (and (not (= ~t1_pc~0 1)) .cse28 .cse29 .cse30 .cse31)) (.cse26 (<= 2 ~m_st~0)) (.cse32 (not (= 0 eval_~tmp~0)))) (let ((.cse9 (not (= 0 |old(~m_st~0)|))) (.cse12 (= ~token~0 |old(~token~0)|)) (.cse19 (and .cse13 .cse26 .cse32)) (.cse15 (= ~E_M~0 |old(~E_M~0)|)) (.cse21 (< |old(~t1_st~0)| 2)) (.cse1 (< |old(~local~0)| |old(~token~0)|)) (.cse23 (not .cse3)) (.cse2 (< |old(~token~0)| |old(~local~0)|)) (.cse4 (and (<= 2 ~E_M~0) .cse14 (and .cse27 .cse29 .cse26 .cse31 .cse32) .cse16)) (.cse11 (< |old(~E_M~0)| 2)) (.cse7 (and .cse27 .cse28 .cse29 .cse30 .cse26 .cse31 .cse17)) (.cse10 (= 1 |old(~E_1~0)|)) (.cse18 (= 0 |old(~E_1~0)|)) (.cse24 (= 0 |old(~E_M~0)|)) (.cse22 (< |old(~m_st~0)| 2)) (.cse5 (= 0 ~M_E~0)) (.cse20 (= 1 |old(~m_pc~0)|)) (.cse6 (= 1 ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse12 .cse13 (= ~m_st~0 0) .cse14 (= eval_~tmp~0 1) .cse15 .cse16 .cse17) .cse18 (and .cse14 .cse19 .cse15 .cse16) .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse18 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse22 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 (and .cse12 .cse14 .cse19 .cse15 .cse16) .cse18) (or .cse0 .cse1 .cse2 .cse22 .cse5 .cse6 .cse7 .cse21 .cse8 .cse10 .cse11 .cse18) (or .cse7 .cse8 .cse0 .cse10 .cse18 .cse23 .cse24 .cse22 .cse5 .cse20 .cse6) (let ((.cse25 (+ |old(~local~0)| 1))) (or .cse0 .cse23 .cse22 .cse5 .cse6 .cse21 .cse8 .cse7 (< |old(~token~0)| .cse25) .cse10 .cse11 .cse18 (< .cse25 |old(~token~0)|))) (or .cse0 .cse1 .cse23 .cse2 .cse22 .cse5 .cse4 .cse6 .cse8 .cse7 .cse10 .cse11 .cse18) (or .cse7 .cse8 .cse0 .cse10 .cse18 .cse24 .cse22 (and .cse13 .cse26 .cse17) .cse5 .cse20 .cse6)))))) [2018-11-18 14:55:15,004 INFO L421 ceAbstractionStarter]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse7 (= ~T1_E~0 1))) (let ((.cse40 (not .cse7)) (.cse29 (and (not .cse0) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse41 (not (= ~M_E~0 1))) (.cse31 (not (= ~E_1~0 1)))) (let ((.cse39 (= 1 ~t1_pc~0)) (.cse43 (+ ~local~0 1)) (.cse37 (and (not (= ~t1_pc~0 1)) .cse40 .cse29 .cse41 .cse31)) (.cse38 (<= 2 ~m_st~0))) (let ((.cse19 (= |old(~t1_pc~0)| 1)) (.cse24 (= ~token~0 |old(~token~0)|)) (.cse26 (= ~E_M~0 |old(~E_M~0)|)) (.cse28 (and .cse37 .cse38)) (.cse34 (<= ~token~0 .cse43)) (.cse36 (<= .cse43 ~token~0)) (.cse17 (<= 2 ~t1_st~0)) (.cse42 (<= 2 ~E_M~0)) (.cse35 (and .cse39 .cse40 .cse29 .cse41 .cse38 .cse31)) (.cse25 (<= ~token~0 ~local~0)) (.cse27 (<= ~local~0 ~token~0)) (.cse30 (= ~m_st~0 0)) (.cse32 (not (= ~m_pc~0 1)))) (let ((.cse18 (and .cse37 .cse30 .cse32)) (.cse20 (not (= 0 |old(~m_st~0)|))) (.cse12 (and .cse42 .cse35 .cse25 .cse27)) (.cse13 (and .cse42 .cse34 .cse35 .cse36 .cse17)) (.cse14 (and .cse42 .cse17 (and .cse34 .cse36 (and .cse39 .cse40 .cse29 .cse41 .cse30 .cse31)))) (.cse21 (and .cse17 .cse28)) (.cse1 (< |old(~local~0)| |old(~token~0)|)) (.cse3 (< |old(~token~0)| |old(~local~0)|)) (.cse16 (and .cse35 .cse24 .cse25 .cse17 .cse26 .cse27)) (.cse2 (not .cse19)) (.cse15 (< |old(~t1_st~0)| 2)) (.cse10 (< |old(~E_M~0)| 2)) (.cse8 (and .cse39 .cse40 .cse29 .cse41 .cse38 .cse31 .cse32)) (.cse9 (= 1 |old(~E_1~0)|)) (.cse11 (= 0 |old(~E_1~0)|)) (.cse23 (= 0 |old(~E_M~0)|)) (.cse4 (< |old(~m_st~0)| 2)) (.cse5 (= 0 ~M_E~0)) (.cse22 (= 1 |old(~m_pc~0)|)) (.cse6 (= 1 ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse15 .cse7 .cse16 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse3 (and .cse17 .cse18) .cse19 .cse5 .cse6 .cse8 .cse15 .cse7 .cse20 .cse9 .cse21 .cse10 .cse11 .cse22) (or .cse8 .cse7 .cse0 .cse9 .cse11 .cse2 .cse23 .cse4 .cse5 .cse22 .cse6) (or .cse0 (and .cse24 .cse25 .cse18 .cse26 .cse27) .cse1 .cse3 .cse19 (and .cse25 .cse28 .cse26 .cse27) .cse5 .cse6 .cse8 .cse7 .cse20 .cse9 .cse10 .cse11 .cse12 (and .cse24 .cse25 (and .cse29 .cse30 .cse31 .cse32) .cse17 .cse26 .cse27) .cse13 .cse14 .cse22) (or .cse0 .cse1 .cse3 .cse19 .cse4 .cse5 .cse6 .cse21 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse3 (and .cse24 .cse25 .cse28 .cse26 .cse27) .cse19 .cse4 .cse5 .cse6 .cse8 .cse7 .cse16 .cse9 .cse10 .cse11) (let ((.cse33 (+ |old(~local~0)| 1))) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse15 .cse7 .cse8 (< |old(~token~0)| .cse33) .cse9 (and .cse34 .cse35 .cse24 .cse36 .cse17 .cse26) .cse10 .cse11 (< .cse33 |old(~token~0)|))) (or .cse8 .cse7 .cse0 .cse9 .cse11 .cse23 .cse4 (and .cse37 .cse38 .cse32) .cse5 .cse22 .cse6))))))) [2018-11-18 14:55:15,004 INFO L425 ceAbstractionStarter]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2018-11-18 14:55:15,005 INFO L421 ceAbstractionStarter]: At program point L216(line 216) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0))) (let ((.cse21 (= 1 ~t1_pc~0)) (.cse18 (= eval_~tmp~0 1)) (.cse14 (<= 2 ~t1_st~0)) (.cse0 (= ~T1_E~0 1)) (.cse22 (and (not .cse1) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse23 (not (= ~E_1~0 1)))) (let ((.cse10 (= |old(~t1_pc~0)| 1)) (.cse13 (and (not (= ~t1_pc~0 1)) (not .cse0) .cse22 (not (= ~M_E~0 1)) .cse23)) (.cse12 (not (= 0 |old(~m_st~0)|))) (.cse6 (= 1 |old(~m_pc~0)|)) (.cse11 (< |old(~t1_st~0)| 2)) (.cse17 (and (<= 2 ~E_M~0) (let ((.cse24 (+ ~local~0 1))) (and .cse21 (<= ~token~0 .cse24) .cse22 (<= .cse24 ~token~0) .cse18 .cse23)) .cse14)) (.cse8 (< |old(~local~0)| |old(~token~0)|)) (.cse9 (< |old(~token~0)| |old(~local~0)|)) (.cse4 (< |old(~m_st~0)| 2)) (.cse5 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse2 (= 1 |old(~E_1~0)|)) (.cse15 (< |old(~E_M~0)| 2)) (.cse3 (= 0 |old(~E_1~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 (= 0 |old(~E_M~0)|) .cse4 .cse5 .cse6 .cse7) (or .cse1 .cse8 .cse9 .cse10 .cse5 .cse7 .cse11 .cse0 .cse12 .cse2 (and .cse13 .cse14) .cse15 .cse3 .cse6) (or .cse0 .cse1 .cse2 .cse15 .cse8 .cse3 .cse9 .cse10 .cse4 .cse5 .cse7) (let ((.cse16 (+ |old(~local~0)| 1))) (or .cse1 (not .cse10) .cse4 .cse5 .cse7 .cse11 .cse0 (< |old(~token~0)| .cse16) .cse2 .cse15 .cse3 (< .cse16 |old(~token~0)|))) (let ((.cse20 (not (= ~m_pc~0 1))) (.cse19 (= ~E_M~0 |old(~E_M~0)|))) (or .cse1 .cse17 .cse8 .cse9 .cse10 (and (= ~token~0 |old(~token~0)|) .cse13 (<= ~token~0 ~local~0) .cse18 .cse19 (<= ~local~0 ~token~0) .cse20) .cse5 (and (and .cse21 .cse22 .cse18 .cse23 .cse20) .cse14 .cse19) .cse7 .cse0 .cse12 .cse2 .cse15 .cse3 .cse6)) (or .cse1 .cse8 .cse9 .cse4 .cse5 .cse7 .cse11 .cse0 .cse2 .cse15 .cse3) (or .cse1 .cse17 .cse8 .cse9 .cse4 .cse5 .cse7 .cse0 .cse2 .cse15 .cse3))))) [2018-11-18 14:55:15,005 INFO L425 ceAbstractionStarter]: For program point L210(lines 200 238) no Hoare annotation was computed. [2018-11-18 14:55:15,005 INFO L421 ceAbstractionStarter]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse6 (= ~T1_E~0 1))) (let ((.cse38 (+ ~local~0 1)) (.cse35 (not .cse6)) (.cse12 (and (not .cse0) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse36 (not (= ~M_E~0 1))) (.cse17 (not (= ~E_1~0 1)))) (let ((.cse34 (not (= ~m_pc~0 1))) (.cse26 (and (not (= ~t1_pc~0 1)) .cse35 .cse12 .cse36 .cse17)) (.cse23 (= |old(~t1_pc~0)| 1)) (.cse13 (= ~token~0 |old(~token~0)|)) (.cse18 (= ~E_M~0 |old(~E_M~0)|)) (.cse11 (<= ~token~0 .cse38)) (.cse14 (<= .cse38 ~token~0)) (.cse16 (<= 2 ~t1_st~0)) (.cse37 (<= 2 ~E_M~0)) (.cse10 (= 1 ~t1_pc~0)) (.cse27 (<= ~token~0 ~local~0)) (.cse15 (<= 2 ~m_st~0)) (.cse28 (<= ~local~0 ~token~0))) (let ((.cse29 (and .cse37 .cse10 .cse35 .cse12 .cse36 .cse27 .cse15 .cse17 .cse28)) (.cse30 (and .cse37 .cse10 .cse11 .cse35 .cse12 .cse36 .cse14 .cse15 .cse16 .cse17)) (.cse32 (and .cse10 .cse12 .cse13 .cse27 .cse15 .cse16 .cse17 .cse18 .cse28)) (.cse1 (not .cse23)) (.cse24 (and .cse26 .cse16)) (.cse21 (< |old(~local~0)| |old(~token~0)|)) (.cse22 (< |old(~token~0)| |old(~local~0)|)) (.cse5 (< |old(~t1_st~0)| 2)) (.cse25 (not (= 0 |old(~m_st~0)|))) (.cse19 (< |old(~E_M~0)| 2)) (.cse7 (and .cse10 .cse35 .cse12 .cse36 .cse15 .cse17 .cse34)) (.cse9 (= 1 |old(~E_1~0)|)) (.cse20 (= 0 |old(~E_1~0)|)) (.cse33 (= 0 |old(~E_M~0)|)) (.cse2 (< |old(~m_st~0)| 2)) (.cse3 (= 0 ~M_E~0)) (.cse31 (= 1 |old(~m_pc~0)|)) (.cse4 (= 1 ~M_E~0))) (and (let ((.cse8 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< |old(~token~0)| .cse8) .cse9 (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse19 .cse20 (< .cse8 |old(~token~0)|))) (or .cse0 .cse21 .cse22 .cse23 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse19 .cse24 .cse20) (or .cse0 .cse21 .cse22 .cse23 .cse3 .cse4 .cse7 .cse6 .cse25 (and .cse26 .cse27 .cse15 .cse18 .cse28) .cse9 .cse29 .cse19 .cse30 .cse20 .cse31) (or .cse32 .cse0 .cse21 .cse1 .cse22 .cse2 .cse3 .cse4 .cse7 .cse5 .cse6 .cse9 .cse19 .cse20) (or .cse0 .cse21 .cse1 .cse22 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse29 .cse19 .cse30 .cse20) (or .cse32 (and .cse13 .cse26 .cse27 .cse15 .cse18 .cse28) .cse0 .cse21 .cse22 .cse23 .cse2 .cse3 .cse4 .cse7 .cse6 .cse9 .cse19 .cse20) (or .cse7 .cse6 .cse0 .cse9 .cse20 .cse1 .cse33 .cse2 .cse3 .cse31 .cse4) (or .cse0 .cse24 .cse21 .cse22 .cse23 .cse3 .cse4 .cse7 .cse5 .cse6 .cse25 .cse9 .cse19 .cse20 .cse31) (or .cse7 .cse6 .cse0 .cse9 .cse20 .cse33 .cse2 (and .cse26 .cse15 .cse34) .cse3 .cse31 .cse4)))))) [2018-11-18 14:55:15,005 INFO L425 ceAbstractionStarter]: For program point L200-1(lines 200 238) no Hoare annotation was computed. [2018-11-18 14:55:15,005 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 234) no Hoare annotation was computed. [2018-11-18 14:55:15,005 INFO L428 ceAbstractionStarter]: At program point L399(lines 388 401) the Hoare annotation is: true [2018-11-18 14:55:15,005 INFO L425 ceAbstractionStarter]: For program point L392(lines 392 397) no Hoare annotation was computed. [2018-11-18 14:55:15,005 INFO L428 ceAbstractionStarter]: At program point L390(line 390) the Hoare annotation is: true [2018-11-18 14:55:15,006 INFO L425 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2018-11-18 14:55:15,006 INFO L425 ceAbstractionStarter]: For program point L390-1(line 390) no Hoare annotation was computed. [2018-11-18 14:55:15,006 INFO L428 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2018-11-18 14:55:15,006 INFO L425 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2018-11-18 14:55:15,006 INFO L425 ceAbstractionStarter]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2018-11-18 14:55:15,006 INFO L428 ceAbstractionStarter]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2018-11-18 14:55:15,006 INFO L421 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse4 (< ~m_st~0 2)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse2 (< ~local~0 ~token~0)) (.cse3 (< ~token~0 ~local~0)) (.cse12 (= ~t1_pc~0 1)) (.cse0 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (= |old(~E_M~0)| ~E_M~0))) (.cse5 (= 0 |old(~M_E~0)|)) (.cse6 (= 1 |old(~M_E~0)|)) (.cse7 (= |old(~T1_E~0)| 1)) (.cse8 (= 1 |old(~E_1~0)|)) (.cse9 (< |old(~E_M~0)| 2)) (.cse10 (= 0 |old(~E_1~0)|)) (.cse11 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse7 .cse1 .cse8 .cse0 .cse10 (= 0 |old(~E_M~0)|) .cse4 .cse5 .cse11 .cse6) (let ((.cse13 (+ ~local~0 1))) (or .cse1 (not .cse12) .cse4 .cse5 .cse6 (< ~t1_st~0 2) .cse7 (< ~token~0 .cse13) .cse8 .cse0 .cse9 .cse10 (< .cse13 ~token~0))) (or .cse1 .cse2 .cse3 .cse12 .cse0 .cse5 .cse6 .cse7 (not (= 0 ~m_st~0)) .cse8 .cse9 .cse10 .cse11))) [2018-11-18 14:55:15,006 INFO L425 ceAbstractionStarter]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2018-11-18 14:55:15,006 INFO L425 ceAbstractionStarter]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2018-11-18 14:55:15,006 INFO L425 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2018-11-18 14:55:15,006 INFO L425 ceAbstractionStarter]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2018-11-18 14:55:15,006 INFO L425 ceAbstractionStarter]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2018-11-18 14:55:15,006 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-18 14:55:15,007 INFO L421 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (= |old(~E_1~0)| ~E_1~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= |old(~M_E~0)| ~M_E~0)) (.cse5 (= |old(~E_M~0)| ~E_M~0))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0) .cse5) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-18 14:55:15,007 INFO L421 ceAbstractionStarter]: At program point L411(line 411) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0) (= |old(~E_M~0)| ~E_M~0)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 14:55:15,007 INFO L425 ceAbstractionStarter]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2018-11-18 14:55:15,007 INFO L421 ceAbstractionStarter]: At program point L411-1(line 411) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0) (= |old(~E_M~0)| ~E_M~0)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 14:55:15,007 INFO L421 ceAbstractionStarter]: At program point L440(line 440) the Hoare annotation is: (let ((.cse8 (not (= ~T1_E~0 1))) (.cse10 (not (= ~M_E~0 1))) (.cse11 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse9 (= |old(~T1_E~0)| ~T1_E~0)) (.cse12 (not (= ~E_1~0 1)))) (let ((.cse2 (not (= ~m_pc~0 1))) (.cse4 (<= 2 ~E_M~0)) (.cse3 (and .cse8 (and (= 1 ~t1_pc~0) .cse10 .cse11) .cse9 .cse12)) (.cse5 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse8 .cse9 (and (not (= ~t1_pc~0 1)) .cse10 .cse11) .cse12)) (.cse6 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2) (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (and .cse0 .cse3 .cse2) (= |old(~t1_pc~0)| 1) (and .cse4 .cse5 .cse0 .cse6 .cse3) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (let ((.cse7 (+ ~local~0 1))) (and .cse4 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse0 (<= 2 ~t1_st~0) .cse3)) (and .cse5 .cse0 .cse1 (= ~E_M~0 |old(~E_M~0)|) .cse6) (= 1 |old(~m_pc~0)|)))) [2018-11-18 14:55:15,007 INFO L421 ceAbstractionStarter]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse8 (not (= ~T1_E~0 1))) (.cse9 (= |old(~T1_E~0)| ~T1_E~0)) (.cse10 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse11 (not (= ~E_1~0 1)))) (let ((.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= ~local~0 ~token~0)) (.cse3 (<= 2 ~E_M~0)) (.cse0 (and (= 1 ~t1_pc~0) .cse8 .cse9 .cse10 .cse11)) (.cse6 (and (not (= ~t1_pc~0 1)) .cse8 .cse9 .cse10 .cse11)) (.cse1 (<= 2 ~m_st~0)) (.cse2 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 .cse2) (= |old(~T1_E~0)| 0) (and .cse3 .cse0 .cse4 .cse1 .cse5) (and .cse6 .cse4 .cse1 (= ~E_M~0 |old(~E_M~0)|) .cse5) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (let ((.cse7 (+ ~local~0 1))) (and .cse3 (<= ~token~0 .cse7) .cse0 (<= .cse7 ~token~0) .cse1 (<= 2 ~t1_st~0))) (and .cse6 .cse1 .cse2) (= 1 |old(~m_pc~0)|)))) [2018-11-18 14:55:15,008 INFO L421 ceAbstractionStarter]: At program point L432(line 432) the Hoare annotation is: (let ((.cse8 (not (= ~T1_E~0 1))) (.cse10 (not (= ~M_E~0 1))) (.cse11 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse9 (= |old(~T1_E~0)| ~T1_E~0)) (.cse12 (not (= ~E_1~0 1)))) (let ((.cse2 (not (= ~m_pc~0 1))) (.cse4 (<= 2 ~E_M~0)) (.cse3 (and .cse8 (and (= 1 ~t1_pc~0) .cse10 .cse11) .cse9 .cse12)) (.cse5 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse8 .cse9 (and (not (= ~t1_pc~0 1)) .cse10 .cse11) .cse12)) (.cse6 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2) (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (and .cse0 .cse3 .cse2) (= |old(~t1_pc~0)| 1) (and .cse4 .cse5 .cse0 .cse6 .cse3) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (let ((.cse7 (+ ~local~0 1))) (and .cse4 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse0 (<= 2 ~t1_st~0) .cse3)) (and .cse5 .cse0 .cse1 (= ~E_M~0 |old(~E_M~0)|) .cse6) (= 1 |old(~m_pc~0)|)))) [2018-11-18 14:55:15,008 INFO L421 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (let ((.cse8 (not (= ~T1_E~0 1))) (.cse10 (not (= ~M_E~0 1))) (.cse11 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse9 (= |old(~T1_E~0)| ~T1_E~0)) (.cse12 (not (= ~E_1~0 1)))) (let ((.cse2 (not (= ~m_pc~0 1))) (.cse4 (<= 2 ~E_M~0)) (.cse3 (and .cse8 (and (= 1 ~t1_pc~0) .cse10 .cse11) .cse9 .cse12)) (.cse5 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse8 .cse9 (and (not (= ~t1_pc~0 1)) .cse10 .cse11) .cse12)) (.cse6 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2) (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (and .cse0 .cse3 .cse2) (= |old(~t1_pc~0)| 1) (and .cse4 .cse5 .cse0 .cse6 .cse3) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (let ((.cse7 (+ ~local~0 1))) (and .cse4 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse0 (<= 2 ~t1_st~0) .cse3)) (and .cse5 .cse0 .cse1 (= ~E_M~0 |old(~E_M~0)|) .cse6) (= 1 |old(~m_pc~0)|)))) [2018-11-18 14:55:15,008 INFO L421 ceAbstractionStarter]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse8 (not (= ~T1_E~0 1))) (.cse10 (not (= ~M_E~0 1))) (.cse11 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse9 (= |old(~T1_E~0)| ~T1_E~0)) (.cse12 (not (= ~E_1~0 1)))) (let ((.cse2 (not (= ~m_pc~0 1))) (.cse4 (<= 2 ~E_M~0)) (.cse3 (and .cse8 (and (= 1 ~t1_pc~0) .cse10 .cse11) .cse9 .cse12)) (.cse5 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse8 .cse9 (and (not (= ~t1_pc~0 1)) .cse10 .cse11) .cse12)) (.cse6 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2) (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (and .cse0 .cse3 .cse2) (= |old(~t1_pc~0)| 1) (and .cse4 .cse5 .cse0 .cse6 .cse3) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (let ((.cse7 (+ ~local~0 1))) (and .cse4 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse0 (<= 2 ~t1_st~0) .cse3)) (and .cse5 .cse0 .cse1 (= ~E_M~0 |old(~E_M~0)|) .cse6) (= 1 |old(~m_pc~0)|)))) [2018-11-18 14:55:15,008 INFO L421 ceAbstractionStarter]: At program point L426(line 426) the Hoare annotation is: (let ((.cse8 (not (= ~T1_E~0 1))) (.cse10 (not (= ~M_E~0 1))) (.cse11 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse9 (= |old(~T1_E~0)| ~T1_E~0)) (.cse12 (not (= ~E_1~0 1)))) (let ((.cse2 (not (= ~m_pc~0 1))) (.cse4 (<= 2 ~E_M~0)) (.cse3 (and .cse8 (and (= 1 ~t1_pc~0) .cse10 .cse11) .cse9 .cse12)) (.cse5 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse8 .cse9 (and (not (= ~t1_pc~0 1)) .cse10 .cse11) .cse12)) (.cse6 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2) (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (and .cse0 .cse3 .cse2) (= |old(~t1_pc~0)| 1) (and .cse4 .cse5 .cse0 .cse6 .cse3) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (let ((.cse7 (+ ~local~0 1))) (and .cse4 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse0 (<= 2 ~t1_st~0) .cse3)) (and .cse5 .cse0 .cse1 (= ~E_M~0 |old(~E_M~0)|) .cse6) (= 1 |old(~m_pc~0)|)))) [2018-11-18 14:55:15,008 INFO L425 ceAbstractionStarter]: For program point L426-1(line 426) no Hoare annotation was computed. [2018-11-18 14:55:15,009 INFO L421 ceAbstractionStarter]: At program point L422(line 422) the Hoare annotation is: (let ((.cse9 (not (= ~T1_E~0 1))) (.cse11 (not (= ~M_E~0 1))) (.cse12 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse10 (= |old(~T1_E~0)| ~T1_E~0)) (.cse13 (not (= ~E_1~0 1)))) (let ((.cse2 (not (= ~m_pc~0 1))) (.cse7 (<= 2 ~E_M~0)) (.cse6 (and .cse9 (and (= 1 ~t1_pc~0) .cse11 .cse12) .cse10 .cse13)) (.cse3 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse9 .cse10 (and (not (= ~t1_pc~0 1)) .cse11 .cse12) .cse13)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse4 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2) (= |old(~T1_E~0)| 0) (and (and (= ~m_st~0 0) .cse3 .cse1 .cse4 .cse2) .cse5) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (and .cse0 .cse6 .cse2) (= |old(~t1_pc~0)| 1) (and .cse7 .cse3 .cse0 .cse4 .cse6) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (let ((.cse8 (+ ~local~0 1))) (and .cse7 (<= ~token~0 .cse8) (<= .cse8 ~token~0) .cse0 (<= 2 ~t1_st~0) .cse6)) (and .cse3 .cse0 .cse1 .cse5 .cse4) (= 1 |old(~m_pc~0)|)))) [2018-11-18 14:55:15,009 INFO L425 ceAbstractionStarter]: For program point L422-1(line 422) no Hoare annotation was computed. [2018-11-18 14:55:15,009 INFO L425 ceAbstractionStarter]: For program point L418(lines 418 455) no Hoare annotation was computed. [2018-11-18 14:55:15,009 INFO L421 ceAbstractionStarter]: At program point start_simulationENTRY(lines 403 461) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and (not (= ~t1_pc~0 1)) (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (<= ~token~0 ~local~0) (= |old(~M_E~0)| ~M_E~0) (<= ~local~0 ~token~0) (= |old(~E_M~0)| ~E_M~0)) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 14:55:15,009 INFO L421 ceAbstractionStarter]: At program point L418-2(lines 415 455) the Hoare annotation is: (let ((.cse9 (not (= ~T1_E~0 1))) (.cse11 (not (= ~M_E~0 1))) (.cse12 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse10 (= |old(~T1_E~0)| ~T1_E~0)) (.cse13 (not (= ~E_1~0 1)))) (let ((.cse2 (not (= ~m_pc~0 1))) (.cse7 (<= 2 ~E_M~0)) (.cse6 (and .cse9 (and (= 1 ~t1_pc~0) .cse11 .cse12) .cse10 .cse13)) (.cse3 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse9 .cse10 (and (not (= ~t1_pc~0 1)) .cse11 .cse12) .cse13)) (.cse5 (= ~E_M~0 |old(~E_M~0)|)) (.cse4 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2) (= |old(~T1_E~0)| 0) (and (and (= ~m_st~0 0) .cse3 .cse1 .cse4 .cse2) .cse5) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (and .cse0 .cse6 .cse2) (= |old(~t1_pc~0)| 1) (and .cse7 .cse3 .cse0 .cse4 .cse6) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (let ((.cse8 (+ ~local~0 1))) (and .cse7 (<= ~token~0 .cse8) (<= .cse8 ~token~0) .cse0 (<= 2 ~t1_st~0) .cse6)) (and .cse3 .cse0 .cse1 .cse5 .cse4) (= 1 |old(~m_pc~0)|)))) [2018-11-18 14:55:15,009 INFO L421 ceAbstractionStarter]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (= |old(~E_1~0)| ~E_1~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= |old(~M_E~0)| ~M_E~0)) (.cse5 (= |old(~E_M~0)| ~E_M~0))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0) .cse5) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-18 14:55:15,009 INFO L421 ceAbstractionStarter]: At program point L412(line 412) the Hoare annotation is: (let ((.cse0 (not (= ~t1_pc~0 1))) (.cse1 (= |old(~E_1~0)| ~E_1~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= |old(~T1_E~0)| ~T1_E~0)) (.cse4 (= |old(~M_E~0)| ~M_E~0)) (.cse5 (= |old(~E_M~0)| ~E_M~0))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse0 .cse1 (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (<= ~local~0 ~token~0) .cse5) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (= 1 |old(~m_pc~0)|))) [2018-11-18 14:55:15,010 INFO L421 ceAbstractionStarter]: At program point L441(line 441) the Hoare annotation is: (let ((.cse8 (not (= ~T1_E~0 1))) (.cse9 (= |old(~T1_E~0)| ~T1_E~0)) (.cse10 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse11 (not (= ~E_1~0 1)))) (let ((.cse4 (<= ~token~0 ~local~0)) (.cse5 (<= ~local~0 ~token~0)) (.cse3 (<= 2 ~E_M~0)) (.cse0 (and (= 1 ~t1_pc~0) .cse8 .cse9 .cse10 .cse11)) (.cse6 (and (not (= ~t1_pc~0 1)) .cse8 .cse9 .cse10 .cse11)) (.cse1 (<= 2 ~m_st~0)) (.cse2 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 .cse2) (= |old(~T1_E~0)| 0) (and .cse3 .cse0 .cse4 .cse1 .cse5) (and .cse6 .cse4 .cse1 (= ~E_M~0 |old(~E_M~0)|) .cse5) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (let ((.cse7 (+ ~local~0 1))) (and .cse3 (<= ~token~0 .cse7) .cse0 (<= .cse7 ~token~0) .cse1 (<= 2 ~t1_st~0))) (and .cse6 .cse1 .cse2) (= 1 |old(~m_pc~0)|)))) [2018-11-18 14:55:15,010 INFO L425 ceAbstractionStarter]: For program point L437(lines 437 446) no Hoare annotation was computed. [2018-11-18 14:55:15,010 INFO L421 ceAbstractionStarter]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse8 (not (= ~T1_E~0 1))) (.cse10 (not (= ~M_E~0 1))) (.cse11 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse9 (= |old(~T1_E~0)| ~T1_E~0)) (.cse12 (not (= ~E_1~0 1)))) (let ((.cse2 (not (= ~m_pc~0 1))) (.cse4 (<= 2 ~E_M~0)) (.cse3 (and .cse8 (and (= 1 ~t1_pc~0) .cse10 .cse11) .cse9 .cse12)) (.cse5 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse8 .cse9 (and (not (= ~t1_pc~0 1)) .cse10 .cse11) .cse12)) (.cse6 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2) (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (and .cse0 .cse3 .cse2) (= |old(~t1_pc~0)| 1) (and .cse4 .cse5 .cse0 .cse6 .cse3) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (let ((.cse7 (+ ~local~0 1))) (and .cse4 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse0 (<= 2 ~t1_st~0) .cse3)) (and .cse5 .cse0 .cse1 (= ~E_M~0 |old(~E_M~0)|) .cse6) (= 1 |old(~m_pc~0)|)))) [2018-11-18 14:55:15,010 INFO L425 ceAbstractionStarter]: For program point L435(line 435) no Hoare annotation was computed. [2018-11-18 14:55:15,010 INFO L421 ceAbstractionStarter]: At program point L431(line 431) the Hoare annotation is: (let ((.cse8 (not (= ~T1_E~0 1))) (.cse10 (not (= ~M_E~0 1))) (.cse11 (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse9 (= |old(~T1_E~0)| ~T1_E~0)) (.cse12 (not (= ~E_1~0 1)))) (let ((.cse2 (not (= ~m_pc~0 1))) (.cse4 (<= 2 ~E_M~0)) (.cse3 (and .cse8 (and (= 1 ~t1_pc~0) .cse10 .cse11) .cse9 .cse12)) (.cse5 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~m_st~0)) (.cse1 (and .cse8 .cse9 (and (not (= ~t1_pc~0 1)) .cse10 .cse11) .cse12)) (.cse6 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2) (= |old(~T1_E~0)| 0) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (and .cse0 .cse3 .cse2) (= |old(~t1_pc~0)| 1) (and .cse4 .cse5 .cse0 .cse6 .cse3) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (let ((.cse7 (+ ~local~0 1))) (and .cse4 (<= ~token~0 .cse7) (<= .cse7 ~token~0) .cse0 (<= 2 ~t1_st~0) .cse3)) (and .cse5 .cse0 .cse1 (= ~E_M~0 |old(~E_M~0)|) .cse6) (= 1 |old(~m_pc~0)|)))) [2018-11-18 14:55:15,010 INFO L421 ceAbstractionStarter]: At program point L456(lines 403 461) the Hoare annotation is: (or (= |old(~T1_E~0)| 0) (not (= ~M_E~0 0)) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (< |old(~E_M~0)| 2) (= 0 |old(~E_1~0)|) (= 1 |old(~m_pc~0)|)) [2018-11-18 14:55:15,010 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-18 14:55:15,010 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 454) no Hoare annotation was computed. [2018-11-18 14:55:15,011 INFO L421 ceAbstractionStarter]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse14 (= ~t1_pc~0 1))) (let ((.cse13 (= 1 ~m_pc~0)) (.cse10 (= 1 ~M_E~0)) (.cse5 (< ~local~0 ~token~0)) (.cse8 (< ~token~0 ~local~0)) (.cse3 (= ~T1_E~0 0)) (.cse7 (not .cse14)) (.cse12 (< ~m_st~0 2)) (.cse9 (= 0 ~M_E~0)) (.cse0 (= 0 is_master_triggered_~__retres1~0)) (.cse1 (< ~t1_st~0 2)) (.cse2 (= ~T1_E~0 1)) (.cse11 (= 1 ~E_1~0)) (.cse4 (< ~E_M~0 2)) (.cse6 (= 0 ~E_1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse2 .cse3 .cse11 .cse0 .cse6 (= 0 ~E_M~0) .cse12 .cse9 .cse13) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse14 .cse9 .cse13 .cse10 .cse0) (or .cse3 .cse5 .cse8 .cse0 .cse12 .cse9 .cse2 .cse11 .cse4 .cse6) (let ((.cse15 (+ ~local~0 1))) (or .cse3 .cse7 .cse12 .cse9 .cse0 .cse1 .cse2 .cse11 (< ~token~0 .cse15) .cse4 .cse6 (< .cse15 ~token~0)))))) [2018-11-18 14:55:15,011 INFO L425 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2018-11-18 14:55:15,011 INFO L425 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2018-11-18 14:55:15,011 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 123) no Hoare annotation was computed. [2018-11-18 14:55:15,011 INFO L425 ceAbstractionStarter]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2018-11-18 14:55:15,011 INFO L425 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2018-11-18 14:55:15,011 INFO L428 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2018-11-18 14:55:15,011 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 14:55:15,011 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 2 ~E_M~0) (not (= ~t1_pc~0 1)) (not (= ~T1_E~0 0)) (not (= ~T1_E~0 1)) (= ~m_st~0 0) (not (= ~M_E~0 1)) (not (= ~M_E~0 0)) (<= ~token~0 ~local~0) (not (= ~E_1~0 0)) (not (= ~E_1~0 1)) (<= ~local~0 ~token~0) (not (= ~m_pc~0 1))) [2018-11-18 14:55:15,012 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 14:55:15,013 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 14:55:15,013 INFO L425 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2018-11-18 14:55:15,013 INFO L425 ceAbstractionStarter]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2018-11-18 14:55:15,013 INFO L421 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse1 (= |old(~T1_E~0)| 0)) (.cse5 (< ~m_st~0 2)) (.cse6 (= 0 |old(~M_E~0)|)) (.cse3 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0) (= |old(~E_M~0)| ~E_M~0))) (.cse0 (= |old(~T1_E~0)| 1)) (.cse2 (= 1 |old(~E_1~0)|)) (.cse7 (< |old(~E_M~0)| 2)) (.cse4 (= 0 |old(~E_1~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 |old(~E_M~0)|) .cse5 .cse6 (= 1 ~m_pc~0)) (or .cse0 .cse3 .cse1 .cse2 .cse7 (< ~local~0 ~token~0) .cse4 (< ~token~0 ~local~0) .cse5 .cse6) (let ((.cse8 (+ ~local~0 1))) (or .cse1 (not (= ~t1_pc~0 1)) .cse5 .cse6 .cse3 (< ~t1_st~0 2) .cse0 .cse2 (< ~token~0 .cse8) .cse7 .cse4 (< .cse8 ~token~0))))) [2018-11-18 14:55:15,013 INFO L425 ceAbstractionStarter]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2018-11-18 14:55:15,013 INFO L425 ceAbstractionStarter]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2018-11-18 14:55:15,013 INFO L425 ceAbstractionStarter]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2018-11-18 14:55:15,013 INFO L425 ceAbstractionStarter]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2018-11-18 14:55:15,013 INFO L425 ceAbstractionStarter]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2018-11-18 14:55:15,013 INFO L428 ceAbstractionStarter]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: true [2018-11-18 14:55:15,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:55:15 BoogieIcfgContainer [2018-11-18 14:55:15,059 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 14:55:15,059 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:55:15,059 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:55:15,059 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:55:15,059 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:54:56" (3/4) ... [2018-11-18 14:55:15,064 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 14:55:15,069 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit1 [2018-11-18 14:55:15,070 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-18 14:55:15,070 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2018-11-18 14:55:15,070 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-18 14:55:15,070 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit1_triggered [2018-11-18 14:55:15,070 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-18 14:55:15,070 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-18 14:55:15,070 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 14:55:15,070 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-18 14:55:15,070 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure master [2018-11-18 14:55:15,070 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 14:55:15,070 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_time_events [2018-11-18 14:55:15,070 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-18 14:55:15,070 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-18 14:55:15,070 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-18 14:55:15,070 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-18 14:55:15,071 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-18 14:55:15,071 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_master_triggered [2018-11-18 14:55:15,071 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_time_events [2018-11-18 14:55:15,071 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-18 14:55:15,077 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2018-11-18 14:55:15,077 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 14:55:15,096 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((2 <= m_st && ((!(T1_E == 1) && \old(T1_E) == T1_E) && (!(t1_pc == 1) && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) || \old(T1_E) == 0) || (((((m_st == 0 && token <= local) && ((!(T1_E == 1) && \old(T1_E) == T1_E) && (!(t1_pc == 1) && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_1 == 1)) && local <= token) && !(m_pc == 1)) && E_M == \old(E_M))) || \old(local) < \old(token)) || \old(token) < \old(local)) || ((2 <= m_st && ((!(T1_E == 1) && (1 == t1_pc && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && \old(T1_E) == T1_E) && !(E_1 == 1)) && !(m_pc == 1))) || \old(t1_pc) == 1) || ((((2 <= E_M && token <= local) && 2 <= m_st) && local <= token) && ((!(T1_E == 1) && (1 == t1_pc && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && \old(T1_E) == T1_E) && !(E_1 == 1))) || 0 == \old(M_E)) || 1 == \old(M_E)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || (((((2 <= E_M && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && ((!(T1_E == 1) && (1 == t1_pc && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && \old(T1_E) == T1_E) && !(E_1 == 1))) || ((((token <= local && 2 <= m_st) && ((!(T1_E == 1) && \old(T1_E) == T1_E) && (!(t1_pc == 1) && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_1 == 1)) && E_M == \old(E_M)) && local <= token)) || 1 == \old(m_pc) [2018-11-18 14:55:15,096 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((\old(T1_E) == 0 || !(M_E == 0)) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 0 == \old(M_E)) || 1 == \old(M_E)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || 1 == \old(m_pc) [2018-11-18 14:55:15,097 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((T1_E == 0 || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || T1_E == 1) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || (((2 <= E_M && ((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && token <= local) && local <= token)) || ((((2 <= E_M && token <= local + 1) && ((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && local + 1 <= token) && 2 <= t1_st)) || ((2 <= E_M && 2 <= t1_st) && (token <= local + 1 && local + 1 <= token) && ((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && m_st == 0) && !(E_1 == 1))) && (((((((((((((T1_E == 0 || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || \old(t1_st) < 2) || T1_E == 1) || ((((((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && token == \old(token)) && token <= local) && 2 <= t1_st) && E_M == \old(E_M)) && local <= token)) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1))) && (((((((((((((((T1_E == 0 || \old(local) < \old(token)) || \old(token) < \old(local)) || (2 <= t1_st && (((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && m_st == 0) && !(m_pc == 1))) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || (2 <= t1_st && ((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && 2 <= m_st)) || \old(E_M) < 2) || 0 == \old(E_1)) || 1 == \old(m_pc))) && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1)) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(\old(t1_pc) == 1)) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && ((((((((((((((((((T1_E == 0 || ((((token == \old(token) && token <= local) && (((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && m_st == 0) && !(m_pc == 1)) && E_M == \old(E_M)) && local <= token)) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((token <= local && ((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && 2 <= m_st) && E_M == \old(E_M)) && local <= token)) || 0 == M_E) || 1 == M_E) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || (((2 <= E_M && ((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && token <= local) && local <= token)) || (((((token == \old(token) && token <= local) && (((((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && m_st == 0) && !(E_1 == 1)) && !(m_pc == 1)) && 2 <= t1_st) && E_M == \old(E_M)) && local <= token)) || ((((2 <= E_M && token <= local + 1) && ((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && local + 1 <= token) && 2 <= t1_st)) || ((2 <= E_M && 2 <= t1_st) && (token <= local + 1 && local + 1 <= token) && ((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && m_st == 0) && !(E_1 == 1))) || 1 == \old(m_pc))) && (((((((((((((T1_E == 0 || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || (2 <= t1_st && ((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && 2 <= m_st)) || \old(t1_st) < 2) || T1_E == 1) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1))) && (((((((((((((T1_E == 0 || \old(local) < \old(token)) || \old(token) < \old(local)) || ((((token == \old(token) && token <= local) && ((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && 2 <= m_st) && E_M == \old(E_M)) && local <= token)) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || T1_E == 1) || ((((((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && token == \old(token)) && token <= local) && 2 <= t1_st) && E_M == \old(E_M)) && local <= token)) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1))) && (((((((((((((T1_E == 0 || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || T1_E == 1) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || (((((token <= local + 1 && ((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && token == \old(token)) && local + 1 <= token) && 2 <= t1_st) && E_M == \old(E_M))) || \old(E_M) < 2) || 0 == \old(E_1)) || \old(local) + 1 < \old(token))) && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1)) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || \old(m_st) < 2) || ((((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) [2018-11-18 14:55:15,097 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((T1_E == 0 || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || T1_E == 1) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || ((((((((1 == t1_pc && token <= local + 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && token == \old(token)) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && !(E_1 == 1)) && E_M == \old(E_M))) || \old(E_M) < 2) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) && (((((((((((((T1_E == 0 || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || T1_E == 1) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 1 == \old(E_1)) || \old(E_M) < 2) || (((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && 2 <= t1_st)) || 0 == \old(E_1))) && (((((((((((((((T1_E == 0 || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || T1_E == 1) || !(0 == \old(m_st))) || ((((((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && token <= local) && 2 <= m_st) && E_M == \old(E_M)) && local <= token)) || 1 == \old(E_1)) || ((((((((2 <= E_M && 1 == t1_pc) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && token <= local) && 2 <= m_st) && !(E_1 == 1)) && local <= token)) || \old(E_M) < 2) || (((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && !(E_1 == 1))) || 0 == \old(E_1)) || 1 == \old(m_pc))) && (((((((((((((((((((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && token == \old(token)) && token <= local) && 2 <= m_st) && 2 <= t1_st) && !(E_1 == 1)) && E_M == \old(E_M)) && local <= token) || T1_E == 0) || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1))) && (((((((((((((T1_E == 0 || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || T1_E == 1) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((((((2 <= E_M && 1 == t1_pc) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && token <= local) && 2 <= m_st) && !(E_1 == 1)) && local <= token)) || \old(E_M) < 2) || (((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && !(E_1 == 1))) || 0 == \old(E_1))) && (((((((((((((((((((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && token == \old(token)) && token <= local) && 2 <= m_st) && 2 <= t1_st) && !(E_1 == 1)) && E_M == \old(E_M)) && local <= token) || (((((token == \old(token) && (((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && token <= local) && 2 <= m_st) && E_M == \old(E_M)) && local <= token)) || T1_E == 0) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || T1_E == 1) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1))) && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1)) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(\old(t1_pc) == 1)) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && ((((((((((((((T1_E == 0 || (((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && 2 <= t1_st)) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || 1 == \old(m_pc))) && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1)) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || \old(m_st) < 2) || ((((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) [2018-11-18 14:55:15,098 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || ((((!(T1_E == 1) && !(T1_E == 0) && !(E_M == 0)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == E_1) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E) && (((((((((((((T1_E == 0 || ((((!(T1_E == 1) && !(T1_E == 0) && !(E_M == 0)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || local < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < local) || (((2 <= E_M && token <= \old(token) + 1) && m_st == 0) && local + 1 <= token)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || T1_E == 1) || (((2 <= E_M && token <= \old(token) + 1) && local + 1 <= token) && 2 <= m_st)) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1)) && (((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || (((2 <= m_st && token <= local) && E_M == \old(E_M)) && local <= token))) && ((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || (((m_st == 0 && token <= local) && E_M == \old(E_M)) && local <= token)) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || 1 == m_pc) [2018-11-18 14:55:15,098 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token <= local) && E_M == \old(E_M)) && local <= token)) || 0 == M_E) || 1 == M_E) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || 1 == m_pc) && (((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == E_1) || (((((((((1 == t1_pc && !(T1_E == 1)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0))) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((((((((((((T1_E == 0 || local < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < local) || \old(m_st) < 2) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && 2 <= E_M) && token <= \old(token) + 1) && local + 1 <= token)) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && 2 <= E_M) && token <= \old(token) + 1) && local + 1 <= token)) || \old(E_M) < 2) || 0 == E_1) || (((((((((1 == t1_pc && !(T1_E == 1)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)))) && (((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || \old(m_st) < 2) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && token <= local) && E_M == \old(E_M)) && local <= token)) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) [2018-11-18 14:55:15,098 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((T1_E == 0 || 2 <= t1_st) || \old(local) < \old(token)) || \old(token) < \old(local)) || t1_pc == 1) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_1)) || E_M < 2) || 0 == \old(E_1)) || 1 == \old(m_pc)) && (((((((((((T1_E == 0 || (((((((((1 == t1_pc && !(T1_E == 1)) && !(M_E == 0)) && 2 <= m_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && token <= local) && !(E_1 == 0)) && local <= token)) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_1)) || \old(token) < \old(local) + 1) || E_M < 2) || 0 == \old(E_1)) || \old(local) + 1 < \old(token))) && (((((((((((T1_E == 0 || \old(local) < \old(token)) || \old(token) < \old(local)) || t1_pc == 1) || ((((2 <= m_st && !(E_1 == 1)) && token <= local) && !(E_1 == 0)) && local <= token)) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == \old(E_1)) || E_M < 2) || 0 == \old(E_1)) || 1 == \old(m_pc))) && (((\old(t1_st) < 2 || (((((((((1 == t1_pc && !(T1_E == 1)) && !(M_E == 0)) && 2 <= m_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && token <= local) && !(E_1 == 0)) && local <= token)) || ((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || E_M < 2) [2018-11-18 14:55:15,100 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(t1_st) < 2 || ((((((((((1 == t1_pc && !(T1_E == 1)) && \old(E_1) == E_1) && token == \old(token)) && !(M_E == 0)) && 2 <= t1_st) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0))) || ((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || E_M < 2) && (((((((((((T1_E == 0 || \old(local) < \old(token)) || \old(token) < \old(local)) || t1_pc == 1) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == \old(E_1)) || ((((\old(E_1) == E_1 && token == \old(token)) && !(m_pc == 1)) && token <= local) && local <= token)) || E_M < 2) || 0 == \old(E_1)) || 1 == \old(m_pc))) && ((((((((((((T1_E == 0 || ((((token <= local + 1 && \old(E_1) == E_1) && token == \old(token)) && 2 <= t1_st) && local + 1 <= token)) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_1)) || \old(token) < \old(local) + 1) || ((((((((((1 == t1_pc && !(T1_E == 1)) && \old(E_1) == E_1) && token == \old(token)) && !(M_E == 0)) && 2 <= t1_st) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0))) || E_M < 2) || 0 == \old(E_1)) || \old(local) + 1 < \old(token))) && (((((((((((2 <= t1_st || T1_E == 0) || \old(local) < \old(token)) || \old(token) < \old(local)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_1)) || E_M < 2) || 0 == \old(E_1)) || 1 == \old(m_pc)) [2018-11-18 14:55:15,100 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((T1_E == 0 || ((((token <= local + 1 && \old(E_1) == E_1) && token == \old(token)) && 2 <= t1_st) && local + 1 <= token)) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_1)) || \old(token) < \old(local) + 1) || E_M < 2) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) && ((((((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || E_M < 2) || \old(local) < \old(token)) || 0 == \old(E_1)) || \old(token) < \old(local)) || t1_pc == 1) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && ((\old(t1_st) < 2 || ((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || E_M < 2) [2018-11-18 14:55:15,100 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || ((1 == t1_pc && 2 <= m_st) && \old(E_M) == E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E) && ((((((((((((((1 == t1_pc && 2 <= m_st) && token <= local) && local <= token) && \old(E_M) == E_M) || T1_E == 0) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1)) && (((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && ((((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || \old(E_M) < 2) || local < \old(token)) || 0 == E_1) || \old(token) < local) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E)) && (((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || 1 == m_pc) [2018-11-18 14:55:15,138 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1547b617-5b10-402f-84a4-d4b059841fc5/bin-2019/uautomizer/witness.graphml [2018-11-18 14:55:15,138 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:55:15,139 INFO L168 Benchmark]: Toolchain (without parser) took 18873.34 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 716.7 MB). Free memory was 959.1 MB in the beginning and 1.5 GB in the end (delta: -502.5 MB). Peak memory consumption was 214.2 MB. Max. memory is 11.5 GB. [2018-11-18 14:55:15,140 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:55:15,141 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.34 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 942.9 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-11-18 14:55:15,141 INFO L168 Benchmark]: Boogie Preprocessor took 64.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -186.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-18 14:55:15,141 INFO L168 Benchmark]: RCFGBuilder took 323.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. [2018-11-18 14:55:15,142 INFO L168 Benchmark]: TraceAbstraction took 18201.41 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 582.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -366.6 MB). Peak memory consumption was 875.5 MB. Max. memory is 11.5 GB. [2018-11-18 14:55:15,142 INFO L168 Benchmark]: Witness Printer took 79.54 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-18 14:55:15,143 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 201.34 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 942.9 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -186.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 323.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18201.41 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 582.0 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -366.6 MB). Peak memory consumption was 875.5 MB. Max. memory is 11.5 GB. * Witness Printer took 79.54 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: 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: 177]: Loop Invariant Derived loop invariant: (((((((((((((T1_E == 0 || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || __retres1 == 1) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || token < local + 1) || 1 == E_1) || E_M < 2) || 0 == E_1) || local + 1 < token) && ((((((((((((T1_E == 0 || local < token) || token < local) || 0 == M_E) || __retres1 == 1) || 1 == M_E) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || E_M < 2) || 0 == E_1) || 1 == m_pc)) && ((((((((((((T1_E == 0 || local < token) || token < local) || t1_pc == 1) || 0 == M_E) || 1 == M_E) || T1_E == 1) || !(0 == m_st)) || __retres1 == 1) || 1 == E_1) || E_M < 2) || 0 == E_1) || 1 == m_pc) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((((((((((T1_E == 0 || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || T1_E == 1) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || (((2 <= E_M && ((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && token <= local) && local <= token)) || ((((2 <= E_M && token <= local + 1) && ((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && local + 1 <= token) && 2 <= t1_st)) || ((2 <= E_M && 2 <= t1_st) && (token <= local + 1 && local + 1 <= token) && ((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && m_st == 0) && !(E_1 == 1))) && (((((((((((((T1_E == 0 || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || \old(t1_st) < 2) || T1_E == 1) || ((((((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && token == \old(token)) && token <= local) && 2 <= t1_st) && E_M == \old(E_M)) && local <= token)) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1))) && (((((((((((((((T1_E == 0 || \old(local) < \old(token)) || \old(token) < \old(local)) || (2 <= t1_st && (((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && m_st == 0) && !(m_pc == 1))) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || (2 <= t1_st && ((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && 2 <= m_st)) || \old(E_M) < 2) || 0 == \old(E_1)) || 1 == \old(m_pc))) && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1)) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(\old(t1_pc) == 1)) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && ((((((((((((((((((T1_E == 0 || ((((token == \old(token) && token <= local) && (((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && m_st == 0) && !(m_pc == 1)) && E_M == \old(E_M)) && local <= token)) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((token <= local && ((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && 2 <= m_st) && E_M == \old(E_M)) && local <= token)) || 0 == M_E) || 1 == M_E) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || (((2 <= E_M && ((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && token <= local) && local <= token)) || (((((token == \old(token) && token <= local) && (((((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && m_st == 0) && !(E_1 == 1)) && !(m_pc == 1)) && 2 <= t1_st) && E_M == \old(E_M)) && local <= token)) || ((((2 <= E_M && token <= local + 1) && ((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && local + 1 <= token) && 2 <= t1_st)) || ((2 <= E_M && 2 <= t1_st) && (token <= local + 1 && local + 1 <= token) && ((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && m_st == 0) && !(E_1 == 1))) || 1 == \old(m_pc))) && (((((((((((((T1_E == 0 || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || (2 <= t1_st && ((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && 2 <= m_st)) || \old(t1_st) < 2) || T1_E == 1) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1))) && (((((((((((((T1_E == 0 || \old(local) < \old(token)) || \old(token) < \old(local)) || ((((token == \old(token) && token <= local) && ((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && 2 <= m_st) && E_M == \old(E_M)) && local <= token)) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || T1_E == 1) || ((((((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && token == \old(token)) && token <= local) && 2 <= t1_st) && E_M == \old(E_M)) && local <= token)) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1))) && (((((((((((((T1_E == 0 || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || T1_E == 1) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || (((((token <= local + 1 && ((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && token == \old(token)) && local + 1 <= token) && 2 <= t1_st) && E_M == \old(E_M))) || \old(E_M) < 2) || 0 == \old(E_1)) || \old(local) + 1 < \old(token))) && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1)) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || \old(m_st) < 2) || ((((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((((((0 == __retres1 || t1_st < 2) || T1_E == 1) || T1_E == 0) || E_M < 2) || local < token) || 0 == E_1) || !(t1_pc == 1)) || token < local) || 0 == M_E) || 1 == M_E) && ((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == __retres1) || 0 == E_1) || 0 == E_M) || m_st < 2) || 0 == M_E) || 1 == m_pc)) && ((((((((((T1_E == 1 || T1_E == 0) || E_M < 2) || local < token) || 0 == E_1) || token < local) || t1_pc == 1) || 0 == M_E) || 1 == m_pc) || 1 == M_E) || 0 == __retres1)) && (((((((((T1_E == 0 || local < token) || token < local) || 0 == __retres1) || m_st < 2) || 0 == M_E) || T1_E == 1) || 1 == E_1) || E_M < 2) || 0 == E_1)) && (((((((((((T1_E == 0 || !(t1_pc == 1)) || m_st < 2) || 0 == M_E) || 0 == __retres1) || t1_st < 2) || T1_E == 1) || 1 == E_1) || token < local + 1) || E_M < 2) || 0 == E_1) || local + 1 < token) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || ((((!(T1_E == 1) && !(T1_E == 0) && !(E_M == 0)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == E_1) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E) && (((((((((((((T1_E == 0 || ((((!(T1_E == 1) && !(T1_E == 0) && !(E_M == 0)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || local < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < local) || (((2 <= E_M && token <= \old(token) + 1) && m_st == 0) && local + 1 <= token)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || T1_E == 1) || (((2 <= E_M && token <= \old(token) + 1) && local + 1 <= token) && 2 <= m_st)) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1)) && (((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || (((2 <= m_st && token <= local) && E_M == \old(E_M)) && local <= token))) && ((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || (((m_st == 0 && token <= local) && E_M == \old(E_M)) && local <= token)) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || 1 == m_pc) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == 0 || 2 <= t1_st) || \old(local) < \old(token)) || \old(token) < \old(local)) || t1_pc == 1) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_1)) || E_M < 2) || 0 == \old(E_1)) || 1 == \old(m_pc)) && (((((((((((T1_E == 0 || (((((((((1 == t1_pc && !(T1_E == 1)) && !(M_E == 0)) && 2 <= m_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && token <= local) && !(E_1 == 0)) && local <= token)) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_1)) || \old(token) < \old(local) + 1) || E_M < 2) || 0 == \old(E_1)) || \old(local) + 1 < \old(token))) && (((((((((((T1_E == 0 || \old(local) < \old(token)) || \old(token) < \old(local)) || t1_pc == 1) || ((((2 <= m_st && !(E_1 == 1)) && token <= local) && !(E_1 == 0)) && local <= token)) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == \old(E_1)) || E_M < 2) || 0 == \old(E_1)) || 1 == \old(m_pc))) && (((\old(t1_st) < 2 || (((((((((1 == t1_pc && !(T1_E == 1)) && !(M_E == 0)) && 2 <= m_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(M_E == 1)) && token <= local) && !(E_1 == 0)) && local <= token)) || ((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || E_M < 2) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == 0 || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || T1_E == 1) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || ((((((((1 == t1_pc && token <= local + 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && token == \old(token)) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && !(E_1 == 1)) && E_M == \old(E_M))) || \old(E_M) < 2) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) && (((((((((((((T1_E == 0 || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || T1_E == 1) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 1 == \old(E_1)) || \old(E_M) < 2) || (((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && 2 <= t1_st)) || 0 == \old(E_1))) && (((((((((((((((T1_E == 0 || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || T1_E == 1) || !(0 == \old(m_st))) || ((((((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && token <= local) && 2 <= m_st) && E_M == \old(E_M)) && local <= token)) || 1 == \old(E_1)) || ((((((((2 <= E_M && 1 == t1_pc) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && token <= local) && 2 <= m_st) && !(E_1 == 1)) && local <= token)) || \old(E_M) < 2) || (((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && !(E_1 == 1))) || 0 == \old(E_1)) || 1 == \old(m_pc))) && (((((((((((((((((((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && token == \old(token)) && token <= local) && 2 <= m_st) && 2 <= t1_st) && !(E_1 == 1)) && E_M == \old(E_M)) && local <= token) || T1_E == 0) || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1))) && (((((((((((((T1_E == 0 || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || T1_E == 1) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((((((2 <= E_M && 1 == t1_pc) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && token <= local) && 2 <= m_st) && !(E_1 == 1)) && local <= token)) || \old(E_M) < 2) || (((((((((2 <= E_M && 1 == t1_pc) && token <= local + 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && !(E_1 == 1))) || 0 == \old(E_1))) && (((((((((((((((((((((1 == t1_pc && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && token == \old(token)) && token <= local) && 2 <= m_st) && 2 <= t1_st) && !(E_1 == 1)) && E_M == \old(E_M)) && local <= token) || (((((token == \old(token) && (((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && token <= local) && 2 <= m_st) && E_M == \old(E_M)) && local <= token)) || T1_E == 0) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || T1_E == 1) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1))) && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1)) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(\old(t1_pc) == 1)) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && ((((((((((((((T1_E == 0 || (((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && 2 <= t1_st)) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || ((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || 1 == \old(m_pc))) && ((((((((((((((((1 == t1_pc && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1)) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || \old(m_st) < 2) || ((((((!(t1_pc == 1) && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && token <= local) && E_M == \old(E_M)) && local <= token)) || 0 == M_E) || 1 == M_E) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || 1 == m_pc) && (((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == E_1) || (((((((((1 == t1_pc && !(T1_E == 1)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0))) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((((((((((((T1_E == 0 || local < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < local) || \old(m_st) < 2) || (((((1 == t1_pc && m_st == 0) && 2 <= t1_st) && 2 <= E_M) && token <= \old(token) + 1) && local + 1 <= token)) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && 2 <= E_M) && token <= \old(token) + 1) && local + 1 <= token)) || \old(E_M) < 2) || 0 == E_1) || (((((((((1 == t1_pc && !(T1_E == 1)) && 2 <= m_st) && !(M_E == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)))) && (((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || \old(m_st) < 2) || (((((1 == t1_pc && 2 <= m_st) && 2 <= t1_st) && token <= local) && E_M == \old(E_M)) && local <= token)) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || ((1 == t1_pc && 2 <= m_st) && \old(E_M) == E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E) && ((((((((((((((1 == t1_pc && 2 <= m_st) && token <= local) && local <= token) && \old(E_M) == E_M) || T1_E == 0) || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1)) && (((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && ((((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || \old(E_M) < 2) || local < \old(token)) || 0 == E_1) || \old(token) < local) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E)) && (((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || \old(E_M) < 2) || 0 == E_1) || 1 == m_pc) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= m_st && ((!(T1_E == 1) && \old(T1_E) == T1_E) && (!(t1_pc == 1) && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) || \old(T1_E) == 0) || (((((m_st == 0 && token <= local) && ((!(T1_E == 1) && \old(T1_E) == T1_E) && (!(t1_pc == 1) && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_1 == 1)) && local <= token) && !(m_pc == 1)) && E_M == \old(E_M))) || \old(local) < \old(token)) || \old(token) < \old(local)) || ((2 <= m_st && ((!(T1_E == 1) && (1 == t1_pc && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && \old(T1_E) == T1_E) && !(E_1 == 1)) && !(m_pc == 1))) || \old(t1_pc) == 1) || ((((2 <= E_M && token <= local) && 2 <= m_st) && local <= token) && ((!(T1_E == 1) && (1 == t1_pc && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && \old(T1_E) == T1_E) && !(E_1 == 1))) || 0 == \old(M_E)) || 1 == \old(M_E)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || (((((2 <= E_M && token <= local + 1) && local + 1 <= token) && 2 <= m_st) && 2 <= t1_st) && ((!(T1_E == 1) && (1 == t1_pc && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && \old(T1_E) == T1_E) && !(E_1 == 1))) || ((((token <= local && 2 <= m_st) && ((!(T1_E == 1) && \old(T1_E) == T1_E) && (!(t1_pc == 1) && !(M_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_1 == 1)) && E_M == \old(E_M)) && local <= token)) || 1 == \old(m_pc) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((((T1_E == 0 || ((((token <= local + 1 && \old(E_1) == E_1) && token == \old(token)) && 2 <= t1_st) && local + 1 <= token)) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_1)) || \old(token) < \old(local) + 1) || E_M < 2) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) && ((((((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || E_M < 2) || \old(local) < \old(token)) || 0 == \old(E_1)) || \old(token) < \old(local)) || t1_pc == 1) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && ((\old(t1_st) < 2 || ((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || E_M < 2) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == __retres1) || 0 == E_1) || 0 == E_M) || m_st < 2) || 0 == M_E) || 1 == m_pc) && (((((((((((T1_E == 0 || !(t1_pc == 1)) || m_st < 2) || 0 == M_E) || t1_st < 2) || T1_E == 1) || 0 == __retres1) || 1 == E_1) || token < local + 1) || E_M < 2) || 0 == E_1) || local + 1 < token)) && (((((((((((T1_E == 0 || 0 == __retres1) || local < token) || !(t1_pc == 1)) || token < local) || 1 == E_1) || 0 == M_E) || 1 == M_E) || t1_st < 2) || T1_E == 1) || E_M < 2) || 0 == E_1)) && ((((((((((T1_E == 1 || T1_E == 0) || E_M < 2) || local < token) || 0 == E_1) || token < local) || 0 == __retres1) || t1_pc == 1) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((((((((((!(1 == E_M) || T1_E == 0) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || !(0 == m_st)) || T1_E == 1) || 1 == E_1) || token < local + 1) || 0 == E_1) || local + 1 < token) || 0 == __retres1)) && (((((((((T1_E == 1 || 0 == __retres1) || T1_E == 0) || 1 == E_1) || E_M < 2) || local < token) || 0 == E_1) || token < local) || m_st < 2) || 0 == M_E)) && (((((((((((!(1 == E_M) || T1_E == 0) || !(t1_pc == 1)) || m_st < 2) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || token < local + 1) || 0 == E_1) || 0 == __retres1) || local + 1 < token) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: (((((((((((\old(T1_E) == 0 || !(M_E == 0)) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 0 == \old(M_E)) || 1 == \old(M_E)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || \old(E_M) < 2) || 0 == \old(E_1)) || 1 == \old(m_pc) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((\old(t1_st) < 2 || ((((((((((1 == t1_pc && !(T1_E == 1)) && \old(E_1) == E_1) && token == \old(token)) && !(M_E == 0)) && 2 <= t1_st) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0))) || ((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || E_M < 2) && (((((((((((T1_E == 0 || \old(local) < \old(token)) || \old(token) < \old(local)) || t1_pc == 1) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == \old(E_1)) || ((((\old(E_1) == E_1 && token == \old(token)) && !(m_pc == 1)) && token <= local) && local <= token)) || E_M < 2) || 0 == \old(E_1)) || 1 == \old(m_pc))) && ((((((((((((T1_E == 0 || ((((token <= local + 1 && \old(E_1) == E_1) && token == \old(token)) && 2 <= t1_st) && local + 1 <= token)) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_1)) || \old(token) < \old(local) + 1) || ((((((((((1 == t1_pc && !(T1_E == 1)) && \old(E_1) == E_1) && token == \old(token)) && !(M_E == 0)) && 2 <= t1_st) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0))) || E_M < 2) || 0 == \old(E_1)) || \old(local) + 1 < \old(token))) && (((((((((((2 <= t1_st || T1_E == 0) || \old(local) < \old(token)) || \old(token) < \old(local)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_1)) || E_M < 2) || 0 == \old(E_1)) || 1 == \old(m_pc)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 148 locations, 1 error locations. SAFE Result, 18.1s OverallTime, 16 OverallIterations, 6 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 12.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 3281 SDtfs, 3609 SDslu, 4121 SDs, 0 SdLazy, 2754 SolverSat, 1077 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 846 GetRequests, 749 SyntacticMatches, 24 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1501occurred in iteration=14, 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, 16 MinimizatonAttempts, 504 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 2785 PreInvPairs, 3352 NumberOfFragments, 15273 HoareAnnotationTreeSize, 2785 FomulaSimplifications, 92581 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 62 FomulaSimplificationsInter, 65464 FormulaSimplificationTreeSizeReductionInter, 11.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 2587 NumberOfCodeBlocks, 2587 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2568 ConstructedInterpolants, 0 QuantifiedInterpolants, 609284 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2557 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 1397/1449 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...