./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5b28d062-ca64-431d-bbd1-d5f00a9a78a8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5b28d062-ca64-431d-bbd1-d5f00a9a78a8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5b28d062-ca64-431d-bbd1-d5f00a9a78a8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5b28d062-ca64-431d-bbd1-d5f00a9a78a8/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_5b28d062-ca64-431d-bbd1-d5f00a9a78a8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5b28d062-ca64-431d-bbd1-d5f00a9a78a8/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-635dfa2 [2018-12-08 20:29:37,870 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 20:29:37,871 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 20:29:37,879 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 20:29:37,879 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 20:29:37,880 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 20:29:37,880 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 20:29:37,882 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 20:29:37,883 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 20:29:37,883 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 20:29:37,884 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 20:29:37,884 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 20:29:37,885 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 20:29:37,886 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 20:29:37,886 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 20:29:37,887 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 20:29:37,887 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 20:29:37,889 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 20:29:37,890 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 20:29:37,891 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 20:29:37,892 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 20:29:37,892 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 20:29:37,894 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 20:29:37,894 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 20:29:37,894 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 20:29:37,895 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 20:29:37,895 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 20:29:37,896 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 20:29:37,896 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 20:29:37,897 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 20:29:37,897 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 20:29:37,898 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 20:29:37,898 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 20:29:37,898 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 20:29:37,899 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 20:29:37,899 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 20:29:37,899 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5b28d062-ca64-431d-bbd1-d5f00a9a78a8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 20:29:37,907 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 20:29:37,907 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 20:29:37,907 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 20:29:37,907 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 20:29:37,908 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 20:29:37,908 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 20:29:37,908 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 20:29:37,908 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 20:29:37,909 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 20:29:37,909 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 20:29:37,909 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 20:29:37,909 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 20:29:37,909 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 20:29:37,909 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 20:29:37,909 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 20:29:37,910 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 20:29:37,910 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 20:29:37,910 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 20:29:37,910 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 20:29:37,910 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 20:29:37,910 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 20:29:37,911 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 20:29:37,911 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 20:29:37,911 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 20:29:37,911 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 20:29:37,911 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 20:29:37,911 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 20:29:37,911 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 20:29:37,912 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 20:29:37,912 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 20:29:37,912 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_5b28d062-ca64-431d-bbd1-d5f00a9a78a8/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-12-08 20:29:37,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 20:29:37,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 20:29:37,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 20:29:37,944 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 20:29:37,945 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 20:29:37,945 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5b28d062-ca64-431d-bbd1-d5f00a9a78a8/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c [2018-12-08 20:29:37,978 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5b28d062-ca64-431d-bbd1-d5f00a9a78a8/bin-2019/uautomizer/data/cccaaf336/48baac5fa7784f36a01f6e64b196fcb1/FLAGf9bd54bcd [2018-12-08 20:29:38,343 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 20:29:38,344 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5b28d062-ca64-431d-bbd1-d5f00a9a78a8/sv-benchmarks/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c [2018-12-08 20:29:38,350 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5b28d062-ca64-431d-bbd1-d5f00a9a78a8/bin-2019/uautomizer/data/cccaaf336/48baac5fa7784f36a01f6e64b196fcb1/FLAGf9bd54bcd [2018-12-08 20:29:38,704 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5b28d062-ca64-431d-bbd1-d5f00a9a78a8/bin-2019/uautomizer/data/cccaaf336/48baac5fa7784f36a01f6e64b196fcb1 [2018-12-08 20:29:38,706 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 20:29:38,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 20:29:38,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 20:29:38,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 20:29:38,709 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 20:29:38,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:29:38" (1/1) ... [2018-12-08 20:29:38,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c8dc319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:29:38, skipping insertion in model container [2018-12-08 20:29:38,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:29:38" (1/1) ... [2018-12-08 20:29:38,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 20:29:38,731 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 20:29:38,830 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:29:38,834 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 20:29:38,852 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:29:38,862 INFO L195 MainTranslator]: Completed translation [2018-12-08 20:29:38,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:29:38 WrapperNode [2018-12-08 20:29:38,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 20:29:38,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 20:29:38,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 20:29:38,863 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 20:29:38,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:29:38" (1/1) ... [2018-12-08 20:29:38,871 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:29:38" (1/1) ... [2018-12-08 20:29:38,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 20:29:38,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 20:29:38,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 20:29:38,906 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 20:29:38,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:29:38" (1/1) ... [2018-12-08 20:29:38,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:29:38" (1/1) ... [2018-12-08 20:29:38,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:29:38" (1/1) ... [2018-12-08 20:29:38,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:29:38" (1/1) ... [2018-12-08 20:29:38,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:29:38" (1/1) ... [2018-12-08 20:29:38,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:29:38" (1/1) ... [2018-12-08 20:29:38,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:29:38" (1/1) ... [2018-12-08 20:29:38,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 20:29:38,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 20:29:38,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 20:29:38,926 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 20:29:38,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:29:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b28d062-ca64-431d-bbd1-d5f00a9a78a8/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-12-08 20:29:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-12-08 20:29:38,958 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-12-08 20:29:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-12-08 20:29:38,958 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-12-08 20:29:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-12-08 20:29:38,959 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-12-08 20:29:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-12-08 20:29:38,959 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-12-08 20:29:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-12-08 20:29:38,959 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-12-08 20:29:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-12-08 20:29:38,959 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-12-08 20:29:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-12-08 20:29:38,959 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-12-08 20:29:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 20:29:38,960 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 20:29:38,960 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-12-08 20:29:38,960 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-12-08 20:29:38,960 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-12-08 20:29:38,960 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-12-08 20:29:38,960 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-12-08 20:29:38,960 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-12-08 20:29:38,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 20:29:38,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 20:29:38,961 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-12-08 20:29:38,961 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-12-08 20:29:38,961 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-12-08 20:29:38,961 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-12-08 20:29:38,961 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-12-08 20:29:38,961 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-12-08 20:29:38,961 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-12-08 20:29:38,961 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-12-08 20:29:38,961 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-12-08 20:29:38,961 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-12-08 20:29:38,961 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-12-08 20:29:38,961 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-12-08 20:29:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 20:29:38,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 20:29:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-12-08 20:29:38,962 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-12-08 20:29:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-12-08 20:29:38,962 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-12-08 20:29:39,197 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 20:29:39,198 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-08 20:29:39,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:29:39 BoogieIcfgContainer [2018-12-08 20:29:39,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 20:29:39,198 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 20:29:39,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 20:29:39,201 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 20:29:39,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 08:29:38" (1/3) ... [2018-12-08 20:29:39,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41de886a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:29:39, skipping insertion in model container [2018-12-08 20:29:39,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:29:38" (2/3) ... [2018-12-08 20:29:39,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41de886a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:29:39, skipping insertion in model container [2018-12-08 20:29:39,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:29:39" (3/3) ... [2018-12-08 20:29:39,203 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01_true-unreach-call_false-termination.cil.c [2018-12-08 20:29:39,208 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 20:29:39,213 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 20:29:39,223 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 20:29:39,241 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 20:29:39,242 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 20:29:39,242 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 20:29:39,242 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 20:29:39,242 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 20:29:39,242 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 20:29:39,242 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 20:29:39,242 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 20:29:39,242 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 20:29:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-12-08 20:29:39,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 20:29:39,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:29:39,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:29:39,262 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:29:39,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:29:39,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1448456726, now seen corresponding path program 1 times [2018-12-08 20:29:39,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:29:39,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:29:39,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:39,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:29:39,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:29:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:29:39,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:29:39,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:29:39,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:29:39,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:29:39,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:29:39,461 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2018-12-08 20:29:39,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:29:39,695 INFO L93 Difference]: Finished difference Result 298 states and 424 transitions. [2018-12-08 20:29:39,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:29:39,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-12-08 20:29:39,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:29:39,707 INFO L225 Difference]: With dead ends: 298 [2018-12-08 20:29:39,707 INFO L226 Difference]: Without dead ends: 161 [2018-12-08 20:29:39,711 INFO L631 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-12-08 20:29:39,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-08 20:29:39,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2018-12-08 20:29:39,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-08 20:29:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 176 transitions. [2018-12-08 20:29:39,752 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 176 transitions. Word has length 77 [2018-12-08 20:29:39,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:29:39,752 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 176 transitions. [2018-12-08 20:29:39,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:29:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 176 transitions. [2018-12-08 20:29:39,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 20:29:39,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:29:39,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:29:39,754 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:29:39,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:29:39,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1407781976, now seen corresponding path program 1 times [2018-12-08 20:29:39,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:29:39,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:29:39,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:39,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:29:39,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:29:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:29:39,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:29:39,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:29:39,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:29:39,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:29:39,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:29:39,806 INFO L87 Difference]: Start difference. First operand 135 states and 176 transitions. Second operand 5 states. [2018-12-08 20:29:40,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:29:40,007 INFO L93 Difference]: Finished difference Result 277 states and 376 transitions. [2018-12-08 20:29:40,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:29:40,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-12-08 20:29:40,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:29:40,009 INFO L225 Difference]: With dead ends: 277 [2018-12-08 20:29:40,009 INFO L226 Difference]: Without dead ends: 161 [2018-12-08 20:29:40,010 INFO L631 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-12-08 20:29:40,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-08 20:29:40,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2018-12-08 20:29:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-08 20:29:40,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 175 transitions. [2018-12-08 20:29:40,022 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 175 transitions. Word has length 77 [2018-12-08 20:29:40,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:29:40,022 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 175 transitions. [2018-12-08 20:29:40,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:29:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 175 transitions. [2018-12-08 20:29:40,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 20:29:40,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:29:40,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:29:40,024 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:29:40,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:29:40,024 INFO L82 PathProgramCache]: Analyzing trace with hash -20996566, now seen corresponding path program 1 times [2018-12-08 20:29:40,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:29:40,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:29:40,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:40,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:29:40,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:29:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:29:40,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:29:40,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:29:40,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:29:40,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:29:40,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:29:40,079 INFO L87 Difference]: Start difference. First operand 135 states and 175 transitions. Second operand 5 states. [2018-12-08 20:29:40,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:29:40,265 INFO L93 Difference]: Finished difference Result 291 states and 396 transitions. [2018-12-08 20:29:40,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:29:40,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-12-08 20:29:40,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:29:40,267 INFO L225 Difference]: With dead ends: 291 [2018-12-08 20:29:40,267 INFO L226 Difference]: Without dead ends: 175 [2018-12-08 20:29:40,267 INFO L631 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-12-08 20:29:40,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-08 20:29:40,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 135. [2018-12-08 20:29:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-08 20:29:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 174 transitions. [2018-12-08 20:29:40,280 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 174 transitions. Word has length 77 [2018-12-08 20:29:40,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:29:40,280 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 174 transitions. [2018-12-08 20:29:40,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:29:40,280 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 174 transitions. [2018-12-08 20:29:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 20:29:40,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:29:40,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:29:40,282 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:29:40,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:29:40,282 INFO L82 PathProgramCache]: Analyzing trace with hash 855022440, now seen corresponding path program 1 times [2018-12-08 20:29:40,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:29:40,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:29:40,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:40,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:29:40,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:29:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:29:40,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:29:40,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:29:40,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:29:40,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:29:40,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:29:40,329 INFO L87 Difference]: Start difference. First operand 135 states and 174 transitions. Second operand 5 states. [2018-12-08 20:29:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:29:40,488 INFO L93 Difference]: Finished difference Result 285 states and 385 transitions. [2018-12-08 20:29:40,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:29:40,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-12-08 20:29:40,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:29:40,490 INFO L225 Difference]: With dead ends: 285 [2018-12-08 20:29:40,490 INFO L226 Difference]: Without dead ends: 169 [2018-12-08 20:29:40,491 INFO L631 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-12-08 20:29:40,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-08 20:29:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 135. [2018-12-08 20:29:40,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-08 20:29:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 173 transitions. [2018-12-08 20:29:40,501 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 173 transitions. Word has length 77 [2018-12-08 20:29:40,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:29:40,501 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 173 transitions. [2018-12-08 20:29:40,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:29:40,501 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 173 transitions. [2018-12-08 20:29:40,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 20:29:40,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:29:40,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:29:40,502 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:29:40,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:29:40,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1298923114, now seen corresponding path program 1 times [2018-12-08 20:29:40,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:29:40,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:29:40,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:40,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:29:40,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:29:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:29:40,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:29:40,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:29:40,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:29:40,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:29:40,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:29:40,539 INFO L87 Difference]: Start difference. First operand 135 states and 173 transitions. Second operand 6 states. [2018-12-08 20:29:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:29:40,560 INFO L93 Difference]: Finished difference Result 260 states and 346 transitions. [2018-12-08 20:29:40,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:29:40,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-12-08 20:29:40,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:29:40,562 INFO L225 Difference]: With dead ends: 260 [2018-12-08 20:29:40,562 INFO L226 Difference]: Without dead ends: 145 [2018-12-08 20:29:40,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:29:40,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-08 20:29:40,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2018-12-08 20:29:40,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-08 20:29:40,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 178 transitions. [2018-12-08 20:29:40,576 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 178 transitions. Word has length 77 [2018-12-08 20:29:40,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:29:40,576 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 178 transitions. [2018-12-08 20:29:40,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:29:40,576 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 178 transitions. [2018-12-08 20:29:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 20:29:40,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:29:40,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:29:40,577 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:29:40,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:29:40,577 INFO L82 PathProgramCache]: Analyzing trace with hash -72884184, now seen corresponding path program 1 times [2018-12-08 20:29:40,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:29:40,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:29:40,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:40,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:29:40,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:29:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:29:40,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:29:40,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:29:40,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:29:40,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:29:40,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:29:40,625 INFO L87 Difference]: Start difference. First operand 140 states and 178 transitions. Second operand 6 states. [2018-12-08 20:29:40,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:29:40,646 INFO L93 Difference]: Finished difference Result 267 states and 351 transitions. [2018-12-08 20:29:40,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:29:40,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-12-08 20:29:40,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:29:40,648 INFO L225 Difference]: With dead ends: 267 [2018-12-08 20:29:40,648 INFO L226 Difference]: Without dead ends: 147 [2018-12-08 20:29:40,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:29:40,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-08 20:29:40,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-12-08 20:29:40,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-08 20:29:40,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 183 transitions. [2018-12-08 20:29:40,661 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 183 transitions. Word has length 77 [2018-12-08 20:29:40,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:29:40,661 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 183 transitions. [2018-12-08 20:29:40,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:29:40,662 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 183 transitions. [2018-12-08 20:29:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 20:29:40,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:29:40,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:29:40,663 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:29:40,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:29:40,663 INFO L82 PathProgramCache]: Analyzing trace with hash 628715690, now seen corresponding path program 1 times [2018-12-08 20:29:40,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:29:40,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:29:40,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:40,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:29:40,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:29:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:29:40,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:29:40,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:29:40,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:29:40,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:29:40,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:29:40,714 INFO L87 Difference]: Start difference. First operand 145 states and 183 transitions. Second operand 5 states. [2018-12-08 20:29:40,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:29:40,905 INFO L93 Difference]: Finished difference Result 323 states and 413 transitions. [2018-12-08 20:29:40,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:29:40,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-12-08 20:29:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:29:40,907 INFO L225 Difference]: With dead ends: 323 [2018-12-08 20:29:40,907 INFO L226 Difference]: Without dead ends: 199 [2018-12-08 20:29:40,907 INFO L631 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-12-08 20:29:40,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-08 20:29:40,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 178. [2018-12-08 20:29:40,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-08 20:29:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 220 transitions. [2018-12-08 20:29:40,923 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 220 transitions. Word has length 77 [2018-12-08 20:29:40,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:29:40,923 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 220 transitions. [2018-12-08 20:29:40,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:29:40,923 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 220 transitions. [2018-12-08 20:29:40,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 20:29:40,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:29:40,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:29:40,925 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:29:40,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:29:40,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1743023572, now seen corresponding path program 1 times [2018-12-08 20:29:40,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:29:40,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:29:40,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:40,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:29:40,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:29:40,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:29:40,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:29:40,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:29:40,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:29:40,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:29:40,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:29:40,983 INFO L87 Difference]: Start difference. First operand 178 states and 220 transitions. Second operand 5 states. [2018-12-08 20:29:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:29:41,141 INFO L93 Difference]: Finished difference Result 335 states and 416 transitions. [2018-12-08 20:29:41,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:29:41,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-12-08 20:29:41,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:29:41,142 INFO L225 Difference]: With dead ends: 335 [2018-12-08 20:29:41,142 INFO L226 Difference]: Without dead ends: 178 [2018-12-08 20:29:41,143 INFO L631 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-12-08 20:29:41,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-08 20:29:41,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-12-08 20:29:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-08 20:29:41,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 218 transitions. [2018-12-08 20:29:41,151 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 218 transitions. Word has length 77 [2018-12-08 20:29:41,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:29:41,152 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 218 transitions. [2018-12-08 20:29:41,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:29:41,152 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 218 transitions. [2018-12-08 20:29:41,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 20:29:41,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:29:41,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:29:41,153 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:29:41,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:29:41,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1680983958, now seen corresponding path program 1 times [2018-12-08 20:29:41,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:29:41,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:29:41,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:41,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:29:41,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:29:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:29:41,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:29:41,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:29:41,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:29:41,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:29:41,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:29:41,200 INFO L87 Difference]: Start difference. First operand 178 states and 218 transitions. Second operand 5 states. [2018-12-08 20:29:41,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:29:41,404 INFO L93 Difference]: Finished difference Result 416 states and 539 transitions. [2018-12-08 20:29:41,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:29:41,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-12-08 20:29:41,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:29:41,406 INFO L225 Difference]: With dead ends: 416 [2018-12-08 20:29:41,406 INFO L226 Difference]: Without dead ends: 258 [2018-12-08 20:29:41,407 INFO L631 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-12-08 20:29:41,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-12-08 20:29:41,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 204. [2018-12-08 20:29:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-12-08 20:29:41,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 246 transitions. [2018-12-08 20:29:41,424 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 246 transitions. Word has length 77 [2018-12-08 20:29:41,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:29:41,424 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 246 transitions. [2018-12-08 20:29:41,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:29:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 246 transitions. [2018-12-08 20:29:41,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 20:29:41,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:29:41,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:29:41,425 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:29:41,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:29:41,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1540435348, now seen corresponding path program 1 times [2018-12-08 20:29:41,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:29:41,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:29:41,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:41,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:29:41,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:29:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:29:41,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:29:41,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:29:41,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:29:41,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:29:41,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:29:41,465 INFO L87 Difference]: Start difference. First operand 204 states and 246 transitions. Second operand 5 states. [2018-12-08 20:29:41,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:29:41,666 INFO L93 Difference]: Finished difference Result 438 states and 560 transitions. [2018-12-08 20:29:41,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:29:41,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-12-08 20:29:41,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:29:41,668 INFO L225 Difference]: With dead ends: 438 [2018-12-08 20:29:41,668 INFO L226 Difference]: Without dead ends: 254 [2018-12-08 20:29:41,668 INFO L631 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-12-08 20:29:41,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-12-08 20:29:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 219. [2018-12-08 20:29:41,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-12-08 20:29:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 258 transitions. [2018-12-08 20:29:41,679 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 258 transitions. Word has length 77 [2018-12-08 20:29:41,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:29:41,680 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 258 transitions. [2018-12-08 20:29:41,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:29:41,680 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 258 transitions. [2018-12-08 20:29:41,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 20:29:41,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:29:41,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:29:41,680 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:29:41,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:29:41,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1674448854, now seen corresponding path program 1 times [2018-12-08 20:29:41,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:29:41,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:29:41,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:41,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:29:41,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:29:41,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:29:41,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:29:41,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:29:41,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:29:41,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:29:41,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:29:41,698 INFO L87 Difference]: Start difference. First operand 219 states and 258 transitions. Second operand 3 states. [2018-12-08 20:29:41,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:29:41,723 INFO L93 Difference]: Finished difference Result 595 states and 733 transitions. [2018-12-08 20:29:41,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:29:41,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-12-08 20:29:41,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:29:41,724 INFO L225 Difference]: With dead ends: 595 [2018-12-08 20:29:41,725 INFO L226 Difference]: Without dead ends: 396 [2018-12-08 20:29:41,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:29:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-12-08 20:29:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 393. [2018-12-08 20:29:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-12-08 20:29:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 470 transitions. [2018-12-08 20:29:41,745 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 470 transitions. Word has length 77 [2018-12-08 20:29:41,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:29:41,745 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 470 transitions. [2018-12-08 20:29:41,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:29:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 470 transitions. [2018-12-08 20:29:41,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-08 20:29:41,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:29:41,747 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:29:41,747 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:29:41,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:29:41,747 INFO L82 PathProgramCache]: Analyzing trace with hash 47216360, now seen corresponding path program 1 times [2018-12-08 20:29:41,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:29:41,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:29:41,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:41,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:29:41,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:29:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-08 20:29:41,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:29:41,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 20:29:41,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:29:41,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:29:41,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:29:41,780 INFO L87 Difference]: Start difference. First operand 393 states and 470 transitions. Second operand 4 states. [2018-12-08 20:29:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:29:41,938 INFO L93 Difference]: Finished difference Result 1077 states and 1303 transitions. [2018-12-08 20:29:41,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:29:41,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-08 20:29:41,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:29:41,940 INFO L225 Difference]: With dead ends: 1077 [2018-12-08 20:29:41,940 INFO L226 Difference]: Without dead ends: 556 [2018-12-08 20:29:41,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:29:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-12-08 20:29:41,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 536. [2018-12-08 20:29:41,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-12-08 20:29:41,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 625 transitions. [2018-12-08 20:29:41,966 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 625 transitions. Word has length 121 [2018-12-08 20:29:41,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:29:41,967 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 625 transitions. [2018-12-08 20:29:41,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:29:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 625 transitions. [2018-12-08 20:29:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-08 20:29:41,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:29:41,968 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:29:41,968 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:29:41,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:29:41,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1355641863, now seen corresponding path program 1 times [2018-12-08 20:29:41,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:29:41,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:29:41,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:41,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:29:41,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:29:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-08 20:29:42,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:29:42,023 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b28d062-ca64-431d-bbd1-d5f00a9a78a8/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-12-08 20:29:42,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:29:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:29:42,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:29:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 20:29:42,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:29:42,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-12-08 20:29:42,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:29:42,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:29:42,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:29:42,126 INFO L87 Difference]: Start difference. First operand 536 states and 625 transitions. Second operand 7 states. [2018-12-08 20:29:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:29:42,489 INFO L93 Difference]: Finished difference Result 1347 states and 1658 transitions. [2018-12-08 20:29:42,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 20:29:42,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 156 [2018-12-08 20:29:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:29:42,492 INFO L225 Difference]: With dead ends: 1347 [2018-12-08 20:29:42,492 INFO L226 Difference]: Without dead ends: 831 [2018-12-08 20:29:42,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-08 20:29:42,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-12-08 20:29:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2018-12-08 20:29:42,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-12-08 20:29:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 949 transitions. [2018-12-08 20:29:42,532 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 949 transitions. Word has length 156 [2018-12-08 20:29:42,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:29:42,533 INFO L480 AbstractCegarLoop]: Abstraction has 831 states and 949 transitions. [2018-12-08 20:29:42,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:29:42,533 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 949 transitions. [2018-12-08 20:29:42,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-08 20:29:42,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:29:42,535 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 20:29:42,535 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:29:42,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:29:42,535 INFO L82 PathProgramCache]: Analyzing trace with hash -501540774, now seen corresponding path program 1 times [2018-12-08 20:29:42,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:29:42,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:29:42,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:42,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:29:42,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:29:42,578 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-12-08 20:29:42,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:29:42,579 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b28d062-ca64-431d-bbd1-d5f00a9a78a8/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-12-08 20:29:42,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:29:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:29:42,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:29:42,663 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-08 20:29:42,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:29:42,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-12-08 20:29:42,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 20:29:42,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 20:29:42,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:29:42,682 INFO L87 Difference]: Start difference. First operand 831 states and 949 transitions. Second operand 4 states. [2018-12-08 20:29:42,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:29:42,855 INFO L93 Difference]: Finished difference Result 1978 states and 2272 transitions. [2018-12-08 20:29:42,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 20:29:42,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-12-08 20:29:42,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:29:42,858 INFO L225 Difference]: With dead ends: 1978 [2018-12-08 20:29:42,858 INFO L226 Difference]: Without dead ends: 593 [2018-12-08 20:29:42,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 176 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 20:29:42,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-12-08 20:29:42,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2018-12-08 20:29:42,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-12-08 20:29:42,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 656 transitions. [2018-12-08 20:29:42,888 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 656 transitions. Word has length 176 [2018-12-08 20:29:42,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:29:42,889 INFO L480 AbstractCegarLoop]: Abstraction has 593 states and 656 transitions. [2018-12-08 20:29:42,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 20:29:42,889 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 656 transitions. [2018-12-08 20:29:42,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-08 20:29:42,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:29:42,891 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 20:29:42,891 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:29:42,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:29:42,891 INFO L82 PathProgramCache]: Analyzing trace with hash -521841111, now seen corresponding path program 1 times [2018-12-08 20:29:42,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:29:42,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:29:42,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:42,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:29:42,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:29:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:29:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-08 20:29:42,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:29:42,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:29:42,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:29:42,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:29:42,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:29:42,953 INFO L87 Difference]: Start difference. First operand 593 states and 656 transitions. Second operand 6 states. [2018-12-08 20:29:43,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:29:43,453 INFO L93 Difference]: Finished difference Result 735 states and 821 transitions. [2018-12-08 20:29:43,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 20:29:43,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2018-12-08 20:29:43,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:29:43,454 INFO L225 Difference]: With dead ends: 735 [2018-12-08 20:29:43,454 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 20:29:43,456 INFO L631 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-12-08 20:29:43,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 20:29:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 20:29:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 20:29:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 20:29:43,456 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 176 [2018-12-08 20:29:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:29:43,457 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 20:29:43,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:29:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 20:29:43,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 20:29:43,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 20:29:43,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:29:43,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:29:43,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:29:43,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:29:43,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:29:43,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:29:43,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:29:43,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:29:43,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:29:43,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 20:29:44,758 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2018-12-08 20:29:45,463 WARN L180 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 57 [2018-12-08 20:29:45,663 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2018-12-08 20:29:45,901 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2018-12-08 20:29:46,224 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2018-12-08 20:29:46,430 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2018-12-08 20:29:46,671 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2018-12-08 20:29:47,030 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2018-12-08 20:29:47,152 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2018-12-08 20:29:47,671 WARN L180 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2018-12-08 20:29:48,222 WARN L180 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2018-12-08 20:29:48,564 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2018-12-08 20:29:49,290 WARN L180 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 71 [2018-12-08 20:29:49,509 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2018-12-08 20:29:50,150 WARN L180 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 65 [2018-12-08 20:29:50,663 WARN L180 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2018-12-08 20:29:51,360 WARN L180 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2018-12-08 20:29:51,852 WARN L180 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2018-12-08 20:29:52,136 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2018-12-08 20:29:52,937 WARN L180 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 106 [2018-12-08 20:29:53,763 WARN L180 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 59 [2018-12-08 20:29:53,871 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2018-12-08 20:29:54,697 WARN L180 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 106 [2018-12-08 20:29:54,886 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2018-12-08 20:29:55,104 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2018-12-08 20:29:56,182 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 125 DAG size of output: 106 [2018-12-08 20:29:56,306 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2018-12-08 20:29:56,424 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2018-12-08 20:29:56,721 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 46 [2018-12-08 20:29:57,726 WARN L180 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2018-12-08 20:29:58,221 WARN L180 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2018-12-08 20:29:58,541 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2018-12-08 20:29:58,722 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2018-12-08 20:29:58,889 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2018-12-08 20:29:59,566 WARN L180 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2018-12-08 20:29:59,805 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2018-12-08 20:30:00,235 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 58 [2018-12-08 20:30:00,449 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 86 [2018-12-08 20:30:01,145 WARN L180 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 65 [2018-12-08 20:30:01,651 WARN L180 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2018-12-08 20:30:02,013 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2018-12-08 20:30:02,219 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2018-12-08 20:30:02,415 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2018-12-08 20:30:02,695 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2018-12-08 20:30:02,746 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 321) no Hoare annotation was computed. [2018-12-08 20:30:02,746 INFO L448 ceAbstractionStarter]: For program point L315(line 315) no Hoare annotation was computed. [2018-12-08 20:30:02,746 INFO L448 ceAbstractionStarter]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2018-12-08 20:30:02,746 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 313) no Hoare annotation was computed. [2018-12-08 20:30:02,747 INFO L444 ceAbstractionStarter]: At program point L307(line 307) the Hoare annotation is: (let ((.cse24 (= ~m_st~0 0)) (.cse21 (<= 2 ~t1_st~0)) (.cse6 (= ~t1_pc~0 1)) (.cse25 (+ ~local~0 1)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~t1_st~0 0))) (let ((.cse20 (and .cse12 .cse4)) (.cse18 (< ~token~0 .cse25)) (.cse19 (< .cse25 ~token~0)) (.cse13 (< |old(~m_st~0)| 2)) (.cse14 (not .cse6)) (.cse22 (< ~local~0 ~token~0)) (.cse23 (< ~token~0 ~local~0)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse9 (= 1 ~M_E~0)) (.cse0 (= 1 ~E_M~0)) (.cse16 (< |old(~t1_st~0)| 2)) (.cse17 (not (= 0 |old(~m_st~0)|))) (.cse1 (= ~T1_E~0 1)) (.cse15 (and .cse24 .cse21)) (.cse2 (= ~T1_E~0 0)) (.cse11 (= 1 ~E_1~0)) (.cse3 (= 0 ~E_1~0)) (.cse5 (= 0 ~E_M~0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse11 .cse12 .cse3 .cse5 .cse13 .cse7 .cse8) (or .cse2 .cse14 .cse7 .cse0 .cse15 .cse16 .cse1 .cse17 .cse18 .cse11 .cse3 .cse19 .cse5) (or .cse20 .cse0 .cse1 .cse2 .cse11 .cse3 .cse5 .cse6 .cse13 .cse7 .cse10) (or .cse0 .cse16 .cse1 (and .cse12 .cse21) .cse2 .cse11 .cse3 .cse5 .cse13 .cse7) (or .cse2 .cse22 .cse23 .cse7 .cse0 .cse16 .cse1 .cse17 .cse11 .cse3 .cse5 .cse15 .cse8) (or .cse2 .cse22 .cse23 .cse13 .cse7 .cse10 .cse0 .cse1 .cse11 .cse3 .cse5 .cse20) (or .cse2 .cse14 .cse12 .cse13 .cse7 .cse9 .cse1 .cse11 .cse18 .cse3 .cse5 .cse19) (or .cse12 .cse1 .cse2 .cse11 .cse3 .cse5 .cse13 .cse7 .cse8 .cse9) (or .cse2 .cse22 .cse14 .cse23 .cse7 .cse9 .cse0 .cse16 .cse1 .cse21 .cse3 .cse5) (or .cse2 .cse22 .cse23 .cse6 .cse7 .cse10 (and .cse24 .cse4) .cse0 .cse1 .cse17 .cse11 .cse3 .cse5 .cse8) (or .cse0 .cse16 .cse1 .cse21 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse16 .cse17 .cse1 .cse15 .cse2 .cse11 .cse3 .cse5 .cse6 .cse7 .cse8)))) [2018-12-08 20:30:02,747 INFO L444 ceAbstractionStarter]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 0)) (.cse22 (<= 2 ~t1_st~0)) (.cse26 (+ ~local~0 1)) (.cse15 (= ~t1_pc~0 1)) (.cse14 (= ~t1_st~0 0)) (.cse7 (= ~T1_E~0 1)) (.cse1 (<= 2 ~m_st~0))) (let ((.cse19 (< ~local~0 ~token~0)) (.cse20 (< ~token~0 ~local~0)) (.cse6 (= 1 ~M_E~0)) (.cse18 (and (not .cse7) .cse1 (not (= ~m_pc~0 1)) (not (= ~E_M~0 1)))) (.cse21 (and .cse1 .cse14)) (.cse4 (< |old(~m_st~0)| 2)) (.cse17 (not (= |old(~t1_st~0)| 0))) (.cse16 (= 1 ~m_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse2 (not .cse15)) (.cse5 (= 0 ~M_E~0)) (.cse13 (= 1 ~E_M~0)) (.cse23 (< |old(~t1_st~0)| 2)) (.cse25 (not (= 0 |old(~m_st~0)|))) (.cse9 (< ~token~0 .cse26)) (.cse8 (= 1 ~E_1~0)) (.cse24 (and .cse3 .cse22)) (.cse10 (= 0 ~E_1~0)) (.cse12 (< .cse26 ~token~0)) (.cse11 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse7 .cse0 .cse10 .cse14 .cse11 .cse15 .cse5 .cse16 .cse6 .cse17) (or .cse18 .cse0 .cse19 .cse20 .cse21 .cse4 .cse5 .cse17 .cse13 .cse7 .cse8 .cse10 .cse11) (or .cse13 .cse18 .cse7 .cse0 .cse8 .cse10 .cse11 .cse4 .cse5 .cse16) (or .cse18 .cse0 .cse4 (and .cse1 .cse22) .cse5 .cse13 .cse23 .cse7 .cse8 .cse10 .cse11) (or .cse0 .cse19 .cse20 .cse24 .cse5 .cse13 .cse23 .cse7 .cse25 .cse8 .cse10 .cse11 .cse16) (or .cse0 .cse19 .cse2 .cse20 .cse5 .cse6 .cse13 .cse23 .cse7 .cse22 .cse10 .cse11) (or .cse1 .cse7 .cse0 .cse8 .cse10 .cse11 .cse4 .cse5 .cse16 .cse6) (or .cse0 .cse19 .cse20 .cse15 .cse5 .cse17 (and .cse3 .cse14) .cse13 .cse7 .cse25 .cse8 .cse10 .cse11 .cse16) (or .cse13 .cse23 .cse7 .cse22 .cse0 .cse10 .cse11 .cse15 .cse5 .cse16 .cse6) (or .cse13 .cse7 .cse18 .cse21 .cse0 .cse8 .cse10 .cse11 .cse15 .cse4 .cse5 .cse17) (or .cse13 .cse23 .cse25 .cse7 .cse24 .cse0 .cse8 .cse10 .cse11 .cse15 .cse5 .cse16) (or .cse0 .cse2 .cse5 .cse13 .cse23 .cse7 .cse25 .cse9 .cse8 .cse24 .cse10 .cse12 .cse11)))) [2018-12-08 20:30:02,747 INFO L448 ceAbstractionStarter]: For program point L307-1(line 307) no Hoare annotation was computed. [2018-12-08 20:30:02,747 INFO L444 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse24 (= ~m_st~0 0)) (.cse21 (<= 2 ~t1_st~0)) (.cse6 (= ~t1_pc~0 1)) (.cse25 (+ ~local~0 1)) (.cse12 (<= 2 ~m_st~0)) (.cse4 (= ~t1_st~0 0))) (let ((.cse20 (and .cse12 .cse4)) (.cse18 (< ~token~0 .cse25)) (.cse19 (< .cse25 ~token~0)) (.cse13 (< |old(~m_st~0)| 2)) (.cse14 (not .cse6)) (.cse22 (< ~local~0 ~token~0)) (.cse23 (< ~token~0 ~local~0)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse9 (= 1 ~M_E~0)) (.cse0 (= 1 ~E_M~0)) (.cse16 (< |old(~t1_st~0)| 2)) (.cse17 (not (= 0 |old(~m_st~0)|))) (.cse1 (= ~T1_E~0 1)) (.cse15 (and .cse24 .cse21)) (.cse2 (= ~T1_E~0 0)) (.cse11 (= 1 ~E_1~0)) (.cse3 (= 0 ~E_1~0)) (.cse5 (= 0 ~E_M~0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse11 .cse12 .cse3 .cse5 .cse13 .cse7 .cse8) (or .cse2 .cse14 .cse7 .cse0 .cse15 .cse16 .cse1 .cse17 .cse18 .cse11 .cse3 .cse19 .cse5) (or .cse20 .cse0 .cse1 .cse2 .cse11 .cse3 .cse5 .cse6 .cse13 .cse7 .cse10) (or .cse0 .cse16 .cse1 (and .cse12 .cse21) .cse2 .cse11 .cse3 .cse5 .cse13 .cse7) (or .cse2 .cse22 .cse23 .cse7 .cse0 .cse16 .cse1 .cse17 .cse11 .cse3 .cse5 .cse15 .cse8) (or .cse2 .cse22 .cse23 .cse13 .cse7 .cse10 .cse0 .cse1 .cse11 .cse3 .cse5 .cse20) (or .cse2 .cse14 .cse12 .cse13 .cse7 .cse9 .cse1 .cse11 .cse18 .cse3 .cse5 .cse19) (or .cse12 .cse1 .cse2 .cse11 .cse3 .cse5 .cse13 .cse7 .cse8 .cse9) (or .cse2 .cse22 .cse14 .cse23 .cse7 .cse9 .cse0 .cse16 .cse1 .cse21 .cse3 .cse5) (or .cse2 .cse22 .cse23 .cse6 .cse7 .cse10 (and .cse24 .cse4) .cse0 .cse1 .cse17 .cse11 .cse3 .cse5 .cse8) (or .cse0 .cse16 .cse1 .cse21 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse16 .cse17 .cse1 .cse15 .cse2 .cse11 .cse3 .cse5 .cse6 .cse7 .cse8)))) [2018-12-08 20:30:02,747 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2018-12-08 20:30:02,748 INFO L444 ceAbstractionStarter]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse12 (= ~T1_E~0 1)) (.cse14 (<= 2 ~m_st~0)) (.cse4 (not (= ~E_M~0 0))) (.cse0 (= ~T1_E~0 0)) (.cse5 (not (= ~E_M~0 1)))) (let ((.cse16 (and (not .cse12) (not (= ~M_E~0 0)) .cse14 .cse4 (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) (not .cse0) (not (= ~M_E~0 1)) (not (= ~E_1~0 0)) .cse5)) (.cse8 (< |old(~m_st~0)| 2)) (.cse2 (= ~m_st~0 0)) (.cse19 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse1 (< ~local~0 |old(~token~0)|)) (.cse7 (< |old(~token~0)| ~local~0)) (.cse6 (= |old(~t1_pc~0)| 1)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 ~M_E~0)) (.cse11 (= 1 |old(~E_M~0)|)) (.cse13 (= 1 ~E_1~0)) (.cse15 (= 0 ~E_1~0)) (.cse17 (= 0 |old(~E_M~0)|)) (.cse18 (= 1 ~m_pc~0))) (and (let ((.cse3 (= ~t1_pc~0 1))) (or .cse0 .cse1 (and .cse2 .cse3 .cse4 (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0) .cse5) (not .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and .cse3 .cse14 .cse4 .cse5) .cse15 .cse16 .cse17)) (or .cse11 .cse12 .cse0 .cse13 .cse15 .cse16 .cse17 .cse8 .cse9 .cse18 .cse10) (or .cse11 .cse12 .cse0 (and .cse14 .cse4 .cse19 .cse5) .cse13 .cse15 .cse16 .cse17 .cse6 .cse8 .cse9 .cse10) (or .cse0 (and .cse2 .cse4 .cse19 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse5) .cse1 .cse7 .cse6 .cse9 .cse10 .cse11 .cse12 (not (= 0 |old(~m_st~0)|)) .cse13 .cse15 .cse17 .cse18)))) [2018-12-08 20:30:02,748 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2018-12-08 20:30:02,748 INFO L444 ceAbstractionStarter]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse4 (<= 2 ~m_st~0)) (.cse10 (< |old(~m_st~0)| 2)) (.cse2 (= ~T1_E~0 0)) (.cse13 (< ~local~0 |old(~token~0)|)) (.cse5 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse15 (<= ~token~0 ~local~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse6 (= |old(~E_M~0)| ~E_M~0)) (.cse14 (< |old(~token~0)| ~local~0)) (.cse9 (= |old(~t1_pc~0)| 1)) (.cse11 (= 0 ~M_E~0)) (.cse12 (= 1 ~M_E~0)) (.cse0 (= 1 |old(~E_M~0)|)) (.cse1 (= ~T1_E~0 1)) (.cse3 (= 1 ~E_1~0)) (.cse7 (= 0 ~E_1~0)) (.cse8 (= 0 |old(~E_M~0)|)) (.cse17 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse2 .cse13 (not .cse9) .cse14 .cse10 (and (= ~t1_pc~0 1) .cse4 .cse15 .cse16 .cse6) .cse11 .cse12 .cse0 .cse1 .cse3 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse6) .cse7 .cse8 .cse10 .cse11 .cse17 .cse12) (or .cse2 .cse13 (and (= ~m_st~0 0) .cse5 .cse15 .cse16 .cse6) .cse14 .cse9 .cse11 .cse12 .cse0 .cse1 (not (= 0 |old(~m_st~0)|)) .cse3 .cse7 .cse8 .cse17))) [2018-12-08 20:30:02,748 INFO L448 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-12-08 20:30:02,748 INFO L444 ceAbstractionStarter]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse4 (<= 2 ~m_st~0)) (.cse5 (= |old(~E_M~0)| ~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)) (.cse14 (= |old(~t1_pc~0)| 1)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse9 (= ~T1_E~0 1)) (.cse10 (= 1 ~E_1~0)) (.cse11 (= 0 ~E_1~0)) (.cse12 (= 0 |old(~E_M~0)|)) (.cse13 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 (and (= ~t1_pc~0 1) .cse4 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse8 .cse9 .cse0 .cse10 (and .cse4 .cse5) .cse11 .cse12 .cse3 .cse6 .cse13 .cse7) (or .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse14 .cse3 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse14 .cse6 .cse7 .cse8 .cse9 (not (= 0 |old(~m_st~0)|)) .cse10 .cse11 .cse12 .cse13))) [2018-12-08 20:30:02,748 INFO L448 ceAbstractionStarter]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2018-12-08 20:30:02,748 INFO L444 ceAbstractionStarter]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 1)) (.cse12 (<= 2 ~m_st~0)) (.cse13 (not (= ~E_M~0 0))) (.cse2 (= ~T1_E~0 0)) (.cse15 (not (= ~E_M~0 1)))) (let ((.cse7 (< |old(~m_st~0)| 2)) (.cse5 (and (not .cse1) (not (= ~M_E~0 0)) .cse12 .cse13 (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) (not .cse2) (not (= ~M_E~0 1)) (not (= ~E_1~0 0)) .cse15)) (.cse17 (< ~local~0 |old(~token~0)|)) (.cse18 (< |old(~token~0)| ~local~0)) (.cse11 (= 1 ~t1_pc~0)) (.cse19 (= ~m_st~0 0)) (.cse14 (<= 2 ~t1_st~0)) (.cse16 (= |old(~t1_pc~0)| 1)) (.cse8 (= 0 ~M_E~0)) (.cse10 (= 1 ~M_E~0)) (.cse0 (= 1 |old(~E_M~0)|)) (.cse3 (= 1 ~E_1~0)) (.cse4 (= 0 ~E_1~0)) (.cse6 (= 0 |old(~E_M~0)|)) (.cse9 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse1 (and .cse11 .cse12 .cse13 .cse14 .cse15) .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse10) (let ((.cse20 (= ~t1_pc~0 1))) (or .cse2 .cse17 .cse18 .cse7 .cse8 .cse10 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (and .cse19 .cse20 .cse13 .cse14 (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0) .cse15) (and .cse20 .cse12 .cse13 .cse14 .cse15))) (or .cse2 .cse17 .cse18 (and .cse11 .cse19 .cse13 .cse14 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse15) .cse16 .cse8 .cse10 .cse0 .cse1 (not (= 0 |old(~m_st~0)|)) .cse3 .cse4 .cse6 .cse9)))) [2018-12-08 20:30:02,748 INFO L444 ceAbstractionStarter]: At program point L99(line 99) the Hoare annotation is: (let ((.cse4 (<= 2 ~m_st~0)) (.cse5 (not (= ~E_M~0 0))) (.cse8 (< |old(~m_st~0)| 2)) (.cse2 (= ~T1_E~0 0)) (.cse12 (< ~local~0 |old(~token~0)|)) (.cse13 (< |old(~token~0)| ~local~0)) (.cse14 (= |old(~t1_pc~0)| 1)) (.cse9 (= 0 ~M_E~0)) (.cse11 (= 1 ~M_E~0)) (.cse0 (= 1 |old(~E_M~0)|)) (.cse1 (= ~T1_E~0 1)) (.cse3 (= 1 ~E_1~0)) (.cse6 (= 0 ~E_1~0)) (.cse7 (= 0 |old(~E_M~0)|)) (.cse10 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse2 .cse12 .cse13 .cse8 .cse9 .cse11 .cse0 .cse1 .cse3 .cse6 .cse7 (and (= ~t1_pc~0 1) .cse4 .cse5 (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0))) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse14 .cse8 .cse9 .cse11) (or .cse2 .cse12 .cse13 .cse14 .cse9 .cse11 .cse0 .cse1 (not (= 0 |old(~m_st~0)|)) .cse3 .cse6 .cse7 .cse10))) [2018-12-08 20:30:02,749 INFO L448 ceAbstractionStarter]: For program point L99-1(line 99) no Hoare annotation was computed. [2018-12-08 20:30:02,749 INFO L448 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2018-12-08 20:30:02,749 INFO L444 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse5 (= ~t1_pc~0 1))) (let ((.cse10 (<= 2 ~m_st~0)) (.cse12 (= 1 ~E_1~0)) (.cse11 (< |old(~m_st~0)| 2)) (.cse9 (not .cse5)) (.cse0 (= 1 ~E_M~0)) (.cse14 (< |old(~t1_st~0)| 2)) (.cse1 (= ~T1_E~0 1)) (.cse15 (<= 2 ~t1_st~0)) (.cse2 (= ~T1_E~0 0)) (.cse3 (= 0 ~E_1~0)) (.cse4 (= 0 ~E_M~0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~m_pc~0)) (.cse8 (= 1 ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 (= ~t1_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 (not (= |old(~t1_st~0)| 0))) (let ((.cse13 (+ ~local~0 1))) (or .cse2 .cse9 .cse10 .cse11 .cse6 .cse8 .cse1 .cse12 (< ~token~0 .cse13) .cse3 .cse4 (< .cse13 ~token~0))) (or .cse10 .cse1 .cse2 .cse12 .cse3 .cse4 .cse11 .cse6 .cse7 .cse8) (or .cse2 (< ~local~0 ~token~0) .cse9 (< ~token~0 ~local~0) .cse6 .cse8 .cse0 .cse14 .cse1 .cse15 .cse3 .cse4) (or .cse0 .cse14 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)))) [2018-12-08 20:30:02,749 INFO L448 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2018-12-08 20:30:02,749 INFO L451 ceAbstractionStarter]: At program point L190(lines 177 192) the Hoare annotation is: true [2018-12-08 20:30:02,749 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2018-12-08 20:30:02,749 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 187) no Hoare annotation was computed. [2018-12-08 20:30:02,749 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2018-12-08 20:30:02,749 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 188) no Hoare annotation was computed. [2018-12-08 20:30:02,749 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2018-12-08 20:30:02,749 INFO L448 ceAbstractionStarter]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2018-12-08 20:30:02,749 INFO L448 ceAbstractionStarter]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2018-12-08 20:30:02,749 INFO L448 ceAbstractionStarter]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2018-12-08 20:30:02,750 INFO L444 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 1)) (.cse7 (< ~m_st~0 2)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= |old(~T1_E~0)| 0)) (.cse4 (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))) (.cse11 (< ~local~0 ~token~0)) (.cse12 (< ~token~0 ~local~0)) (.cse8 (= 0 |old(~M_E~0)|)) (.cse10 (= 1 |old(~M_E~0)|)) (.cse0 (= 1 |old(~E_M~0)|)) (.cse16 (< ~t1_st~0 2)) (.cse1 (= |old(~T1_E~0)| 1)) (.cse15 (not (= 0 ~m_st~0))) (.cse3 (= 1 |old(~E_1~0)|)) (.cse5 (= 0 |old(~E_1~0)|)) (.cse6 (= 0 |old(~E_M~0)|)) (.cse9 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse2 .cse11 .cse12 .cse13 .cse8 .cse10 .cse14 .cse0 .cse1 .cse15 .cse3 .cse4 .cse5 .cse6 .cse9) (or .cse2 .cse13 .cse8 .cse10 .cse0 .cse16 .cse15 .cse1 .cse3 .cse5 .cse4 .cse6 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse10 .cse14) (or .cse4 .cse2 .cse7 .cse8 .cse10 .cse0 .cse16 .cse1 .cse3 .cse5 .cse6) (let ((.cse17 (+ ~local~0 1))) (or .cse4 .cse2 (not .cse13) .cse8 .cse10 .cse0 .cse16 .cse1 .cse15 (< ~token~0 .cse17) .cse3 .cse5 (< .cse17 ~token~0) .cse6)) (or .cse2 .cse11 .cse12 .cse7 .cse8 .cse10 .cse14 .cse0 .cse1 .cse4 .cse3 .cse5 .cse6) (or .cse2 .cse4 .cse11 .cse12 .cse8 .cse10 .cse0 .cse16 .cse1 .cse15 .cse3 .cse5 .cse6 .cse9))) [2018-12-08 20:30:02,750 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2018-12-08 20:30:02,750 INFO L448 ceAbstractionStarter]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2018-12-08 20:30:02,750 INFO L448 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2018-12-08 20:30:02,750 INFO L451 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2018-12-08 20:30:02,750 INFO L448 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2018-12-08 20:30:02,750 INFO L444 ceAbstractionStarter]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 1)) (.cse6 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse10 (= 0 ~E_1~0)) (.cse12 (= 0 ~E_M~0)) (.cse3 (= 0 ~M_E~0)) (.cse19 (= 1 ~M_E~0)) (.cse21 (+ ~local~0 1))) (let ((.cse7 (not (= 0 ~m_st~0))) (.cse8 (< ~token~0 .cse21)) (.cse20 (or .cse6 .cse0 .cse10 .cse12 .cse3 .cse19)) (.cse1 (not .cse13)) (.cse11 (< .cse21 ~token~0)) (.cse16 (< ~local~0 ~token~0)) (.cse17 (< ~token~0 ~local~0)) (.cse15 (not (= ~t1_st~0 0))) (.cse5 (< ~t1_st~0 2)) (.cse4 (= 1 ~E_M~0)) (.cse9 (= 1 ~E_1~0)) (.cse2 (= 0 is_transmit1_triggered_~__retres1~1)) (.cse14 (< ~m_st~0 2)) (.cse18 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse4 .cse6 .cse2 .cse0 .cse9 .cse10 .cse12 .cse13 .cse14 .cse3 .cse15) (or .cse0 .cse2 .cse16 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse18) (or .cse0 .cse2 .cse9 .cse16 .cse1 .cse17 .cse3 .cse19 .cse4 .cse5 .cse6 .cse10 .cse12) (or .cse4 .cse5 .cse6 .cse0 .cse2 .cse10 .cse12 .cse13 .cse3 .cse18 .cse19) (or .cse0 .cse2 .cse16 .cse17 .cse13 .cse3 .cse15 .cse4 .cse6 .cse7 .cse9 .cse10 .cse12 .cse18) (or .cse4 .cse6 .cse0 .cse10 .cse12 .cse13 .cse2 .cse3 .cse18 .cse19 .cse15) (or .cse9 .cse20 .cse1 .cse2 .cse14) (or .cse4 .cse5 .cse7 .cse6 .cse0 .cse9 .cse2 .cse10 .cse12 .cse13 .cse3 .cse18) (or .cse9 .cse20 .cse2 .cse14 .cse18) (or .cse7 .cse2 .cse9 .cse8 .cse20 .cse1 .cse11) (or .cse0 .cse16 .cse17 .cse14 .cse3 .cse15 .cse2 .cse4 .cse6 .cse9 .cse10 .cse12) (or .cse4 .cse5 .cse6 .cse0 .cse9 .cse2 .cse10 .cse12 .cse14 .cse3) (or .cse4 .cse6 .cse0 .cse9 .cse2 .cse10 .cse12 .cse14 .cse3 .cse18)))) [2018-12-08 20:30:02,750 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 139) no Hoare annotation was computed. [2018-12-08 20:30:02,750 INFO L448 ceAbstractionStarter]: For program point L133(lines 133 142) no Hoare annotation was computed. [2018-12-08 20:30:02,750 INFO L448 ceAbstractionStarter]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2018-12-08 20:30:02,750 INFO L448 ceAbstractionStarter]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2018-12-08 20:30:02,750 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2018-12-08 20:30:02,750 INFO L444 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) (= 0 ~M_E~0) (= 1 ~M_E~0) (not (= |old(~t1_st~0)| 0)) (= 1 ~E_M~0) (= ~T1_E~0 1) (not (= 0 |old(~m_st~0)|)) (= 1 ~E_1~0) (and (= ~m_st~0 0) (= ~t1_st~0 0)) (= 0 ~E_1~0) (= 0 ~E_M~0) (= 1 ~m_pc~0)) [2018-12-08 20:30:02,750 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2018-12-08 20:30:02,751 INFO L444 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) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (and (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~t1_st~0 0) (= |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(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-08 20:30:02,751 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2018-12-08 20:30:02,751 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2018-12-08 20:30:02,751 INFO L448 ceAbstractionStarter]: For program point L468(line 468) no Hoare annotation was computed. [2018-12-08 20:30:02,751 INFO L444 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) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (and (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~t1_st~0 0) (= |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(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-08 20:30:02,751 INFO L444 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) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (and (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~t1_st~0 0) (= |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(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-08 20:30:02,751 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-12-08 20:30:02,751 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-12-08 20:30:02,751 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-12-08 20:30:02,751 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-12-08 20:30:02,751 INFO L448 ceAbstractionStarter]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2018-12-08 20:30:02,751 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-12-08 20:30:02,752 INFO L444 ceAbstractionStarter]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse14 (+ |old(~local~0)| 1))) (let ((.cse8 (< |old(~token~0)| .cse14)) (.cse11 (< .cse14 |old(~token~0)|)) (.cse5 (= 1 ~E_M~0)) (.cse6 (< |old(~t1_st~0)| 2)) (.cse7 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse9 (= 1 |old(~E_1~0)|)) (.cse10 (= 0 |old(~E_1~0)|)) (.cse12 (= 0 ~E_M~0)) (.cse1 (= ~t1_pc~0 1)) (.cse3 (= 0 ~M_E~0)) (.cse13 (= 1 |old(~m_pc~0)|)) (.cse4 (= 1 ~M_E~0))) (and (or .cse0 (not .cse1) (let ((.cse2 (+ ~local~0 1))) (and (<= ~token~0 .cse2) (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (<= 2 ~t1_st~0) (<= .cse2 ~token~0))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13) (or .cse5 .cse7 .cse0 .cse9 .cse10 .cse12 .cse1 .cse3 .cse13 .cse4 (not (= |old(~t1_st~0)| 0))) (or .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse5 .cse6 .cse7 .cse0 .cse9 .cse10 .cse12 .cse1 .cse3 .cse13 .cse4)))) [2018-12-08 20:30:02,752 INFO L444 ceAbstractionStarter]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse7 (= ~T1_E~0 0))) (let ((.cse1 (<= 2 ~t1_st~0)) (.cse0 (<= 2 ~m_st~0)) (.cse2 (not (= ~E_1~0 1))) (.cse19 (not .cse7)) (.cse18 (= ~t1_st~0 0)) (.cse3 (not (= ~E_1~0 0)))) (let ((.cse11 (= ~t1_pc~0 1)) (.cse15 (and .cse0 .cse2 .cse19 .cse18 (<= ~token~0 ~local~0) .cse3 (<= ~local~0 ~token~0))) (.cse16 (and .cse0 .cse1 .cse2 .cse19 .cse3)) (.cse12 (= 0 ~M_E~0)) (.cse14 (= 1 ~M_E~0)) (.cse4 (= 1 ~E_M~0)) (.cse5 (< |old(~t1_st~0)| 2)) (.cse6 (= ~T1_E~0 1)) (.cse8 (= 1 |old(~E_1~0)|)) (.cse9 (= 0 |old(~E_1~0)|)) (.cse10 (= 0 ~E_M~0)) (.cse13 (= 1 |old(~m_pc~0)|))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse17 (+ |old(~local~0)| 1))) (or .cse7 .cse15 .cse16 (not .cse11) .cse12 .cse14 .cse4 .cse5 .cse6 (< |old(~token~0)| .cse17) .cse8 .cse9 (< .cse17 |old(~token~0)|) .cse10)) (or .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (and .cse0 .cse2 .cse18 .cse3) .cse12 .cse13 .cse14 (not (= |old(~t1_st~0)| 0))) (or .cse7 .cse15 (< |old(~local~0)| |old(~token~0)|) .cse16 (< |old(~token~0)| |old(~local~0)|) .cse12 .cse14 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse13))))) [2018-12-08 20:30:02,752 INFO L444 ceAbstractionStarter]: At program point L61(line 61) the Hoare annotation is: (let ((.cse4 (= 1 ~E_M~0)) (.cse5 (< |old(~t1_st~0)| 2)) (.cse6 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse8 (= 1 |old(~E_1~0)|)) (.cse9 (= 0 |old(~E_1~0)|)) (.cse10 (= 0 ~E_M~0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= 0 ~M_E~0)) (.cse11 (= 1 |old(~m_pc~0)|)) (.cse3 (= 1 ~M_E~0))) (and (let ((.cse7 (+ |old(~local~0)| 1))) (or .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 (< |old(~token~0)| .cse7) .cse8 .cse9 (< .cse7 |old(~token~0)|) .cse10)) (or .cse0 (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11) (or .cse4 .cse6 .cse0 .cse8 .cse9 .cse10 .cse1 .cse2 .cse11 .cse3 (not (= |old(~t1_st~0)| 0))) (or .cse4 .cse5 .cse6 .cse0 .cse8 .cse9 .cse10 .cse1 .cse2 .cse11 .cse3))) [2018-12-08 20:30:02,752 INFO L444 ceAbstractionStarter]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0 1)) (.cse19 (+ |old(~local~0)| 1))) (let ((.cse11 (< |old(~token~0)| .cse19)) (.cse14 (< .cse19 |old(~token~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse1 (not .cse16)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse9 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse3 (= |old(~E_1~0)| ~E_1~0)) (.cse4 (= ~token~0 |old(~token~0)|)) (.cse5 (<= 2 ~t1_st~0)) (.cse17 (not (= ~m_pc~0 1))) (.cse12 (= 1 |old(~E_1~0)|)) (.cse13 (= 0 |old(~E_1~0)|)) (.cse15 (= 0 ~E_M~0)) (.cse18 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 (let ((.cse2 (+ ~local~0 1))) (and (<= ~token~0 .cse2) .cse3 .cse4 .cse5 (<= .cse2 ~token~0))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse8 .cse9 .cse10 .cse0 .cse12 .cse13 .cse15 .cse16 (and .cse3 .cse5 .cse17) .cse6 .cse18 .cse7) (or .cse8 .cse10 .cse0 .cse12 .cse13 .cse15 .cse16 (and .cse3 .cse17 (= ~t1_st~0 0)) .cse6 .cse18 .cse7 (not (= |old(~t1_st~0)| 0))) (or .cse0 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18) (or .cse0 (< |old(~local~0)| |old(~token~0)|) .cse1 (< |old(~token~0)| |old(~local~0)|) .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse3 .cse4 .cse5 .cse17 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)) .cse12 .cse13 .cse15 .cse18)))) [2018-12-08 20:30:02,752 INFO L444 ceAbstractionStarter]: At program point L51(line 51) the Hoare annotation is: (let ((.cse20 (+ |old(~local~0)| 1)) (.cse6 (= ~t1_pc~0 1)) (.cse17 (<= 2 ~t1_st~0)) (.cse7 (not (= ~m_pc~0 1))) (.cse2 (= ~T1_E~0 0)) (.cse18 (<= ~token~0 ~local~0)) (.cse8 (not (= ~E_1~0 0))) (.cse19 (<= ~local~0 ~token~0))) (let ((.cse13 (and .cse17 .cse7 (not .cse2) .cse18 .cse8 (= 1 ~t1_pc~0) .cse19)) (.cse12 (not .cse6)) (.cse15 (< |old(~token~0)| .cse20)) (.cse16 (< .cse20 |old(~token~0)|)) (.cse0 (= 1 ~E_M~0)) (.cse14 (< |old(~t1_st~0)| 2)) (.cse1 (= ~T1_E~0 1)) (.cse3 (= 1 |old(~E_1~0)|)) (.cse4 (= 0 |old(~E_1~0)|)) (.cse5 (= 0 ~E_M~0)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 |old(~m_pc~0)|)) (.cse11 (= 1 ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 (= ~t1_st~0 0) .cse8) .cse9 .cse10 .cse11 (not (= |old(~t1_st~0)| 0))) (or .cse2 (< |old(~local~0)| |old(~token~0)|) .cse12 (< |old(~token~0)| |old(~local~0)|) .cse13 .cse9 .cse11 .cse0 .cse14 .cse1 .cse3 .cse4 .cse5 .cse10) (or .cse2 .cse12 .cse13 .cse9 .cse11 .cse0 .cse14 .cse1 .cse15 .cse3 .cse4 .cse16 .cse5 .cse10) (or .cse2 .cse12 (and .cse17 .cse18 .cse8 .cse19) .cse9 .cse11 .cse0 .cse14 .cse1 .cse15 .cse3 .cse4 .cse16 .cse5) (or .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse17 .cse7 .cse8) .cse9 .cse10 .cse11)))) [2018-12-08 20:30:02,752 INFO L448 ceAbstractionStarter]: For program point L51-1(line 51) no Hoare annotation was computed. [2018-12-08 20:30:02,752 INFO L444 ceAbstractionStarter]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0 1)) (.cse19 (+ |old(~local~0)| 1))) (let ((.cse11 (< |old(~token~0)| .cse19)) (.cse14 (< .cse19 |old(~token~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse1 (not .cse16)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse9 (< |old(~t1_st~0)| 2)) (.cse10 (= ~T1_E~0 1)) (.cse3 (= |old(~E_1~0)| ~E_1~0)) (.cse4 (= ~token~0 |old(~token~0)|)) (.cse5 (<= 2 ~t1_st~0)) (.cse17 (not (= ~m_pc~0 1))) (.cse12 (= 1 |old(~E_1~0)|)) (.cse13 (= 0 |old(~E_1~0)|)) (.cse15 (= 0 ~E_M~0)) (.cse18 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 (let ((.cse2 (+ ~local~0 1))) (and (<= ~token~0 .cse2) .cse3 .cse4 .cse5 (<= .cse2 ~token~0))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse8 .cse9 .cse10 .cse0 .cse12 .cse13 .cse15 .cse16 (and .cse3 .cse5 .cse17) .cse6 .cse18 .cse7) (or .cse8 .cse10 .cse0 .cse12 .cse13 .cse15 .cse16 (and .cse3 .cse17 (= ~t1_st~0 0)) .cse6 .cse18 .cse7 (not (= |old(~t1_st~0)| 0))) (or .cse0 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18) (or .cse0 (< |old(~local~0)| |old(~token~0)|) .cse1 (< |old(~token~0)| |old(~local~0)|) .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse3 .cse4 .cse5 .cse17 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)) .cse12 .cse13 .cse15 .cse18)))) [2018-12-08 20:30:02,753 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-12-08 20:30:02,753 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2018-12-08 20:30:02,753 INFO L444 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse14 (not (= ~t1_st~0 0))) (.cse15 (< ~local~0 ~token~0)) (.cse16 (< ~token~0 ~local~0)) (.cse13 (< ~m_st~0 2)) (.cse12 (= 1 ~m_pc~0)) (.cse10 (= |old(~M_E~0)| ~M_E~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= 0 |old(~M_E~0)|)) (.cse3 (= 1 |old(~M_E~0)|)) (.cse4 (= 1 ~E_M~0)) (.cse5 (< ~t1_st~0 2)) (.cse7 (= ~T1_E~0 1)) (.cse6 (not (= 0 ~m_st~0))) (.cse8 (= 1 ~E_1~0)) (.cse9 (= 0 ~E_1~0)) (.cse11 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse10 .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11) (or .cse4 .cse7 .cse0 .cse8 .cse10 .cse9 .cse11 .cse1 .cse13 .cse2 .cse3 .cse14) (or .cse0 .cse15 .cse16 .cse1 .cse2 .cse3 .cse14 .cse4 .cse7 .cse6 .cse8 .cse10 .cse9 .cse11 .cse12) (or .cse0 .cse15 .cse16 .cse13 .cse2 .cse3 .cse14 .cse4 .cse7 .cse10 .cse8 .cse9 .cse11) (or .cse0 .cse10 .cse15 .cse16 .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9 .cse11 .cse12) (or .cse4 .cse7 .cse0 .cse8 .cse10 .cse9 .cse11 .cse13 .cse2 .cse12 .cse3) (let ((.cse17 (+ ~local~0 1))) (or .cse10 .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 (< ~token~0 .cse17) .cse8 .cse9 (< .cse17 ~token~0) .cse11)))) [2018-12-08 20:30:02,753 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2018-12-08 20:30:02,753 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-08 20:30:02,753 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~t1_pc~0 |old(~t1_pc~0)|) (= |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-12-08 20:30:02,753 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 20:30:02,753 INFO L451 ceAbstractionStarter]: At program point L399(lines 388 401) the Hoare annotation is: true [2018-12-08 20:30:02,753 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 397) no Hoare annotation was computed. [2018-12-08 20:30:02,754 INFO L451 ceAbstractionStarter]: At program point L390(line 390) the Hoare annotation is: true [2018-12-08 20:30:02,754 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2018-12-08 20:30:02,754 INFO L448 ceAbstractionStarter]: For program point L390-1(line 390) no Hoare annotation was computed. [2018-12-08 20:30:02,754 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2018-12-08 20:30:02,754 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2018-12-08 20:30:02,754 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse31 (= |old(~t1_pc~0)| 1)) (.cse32 (+ |old(~local~0)| 1))) (let ((.cse8 (< |old(~token~0)| .cse32)) (.cse11 (< .cse32 |old(~token~0)|)) (.cse22 (<= 2 ~m_st~0)) (.cse17 (< |old(~m_st~0)| 2)) (.cse21 (= ~t1_pc~0 1)) (.cse29 (<= 2 ~t1_st~0)) (.cse15 (not .cse31)) (.cse5 (< |old(~t1_st~0)| 2)) (.cse0 (= ~T1_E~0 0)) (.cse14 (< |old(~local~0)| |old(~token~0)|)) (.cse16 (< |old(~token~0)| |old(~local~0)|)) (.cse2 (= 0 ~M_E~0)) (.cse3 (= 1 ~M_E~0)) (.cse18 (not (= |old(~t1_st~0)| 0))) (.cse4 (= 1 |old(~E_M~0)|)) (.cse6 (= ~T1_E~0 1)) (.cse7 (not (= 0 |old(~m_st~0)|))) (.cse9 (= 1 |old(~E_1~0)|)) (.cse19 (= |old(~E_1~0)| ~E_1~0)) (.cse20 (= ~token~0 |old(~token~0)|)) (.cse28 (= ~m_st~0 0)) (.cse1 (not (= ~m_pc~0 1))) (.cse30 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse23 (= ~t1_st~0 0)) (.cse24 (<= ~token~0 ~local~0)) (.cse25 (<= ~local~0 ~token~0)) (.cse26 (= |old(~E_M~0)| ~E_M~0)) (.cse10 (= 0 |old(~E_1~0)|)) (.cse12 (= 0 |old(~E_M~0)|)) (.cse13 (= 1 |old(~m_pc~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse14 .cse15 .cse16 .cse17 .cse2 .cse3 .cse18 .cse4 .cse6 (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) .cse9 .cse10 .cse12) (or .cse4 .cse6 .cse0 .cse9 (and .cse19 .cse22 .cse1 .cse26) .cse10 .cse12 .cse17 .cse2 .cse13 .cse3) (or (let ((.cse27 (+ ~local~0 1))) (and (<= ~token~0 .cse27) .cse19 .cse20 .cse28 .cse21 .cse29 (<= .cse27 ~token~0) .cse26)) .cse0 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse4 .cse6 .cse0 .cse9 (and .cse19 .cse22 .cse30 .cse23 .cse26) .cse10 .cse12 .cse31 .cse17 .cse2 .cse3 .cse18) (or .cse0 .cse31 .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 .cse9 .cse10 (and .cse19 .cse28 .cse29 .cse1 .cse30 .cse26) .cse12 .cse13) (or .cse4 .cse5 .cse6 .cse0 .cse9 (and .cse19 .cse22 .cse29 .cse30 .cse26) .cse10 .cse12 .cse17 .cse2 .cse3) (or .cse0 (and .cse19 .cse20 .cse28 .cse21 .cse29 .cse1 .cse24 .cse25 .cse26) .cse14 .cse15 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13) (or .cse0 .cse14 .cse16 .cse31 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse9 (and .cse19 .cse20 .cse28 .cse1 .cse30 .cse23 .cse24 .cse25 .cse26) .cse10 .cse12 .cse13)))) [2018-12-08 20:30:02,754 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 220) no Hoare annotation was computed. [2018-12-08 20:30:02,755 INFO L448 ceAbstractionStarter]: For program point L205(lines 205 209) no Hoare annotation was computed. [2018-12-08 20:30:02,755 INFO L448 ceAbstractionStarter]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2018-12-08 20:30:02,755 INFO L448 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2018-12-08 20:30:02,755 INFO L444 ceAbstractionStarter]: At program point L201(line 201) the Hoare annotation is: (let ((.cse20 (= ~T1_E~0 1)) (.cse6 (= ~T1_E~0 0)) (.cse38 (= ~t1_pc~0 1)) (.cse41 (+ ~local~0 1))) (let ((.cse1 (<= ~token~0 .cse41)) (.cse3 (= ~m_st~0 0)) (.cse4 (<= .cse41 ~token~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse39 (= 1 |old(~t1_pc~0)|)) (.cse9 (<= ~local~0 ~token~0)) (.cse10 (not (= ~m_pc~0 1))) (.cse13 (= |old(~t1_pc~0)| 1)) (.cse28 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse40 (not .cse38)) (.cse18 (= ~t1_st~0 0)) (.cse0 (= 1 ~t1_pc~0)) (.cse2 (and (and (not .cse20) (and (not .cse6) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~M_E~0 1)) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (.cse19 (<= 2 ~m_st~0)) (.cse5 (<= 2 ~t1_st~0))) (let ((.cse22 (and .cse0 .cse2 .cse19 .cse5)) (.cse24 (and .cse28 .cse40 .cse2 .cse18 .cse19)) (.cse31 (and .cse28 .cse40 .cse2 .cse19 .cse5)) (.cse30 (< |old(~t1_st~0)| 2)) (.cse21 (not (= 0 |old(~m_st~0)|))) (.cse7 (= ~token~0 |old(~token~0)|)) (.cse29 (= 1 |old(~m_pc~0)|)) (.cse33 (and .cse2 .cse38 .cse19 .cse5)) (.cse11 (< |old(~local~0)| |old(~token~0)|)) (.cse34 (not .cse13)) (.cse12 (< |old(~token~0)| |old(~local~0)|)) (.cse32 (< |old(~m_st~0)| 2)) (.cse14 (= 0 ~M_E~0)) (.cse15 (= 1 ~M_E~0)) (.cse16 (not (= |old(~t1_st~0)| 0))) (.cse17 (= 1 |old(~E_M~0)|)) (.cse23 (and .cse2 .cse19 .cse10)) (.cse25 (= 1 |old(~E_1~0)|)) (.cse36 (and .cse2 .cse18 .cse8 .cse38 .cse19 .cse39 .cse9)) (.cse26 (= 0 |old(~E_1~0)|)) (.cse27 (= 0 |old(~E_M~0)|)) (.cse37 (and .cse1 .cse2 .cse3 .cse4 .cse38 .cse5 .cse39))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 (and .cse0 .cse2 .cse7 .cse3 .cse8 .cse5 .cse9 .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (and .cse0 .cse2 .cse18 .cse8 .cse19 .cse9) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (and .cse28 .cse2 .cse18 .cse7 .cse3 .cse8 .cse9 .cse10) .cse29) (or (and .cse28 .cse2 .cse3 .cse5 .cse10) .cse6 .cse13 .cse14 .cse15 .cse17 .cse30 .cse21 .cse20 .cse23 .cse25 .cse31 .cse26 .cse27 .cse29) (or .cse6 .cse13 .cse32 .cse14 .cse15 .cse16 .cse17 .cse20 .cse22 .cse23 .cse25 .cse24 .cse26 .cse27) (let ((.cse35 (+ |old(~local~0)| 1))) (or .cse33 .cse6 .cse34 .cse14 .cse15 .cse17 .cse30 .cse20 .cse21 .cse23 (< |old(~token~0)| .cse35) .cse25 .cse36 .cse26 (< .cse35 |old(~token~0)|) .cse27 .cse37)) (or .cse6 .cse13 .cse32 .cse14 .cse15 .cse17 .cse30 .cse20 .cse23 .cse25 .cse31 .cse26 .cse27) (or .cse33 .cse6 .cse34 .cse32 .cse14 .cse15 .cse17 .cse30 .cse20 .cse23 .cse25 .cse26 .cse27) (or .cse17 .cse20 .cse6 .cse23 .cse25 .cse26 .cse27 .cse32 .cse14 .cse29 .cse15) (or .cse33 .cse6 .cse11 .cse34 .cse12 .cse14 .cse15 .cse17 .cse30 .cse20 .cse21 .cse23 .cse25 .cse36 .cse26 (and .cse2 .cse7 .cse3 .cse8 .cse38 .cse5 .cse9 .cse10) .cse27 .cse37 .cse29) (or .cse33 .cse6 .cse11 .cse34 .cse12 .cse32 .cse14 .cse15 .cse16 .cse17 .cse20 .cse23 .cse25 .cse36 .cse26 .cse27 .cse37))))) [2018-12-08 20:30:02,756 INFO L444 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (let ((.cse6 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0))) (let ((.cse24 (not (= ~m_pc~0 1))) (.cse18 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse23 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse27 (= ~t1_pc~0 1)) (.cse17 (and (and (not .cse6) (and (not .cse0) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~M_E~0 1)) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (.cse19 (<= 2 ~m_st~0)) (.cse16 (= |old(~t1_pc~0)| 1))) (let ((.cse1 (not .cse16)) (.cse21 (and .cse23 (not .cse27) .cse17 .cse19)) (.cse22 (not (= |old(~t1_st~0)| 0))) (.cse14 (< |old(~local~0)| |old(~token~0)|)) (.cse15 (< |old(~token~0)| |old(~local~0)|)) (.cse7 (not (= 0 |old(~m_st~0)|))) (.cse11 (and .cse17 .cse18 .cse27 .cse19 (= 1 |old(~t1_pc~0)|) .cse20)) (.cse25 (= 1 |old(~m_pc~0)|)) (.cse26 (< |old(~m_st~0)| 2)) (.cse2 (= 0 ~M_E~0)) (.cse3 (= 1 ~M_E~0)) (.cse4 (= 1 |old(~E_M~0)|)) (.cse5 (< |old(~t1_st~0)| 2)) (.cse8 (and .cse17 .cse19 .cse24)) (.cse10 (= 1 |old(~E_1~0)|)) (.cse12 (= 0 |old(~E_1~0)|)) (.cse13 (= 0 |old(~E_M~0)|))) (and (let ((.cse9 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< |old(~token~0)| .cse9) .cse10 .cse11 .cse12 (< .cse9 |old(~token~0)|) .cse13)) (or .cse0 .cse14 .cse15 .cse16 (and (= 1 ~t1_pc~0) .cse17 .cse18 .cse19 .cse20) .cse21 .cse2 .cse3 .cse22 .cse4 .cse6 .cse7 .cse8 .cse10 .cse12 (and .cse23 .cse17 (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) .cse18 .cse20 .cse24) .cse13 .cse25) (or .cse0 .cse16 .cse2 .cse3 .cse4 .cse5 .cse7 .cse6 .cse8 .cse10 .cse12 .cse13 .cse25) (or .cse0 .cse14 .cse1 .cse15 .cse26 .cse2 .cse3 .cse22 .cse4 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse16 .cse26 .cse21 .cse2 .cse3 .cse22 .cse4 .cse6 .cse8 .cse10 .cse12 .cse13) (or .cse0 .cse14 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse25) (or .cse4 .cse6 .cse0 .cse8 .cse10 .cse12 .cse13 .cse26 .cse2 .cse25 .cse3) (or .cse0 .cse26 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse12 .cse13))))) [2018-12-08 20:30:02,756 INFO L444 ceAbstractionStarter]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse20 (= ~T1_E~0 1)) (.cse6 (= ~T1_E~0 0)) (.cse38 (= ~t1_pc~0 1)) (.cse41 (+ ~local~0 1))) (let ((.cse1 (<= ~token~0 .cse41)) (.cse3 (= ~m_st~0 0)) (.cse4 (<= .cse41 ~token~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse39 (= 1 |old(~t1_pc~0)|)) (.cse9 (<= ~local~0 ~token~0)) (.cse10 (not (= ~m_pc~0 1))) (.cse13 (= |old(~t1_pc~0)| 1)) (.cse28 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse40 (not .cse38)) (.cse18 (= ~t1_st~0 0)) (.cse0 (= 1 ~t1_pc~0)) (.cse2 (and (and (not .cse20) (and (not .cse6) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~M_E~0 1)) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (.cse19 (<= 2 ~m_st~0)) (.cse5 (<= 2 ~t1_st~0))) (let ((.cse22 (and .cse0 .cse2 .cse19 .cse5)) (.cse24 (and .cse28 .cse40 .cse2 .cse18 .cse19)) (.cse31 (and .cse28 .cse40 .cse2 .cse19 .cse5)) (.cse30 (< |old(~t1_st~0)| 2)) (.cse21 (not (= 0 |old(~m_st~0)|))) (.cse7 (= ~token~0 |old(~token~0)|)) (.cse29 (= 1 |old(~m_pc~0)|)) (.cse33 (and .cse2 .cse38 .cse19 .cse5)) (.cse11 (< |old(~local~0)| |old(~token~0)|)) (.cse34 (not .cse13)) (.cse12 (< |old(~token~0)| |old(~local~0)|)) (.cse32 (< |old(~m_st~0)| 2)) (.cse14 (= 0 ~M_E~0)) (.cse15 (= 1 ~M_E~0)) (.cse16 (not (= |old(~t1_st~0)| 0))) (.cse17 (= 1 |old(~E_M~0)|)) (.cse23 (and .cse2 .cse19 .cse10)) (.cse25 (= 1 |old(~E_1~0)|)) (.cse36 (and .cse2 .cse18 .cse8 .cse38 .cse19 .cse39 .cse9)) (.cse26 (= 0 |old(~E_1~0)|)) (.cse27 (= 0 |old(~E_M~0)|)) (.cse37 (and .cse1 .cse2 .cse3 .cse4 .cse38 .cse5 .cse39))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 (and .cse0 .cse2 .cse7 .cse3 .cse8 .cse5 .cse9 .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (and .cse0 .cse2 .cse18 .cse8 .cse19 .cse9) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (and .cse28 .cse2 .cse18 .cse7 .cse3 .cse8 .cse9 .cse10) .cse29) (or (and .cse28 .cse2 .cse3 .cse5 .cse10) .cse6 .cse13 .cse14 .cse15 .cse17 .cse30 .cse21 .cse20 .cse23 .cse25 .cse31 .cse26 .cse27 .cse29) (or .cse6 .cse13 .cse32 .cse14 .cse15 .cse16 .cse17 .cse20 .cse22 .cse23 .cse25 .cse24 .cse26 .cse27) (let ((.cse35 (+ |old(~local~0)| 1))) (or .cse33 .cse6 .cse34 .cse14 .cse15 .cse17 .cse30 .cse20 .cse21 .cse23 (< |old(~token~0)| .cse35) .cse25 .cse36 .cse26 (< .cse35 |old(~token~0)|) .cse27 .cse37)) (or .cse6 .cse13 .cse32 .cse14 .cse15 .cse17 .cse30 .cse20 .cse23 .cse25 .cse31 .cse26 .cse27) (or .cse33 .cse6 .cse34 .cse32 .cse14 .cse15 .cse17 .cse30 .cse20 .cse23 .cse25 .cse26 .cse27) (or .cse17 .cse20 .cse6 .cse23 .cse25 .cse26 .cse27 .cse32 .cse14 .cse29 .cse15) (or .cse33 .cse6 .cse11 .cse34 .cse12 .cse14 .cse15 .cse17 .cse30 .cse20 .cse21 .cse23 .cse25 .cse36 .cse26 (and .cse2 .cse7 .cse3 .cse8 .cse38 .cse5 .cse9 .cse10) .cse27 .cse37 .cse29) (or .cse33 .cse6 .cse11 .cse34 .cse12 .cse32 .cse14 .cse15 .cse16 .cse17 .cse20 .cse23 .cse25 .cse36 .cse26 .cse27 .cse37))))) [2018-12-08 20:30:02,756 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2018-12-08 20:30:02,757 INFO L444 ceAbstractionStarter]: At program point L216(line 216) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 1)) (.cse2 (= ~T1_E~0 0)) (.cse30 (+ ~local~0 1))) (let ((.cse21 (<= ~token~0 .cse30)) (.cse12 (and (and (not .cse1) (and (not .cse2) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~M_E~0 1)) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (.cse22 (<= .cse30 ~token~0)) (.cse29 (= ~t1_pc~0 1)) (.cse15 (<= 2 ~t1_st~0)) (.cse6 (= |old(~t1_pc~0)| 1))) (let ((.cse26 (not .cse6)) (.cse13 (= ~token~0 |old(~token~0)|)) (.cse14 (<= ~token~0 ~local~0)) (.cse16 (<= ~local~0 ~token~0)) (.cse23 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse17 (not (= ~m_pc~0 1))) (.cse27 (< |old(~t1_st~0)| 2)) (.cse20 (not (= 0 |old(~m_st~0)|))) (.cse24 (= 1 |old(~m_pc~0)|)) (.cse25 (and .cse21 .cse12 .cse22 .cse29 .cse15)) (.cse18 (< |old(~local~0)| |old(~token~0)|)) (.cse19 (< |old(~token~0)| |old(~local~0)|)) (.cse7 (< |old(~m_st~0)| 2)) (.cse8 (= 0 ~M_E~0)) (.cse9 (= 1 ~M_E~0)) (.cse10 (not (= |old(~t1_st~0)| 0))) (.cse0 (= 1 |old(~E_M~0)|)) (.cse3 (= 1 |old(~E_1~0)|)) (.cse4 (= 0 |old(~E_1~0)|)) (.cse5 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (= 1 ~t1_pc~0))) (or (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse2 .cse18 .cse19 .cse6 .cse8 .cse9 .cse10 .cse0 .cse1 .cse20 .cse3 .cse4 (and .cse11 .cse21 .cse12 .cse22 .cse15) .cse5 (and .cse23 .cse12 (= ~t1_st~0 0) .cse17) .cse24)) (let ((.cse28 (+ |old(~local~0)| 1))) (or .cse2 .cse25 .cse26 .cse8 .cse9 .cse0 .cse27 .cse1 .cse20 (< |old(~token~0)| .cse28) .cse3 .cse4 (< .cse28 |old(~token~0)|) .cse5)) (or .cse2 .cse25 .cse18 .cse26 .cse19 .cse8 .cse9 .cse0 .cse27 .cse1 .cse20 .cse3 (and .cse12 .cse13 .cse14 .cse29 .cse15 .cse16 .cse17) .cse4 .cse5 .cse24) (or .cse0 .cse27 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse24 .cse9) (or .cse2 .cse6 .cse8 .cse9 (and .cse23 .cse12 .cse15 .cse17) .cse0 .cse27 .cse20 .cse1 .cse3 .cse4 .cse5 .cse24) (or .cse2 .cse25 .cse18 .cse19 .cse7 .cse8 .cse9 .cse10 .cse0 .cse1 .cse3 .cse4 .cse5))))) [2018-12-08 20:30:02,757 INFO L448 ceAbstractionStarter]: For program point L210(lines 200 238) no Hoare annotation was computed. [2018-12-08 20:30:02,757 INFO L444 ceAbstractionStarter]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse20 (= ~T1_E~0 1)) (.cse6 (= ~T1_E~0 0)) (.cse38 (= ~t1_pc~0 1)) (.cse41 (+ ~local~0 1))) (let ((.cse1 (<= ~token~0 .cse41)) (.cse3 (= ~m_st~0 0)) (.cse4 (<= .cse41 ~token~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse39 (= 1 |old(~t1_pc~0)|)) (.cse9 (<= ~local~0 ~token~0)) (.cse10 (not (= ~m_pc~0 1))) (.cse13 (= |old(~t1_pc~0)| 1)) (.cse28 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse40 (not .cse38)) (.cse18 (= ~t1_st~0 0)) (.cse0 (= 1 ~t1_pc~0)) (.cse2 (and (and (not .cse20) (and (not .cse6) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~M_E~0 1)) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (.cse19 (<= 2 ~m_st~0)) (.cse5 (<= 2 ~t1_st~0))) (let ((.cse22 (and .cse0 .cse2 .cse19 .cse5)) (.cse24 (and .cse28 .cse40 .cse2 .cse18 .cse19)) (.cse31 (and .cse28 .cse40 .cse2 .cse19 .cse5)) (.cse30 (< |old(~t1_st~0)| 2)) (.cse21 (not (= 0 |old(~m_st~0)|))) (.cse7 (= ~token~0 |old(~token~0)|)) (.cse29 (= 1 |old(~m_pc~0)|)) (.cse33 (and .cse2 .cse38 .cse19 .cse5)) (.cse11 (< |old(~local~0)| |old(~token~0)|)) (.cse34 (not .cse13)) (.cse12 (< |old(~token~0)| |old(~local~0)|)) (.cse32 (< |old(~m_st~0)| 2)) (.cse14 (= 0 ~M_E~0)) (.cse15 (= 1 ~M_E~0)) (.cse16 (not (= |old(~t1_st~0)| 0))) (.cse17 (= 1 |old(~E_M~0)|)) (.cse23 (and .cse2 .cse19 .cse10)) (.cse25 (= 1 |old(~E_1~0)|)) (.cse36 (and .cse2 .cse18 .cse8 .cse38 .cse19 .cse39 .cse9)) (.cse26 (= 0 |old(~E_1~0)|)) (.cse27 (= 0 |old(~E_M~0)|)) (.cse37 (and .cse1 .cse2 .cse3 .cse4 .cse38 .cse5 .cse39))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 (and .cse0 .cse2 .cse7 .cse3 .cse8 .cse5 .cse9 .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (and .cse0 .cse2 .cse18 .cse8 .cse19 .cse9) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (and .cse28 .cse2 .cse18 .cse7 .cse3 .cse8 .cse9 .cse10) .cse29) (or (and .cse28 .cse2 .cse3 .cse5 .cse10) .cse6 .cse13 .cse14 .cse15 .cse17 .cse30 .cse21 .cse20 .cse23 .cse25 .cse31 .cse26 .cse27 .cse29) (or .cse6 .cse13 .cse32 .cse14 .cse15 .cse16 .cse17 .cse20 .cse22 .cse23 .cse25 .cse24 .cse26 .cse27) (let ((.cse35 (+ |old(~local~0)| 1))) (or .cse33 .cse6 .cse34 .cse14 .cse15 .cse17 .cse30 .cse20 .cse21 .cse23 (< |old(~token~0)| .cse35) .cse25 .cse36 .cse26 (< .cse35 |old(~token~0)|) .cse27 .cse37)) (or .cse6 .cse13 .cse32 .cse14 .cse15 .cse17 .cse30 .cse20 .cse23 .cse25 .cse31 .cse26 .cse27) (or .cse33 .cse6 .cse34 .cse32 .cse14 .cse15 .cse17 .cse30 .cse20 .cse23 .cse25 .cse26 .cse27) (or .cse17 .cse20 .cse6 .cse23 .cse25 .cse26 .cse27 .cse32 .cse14 .cse29 .cse15) (or .cse33 .cse6 .cse11 .cse34 .cse12 .cse14 .cse15 .cse17 .cse30 .cse20 .cse21 .cse23 .cse25 .cse36 .cse26 (and .cse2 .cse7 .cse3 .cse8 .cse38 .cse5 .cse9 .cse10) .cse27 .cse37 .cse29) (or .cse33 .cse6 .cse11 .cse34 .cse12 .cse32 .cse14 .cse15 .cse16 .cse17 .cse20 .cse23 .cse25 .cse36 .cse26 .cse27 .cse37))))) [2018-12-08 20:30:02,758 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 234) no Hoare annotation was computed. [2018-12-08 20:30:02,758 INFO L448 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-12-08 20:30:02,758 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse0 (= |old(~E_1~0)| ~E_1~0)) (.cse5 (= ~m_st~0 0)) (.cse1 (not (= ~m_pc~0 1))) (.cse6 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (= |old(~M_E~0)| ~M_E~0)) (.cse4 (= |old(~E_M~0)| ~E_M~0))) (or (= |old(~T1_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)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (and .cse0 (<= 2 ~m_st~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 (= ~token~0 |old(~token~0)|) .cse5 .cse1 .cse6 (= ~t1_st~0 0) .cse2 (<= ~token~0 ~local~0) .cse3 (<= ~local~0 ~token~0) .cse4) (= 0 |old(~E_1~0)|) (and .cse0 .cse5 (<= 2 ~t1_st~0) .cse1 .cse6 .cse2 .cse3 .cse4) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))) [2018-12-08 20:30:02,758 INFO L444 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) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (and (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~t1_st~0 0) (= |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(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-08 20:30:02,758 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2018-12-08 20:30:02,758 INFO L444 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) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (and (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~t1_st~0 0) (= |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(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-08 20:30:02,759 INFO L444 ceAbstractionStarter]: At program point L440(line 440) the Hoare annotation is: (let ((.cse3 (= ~token~0 |old(~token~0)|)) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse2 (= ~t1_st~0 0)) (.cse1 (and (and (not (= ~T1_E~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (and (not (= ~M_E~0 1)) (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (.cse10 (<= 2 ~m_st~0)) (.cse7 (not (= ~m_pc~0 1)))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse8 .cse1 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse10 .cse9) (and .cse8 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse7) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (let ((.cse11 (+ ~local~0 1))) (and .cse8 .cse1 (<= ~token~0 .cse11) .cse4 (<= .cse11 ~token~0) .cse9)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (and .cse0 .cse1 .cse10 .cse9) (= 0 |old(~E_1~0)|) (and .cse0 .cse1 .cse2 .cse10) (= 0 |old(~E_M~0)|) (and .cse1 .cse10 .cse7) (= 1 |old(~m_pc~0)|))) [2018-12-08 20:30:02,759 INFO L444 ceAbstractionStarter]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse1 (= ~t1_st~0 0)) (.cse4 (= ~token~0 |old(~token~0)|)) (.cse5 (= ~m_st~0 0)) (.cse6 (<= ~token~0 ~local~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse10 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse3 (and (and (not (= ~T1_E~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_M~0 1))) (not (= ~E_1~0 1))))) (or (= |old(~T1_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)|) (and .cse0 .cse1 .cse2 .cse3) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse3 .cse7 .cse8) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse5 .cse9 .cse3 .cse8) (= 1 |old(~E_1~0)|) (and .cse0 .cse2 .cse9 .cse3) (let ((.cse11 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse11) .cse5 (<= .cse11 ~token~0) .cse9 .cse3)) (and .cse10 .cse1 .cse6 .cse2 .cse3 .cse7) (and .cse10 .cse4 .cse5 .cse6 .cse9 .cse3 .cse7 .cse8) (and .cse2 .cse3 .cse8) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and .cse10 .cse2 .cse9 .cse3) (= 1 |old(~m_pc~0)|))) [2018-12-08 20:30:02,759 INFO L444 ceAbstractionStarter]: At program point L432(line 432) the Hoare annotation is: (let ((.cse3 (= ~token~0 |old(~token~0)|)) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse2 (= ~t1_st~0 0)) (.cse1 (and (and (not (= ~T1_E~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (and (not (= ~M_E~0 1)) (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (.cse10 (<= 2 ~m_st~0)) (.cse7 (not (= ~m_pc~0 1)))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse8 .cse1 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse10 .cse9) (and .cse8 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse7) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (let ((.cse11 (+ ~local~0 1))) (and .cse8 .cse1 (<= ~token~0 .cse11) .cse4 (<= .cse11 ~token~0) .cse9)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (and .cse0 .cse1 .cse10 .cse9) (= 0 |old(~E_1~0)|) (and .cse0 .cse1 .cse2 .cse10) (= 0 |old(~E_M~0)|) (and .cse1 .cse10 .cse7) (= 1 |old(~m_pc~0)|))) [2018-12-08 20:30:02,760 INFO L444 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (let ((.cse3 (= ~token~0 |old(~token~0)|)) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse2 (= ~t1_st~0 0)) (.cse1 (and (and (not (= ~T1_E~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (and (not (= ~M_E~0 1)) (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (.cse10 (<= 2 ~m_st~0)) (.cse7 (not (= ~m_pc~0 1)))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse8 .cse1 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse10 .cse9) (and .cse8 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse7) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (let ((.cse11 (+ ~local~0 1))) (and .cse8 .cse1 (<= ~token~0 .cse11) .cse4 (<= .cse11 ~token~0) .cse9)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (and .cse0 .cse1 .cse10 .cse9) (= 0 |old(~E_1~0)|) (and .cse0 .cse1 .cse2 .cse10) (= 0 |old(~E_M~0)|) (and .cse1 .cse10 .cse7) (= 1 |old(~m_pc~0)|))) [2018-12-08 20:30:02,760 INFO L444 ceAbstractionStarter]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse3 (= ~token~0 |old(~token~0)|)) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse2 (= ~t1_st~0 0)) (.cse1 (and (and (not (= ~T1_E~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (and (not (= ~M_E~0 1)) (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (.cse10 (<= 2 ~m_st~0)) (.cse7 (not (= ~m_pc~0 1)))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse8 .cse1 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse10 .cse9) (and .cse8 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse7) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (let ((.cse11 (+ ~local~0 1))) (and .cse8 .cse1 (<= ~token~0 .cse11) .cse4 (<= .cse11 ~token~0) .cse9)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (and .cse0 .cse1 .cse10 .cse9) (= 0 |old(~E_1~0)|) (and .cse0 .cse1 .cse2 .cse10) (= 0 |old(~E_M~0)|) (and .cse1 .cse10 .cse7) (= 1 |old(~m_pc~0)|))) [2018-12-08 20:30:02,760 INFO L444 ceAbstractionStarter]: At program point L426(line 426) the Hoare annotation is: (let ((.cse3 (= ~token~0 |old(~token~0)|)) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse2 (= ~t1_st~0 0)) (.cse1 (and (and (not (= ~T1_E~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (and (not (= ~M_E~0 1)) (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (.cse10 (<= 2 ~m_st~0)) (.cse7 (not (= ~m_pc~0 1)))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse8 .cse1 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse10 .cse9) (and .cse8 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse7) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (let ((.cse11 (+ ~local~0 1))) (and .cse8 .cse1 (<= ~token~0 .cse11) .cse4 (<= .cse11 ~token~0) .cse9)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (and .cse0 .cse1 .cse10 .cse9) (= 0 |old(~E_1~0)|) (and .cse0 .cse1 .cse2 .cse10) (= 0 |old(~E_M~0)|) (and .cse1 .cse10 .cse7) (= 1 |old(~m_pc~0)|))) [2018-12-08 20:30:02,760 INFO L448 ceAbstractionStarter]: For program point L426-1(line 426) no Hoare annotation was computed. [2018-12-08 20:30:02,761 INFO L444 ceAbstractionStarter]: At program point L422(line 422) the Hoare annotation is: (let ((.cse3 (= ~token~0 |old(~token~0)|)) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse2 (= ~t1_st~0 0)) (.cse1 (and (and (not (= ~T1_E~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (and (not (= ~M_E~0 1)) (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (.cse10 (<= 2 ~m_st~0)) (.cse7 (not (= ~m_pc~0 1)))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse8 .cse1 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse10 .cse9) (and .cse8 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse7) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (let ((.cse11 (+ ~local~0 1))) (and .cse8 .cse1 (<= ~token~0 .cse11) .cse4 (<= .cse11 ~token~0) .cse9)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (and .cse0 .cse1 .cse10 .cse9) (= 0 |old(~E_1~0)|) (and .cse0 .cse1 .cse2 .cse10) (= 0 |old(~E_M~0)|) (and .cse1 .cse10 .cse7) (= 1 |old(~m_pc~0)|))) [2018-12-08 20:30:02,761 INFO L448 ceAbstractionStarter]: For program point L422-1(line 422) no Hoare annotation was computed. [2018-12-08 20:30:02,761 INFO L444 ceAbstractionStarter]: At program point L418-1(lines 415 455) the Hoare annotation is: (let ((.cse3 (= ~token~0 |old(~token~0)|)) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse2 (= ~t1_st~0 0)) (.cse1 (and (and (not (= ~T1_E~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (and (not (= ~M_E~0 1)) (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (.cse10 (<= 2 ~m_st~0)) (.cse7 (not (= ~m_pc~0 1)))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse8 .cse1 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse10 .cse9) (and .cse8 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse7) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (let ((.cse11 (+ ~local~0 1))) (and .cse8 .cse1 (<= ~token~0 .cse11) .cse4 (<= .cse11 ~token~0) .cse9)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (and .cse0 .cse1 .cse10 .cse9) (= 0 |old(~E_1~0)|) (and .cse0 .cse1 .cse2 .cse10) (= 0 |old(~E_M~0)|) (and .cse1 .cse10 .cse7) (= 1 |old(~m_pc~0)|))) [2018-12-08 20:30:02,761 INFO L444 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) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (and (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (= ~m_st~0 0) (not (= ~m_pc~0 1)) (= ~t1_pc~0 |old(~t1_pc~0)|) (= ~t1_st~0 0) (= |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(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-08 20:30:02,762 INFO L444 ceAbstractionStarter]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (= |old(~E_1~0)| ~E_1~0)) (.cse1 (= ~m_st~0 0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse4 (= |old(~T1_E~0)| ~T1_E~0)) (.cse5 (= |old(~M_E~0)| ~M_E~0)) (.cse6 (= |old(~E_M~0)| ~E_M~0))) (or (= |old(~T1_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)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (and .cse0 (= ~token~0 |old(~token~0)|) .cse1 .cse2 .cse3 (= ~t1_st~0 0) .cse4 (<= ~token~0 ~local~0) .cse5 (<= ~local~0 ~token~0) .cse6) (and .cse0 (<= 2 ~m_st~0) .cse2 .cse4 .cse5 .cse6) (= 0 |old(~E_1~0)|) (and .cse0 .cse1 (<= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))) [2018-12-08 20:30:02,762 INFO L444 ceAbstractionStarter]: At program point L412(line 412) the Hoare annotation is: (let ((.cse0 (= |old(~E_1~0)| ~E_1~0)) (.cse5 (= ~m_st~0 0)) (.cse1 (not (= ~m_pc~0 1))) (.cse6 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse2 (= |old(~T1_E~0)| ~T1_E~0)) (.cse3 (= |old(~M_E~0)| ~M_E~0)) (.cse4 (= |old(~E_M~0)| ~E_M~0))) (or (= |old(~T1_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)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (and .cse0 (<= 2 ~m_st~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 (= ~token~0 |old(~token~0)|) .cse5 .cse1 .cse6 (= ~t1_st~0 0) .cse2 (<= ~token~0 ~local~0) .cse3 (<= ~local~0 ~token~0) .cse4) (= 0 |old(~E_1~0)|) (and .cse0 .cse5 (<= 2 ~t1_st~0) .cse1 .cse6 .cse2 .cse3 .cse4) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|))) [2018-12-08 20:30:02,762 INFO L444 ceAbstractionStarter]: At program point L441(line 441) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse1 (= ~t1_st~0 0)) (.cse4 (= ~token~0 |old(~token~0)|)) (.cse5 (= ~m_st~0 0)) (.cse6 (<= ~token~0 ~local~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse10 (= 1 ~t1_pc~0)) (.cse2 (<= 2 ~m_st~0)) (.cse9 (<= 2 ~t1_st~0)) (.cse3 (and (and (not (= ~T1_E~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_M~0 1))) (not (= ~E_1~0 1))))) (or (= |old(~T1_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)|) (and .cse0 .cse1 .cse2 .cse3) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse3 .cse7 .cse8) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (and .cse0 .cse5 .cse9 .cse3 .cse8) (= 1 |old(~E_1~0)|) (and .cse0 .cse2 .cse9 .cse3) (let ((.cse11 (+ ~local~0 1))) (and .cse10 (<= ~token~0 .cse11) .cse5 (<= .cse11 ~token~0) .cse9 .cse3)) (and .cse10 .cse1 .cse6 .cse2 .cse3 .cse7) (and .cse10 .cse4 .cse5 .cse6 .cse9 .cse3 .cse7 .cse8) (and .cse2 .cse3 .cse8) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (and .cse10 .cse2 .cse9 .cse3) (= 1 |old(~m_pc~0)|))) [2018-12-08 20:30:02,762 INFO L448 ceAbstractionStarter]: For program point L437(lines 437 446) no Hoare annotation was computed. [2018-12-08 20:30:02,763 INFO L444 ceAbstractionStarter]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse3 (= ~token~0 |old(~token~0)|)) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse2 (= ~t1_st~0 0)) (.cse1 (and (and (not (= ~T1_E~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (and (not (= ~M_E~0 1)) (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (.cse10 (<= 2 ~m_st~0)) (.cse7 (not (= ~m_pc~0 1)))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse8 .cse1 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse10 .cse9) (and .cse8 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse7) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (let ((.cse11 (+ ~local~0 1))) (and .cse8 .cse1 (<= ~token~0 .cse11) .cse4 (<= .cse11 ~token~0) .cse9)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (and .cse0 .cse1 .cse10 .cse9) (= 0 |old(~E_1~0)|) (and .cse0 .cse1 .cse2 .cse10) (= 0 |old(~E_M~0)|) (and .cse1 .cse10 .cse7) (= 1 |old(~m_pc~0)|))) [2018-12-08 20:30:02,765 INFO L448 ceAbstractionStarter]: For program point L435(line 435) no Hoare annotation was computed. [2018-12-08 20:30:02,765 INFO L444 ceAbstractionStarter]: At program point L431(line 431) the Hoare annotation is: (let ((.cse3 (= ~token~0 |old(~token~0)|)) (.cse5 (<= ~token~0 ~local~0)) (.cse6 (<= ~local~0 ~token~0)) (.cse8 (= 1 ~t1_pc~0)) (.cse4 (= ~m_st~0 0)) (.cse9 (<= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 |old(~t1_pc~0)|)) (.cse2 (= ~t1_st~0 0)) (.cse1 (and (and (not (= ~T1_E~0 1)) (= |old(~T1_E~0)| ~T1_E~0) (and (not (= ~M_E~0 1)) (and (not (= ~T1_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (not (= ~E_M~0 1))) (not (= ~E_1~0 1)))) (.cse10 (<= 2 ~m_st~0)) (.cse7 (not (= ~m_pc~0 1)))) (or (= |old(~T1_E~0)| 0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (< |old(~local~0)| |old(~token~0)|) (< |old(~token~0)| |old(~local~0)|) (= |old(~t1_pc~0)| 1) (and .cse8 .cse1 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse10 .cse9) (and .cse8 .cse1 .cse2 .cse5 .cse10 .cse6) (and .cse0 .cse1 .cse4 .cse9 .cse7) (= 0 |old(~M_E~0)|) (= 1 |old(~M_E~0)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (let ((.cse11 (+ ~local~0 1))) (and .cse8 .cse1 (<= ~token~0 .cse11) .cse4 (<= .cse11 ~token~0) .cse9)) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (and .cse0 .cse1 .cse10 .cse9) (= 0 |old(~E_1~0)|) (and .cse0 .cse1 .cse2 .cse10) (= 0 |old(~E_M~0)|) (and .cse1 .cse10 .cse7) (= 1 |old(~m_pc~0)|))) [2018-12-08 20:30:02,765 INFO L444 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)|) (not (= |old(~t1_st~0)| 0)) (= 1 |old(~E_M~0)|) (= |old(~T1_E~0)| 1) (not (= 0 |old(~m_st~0)|)) (= 1 |old(~E_1~0)|) (= 0 |old(~E_1~0)|) (= 0 |old(~E_M~0)|) (= 1 |old(~m_pc~0)|)) [2018-12-08 20:30:02,765 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-12-08 20:30:02,765 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 454) no Hoare annotation was computed. [2018-12-08 20:30:02,766 INFO L444 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse13 (= ~t1_pc~0 1)) (.cse7 (< ~m_st~0 2)) (.cse14 (not (= ~t1_st~0 0))) (.cse2 (= |old(~T1_E~0)| 0)) (.cse4 (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))) (.cse11 (< ~local~0 ~token~0)) (.cse12 (< ~token~0 ~local~0)) (.cse8 (= 0 |old(~M_E~0)|)) (.cse10 (= 1 |old(~M_E~0)|)) (.cse0 (= 1 |old(~E_M~0)|)) (.cse16 (< ~t1_st~0 2)) (.cse1 (= |old(~T1_E~0)| 1)) (.cse15 (not (= 0 ~m_st~0))) (.cse3 (= 1 |old(~E_1~0)|)) (.cse5 (= 0 |old(~E_1~0)|)) (.cse6 (= 0 |old(~E_M~0)|)) (.cse9 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse2 .cse11 .cse12 .cse13 .cse8 .cse10 .cse14 .cse0 .cse1 .cse15 .cse3 .cse4 .cse5 .cse6 .cse9) (or .cse2 .cse13 .cse8 .cse10 .cse0 .cse16 .cse15 .cse1 .cse3 .cse5 .cse4 .cse6 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse10 .cse14) (or .cse4 .cse2 .cse7 .cse8 .cse10 .cse0 .cse16 .cse1 .cse3 .cse5 .cse6) (let ((.cse17 (+ ~local~0 1))) (or .cse4 .cse2 (not .cse13) .cse8 .cse10 .cse0 .cse16 .cse1 .cse15 (< ~token~0 .cse17) .cse3 .cse5 (< .cse17 ~token~0) .cse6)) (or .cse2 .cse11 .cse12 .cse7 .cse8 .cse10 .cse14 .cse0 .cse1 .cse4 .cse3 .cse5 .cse6) (or .cse2 .cse4 .cse11 .cse12 .cse8 .cse10 .cse0 .cse16 .cse1 .cse15 .cse3 .cse5 .cse6 .cse9))) [2018-12-08 20:30:02,769 INFO L448 ceAbstractionStarter]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2018-12-08 20:30:02,769 INFO L448 ceAbstractionStarter]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2018-12-08 20:30:02,769 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2018-12-08 20:30:02,769 INFO L448 ceAbstractionStarter]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2018-12-08 20:30:02,769 INFO L448 ceAbstractionStarter]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2018-12-08 20:30:02,769 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2018-12-08 20:30:02,769 INFO L451 ceAbstractionStarter]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2018-12-08 20:30:02,769 INFO L444 ceAbstractionStarter]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse20 (+ ~local~0 1)) (.cse13 (= ~t1_pc~0 1))) (let ((.cse5 (< ~t1_st~0 2)) (.cse18 (< ~local~0 ~token~0)) (.cse19 (< ~token~0 ~local~0)) (.cse16 (not (= ~t1_st~0 0))) (.cse7 (not (= 0 ~m_st~0))) (.cse14 (= 1 ~m_pc~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (not .cse13)) (.cse17 (< ~m_st~0 2)) (.cse3 (= 0 ~M_E~0)) (.cse15 (= 1 ~M_E~0)) (.cse6 (= ~T1_E~0 1)) (.cse9 (= 1 ~E_1~0)) (.cse8 (< ~token~0 .cse20)) (.cse10 (= 0 ~E_1~0)) (.cse12 (= 0 ~E_M~0)) (.cse11 (< .cse20 ~token~0)) (.cse4 (= 1 ~E_M~0)) (.cse2 (= 0 is_master_triggered_~__retres1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse4 .cse6 .cse0 .cse10 .cse12 .cse13 .cse2 .cse3 .cse14 .cse15 .cse16) (or .cse4 .cse6 .cse0 .cse9 .cse2 .cse10 .cse12 .cse13 .cse17 .cse3 .cse16) (or .cse0 .cse18 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse2 .cse14) (or .cse6 .cse0 .cse2 .cse9 .cse10 .cse12 .cse17 .cse3 .cse14 .cse15) (or .cse0 .cse18 .cse1 .cse19 .cse2 .cse3 .cse15 .cse4 .cse5 .cse6 .cse10 .cse12) (or .cse4 .cse5 .cse6 .cse0 .cse2 .cse10 .cse12 .cse13 .cse3 .cse14 .cse15) (or .cse0 .cse18 .cse19 .cse17 .cse3 .cse16 .cse4 .cse6 .cse2 .cse9 .cse10 .cse12) (or .cse4 .cse6 .cse0 .cse9 .cse2 .cse10 .cse12 .cse17 .cse3 .cse14) (or .cse4 .cse5 .cse7 .cse6 .cse0 .cse9 .cse10 .cse12 .cse13 .cse2 .cse3 .cse14) (or .cse4 .cse5 .cse6 .cse0 .cse9 .cse2 .cse10 .cse12 .cse17 .cse3) (or .cse0 .cse18 .cse19 .cse13 .cse3 .cse16 .cse4 .cse2 .cse6 .cse7 .cse9 .cse10 .cse12 .cse14) (or .cse0 .cse1 .cse17 .cse3 .cse15 .cse6 .cse9 .cse8 .cse10 .cse12 .cse11 .cse4 .cse2)))) [2018-12-08 20:30:02,771 INFO L448 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2018-12-08 20:30:02,771 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2018-12-08 20:30:02,771 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 123) no Hoare annotation was computed. [2018-12-08 20:30:02,771 INFO L448 ceAbstractionStarter]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2018-12-08 20:30:02,771 INFO L448 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2018-12-08 20:30:02,771 INFO L451 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2018-12-08 20:30:02,771 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 20:30:02,771 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~t1_pc~0 1)) (not (= ~T1_E~0 1)) (= ~m_st~0 0) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) (not (= ~T1_E~0 0)) (= ~t1_st~0 0) (not (= ~M_E~0 1)) (<= ~token~0 ~local~0) (not (= ~E_1~0 0)) (<= ~local~0 ~token~0) (not (= ~E_M~0 1))) [2018-12-08 20:30:02,771 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 20:30:02,771 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 20:30:02,771 INFO L448 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2018-12-08 20:30:02,771 INFO L448 ceAbstractionStarter]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2018-12-08 20:30:02,772 INFO L444 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse14 (< ~local~0 ~token~0)) (.cse15 (< ~token~0 ~local~0)) (.cse8 (< ~m_st~0 2)) (.cse16 (not (= ~t1_st~0 0))) (.cse0 (= 1 |old(~E_M~0)|)) (.cse1 (< ~t1_st~0 2)) (.cse11 (not (= 0 ~m_st~0))) (.cse2 (= |old(~T1_E~0)| 1)) (.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))) (.cse4 (= |old(~T1_E~0)| 0)) (.cse5 (= 1 |old(~E_1~0)|)) (.cse6 (= 0 |old(~E_1~0)|)) (.cse7 (= 0 |old(~E_M~0)|)) (.cse10 (= ~t1_pc~0 1)) (.cse9 (= 0 |old(~M_E~0)|)) (.cse13 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (let ((.cse12 (+ ~local~0 1))) (or .cse4 (not .cse10) .cse9 .cse0 .cse3 .cse1 .cse2 .cse11 (< ~token~0 .cse12) .cse5 .cse6 (< .cse12 ~token~0) .cse7)) (or .cse0 .cse2 .cse4 .cse5 .cse3 .cse6 .cse7 .cse8 .cse9 .cse13) (or .cse4 .cse14 .cse15 .cse8 .cse9 .cse16 .cse0 .cse2 .cse5 .cse6 .cse7 .cse3) (or .cse4 .cse14 .cse15 .cse9 .cse0 .cse1 .cse2 .cse11 .cse5 .cse6 .cse7 .cse3 .cse13) (or .cse4 .cse14 .cse15 .cse10 .cse9 .cse16 .cse3 .cse0 .cse2 .cse11 .cse5 .cse6 .cse7 .cse13) (or .cse3 .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse8 .cse9 .cse16) (or .cse0 .cse1 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse9 .cse13))) [2018-12-08 20:30:02,773 INFO L448 ceAbstractionStarter]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2018-12-08 20:30:02,773 INFO L448 ceAbstractionStarter]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2018-12-08 20:30:02,773 INFO L448 ceAbstractionStarter]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2018-12-08 20:30:02,773 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2018-12-08 20:30:02,773 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2018-12-08 20:30:02,773 INFO L451 ceAbstractionStarter]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: true [2018-12-08 20:30:02,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 08:30:02 BoogieIcfgContainer [2018-12-08 20:30:02,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 20:30:02,821 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 20:30:02,821 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 20:30:02,821 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 20:30:02,822 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:29:39" (3/4) ... [2018-12-08 20:30:02,825 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 20:30:02,830 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-12-08 20:30:02,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit1 [2018-12-08 20:30:02,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2018-12-08 20:30:02,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-12-08 20:30:02,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-12-08 20:30:02,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit1_triggered [2018-12-08 20:30:02,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-12-08 20:30:02,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 20:30:02,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-12-08 20:30:02,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure master [2018-12-08 20:30:02,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_time_events [2018-12-08 20:30:02,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 20:30:02,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-12-08 20:30:02,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-12-08 20:30:02,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-12-08 20:30:02,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-12-08 20:30:02,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-12-08 20:30:02,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_master_triggered [2018-12-08 20:30:02,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_time_events [2018-12-08 20:30:02,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-12-08 20:30:02,838 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-12-08 20:30:02,838 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-08 20:30:02,862 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((\old(T1_E) == 0 || (((((((t1_pc == \old(t1_pc) && (((!(T1_E == 1) && \old(T1_E) == T1_E) && !(M_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token == \old(token)) && m_st == 0) && token <= local) && local <= token) && !(m_pc == 1))) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((((1 == t1_pc && (((!(T1_E == 1) && \old(T1_E) == T1_E) && !(M_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_M == 1)) && !(E_1 == 1)) && token == \old(token)) && m_st == 0) && token <= local) && 2 <= t1_st) && local <= token) && !(m_pc == 1))) || (((1 == t1_pc && (((!(T1_E == 1) && \old(T1_E) == T1_E) && !(M_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || (((((1 == t1_pc && (((!(T1_E == 1) && \old(T1_E) == T1_E) && !(M_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token <= local) && 2 <= m_st) && local <= token)) || ((((t1_pc == \old(t1_pc) && (((!(T1_E == 1) && \old(T1_E) == T1_E) && !(M_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && 2 <= t1_st) && !(m_pc == 1))) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || (((((1 == t1_pc && (((!(T1_E == 1) && \old(T1_E) == T1_E) && !(M_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local + 1) && m_st == 0) && local + 1 <= token) && 2 <= t1_st)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || (((t1_pc == \old(t1_pc) && (((!(T1_E == 1) && \old(T1_E) == T1_E) && !(M_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || 0 == \old(E_1)) || (((t1_pc == \old(t1_pc) && (((!(T1_E == 1) && \old(T1_E) == T1_E) && !(M_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && 2 <= m_st)) || 0 == \old(E_M)) || ((((((!(T1_E == 1) && \old(T1_E) == T1_E) && !(M_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(m_pc) [2018-12-08 20:30:02,862 WARN L221 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_st) == 0)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 1 == \old(m_pc) [2018-12-08 20:30:02,862 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((1 == t1_pc && token <= local + 1) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && 2 <= t1_st) || T1_E == 0) || (((((((1 == t1_pc && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && token == \old(token)) && m_st == 0) && token <= local) && 2 <= t1_st) && local <= token) && !(m_pc == 1))) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || (((((1 == t1_pc && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token <= local) && 2 <= m_st) && local <= token)) || T1_E == 1) || !(0 == \old(m_st))) || (((1 == t1_pc && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || ((((t1_pc == \old(t1_pc) && !(t1_pc == 1)) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && 2 <= m_st)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || (((((((t1_pc == \old(t1_pc) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token == \old(token)) && m_st == 0) && token <= local) && local <= token) && !(m_pc == 1))) || 1 == \old(m_pc)) && ((((((((((((((((((t1_pc == \old(t1_pc) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && 2 <= t1_st) && !(m_pc == 1)) || T1_E == 0) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || T1_E == 1) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((t1_pc == \old(t1_pc) && !(t1_pc == 1)) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && (((((((((((((T1_E == 0 || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || (((1 == t1_pc && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((t1_pc == \old(t1_pc) && !(t1_pc == 1)) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && 2 <= m_st)) || 0 == \old(E_1)) || 0 == \old(E_M))) && (((((((((((((((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_pc == 1) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || !(\old(t1_pc) == 1)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || ((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token <= local) && t1_pc == 1) && 2 <= m_st) && 1 == \old(t1_pc)) && local <= token)) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M)) || ((((((token <= local + 1 && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && t1_pc == 1) && 2 <= t1_st) && 1 == \old(t1_pc)))) && ((((((((((((T1_E == 0 || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((t1_pc == \old(t1_pc) && !(t1_pc == 1)) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || 0 == \old(E_1)) || 0 == \old(E_M))) && (((((((((((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_pc == 1) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M))) && ((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && (((((((((((((((((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_pc == 1) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token <= local) && t1_pc == 1) && 2 <= m_st) && 1 == \old(t1_pc)) && local <= token)) || 0 == \old(E_1)) || (((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && token == \old(token)) && m_st == 0) && token <= local) && t1_pc == 1) && 2 <= t1_st) && local <= token) && !(m_pc == 1))) || 0 == \old(E_M)) || ((((((token <= local + 1 && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && t1_pc == 1) && 2 <= t1_st) && 1 == \old(t1_pc))) || 1 == \old(m_pc))) && (((((((((((((((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_pc == 1) && 2 <= m_st) && 2 <= t1_st) || 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) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token <= local) && t1_pc == 1) && 2 <= m_st) && 1 == \old(t1_pc)) && local <= token)) || 0 == \old(E_1)) || 0 == \old(E_M)) || ((((((token <= local + 1 && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && t1_pc == 1) && 2 <= t1_st) && 1 == \old(t1_pc))) [2018-12-08 20:30:02,863 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((1 == t1_pc && token <= local + 1) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && 2 <= t1_st) || T1_E == 0) || (((((((1 == t1_pc && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && token == \old(token)) && m_st == 0) && token <= local) && 2 <= t1_st) && local <= token) && !(m_pc == 1))) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || (((((1 == t1_pc && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token <= local) && 2 <= m_st) && local <= token)) || T1_E == 1) || !(0 == \old(m_st))) || (((1 == t1_pc && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || ((((t1_pc == \old(t1_pc) && !(t1_pc == 1)) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && 2 <= m_st)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || (((((((t1_pc == \old(t1_pc) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token == \old(token)) && m_st == 0) && token <= local) && local <= token) && !(m_pc == 1))) || 1 == \old(m_pc)) && ((((((((((((((((((t1_pc == \old(t1_pc) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && 2 <= t1_st) && !(m_pc == 1)) || T1_E == 0) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || T1_E == 1) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((t1_pc == \old(t1_pc) && !(t1_pc == 1)) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && (((((((((((((T1_E == 0 || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || (((1 == t1_pc && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((t1_pc == \old(t1_pc) && !(t1_pc == 1)) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && 2 <= m_st)) || 0 == \old(E_1)) || 0 == \old(E_M))) && (((((((((((((((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_pc == 1) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || !(\old(t1_pc) == 1)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || ((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token <= local) && t1_pc == 1) && 2 <= m_st) && 1 == \old(t1_pc)) && local <= token)) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M)) || ((((((token <= local + 1 && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && t1_pc == 1) && 2 <= t1_st) && 1 == \old(t1_pc)))) && ((((((((((((T1_E == 0 || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((t1_pc == \old(t1_pc) && !(t1_pc == 1)) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || 0 == \old(E_1)) || 0 == \old(E_M))) && (((((((((((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_pc == 1) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M))) && ((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && (((((((((((((((((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_pc == 1) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token <= local) && t1_pc == 1) && 2 <= m_st) && 1 == \old(t1_pc)) && local <= token)) || 0 == \old(E_1)) || (((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && token == \old(token)) && m_st == 0) && token <= local) && t1_pc == 1) && 2 <= t1_st) && local <= token) && !(m_pc == 1))) || 0 == \old(E_M)) || ((((((token <= local + 1 && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && t1_pc == 1) && 2 <= t1_st) && 1 == \old(t1_pc))) || 1 == \old(m_pc))) && (((((((((((((((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_pc == 1) && 2 <= m_st) && 2 <= t1_st) || 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) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token <= local) && t1_pc == 1) && 2 <= m_st) && 1 == \old(t1_pc)) && local <= token)) || 0 == \old(E_1)) || 0 == \old(E_M)) || ((((((token <= local + 1 && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && t1_pc == 1) && 2 <= t1_st) && 1 == \old(t1_pc))) [2018-12-08 20:30:02,864 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((T1_E == 0 || local < \old(token)) || (((((m_st == 0 && t1_pc == 1) && !(E_M == 0)) && token <= \old(token) + 1) && local + 1 <= token) && !(E_M == 1))) || !(\old(t1_pc) == 1)) || \old(token) < local) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_1) || (((t1_pc == 1 && 2 <= m_st) && !(E_M == 0)) && !(E_M == 1))) || 0 == E_1) || (((((((((!(T1_E == 1) && !(M_E == 0)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_M == 1))) || 0 == \old(E_M)) && ((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || (((((((((!(T1_E == 1) && !(M_E == 0)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_M == 1))) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || (((2 <= m_st && !(E_M == 0)) && t1_pc == \old(t1_pc)) && !(E_M == 1))) || 1 == E_1) || 0 == E_1) || (((((((((!(T1_E == 1) && !(M_E == 0)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_M == 1))) || 0 == \old(E_M)) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E)) && (((((((((((((T1_E == 0 || (((((m_st == 0 && !(E_M == 0)) && t1_pc == \old(t1_pc)) && token <= local) && local <= token) && !(E_M == 1))) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || 1 == m_pc) [2018-12-08 20:30:02,864 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || (((((((((!(T1_E == 1) && !(M_E == 0)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_M == 1))) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E) && (((((((((((1 == \old(E_M) || T1_E == 1) || ((((1 == t1_pc && 2 <= m_st) && !(E_M == 0)) && 2 <= t1_st) && !(E_M == 1))) || T1_E == 0) || 1 == E_1) || 0 == E_1) || (((((((((!(T1_E == 1) && !(M_E == 0)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_M == 1))) || 0 == \old(E_M)) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E)) && (((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_1) || 0 == E_1) || (((((((((!(T1_E == 1) && !(M_E == 0)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_M == 1))) || 0 == \old(E_M)) || ((((((m_st == 0 && t1_pc == 1) && !(E_M == 0)) && 2 <= t1_st) && token <= \old(token) + 1) && local + 1 <= token) && !(E_M == 1))) || ((((t1_pc == 1 && 2 <= m_st) && !(E_M == 0)) && 2 <= t1_st) && !(E_M == 1)))) && (((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || ((((((1 == t1_pc && m_st == 0) && !(E_M == 0)) && 2 <= t1_st) && token <= local) && local <= token) && !(E_M == 1))) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || 1 == m_pc) [2018-12-08 20:30:02,864 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((2 <= m_st && 2 <= t1_st) && !(E_1 == 1)) && !(E_1 == 0)) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) && (((((((((((((T1_E == 0 || ((((((2 <= m_st && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && token <= local) && !(E_1 == 0)) && local <= token)) || ((((2 <= m_st && 2 <= t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0))) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) || 0 == E_M)) && (((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || (((2 <= m_st && !(E_1 == 1)) && t1_st == 0) && !(E_1 == 0))) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || !(\old(t1_st) == 0))) && (((((((((((((T1_E == 0 || ((((((2 <= m_st && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && token <= local) && !(E_1 == 0)) && local <= token)) || \old(local) < \old(token)) || ((((2 <= m_st && 2 <= t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0))) || \old(token) < \old(local)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || 1 == \old(m_pc)) [2018-12-08 20:30:02,865 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((T1_E == 0 || !(t1_pc == 1)) || ((((token <= local + 1 && \old(E_1) == E_1) && token == \old(token)) && 2 <= t1_st) && local + 1 <= token)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) || 0 == E_M) && (((((((((((1 == E_M || \old(t1_st) < 2) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || ((\old(E_1) == E_1 && 2 <= t1_st) && !(m_pc == 1))) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && (((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || ((\old(E_1) == E_1 && !(m_pc == 1)) && t1_st == 0)) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || !(\old(t1_st) == 0))) && ((((((((((((T1_E == 0 || !(m_pc == 1)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((T1_E == 0 || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || (((((\old(E_1) == E_1 && token == \old(token)) && 2 <= t1_st) && !(m_pc == 1)) && token <= local) && local <= token)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || 1 == \old(m_pc)) [2018-12-08 20:30:02,865 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((T1_E == 0 || !(t1_pc == 1)) || ((((token <= local + 1 && \old(E_1) == E_1) && token == \old(token)) && 2 <= t1_st) && local + 1 <= token)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) || 0 == E_M) && (((((((((((T1_E == 0 || \old(local) < \old(token)) || \old(token) < \old(local)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || !(\old(t1_st) == 0))) && (((((((((((T1_E == 0 || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((1 == E_M || \old(t1_st) < 2) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) [2018-12-08 20:30:02,865 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || ((((t1_pc == 1 && 2 <= m_st) && token <= local) && local <= token) && \old(E_M) == E_M)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) && ((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == E_1) || (2 <= m_st && \old(E_M) == E_M)) || 0 == E_1) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((((((((1 == \old(E_M) || 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_E)) && ((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || 1 == m_pc) [2018-12-08 20:30:02,898 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5b28d062-ca64-431d-bbd1-d5f00a9a78a8/bin-2019/uautomizer/witness.graphml [2018-12-08 20:30:02,898 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 20:30:02,898 INFO L168 Benchmark]: Toolchain (without parser) took 24192.26 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 510.7 MB). Free memory was 956.0 MB in the beginning and 1.0 GB in the end (delta: -60.9 MB). Peak memory consumption was 449.8 MB. Max. memory is 11.5 GB. [2018-12-08 20:30:02,899 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:30:02,899 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.30 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 939.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-08 20:30:02,899 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2018-12-08 20:30:02,900 INFO L168 Benchmark]: Boogie Preprocessor took 20.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 20:30:02,900 INFO L168 Benchmark]: RCFGBuilder took 272.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-12-08 20:30:02,900 INFO L168 Benchmark]: TraceAbstraction took 23622.30 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 409.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.7 MB). Peak memory consumption was 669.7 MB. Max. memory is 11.5 GB. [2018-12-08 20:30:02,900 INFO L168 Benchmark]: Witness Printer took 76.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-12-08 20:30:02,902 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 155.30 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 939.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 272.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23622.30 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 409.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.7 MB). Peak memory consumption was 669.7 MB. Max. memory is 11.5 GB. * Witness Printer took 76.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. 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: 1 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((1 == t1_pc && token <= local + 1) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && 2 <= t1_st) || T1_E == 0) || (((((((1 == t1_pc && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && token == \old(token)) && m_st == 0) && token <= local) && 2 <= t1_st) && local <= token) && !(m_pc == 1))) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || (((((1 == t1_pc && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token <= local) && 2 <= m_st) && local <= token)) || T1_E == 1) || !(0 == \old(m_st))) || (((1 == t1_pc && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || ((((t1_pc == \old(t1_pc) && !(t1_pc == 1)) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && 2 <= m_st)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || (((((((t1_pc == \old(t1_pc) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token == \old(token)) && m_st == 0) && token <= local) && local <= token) && !(m_pc == 1))) || 1 == \old(m_pc)) && ((((((((((((((((((t1_pc == \old(t1_pc) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && 2 <= t1_st) && !(m_pc == 1)) || T1_E == 0) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || T1_E == 1) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((t1_pc == \old(t1_pc) && !(t1_pc == 1)) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && (((((((((((((T1_E == 0 || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || (((1 == t1_pc && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((t1_pc == \old(t1_pc) && !(t1_pc == 1)) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && 2 <= m_st)) || 0 == \old(E_1)) || 0 == \old(E_M))) && (((((((((((((((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_pc == 1) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || !(\old(t1_pc) == 1)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || ((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token <= local) && t1_pc == 1) && 2 <= m_st) && 1 == \old(t1_pc)) && local <= token)) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M)) || ((((((token <= local + 1 && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && t1_pc == 1) && 2 <= t1_st) && 1 == \old(t1_pc)))) && ((((((((((((T1_E == 0 || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((t1_pc == \old(t1_pc) && !(t1_pc == 1)) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || 0 == \old(E_1)) || 0 == \old(E_M))) && (((((((((((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_pc == 1) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M))) && ((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && (((((((((((((((((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_pc == 1) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token <= local) && t1_pc == 1) && 2 <= m_st) && 1 == \old(t1_pc)) && local <= token)) || 0 == \old(E_1)) || (((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && token == \old(token)) && m_st == 0) && token <= local) && t1_pc == 1) && 2 <= t1_st) && local <= token) && !(m_pc == 1))) || 0 == \old(E_M)) || ((((((token <= local + 1 && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && t1_pc == 1) && 2 <= t1_st) && 1 == \old(t1_pc))) || 1 == \old(m_pc))) && (((((((((((((((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_pc == 1) && 2 <= m_st) && 2 <= t1_st) || 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) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token <= local) && t1_pc == 1) && 2 <= m_st) && 1 == \old(t1_pc)) && local <= token)) || 0 == \old(E_1)) || 0 == \old(E_M)) || ((((((token <= local + 1 && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && t1_pc == 1) && 2 <= t1_st) && 1 == \old(t1_pc))) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((T1_E == 0 || !(t1_pc == 1)) || 0 == __retres1) || 0 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || token < local + 1) || 1 == E_1) || 0 == E_1) || local + 1 < token) || 0 == E_M) && ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || 0 == __retres1) || 0 == M_E) || 1 == m_pc) || 1 == M_E) || !(t1_st == 0))) && ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == __retres1) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || m_st < 2) || 0 == M_E) || !(t1_st == 0))) && ((((((((((((T1_E == 0 || local < token) || token < local) || 0 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == __retres1) || 1 == m_pc)) && (((((((((T1_E == 1 || T1_E == 0) || 0 == __retres1) || 1 == E_1) || 0 == E_1) || 0 == E_M) || m_st < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((((((((((T1_E == 0 || local < token) || !(t1_pc == 1)) || token < local) || 0 == __retres1) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || 0 == E_1) || 0 == E_M)) && ((((((((((1 == E_M || t1_st < 2) || T1_E == 1) || T1_E == 0) || 0 == __retres1) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((((((((((T1_E == 0 || local < token) || token < local) || m_st < 2) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || 0 == __retres1) || 1 == E_1) || 0 == E_1) || 0 == E_M)) && (((((((((1 == E_M || 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)) && (((((((((((1 == E_M || t1_st < 2) || !(0 == m_st)) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || 0 == __retres1) || 0 == M_E) || 1 == m_pc)) && (((((((((1 == E_M || t1_st < 2) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == __retres1) || 0 == E_1) || 0 == E_M) || m_st < 2) || 0 == M_E)) && (((((((((((((T1_E == 0 || local < token) || token < local) || t1_pc == 1) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || 0 == __retres1) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 1 == m_pc)) && ((((((((((((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 == E_M) || local + 1 < token) || 1 == E_M) || 0 == __retres1) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= m_st && 2 <= t1_st) && !(E_1 == 1)) && !(E_1 == 0)) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) && (((((((((((((T1_E == 0 || ((((((2 <= m_st && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && token <= local) && !(E_1 == 0)) && local <= token)) || ((((2 <= m_st && 2 <= t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0))) || !(t1_pc == 1)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) || 0 == E_M)) && (((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || (((2 <= m_st && !(E_1 == 1)) && t1_st == 0) && !(E_1 == 0))) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || !(\old(t1_st) == 0))) && (((((((((((((T1_E == 0 || ((((((2 <= m_st && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && token <= local) && !(E_1 == 0)) && local <= token)) || \old(local) < \old(token)) || ((((2 <= m_st && 2 <= t1_st) && !(E_1 == 1)) && !(T1_E == 0)) && !(E_1 == 0))) || \old(token) < \old(local)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || 1 == \old(m_pc)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == 0 || local < \old(token)) || (((((m_st == 0 && t1_pc == 1) && !(E_M == 0)) && token <= \old(token) + 1) && local + 1 <= token) && !(E_M == 1))) || !(\old(t1_pc) == 1)) || \old(token) < local) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_1) || (((t1_pc == 1 && 2 <= m_st) && !(E_M == 0)) && !(E_M == 1))) || 0 == E_1) || (((((((((!(T1_E == 1) && !(M_E == 0)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_M == 1))) || 0 == \old(E_M)) && ((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || (((((((((!(T1_E == 1) && !(M_E == 0)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_M == 1))) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || (((2 <= m_st && !(E_M == 0)) && t1_pc == \old(t1_pc)) && !(E_M == 1))) || 1 == E_1) || 0 == E_1) || (((((((((!(T1_E == 1) && !(M_E == 0)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_M == 1))) || 0 == \old(E_M)) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E)) && (((((((((((((T1_E == 0 || (((((m_st == 0 && !(E_M == 0)) && t1_pc == \old(t1_pc)) && token <= local) && local <= token) && !(E_M == 1))) || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || 1 == m_pc) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((1 == t1_pc && token <= local + 1) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && 2 <= t1_st) || T1_E == 0) || (((((((1 == t1_pc && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && token == \old(token)) && m_st == 0) && token <= local) && 2 <= t1_st) && local <= token) && !(m_pc == 1))) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || (((((1 == t1_pc && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token <= local) && 2 <= m_st) && local <= token)) || T1_E == 1) || !(0 == \old(m_st))) || (((1 == t1_pc && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || ((((t1_pc == \old(t1_pc) && !(t1_pc == 1)) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && 2 <= m_st)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || (((((((t1_pc == \old(t1_pc) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token == \old(token)) && m_st == 0) && token <= local) && local <= token) && !(m_pc == 1))) || 1 == \old(m_pc)) && ((((((((((((((((((t1_pc == \old(t1_pc) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && 2 <= t1_st) && !(m_pc == 1)) || T1_E == 0) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || T1_E == 1) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((t1_pc == \old(t1_pc) && !(t1_pc == 1)) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 1 == \old(m_pc))) && (((((((((((((T1_E == 0 || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || (((1 == t1_pc && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((t1_pc == \old(t1_pc) && !(t1_pc == 1)) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && 2 <= m_st)) || 0 == \old(E_1)) || 0 == \old(E_M))) && (((((((((((((((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_pc == 1) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || !(\old(t1_pc) == 1)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || ((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token <= local) && t1_pc == 1) && 2 <= m_st) && 1 == \old(t1_pc)) && local <= token)) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M)) || ((((((token <= local + 1 && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && t1_pc == 1) && 2 <= t1_st) && 1 == \old(t1_pc)))) && ((((((((((((T1_E == 0 || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((t1_pc == \old(t1_pc) && !(t1_pc == 1)) && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || 0 == \old(E_1)) || 0 == \old(E_M))) && (((((((((((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_pc == 1) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || !(\old(t1_pc) == 1)) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M))) && ((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && (((((((((((((((((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_pc == 1) && 2 <= m_st) && 2 <= t1_st) || T1_E == 0) || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token <= local) && t1_pc == 1) && 2 <= m_st) && 1 == \old(t1_pc)) && local <= token)) || 0 == \old(E_1)) || (((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && token == \old(token)) && m_st == 0) && token <= local) && t1_pc == 1) && 2 <= t1_st) && local <= token) && !(m_pc == 1))) || 0 == \old(E_M)) || ((((((token <= local + 1 && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && t1_pc == 1) && 2 <= t1_st) && 1 == \old(t1_pc))) || 1 == \old(m_pc))) && (((((((((((((((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_pc == 1) && 2 <= m_st) && 2 <= t1_st) || 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) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || T1_E == 1) || ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(E_1)) || ((((((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token <= local) && t1_pc == 1) && 2 <= m_st) && 1 == \old(t1_pc)) && local <= token)) || 0 == \old(E_1)) || 0 == \old(E_M)) || ((((((token <= local + 1 && (((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && local + 1 <= token) && t1_pc == 1) && 2 <= t1_st) && 1 == \old(t1_pc))) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || (((((((((!(T1_E == 1) && !(M_E == 0)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_M == 1))) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E) && (((((((((((1 == \old(E_M) || T1_E == 1) || ((((1 == t1_pc && 2 <= m_st) && !(E_M == 0)) && 2 <= t1_st) && !(E_M == 1))) || T1_E == 0) || 1 == E_1) || 0 == E_1) || (((((((((!(T1_E == 1) && !(M_E == 0)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_M == 1))) || 0 == \old(E_M)) || \old(t1_pc) == 1) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E)) && (((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_1) || 0 == E_1) || (((((((((!(T1_E == 1) && !(M_E == 0)) && 2 <= m_st) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && !(E_M == 1))) || 0 == \old(E_M)) || ((((((m_st == 0 && t1_pc == 1) && !(E_M == 0)) && 2 <= t1_st) && token <= \old(token) + 1) && local + 1 <= token) && !(E_M == 1))) || ((((t1_pc == 1 && 2 <= m_st) && !(E_M == 0)) && 2 <= t1_st) && !(E_M == 1)))) && (((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || ((((((1 == t1_pc && m_st == 0) && !(E_M == 0)) && 2 <= t1_st) && token <= local) && local <= token) && !(E_M == 1))) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || 1 == m_pc) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(m_st) < 2) || ((((t1_pc == 1 && 2 <= m_st) && token <= local) && local <= token) && \old(E_M) == E_M)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) && ((((((((((1 == \old(E_M) || T1_E == 1) || T1_E == 0) || 1 == E_1) || (2 <= m_st && \old(E_M) == E_M)) || 0 == E_1) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((((((((1 == \old(E_M) || 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_E)) && ((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || \old(t1_pc) == 1) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || !(0 == \old(m_st))) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || 1 == m_pc) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: (((((((((((((((((((((\old(T1_E) == 0 || (((((((t1_pc == \old(t1_pc) && (((!(T1_E == 1) && \old(T1_E) == T1_E) && !(M_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token == \old(token)) && m_st == 0) && token <= local) && local <= token) && !(m_pc == 1))) || \old(local) < \old(token)) || \old(token) < \old(local)) || \old(t1_pc) == 1) || (((((((1 == t1_pc && (((!(T1_E == 1) && \old(T1_E) == T1_E) && !(M_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_M == 1)) && !(E_1 == 1)) && token == \old(token)) && m_st == 0) && token <= local) && 2 <= t1_st) && local <= token) && !(m_pc == 1))) || (((1 == t1_pc && (((!(T1_E == 1) && \old(T1_E) == T1_E) && !(M_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || (((((1 == t1_pc && (((!(T1_E == 1) && \old(T1_E) == T1_E) && !(M_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && token <= local) && 2 <= m_st) && local <= token)) || ((((t1_pc == \old(t1_pc) && (((!(T1_E == 1) && \old(T1_E) == T1_E) && !(M_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_M == 1)) && !(E_1 == 1)) && m_st == 0) && 2 <= t1_st) && !(m_pc == 1))) || 0 == \old(M_E)) || 1 == \old(M_E)) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || (((((1 == t1_pc && (((!(T1_E == 1) && \old(T1_E) == T1_E) && !(M_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_M == 1)) && !(E_1 == 1)) && token <= local + 1) && m_st == 0) && local + 1 <= token) && 2 <= t1_st)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || (((t1_pc == \old(t1_pc) && (((!(T1_E == 1) && \old(T1_E) == T1_E) && !(M_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && 2 <= t1_st)) || 0 == \old(E_1)) || (((t1_pc == \old(t1_pc) && (((!(T1_E == 1) && \old(T1_E) == T1_E) && !(M_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_M == 1)) && !(E_1 == 1)) && t1_st == 0) && 2 <= m_st)) || 0 == \old(E_M)) || ((((((!(T1_E == 1) && \old(T1_E) == T1_E) && !(M_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(E_M == 1)) && !(E_1 == 1)) && 2 <= m_st) && !(m_pc == 1))) || 1 == \old(m_pc) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((((((((T1_E == 0 || !(t1_pc == 1)) || ((((token <= local + 1 && \old(E_1) == E_1) && token == \old(token)) && 2 <= t1_st) && local + 1 <= token)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) || 0 == E_M) && (((((((((((T1_E == 0 || \old(local) < \old(token)) || \old(token) < \old(local)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || !(\old(t1_st) == 0))) && (((((((((((T1_E == 0 || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) || 0 == E_M) || 1 == \old(m_pc))) && ((((((((((1 == E_M || \old(t1_st) < 2) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((T1_E == 0 || !(t1_pc == 1)) || 0 == __retres1) || 0 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || token < local + 1) || 1 == E_1) || 0 == E_1) || local + 1 < token) || 0 == E_M) && ((((((((((1 == E_M || T1_E == 1) || 0 == __retres1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || m_st < 2) || 0 == M_E) || !(t1_st == 0))) && ((((((((((((T1_E == 0 || 0 == __retres1) || local < token) || token < local) || 0 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 1 == m_pc)) && ((((((((((((T1_E == 0 || 0 == __retres1) || 1 == E_1) || local < token) || !(t1_pc == 1)) || token < local) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || 0 == E_1) || 0 == E_M)) && ((((((((((1 == E_M || t1_st < 2) || T1_E == 1) || T1_E == 0) || 0 == __retres1) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((((((((((((T1_E == 0 || 0 == __retres1) || local < token) || token < local) || t1_pc == 1) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 1 == m_pc)) && ((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || 0 == __retres1) || 0 == M_E) || 1 == m_pc) || 1 == M_E) || !(t1_st == 0))) && ((((1 == E_1 || ((((T1_E == 1 || T1_E == 0) || 0 == E_1) || 0 == E_M) || 0 == M_E) || 1 == M_E) || !(t1_pc == 1)) || 0 == __retres1) || m_st < 2)) && (((((((((((1 == E_M || t1_st < 2) || !(0 == m_st)) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == __retres1) || 0 == E_1) || 0 == E_M) || t1_pc == 1) || 0 == M_E) || 1 == m_pc)) && ((((1 == E_1 || ((((T1_E == 1 || T1_E == 0) || 0 == E_1) || 0 == E_M) || 0 == M_E) || 1 == M_E) || 0 == __retres1) || m_st < 2) || 1 == m_pc)) && ((((((!(0 == m_st) || 0 == __retres1) || 1 == E_1) || token < local + 1) || ((((T1_E == 1 || T1_E == 0) || 0 == E_1) || 0 == E_M) || 0 == M_E) || 1 == M_E) || !(t1_pc == 1)) || local + 1 < token)) && (((((((((((T1_E == 0 || local < token) || token < local) || m_st < 2) || 0 == M_E) || !(t1_st == 0)) || 0 == __retres1) || 1 == E_M) || T1_E == 1) || 1 == E_1) || 0 == E_1) || 0 == E_M)) && (((((((((1 == E_M || t1_st < 2) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == __retres1) || 0 == E_1) || 0 == E_M) || m_st < 2) || 0 == M_E)) && (((((((((1 == E_M || 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) - 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_st) == 0)) || 1 == \old(E_M)) || \old(T1_E) == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == \old(E_M)) || 1 == \old(m_pc) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((((((((T1_E == 0 || !(t1_pc == 1)) || ((((token <= local + 1 && \old(E_1) == E_1) && token == \old(token)) && 2 <= t1_st) && local + 1 <= token)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) || 0 == E_M) && (((((((((((1 == E_M || \old(t1_st) < 2) || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || ((\old(E_1) == E_1 && 2 <= t1_st) && !(m_pc == 1))) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && (((((((((((1 == E_M || T1_E == 1) || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || t1_pc == 1) || ((\old(E_1) == E_1 && !(m_pc == 1)) && t1_st == 0)) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || !(\old(t1_st) == 0))) && ((((((((((((T1_E == 0 || !(m_pc == 1)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) || 0 == E_M) || 1 == \old(m_pc))) && (((((((((((((T1_E == 0 || \old(local) < \old(token)) || !(t1_pc == 1)) || \old(token) < \old(local)) || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || (((((\old(E_1) == E_1 && token == \old(token)) && 2 <= t1_st) && !(m_pc == 1)) && token <= local) && local <= token)) || 1 == \old(E_1)) || 0 == \old(E_1)) || 0 == E_M) || 1 == \old(m_pc)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 144 locations, 1 error locations. SAFE Result, 23.5s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 19.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 2922 SDtfs, 3505 SDslu, 2944 SDs, 0 SdLazy, 3103 SolverSat, 1194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 466 GetRequests, 379 SyntacticMatches, 24 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=831occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 266 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 1694 PreInvPairs, 2244 NumberOfFragments, 22057 HoareAnnotationTreeSize, 1694 FomulaSimplifications, 144552 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 62 FomulaSimplificationsInter, 107953 FormulaSimplificationTreeSizeReductionInter, 18.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1808 NumberOfCodeBlocks, 1808 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1791 ConstructedInterpolants, 0 QuantifiedInterpolants, 318994 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1344 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 483/504 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...