./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_abe16e72-4e49-41da-a6df-c098b7e80740/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_abe16e72-4e49-41da-a6df-c098b7e80740/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_abe16e72-4e49-41da-a6df-c098b7e80740/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_abe16e72-4e49-41da-a6df-c098b7e80740/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_abe16e72-4e49-41da-a6df-c098b7e80740/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_abe16e72-4e49-41da-a6df-c098b7e80740/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2216fd6115b2bb44c4633e353be739828d7cac46 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 05:11:01,260 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:11:01,262 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:11:01,269 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:11:01,270 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:11:01,270 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:11:01,271 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:11:01,273 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:11:01,274 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:11:01,274 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:11:01,275 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:11:01,275 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:11:01,276 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:11:01,276 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:11:01,277 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:11:01,277 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:11:01,278 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:11:01,279 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:11:01,280 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:11:01,281 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:11:01,281 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:11:01,282 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:11:01,283 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:11:01,283 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:11:01,283 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:11:01,283 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:11:01,284 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:11:01,284 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:11:01,285 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:11:01,286 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:11:01,286 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:11:01,286 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:11:01,286 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:11:01,287 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:11:01,287 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:11:01,288 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:11:01,288 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_abe16e72-4e49-41da-a6df-c098b7e80740/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 05:11:01,296 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:11:01,296 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:11:01,297 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:11:01,297 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:11:01,297 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 05:11:01,297 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 05:11:01,298 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 05:11:01,298 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 05:11:01,298 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 05:11:01,298 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 05:11:01,298 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 05:11:01,298 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 05:11:01,298 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 05:11:01,299 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:11:01,299 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:11:01,299 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:11:01,299 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:11:01,299 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:11:01,300 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:11:01,300 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:11:01,300 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:11:01,300 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:11:01,300 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:11:01,300 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:11:01,300 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:11:01,301 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:11:01,301 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:11:01,301 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:11:01,301 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:11:01,301 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:11:01,301 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:11:01,302 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:11:01,302 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:11:01,302 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 05:11:01,302 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:11:01,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:11:01,302 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 05:11:01,302 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_abe16e72-4e49-41da-a6df-c098b7e80740/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2216fd6115b2bb44c4633e353be739828d7cac46 [2018-11-23 05:11:01,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:11:01,336 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:11:01,339 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:11:01,340 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:11:01,340 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:11:01,341 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_abe16e72-4e49-41da-a6df-c098b7e80740/bin-2019/utaipan/../../sv-benchmarks/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c [2018-11-23 05:11:01,390 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_abe16e72-4e49-41da-a6df-c098b7e80740/bin-2019/utaipan/data/4de62577e/deb2832c275940df8f26195cdce65f2a/FLAG56515011c [2018-11-23 05:11:01,752 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:11:01,753 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_abe16e72-4e49-41da-a6df-c098b7e80740/sv-benchmarks/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c [2018-11-23 05:11:01,761 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_abe16e72-4e49-41da-a6df-c098b7e80740/bin-2019/utaipan/data/4de62577e/deb2832c275940df8f26195cdce65f2a/FLAG56515011c [2018-11-23 05:11:02,150 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_abe16e72-4e49-41da-a6df-c098b7e80740/bin-2019/utaipan/data/4de62577e/deb2832c275940df8f26195cdce65f2a [2018-11-23 05:11:02,152 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:11:02,153 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:11:02,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:11:02,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:11:02,156 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:11:02,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:11:02" (1/1) ... [2018-11-23 05:11:02,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f51b539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:11:02, skipping insertion in model container [2018-11-23 05:11:02,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:11:02" (1/1) ... [2018-11-23 05:11:02,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:11:02,183 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:11:02,299 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:11:02,303 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:11:02,324 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:11:02,336 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:11:02,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:11:02 WrapperNode [2018-11-23 05:11:02,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:11:02,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:11:02,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:11:02,337 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:11:02,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:11:02" (1/1) ... [2018-11-23 05:11:02,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:11:02" (1/1) ... [2018-11-23 05:11:02,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:11:02,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:11:02,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:11:02,350 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:11:02,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:11:02" (1/1) ... [2018-11-23 05:11:02,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:11:02" (1/1) ... [2018-11-23 05:11:02,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:11:02" (1/1) ... [2018-11-23 05:11:02,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:11:02" (1/1) ... [2018-11-23 05:11:02,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:11:02" (1/1) ... [2018-11-23 05:11:02,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:11:02" (1/1) ... [2018-11-23 05:11:02,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:11:02" (1/1) ... [2018-11-23 05:11:02,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:11:02,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:11:02,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:11:02,410 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:11:02,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:11:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abe16e72-4e49-41da-a6df-c098b7e80740/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:11:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-23 05:11:02,442 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-23 05:11:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-11-23 05:11:02,442 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-11-23 05:11:02,442 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-23 05:11:02,442 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-23 05:11:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-23 05:11:02,443 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-23 05:11:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-23 05:11:02,443 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-23 05:11:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-11-23 05:11:02,443 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-11-23 05:11:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-23 05:11:02,443 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-23 05:11:02,443 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:11:02,444 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:11:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-23 05:11:02,444 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-23 05:11:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-11-23 05:11:02,444 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-11-23 05:11:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-23 05:11:02,444 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-23 05:11:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:11:02,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:11:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-23 05:11:02,445 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-23 05:11:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-23 05:11:02,445 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-23 05:11:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-23 05:11:02,445 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-23 05:11:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-23 05:11:02,445 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-23 05:11:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-23 05:11:02,445 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-23 05:11:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-11-23 05:11:02,446 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-11-23 05:11:02,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:11:02,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:11:02,446 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-23 05:11:02,446 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-23 05:11:02,446 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-23 05:11:02,446 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-23 05:11:02,780 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:11:02,780 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 05:11:02,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:11:02 BoogieIcfgContainer [2018-11-23 05:11:02,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:11:02,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:11:02,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:11:02,783 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:11:02,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:11:02" (1/3) ... [2018-11-23 05:11:02,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d8bb4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:11:02, skipping insertion in model container [2018-11-23 05:11:02,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:11:02" (2/3) ... [2018-11-23 05:11:02,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d8bb4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:11:02, skipping insertion in model container [2018-11-23 05:11:02,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:11:02" (3/3) ... [2018-11-23 05:11:02,786 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01_true-unreach-call_false-termination.cil.c [2018-11-23 05:11:02,792 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:11:02,799 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:11:02,812 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:11:02,842 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:11:02,843 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:11:02,843 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:11:02,843 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:11:02,843 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:11:02,843 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:11:02,843 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:11:02,843 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:11:02,861 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-11-23 05:11:02,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 05:11:02,867 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:11:02,868 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-11-23 05:11:02,870 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:11:02,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:02,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1448456726, now seen corresponding path program 1 times [2018-11-23 05:11:02,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:11:02,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:02,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:11:02,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:02,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:11:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:11:03,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:11:03,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:11:03,103 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:11:03,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:11:03,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:11:03,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:11:03,122 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2018-11-23 05:11:03,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:11:03,468 INFO L93 Difference]: Finished difference Result 298 states and 424 transitions. [2018-11-23 05:11:03,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:11:03,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-11-23 05:11:03,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:11:03,480 INFO L225 Difference]: With dead ends: 298 [2018-11-23 05:11:03,480 INFO L226 Difference]: Without dead ends: 161 [2018-11-23 05:11:03,483 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-11-23 05:11:03,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-23 05:11:03,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2018-11-23 05:11:03,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 05:11:03,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 176 transitions. [2018-11-23 05:11:03,535 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 176 transitions. Word has length 77 [2018-11-23 05:11:03,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:11:03,536 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 176 transitions. [2018-11-23 05:11:03,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:11:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 176 transitions. [2018-11-23 05:11:03,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 05:11:03,539 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:11:03,539 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-11-23 05:11:03,540 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:11:03,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:03,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1407781976, now seen corresponding path program 1 times [2018-11-23 05:11:03,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:11:03,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:03,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:11:03,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:03,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:11:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:03,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:11:03,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:11:03,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:11:03,643 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:11:03,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:11:03,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:11:03,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:11:03,645 INFO L87 Difference]: Start difference. First operand 135 states and 176 transitions. Second operand 5 states. [2018-11-23 05:11:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:11:03,909 INFO L93 Difference]: Finished difference Result 277 states and 376 transitions. [2018-11-23 05:11:03,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:11:03,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-11-23 05:11:03,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:11:03,912 INFO L225 Difference]: With dead ends: 277 [2018-11-23 05:11:03,912 INFO L226 Difference]: Without dead ends: 161 [2018-11-23 05:11:03,913 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-11-23 05:11:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-23 05:11:03,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2018-11-23 05:11:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 05:11:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 175 transitions. [2018-11-23 05:11:03,931 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 175 transitions. Word has length 77 [2018-11-23 05:11:03,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:11:03,932 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 175 transitions. [2018-11-23 05:11:03,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:11:03,936 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 175 transitions. [2018-11-23 05:11:03,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 05:11:03,938 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:11:03,938 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-11-23 05:11:03,938 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:11:03,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:03,938 INFO L82 PathProgramCache]: Analyzing trace with hash -20996566, now seen corresponding path program 1 times [2018-11-23 05:11:03,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:11:03,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:03,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:11:03,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:03,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:11:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:04,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:11:04,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:11:04,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:11:04,009 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:11:04,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:11:04,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:11:04,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:11:04,010 INFO L87 Difference]: Start difference. First operand 135 states and 175 transitions. Second operand 5 states. [2018-11-23 05:11:04,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:11:04,215 INFO L93 Difference]: Finished difference Result 291 states and 396 transitions. [2018-11-23 05:11:04,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:11:04,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-11-23 05:11:04,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:11:04,217 INFO L225 Difference]: With dead ends: 291 [2018-11-23 05:11:04,217 INFO L226 Difference]: Without dead ends: 175 [2018-11-23 05:11:04,217 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-11-23 05:11:04,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-23 05:11:04,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 135. [2018-11-23 05:11:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 05:11:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 174 transitions. [2018-11-23 05:11:04,232 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 174 transitions. Word has length 77 [2018-11-23 05:11:04,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:11:04,233 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 174 transitions. [2018-11-23 05:11:04,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:11:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 174 transitions. [2018-11-23 05:11:04,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 05:11:04,234 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:11:04,236 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-11-23 05:11:04,236 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:11:04,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:04,237 INFO L82 PathProgramCache]: Analyzing trace with hash 855022440, now seen corresponding path program 1 times [2018-11-23 05:11:04,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:11:04,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:04,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:11:04,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:04,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:11:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:11:04,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:11:04,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:11:04,288 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:11:04,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:11:04,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:11:04,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:11:04,289 INFO L87 Difference]: Start difference. First operand 135 states and 174 transitions. Second operand 5 states. [2018-11-23 05:11:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:11:04,482 INFO L93 Difference]: Finished difference Result 285 states and 385 transitions. [2018-11-23 05:11:04,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:11:04,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-11-23 05:11:04,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:11:04,485 INFO L225 Difference]: With dead ends: 285 [2018-11-23 05:11:04,485 INFO L226 Difference]: Without dead ends: 169 [2018-11-23 05:11:04,485 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-11-23 05:11:04,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-23 05:11:04,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 135. [2018-11-23 05:11:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-23 05:11:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 173 transitions. [2018-11-23 05:11:04,502 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 173 transitions. Word has length 77 [2018-11-23 05:11:04,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:11:04,502 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 173 transitions. [2018-11-23 05:11:04,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:11:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 173 transitions. [2018-11-23 05:11:04,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 05:11:04,504 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:11:04,504 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-11-23 05:11:04,504 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:11:04,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:04,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1298923114, now seen corresponding path program 1 times [2018-11-23 05:11:04,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:11:04,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:04,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:11:04,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:04,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:11:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:11:04,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:11:04,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 05:11:04,552 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:11:04,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:11:04,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:11:04,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:11:04,552 INFO L87 Difference]: Start difference. First operand 135 states and 173 transitions. Second operand 6 states. [2018-11-23 05:11:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:11:04,585 INFO L93 Difference]: Finished difference Result 260 states and 346 transitions. [2018-11-23 05:11:04,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:11:04,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-23 05:11:04,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:11:04,587 INFO L225 Difference]: With dead ends: 260 [2018-11-23 05:11:04,587 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 05:11:04,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:11:04,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 05:11:04,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 140. [2018-11-23 05:11:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-23 05:11:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 178 transitions. [2018-11-23 05:11:04,602 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 178 transitions. Word has length 77 [2018-11-23 05:11:04,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:11:04,603 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 178 transitions. [2018-11-23 05:11:04,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:11:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 178 transitions. [2018-11-23 05:11:04,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 05:11:04,604 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:11:04,604 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-11-23 05:11:04,604 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:11:04,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:04,605 INFO L82 PathProgramCache]: Analyzing trace with hash -72884184, now seen corresponding path program 1 times [2018-11-23 05:11:04,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:11:04,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:04,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:11:04,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:04,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:11:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:11:04,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:11:04,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 05:11:04,658 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:11:04,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:11:04,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:11:04,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:11:04,659 INFO L87 Difference]: Start difference. First operand 140 states and 178 transitions. Second operand 6 states. [2018-11-23 05:11:04,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:11:04,689 INFO L93 Difference]: Finished difference Result 267 states and 351 transitions. [2018-11-23 05:11:04,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:11:04,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-23 05:11:04,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:11:04,692 INFO L225 Difference]: With dead ends: 267 [2018-11-23 05:11:04,692 INFO L226 Difference]: Without dead ends: 147 [2018-11-23 05:11:04,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:11:04,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-23 05:11:04,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-11-23 05:11:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-23 05:11:04,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 183 transitions. [2018-11-23 05:11:04,705 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 183 transitions. Word has length 77 [2018-11-23 05:11:04,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:11:04,705 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 183 transitions. [2018-11-23 05:11:04,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:11:04,706 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 183 transitions. [2018-11-23 05:11:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 05:11:04,706 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:11:04,707 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-11-23 05:11:04,707 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:11:04,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:04,707 INFO L82 PathProgramCache]: Analyzing trace with hash 628715690, now seen corresponding path program 1 times [2018-11-23 05:11:04,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:11:04,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:04,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:11:04,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:04,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:11:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:11:04,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:11:04,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:11:04,754 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:11:04,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:11:04,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:11:04,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:11:04,755 INFO L87 Difference]: Start difference. First operand 145 states and 183 transitions. Second operand 5 states. [2018-11-23 05:11:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:11:05,008 INFO L93 Difference]: Finished difference Result 323 states and 413 transitions. [2018-11-23 05:11:05,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:11:05,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-11-23 05:11:05,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:11:05,010 INFO L225 Difference]: With dead ends: 323 [2018-11-23 05:11:05,010 INFO L226 Difference]: Without dead ends: 199 [2018-11-23 05:11:05,011 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-11-23 05:11:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-23 05:11:05,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 178. [2018-11-23 05:11:05,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-23 05:11:05,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 220 transitions. [2018-11-23 05:11:05,028 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 220 transitions. Word has length 77 [2018-11-23 05:11:05,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:11:05,028 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 220 transitions. [2018-11-23 05:11:05,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:11:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 220 transitions. [2018-11-23 05:11:05,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 05:11:05,030 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:11:05,030 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-11-23 05:11:05,030 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:11:05,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:05,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1743023572, now seen corresponding path program 1 times [2018-11-23 05:11:05,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:11:05,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:05,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:11:05,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:05,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:11:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:11:05,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:11:05,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:11:05,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:11:05,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:11:05,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:11:05,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:11:05,083 INFO L87 Difference]: Start difference. First operand 178 states and 220 transitions. Second operand 5 states. [2018-11-23 05:11:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:11:05,288 INFO L93 Difference]: Finished difference Result 335 states and 416 transitions. [2018-11-23 05:11:05,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:11:05,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-11-23 05:11:05,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:11:05,290 INFO L225 Difference]: With dead ends: 335 [2018-11-23 05:11:05,290 INFO L226 Difference]: Without dead ends: 178 [2018-11-23 05:11:05,291 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-11-23 05:11:05,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-11-23 05:11:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-11-23 05:11:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-23 05:11:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 218 transitions. [2018-11-23 05:11:05,302 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 218 transitions. Word has length 77 [2018-11-23 05:11:05,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:11:05,302 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 218 transitions. [2018-11-23 05:11:05,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:11:05,302 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 218 transitions. [2018-11-23 05:11:05,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 05:11:05,303 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:11:05,303 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-11-23 05:11:05,303 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:11:05,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:05,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1680983958, now seen corresponding path program 1 times [2018-11-23 05:11:05,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:11:05,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:05,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:11:05,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:05,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:11:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:05,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:11:05,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:11:05,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:11:05,345 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:11:05,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:11:05,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:11:05,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:11:05,346 INFO L87 Difference]: Start difference. First operand 178 states and 218 transitions. Second operand 5 states. [2018-11-23 05:11:05,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:11:05,615 INFO L93 Difference]: Finished difference Result 416 states and 539 transitions. [2018-11-23 05:11:05,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:11:05,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-11-23 05:11:05,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:11:05,617 INFO L225 Difference]: With dead ends: 416 [2018-11-23 05:11:05,617 INFO L226 Difference]: Without dead ends: 258 [2018-11-23 05:11:05,618 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-11-23 05:11:05,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-23 05:11:05,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 204. [2018-11-23 05:11:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-23 05:11:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 246 transitions. [2018-11-23 05:11:05,632 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 246 transitions. Word has length 77 [2018-11-23 05:11:05,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:11:05,632 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 246 transitions. [2018-11-23 05:11:05,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:11:05,632 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 246 transitions. [2018-11-23 05:11:05,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 05:11:05,633 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:11:05,633 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-11-23 05:11:05,633 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:11:05,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:05,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1540435348, now seen corresponding path program 1 times [2018-11-23 05:11:05,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:11:05,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:05,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:11:05,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:05,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:11:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:11:05,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:11:05,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:11:05,679 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:11:05,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:11:05,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:11:05,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:11:05,680 INFO L87 Difference]: Start difference. First operand 204 states and 246 transitions. Second operand 5 states. [2018-11-23 05:11:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:11:05,897 INFO L93 Difference]: Finished difference Result 438 states and 560 transitions. [2018-11-23 05:11:05,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:11:05,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-11-23 05:11:05,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:11:05,898 INFO L225 Difference]: With dead ends: 438 [2018-11-23 05:11:05,898 INFO L226 Difference]: Without dead ends: 254 [2018-11-23 05:11:05,899 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-11-23 05:11:05,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-23 05:11:05,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 219. [2018-11-23 05:11:05,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-23 05:11:05,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 258 transitions. [2018-11-23 05:11:05,914 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 258 transitions. Word has length 77 [2018-11-23 05:11:05,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:11:05,914 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 258 transitions. [2018-11-23 05:11:05,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:11:05,915 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 258 transitions. [2018-11-23 05:11:05,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 05:11:05,915 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:11:05,915 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-11-23 05:11:05,916 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:11:05,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:05,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1674448854, now seen corresponding path program 1 times [2018-11-23 05:11:05,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:11:05,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:05,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:11:05,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:05,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:11:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:05,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:11:05,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:11:05,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 05:11:05,952 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:11:05,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:11:05,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:11:05,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:11:05,952 INFO L87 Difference]: Start difference. First operand 219 states and 258 transitions. Second operand 3 states. [2018-11-23 05:11:05,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:11:05,983 INFO L93 Difference]: Finished difference Result 595 states and 733 transitions. [2018-11-23 05:11:05,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:11:05,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-11-23 05:11:05,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:11:05,985 INFO L225 Difference]: With dead ends: 595 [2018-11-23 05:11:05,985 INFO L226 Difference]: Without dead ends: 396 [2018-11-23 05:11:05,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 05:11:05,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-11-23 05:11:06,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 393. [2018-11-23 05:11:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-11-23 05:11:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 470 transitions. [2018-11-23 05:11:06,010 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 470 transitions. Word has length 77 [2018-11-23 05:11:06,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:11:06,011 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 470 transitions. [2018-11-23 05:11:06,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:11:06,011 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 470 transitions. [2018-11-23 05:11:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-23 05:11:06,012 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:11:06,013 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-11-23 05:11:06,013 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:11:06,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:06,013 INFO L82 PathProgramCache]: Analyzing trace with hash 47216360, now seen corresponding path program 1 times [2018-11-23 05:11:06,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:11:06,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:06,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:11:06,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:06,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:11:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 05:11:06,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:11:06,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:11:06,070 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:11:06,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 05:11:06,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:11:06,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:11:06,071 INFO L87 Difference]: Start difference. First operand 393 states and 470 transitions. Second operand 4 states. [2018-11-23 05:11:06,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:11:06,211 INFO L93 Difference]: Finished difference Result 1077 states and 1303 transitions. [2018-11-23 05:11:06,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 05:11:06,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-11-23 05:11:06,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:11:06,214 INFO L225 Difference]: With dead ends: 1077 [2018-11-23 05:11:06,214 INFO L226 Difference]: Without dead ends: 556 [2018-11-23 05:11:06,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:11:06,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-11-23 05:11:06,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 536. [2018-11-23 05:11:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-11-23 05:11:06,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 625 transitions. [2018-11-23 05:11:06,245 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 625 transitions. Word has length 121 [2018-11-23 05:11:06,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:11:06,245 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 625 transitions. [2018-11-23 05:11:06,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 05:11:06,246 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 625 transitions. [2018-11-23 05:11:06,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-23 05:11:06,247 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:11:06,248 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-11-23 05:11:06,248 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:11:06,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:06,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1355641863, now seen corresponding path program 1 times [2018-11-23 05:11:06,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:11:06,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:06,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:11:06,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:06,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:11:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-23 05:11:06,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:11:06,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:11:06,322 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2018-11-23 05:11:06,323 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [15], [17], [22], [25], [36], [38], [40], [42], [46], [48], [49], [52], [61], [62], [67], [73], [79], [85], [87], [88], [98], [100], [102], [103], [106], [112], [116], [117], [122], [127], [129], [132], [143], [145], [147], [151], [159], [162], [163], [175], [184], [187], [190], [196], [199], [209], [212], [224], [238], [240], [274], [280], [286], [292], [294], [295], [296], [299], [302], [306], [308], [310], [311], [340], [341], [342], [343], [344], [345], [346], [347], [348], [349], [350], [351], [352], [354], [355], [356], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [396], [397], [398] [2018-11-23 05:11:06,348 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:11:06,348 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:11:06,525 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:11:06,527 INFO L272 AbstractInterpreter]: Visited 90 different actions 112 times. Never merged. Never widened. Performed 630 root evaluator evaluations with a maximum evaluation depth of 3. Performed 630 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 30 variables. [2018-11-23 05:11:06,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:06,531 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:11:06,707 INFO L227 lantSequenceWeakener]: Weakened 118 states. On average, predicates are now at 77.23% of their original sizes. [2018-11-23 05:11:06,707 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:11:07,042 INFO L415 sIntCurrentIteration]: We unified 155 AI predicates to 155 [2018-11-23 05:11:07,042 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:11:07,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:11:07,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [6] total 44 [2018-11-23 05:11:07,043 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:11:07,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 05:11:07,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 05:11:07,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1356, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 05:11:07,044 INFO L87 Difference]: Start difference. First operand 536 states and 625 transitions. Second operand 40 states. [2018-11-23 05:11:10,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:11:10,904 INFO L93 Difference]: Finished difference Result 1284 states and 1520 transitions. [2018-11-23 05:11:10,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 05:11:10,904 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 156 [2018-11-23 05:11:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:11:10,907 INFO L225 Difference]: With dead ends: 1284 [2018-11-23 05:11:10,907 INFO L226 Difference]: Without dead ends: 764 [2018-11-23 05:11:10,909 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 191 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=671, Invalid=5029, Unknown=0, NotChecked=0, Total=5700 [2018-11-23 05:11:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-11-23 05:11:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 754. [2018-11-23 05:11:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2018-11-23 05:11:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 863 transitions. [2018-11-23 05:11:10,950 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 863 transitions. Word has length 156 [2018-11-23 05:11:10,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:11:10,951 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 863 transitions. [2018-11-23 05:11:10,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 05:11:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 863 transitions. [2018-11-23 05:11:10,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-23 05:11:10,953 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:11:10,953 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-23 05:11:10,953 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:11:10,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:10,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2024036685, now seen corresponding path program 1 times [2018-11-23 05:11:10,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:11:10,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:10,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:11:10,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:10,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:11:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-11-23 05:11:11,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:11:11,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:11:11,010 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-23 05:11:11,010 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [15], [17], [20], [22], [25], [36], [38], [40], [42], [46], [48], [49], [52], [54], [57], [61], [62], [67], [73], [79], [85], [87], [88], [98], [100], [102], [103], [106], [112], [116], [117], [122], [127], [129], [132], [143], [145], [147], [151], [159], [162], [163], [175], [184], [187], [190], [196], [199], [205], [209], [212], [224], [238], [240], [274], [280], [286], [292], [294], [295], [296], [299], [302], [306], [308], [310], [311], [340], [341], [342], [343], [344], [345], [346], [347], [348], [349], [350], [351], [352], [354], [355], [356], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [396], [397], [398] [2018-11-23 05:11:11,013 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:11:11,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:11:11,052 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:11:11,052 INFO L272 AbstractInterpreter]: Visited 98 different actions 128 times. Merged at 2 different actions 2 times. Never widened. Performed 745 root evaluator evaluations with a maximum evaluation depth of 3. Performed 745 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-11-23 05:11:11,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:11,060 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:11:11,158 INFO L227 lantSequenceWeakener]: Weakened 141 states. On average, predicates are now at 77.87% of their original sizes. [2018-11-23 05:11:11,158 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:11:11,640 INFO L415 sIntCurrentIteration]: We unified 174 AI predicates to 174 [2018-11-23 05:11:11,640 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:11:11,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:11:11,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [4] total 54 [2018-11-23 05:11:11,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:11:11,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-23 05:11:11,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-23 05:11:11,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=2334, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 05:11:11,642 INFO L87 Difference]: Start difference. First operand 754 states and 863 transitions. Second operand 52 states. [2018-11-23 05:11:16,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:11:16,573 INFO L93 Difference]: Finished difference Result 1388 states and 1620 transitions. [2018-11-23 05:11:16,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-23 05:11:16,573 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 175 [2018-11-23 05:11:16,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:11:16,576 INFO L225 Difference]: With dead ends: 1388 [2018-11-23 05:11:16,576 INFO L226 Difference]: Without dead ends: 601 [2018-11-23 05:11:16,578 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 210 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2488 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=888, Invalid=6768, Unknown=0, NotChecked=0, Total=7656 [2018-11-23 05:11:16,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-11-23 05:11:16,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 593. [2018-11-23 05:11:16,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-11-23 05:11:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 683 transitions. [2018-11-23 05:11:16,612 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 683 transitions. Word has length 175 [2018-11-23 05:11:16,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:11:16,613 INFO L480 AbstractCegarLoop]: Abstraction has 593 states and 683 transitions. [2018-11-23 05:11:16,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-23 05:11:16,613 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 683 transitions. [2018-11-23 05:11:16,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-23 05:11:16,615 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:11:16,615 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:11:16,615 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:11:16,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:16,616 INFO L82 PathProgramCache]: Analyzing trace with hash 303462817, now seen corresponding path program 1 times [2018-11-23 05:11:16,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:11:16,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:16,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:11:16,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:16,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:11:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 31 proven. 12 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 05:11:16,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:11:16,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:11:16,678 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-23 05:11:16,679 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [15], [17], [20], [22], [25], [36], [38], [40], [42], [46], [48], [49], [52], [61], [62], [67], [73], [79], [85], [87], [88], [98], [100], [102], [103], [106], [112], [116], [117], [122], [127], [129], [132], [143], [145], [147], [151], [159], [162], [163], [175], [184], [187], [190], [196], [199], [202], [209], [212], [224], [238], [240], [274], [280], [286], [292], [294], [295], [296], [299], [302], [306], [308], [310], [311], [340], [341], [342], [343], [344], [345], [346], [347], [348], [349], [350], [351], [352], [354], [355], [356], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [396], [397], [398] [2018-11-23 05:11:16,681 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:11:16,681 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:11:16,755 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:11:16,756 INFO L272 AbstractInterpreter]: Visited 100 different actions 282 times. Merged at 18 different actions 28 times. Never widened. Performed 2656 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2656 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 30 variables. [2018-11-23 05:11:16,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:16,761 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:11:16,845 INFO L227 lantSequenceWeakener]: Weakened 158 states. On average, predicates are now at 79.7% of their original sizes. [2018-11-23 05:11:16,845 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:11:17,416 INFO L415 sIntCurrentIteration]: We unified 174 AI predicates to 174 [2018-11-23 05:11:17,416 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:11:17,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:11:17,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [55] imperfect sequences [4] total 57 [2018-11-23 05:11:17,417 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:11:17,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-23 05:11:17,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-23 05:11:17,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=2624, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 05:11:17,418 INFO L87 Difference]: Start difference. First operand 593 states and 683 transitions. Second operand 55 states. [2018-11-23 05:11:27,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:11:27,047 INFO L93 Difference]: Finished difference Result 969 states and 1147 transitions. [2018-11-23 05:11:27,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-11-23 05:11:27,048 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 175 [2018-11-23 05:11:27,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:11:27,049 INFO L225 Difference]: With dead ends: 969 [2018-11-23 05:11:27,050 INFO L226 Difference]: Without dead ends: 451 [2018-11-23 05:11:27,052 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 241 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4808 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1522, Invalid=13240, Unknown=0, NotChecked=0, Total=14762 [2018-11-23 05:11:27,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-11-23 05:11:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 444. [2018-11-23 05:11:27,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-11-23 05:11:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 477 transitions. [2018-11-23 05:11:27,106 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 477 transitions. Word has length 175 [2018-11-23 05:11:27,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:11:27,107 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 477 transitions. [2018-11-23 05:11:27,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-23 05:11:27,107 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 477 transitions. [2018-11-23 05:11:27,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-23 05:11:27,109 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:11:27,109 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-23 05:11:27,109 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:11:27,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:27,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1995244166, now seen corresponding path program 1 times [2018-11-23 05:11:27,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:11:27,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:27,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:11:27,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:27,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:11:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:27,191 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 31 proven. 12 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 05:11:27,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:11:27,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:11:27,191 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 177 with the following transitions: [2018-11-23 05:11:27,192 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [15], [17], [20], [22], [25], [36], [38], [40], [42], [46], [48], [49], [52], [61], [62], [67], [73], [79], [85], [87], [88], [91], [96], [98], [100], [102], [103], [106], [112], [116], [117], [122], [127], [129], [132], [143], [145], [147], [151], [159], [162], [163], [175], [184], [187], [190], [196], [199], [202], [209], [212], [224], [238], [240], [274], [280], [286], [292], [294], [295], [296], [299], [302], [306], [308], [310], [311], [340], [341], [342], [343], [344], [345], [346], [347], [348], [349], [350], [351], [352], [354], [355], [356], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [396], [397], [398] [2018-11-23 05:11:27,194 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:11:27,194 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:11:27,285 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 05:11:27,285 INFO L272 AbstractInterpreter]: Visited 108 different actions 286 times. Merged at 23 different actions 30 times. Never widened. Performed 2451 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2451 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 6 different actions. Largest state had 30 variables. [2018-11-23 05:11:27,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:27,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 05:11:27,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:11:27,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abe16e72-4e49-41da-a6df-c098b7e80740/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:11:27,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:11:27,322 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 05:11:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:27,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:11:27,455 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 05:11:27,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:11:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 31 proven. 12 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 05:11:27,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:11:27,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2018-11-23 05:11:27,631 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:11:27,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:11:27,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:11:27,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:11:27,632 INFO L87 Difference]: Start difference. First operand 444 states and 477 transitions. Second operand 3 states. [2018-11-23 05:11:27,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:11:27,701 INFO L93 Difference]: Finished difference Result 772 states and 833 transitions. [2018-11-23 05:11:27,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:11:27,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2018-11-23 05:11:27,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:11:27,703 INFO L225 Difference]: With dead ends: 772 [2018-11-23 05:11:27,704 INFO L226 Difference]: Without dead ends: 444 [2018-11-23 05:11:27,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 346 SyntacticMatches, 7 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:11:27,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-11-23 05:11:27,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2018-11-23 05:11:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-11-23 05:11:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 476 transitions. [2018-11-23 05:11:27,759 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 476 transitions. Word has length 176 [2018-11-23 05:11:27,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:11:27,759 INFO L480 AbstractCegarLoop]: Abstraction has 444 states and 476 transitions. [2018-11-23 05:11:27,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:11:27,760 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 476 transitions. [2018-11-23 05:11:27,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-23 05:11:27,761 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:11:27,761 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-11-23 05:11:27,762 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:11:27,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:27,762 INFO L82 PathProgramCache]: Analyzing trace with hash -521841111, now seen corresponding path program 1 times [2018-11-23 05:11:27,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:11:27,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:27,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:11:27,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:27,763 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:11:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 05:11:27,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:11:27,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 05:11:27,893 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:11:27,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:11:27,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:11:27,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:11:27,894 INFO L87 Difference]: Start difference. First operand 444 states and 476 transitions. Second operand 6 states. [2018-11-23 05:11:28,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:11:28,401 INFO L93 Difference]: Finished difference Result 642 states and 721 transitions. [2018-11-23 05:11:28,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 05:11:28,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2018-11-23 05:11:28,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:11:28,403 INFO L225 Difference]: With dead ends: 642 [2018-11-23 05:11:28,404 INFO L226 Difference]: Without dead ends: 639 [2018-11-23 05:11:28,404 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-11-23 05:11:28,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-11-23 05:11:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 628. [2018-11-23 05:11:28,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-11-23 05:11:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 699 transitions. [2018-11-23 05:11:28,488 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 699 transitions. Word has length 176 [2018-11-23 05:11:28,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:11:28,488 INFO L480 AbstractCegarLoop]: Abstraction has 628 states and 699 transitions. [2018-11-23 05:11:28,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:11:28,488 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 699 transitions. [2018-11-23 05:11:28,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-11-23 05:11:28,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:11:28,490 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:11:28,490 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:11:28,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:11:28,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1300156851, now seen corresponding path program 2 times [2018-11-23 05:11:28,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:11:28,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:28,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:11:28,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:11:28,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:11:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:11:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-11-23 05:11:28,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:11:28,571 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:11:28,571 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 05:11:28,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 05:11:28,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:11:28,571 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_abe16e72-4e49-41da-a6df-c098b7e80740/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:11:28,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:11:28,583 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 05:11:28,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 05:11:28,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:11:28,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:11:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-23 05:11:28,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:11:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-11-23 05:11:28,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:11:28,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 4 [2018-11-23 05:11:28,879 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:11:28,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 05:11:28,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 05:11:28,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:11:28,880 INFO L87 Difference]: Start difference. First operand 628 states and 699 transitions. Second operand 3 states. [2018-11-23 05:11:28,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:11:28,963 INFO L93 Difference]: Finished difference Result 1082 states and 1221 transitions. [2018-11-23 05:11:28,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 05:11:28,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2018-11-23 05:11:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:11:28,965 INFO L225 Difference]: With dead ends: 1082 [2018-11-23 05:11:28,965 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 05:11:28,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:11:28,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 05:11:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 05:11:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 05:11:28,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 05:11:28,968 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 224 [2018-11-23 05:11:28,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:11:28,968 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:11:28,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 05:11:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 05:11:28,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 05:11:28,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 05:11:29,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:29,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:29,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:29,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:29,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:29,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:29,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:29,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:29,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:29,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:29,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:29,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:29,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:29,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:30,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:30,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:30,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:30,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:30,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:30,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:30,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:30,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:11:30,651 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 68 [2018-11-23 05:11:31,550 WARN L180 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 77 [2018-11-23 05:11:31,794 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 91 [2018-11-23 05:11:32,023 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 94 [2018-11-23 05:11:32,282 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 94 [2018-11-23 05:11:32,438 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2018-11-23 05:11:32,668 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 94 [2018-11-23 05:11:32,900 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 94 [2018-11-23 05:11:33,267 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 102 [2018-11-23 05:11:33,850 WARN L180 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 130 [2018-11-23 05:11:34,198 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 94 [2018-11-23 05:11:35,274 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 168 DAG size of output: 113 [2018-11-23 05:11:35,499 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 91 [2018-11-23 05:11:36,565 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 165 DAG size of output: 110 [2018-11-23 05:11:37,134 WARN L180 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 97 [2018-11-23 05:11:37,767 WARN L180 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 133 [2018-11-23 05:11:38,040 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 102 [2018-11-23 05:11:38,235 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2018-11-23 05:11:39,184 WARN L180 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 146 [2018-11-23 05:11:39,832 WARN L180 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 77 [2018-11-23 05:11:39,936 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 68 [2018-11-23 05:11:40,873 WARN L180 SmtUtils]: Spent 935.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 146 [2018-11-23 05:11:41,134 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 84 [2018-11-23 05:11:41,361 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 94 [2018-11-23 05:11:42,155 WARN L180 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 135 [2018-11-23 05:11:42,508 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2018-11-23 05:11:42,971 WARN L180 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 97 [2018-11-23 05:11:43,249 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 86 [2018-11-23 05:11:43,534 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 86 [2018-11-23 05:11:43,747 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 58 [2018-11-23 05:11:43,925 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 68 [2018-11-23 05:11:44,420 WARN L180 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 127 [2018-11-23 05:11:44,704 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 67 [2018-11-23 05:11:45,023 WARN L180 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 75 [2018-11-23 05:11:45,346 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 98 [2018-11-23 05:11:45,576 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 94 [2018-11-23 05:11:46,801 WARN L180 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 165 DAG size of output: 110 [2018-11-23 05:11:47,126 WARN L180 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 69 [2018-11-23 05:11:47,440 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2018-11-23 05:11:47,686 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2018-11-23 05:11:47,955 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2018-11-23 05:11:48,281 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 80 [2018-11-23 05:11:48,372 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 321) no Hoare annotation was computed. [2018-11-23 05:11:48,372 INFO L448 ceAbstractionStarter]: For program point L315(line 315) no Hoare annotation was computed. [2018-11-23 05:11:48,372 INFO L448 ceAbstractionStarter]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2018-11-23 05:11:48,372 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 313) no Hoare annotation was computed. [2018-11-23 05:11:48,372 INFO L444 ceAbstractionStarter]: At program point L307(line 307) the Hoare annotation is: (let ((.cse25 (= 1 ~m_pc~0))) (let ((.cse29 (not (= 0 ~local~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse19 (not .cse25)) (.cse18 (not (= 2 |old(~m_st~0)|))) (.cse31 (not (= 0 |old(~m_st~0)|))) (.cse4 (not (= (mod |old(~t1_st~0)| 2) 0))) (.cse13 (not (= 0 ~m_pc~0))) (.cse33 (+ ~local~0 1)) (.cse32 (= (mod ~t1_st~0 2) 0)) (.cse22 (<= 2 ~t1_st~0))) (let ((.cse1 (and .cse32 .cse22)) (.cse23 (<= 2 ~m_st~0)) (.cse24 (< |old(~m_st~0)| 2)) (.cse9 (< |old(~t1_st~0)| 2)) (.cse30 (= ~m_st~0 0)) (.cse16 (< ~token~0 .cse33)) (.cse20 (< .cse33 ~token~0)) (.cse28 (not (= ~t1_pc~0 0))) (.cse7 (= 1 ~M_E~0)) (.cse27 (not (= |old(~t1_st~0)| 0))) (.cse26 (= ~t1_st~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse2 (< ~local~0 ~token~0)) (.cse5 (< ~token~0 ~local~0)) (.cse15 (= ~m_st~0 2)) (.cse6 (= 0 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse10 (= ~T1_E~0 1)) (.cse17 (= 1 ~E_1~0)) (.cse21 (and (or .cse19 .cse18 .cse4) (or .cse31 .cse4 .cse13))) (.cse11 (= 0 ~E_1~0)) (.cse14 (and (or .cse19 .cse3) (or (not (= ~token~0 1)) .cse29 .cse3 .cse13))) (.cse12 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse12) (or (not .cse8) .cse0 .cse15 .cse6 .cse7 .cse10 .cse16 .cse17 (or .cse18 .cse3) .cse19 .cse11 .cse20) (or .cse0 .cse2 .cse5 .cse6 .cse8 .cse9 .cse10 .cse17 .cse21 .cse11 .cse14 .cse12 .cse22) (or .cse0 .cse18 .cse3 .cse6 .cse8 (not (= |old(~t1_st~0)| 2)) .cse10 .cse17 .cse19 .cse11 .cse12 (and .cse15 (= ~t1_st~0 2))) (or .cse8 .cse10 .cse0 .cse17 .cse23 .cse11 .cse12 .cse24 .cse6 .cse25) (or .cse23 .cse10 .cse0 .cse17 .cse11 .cse12 .cse24 .cse6 .cse25 .cse7) (or .cse0 .cse18 (and .cse15 .cse26) .cse6 .cse27 .cse8 .cse28 .cse10 .cse17 .cse19 .cse11 .cse12) (or (not (= ~T1_E~0 2)) .cse27 .cse28 (or (not (= ~token~0 0)) .cse29) (not (= 1 ~t1_i~0)) .cse13 .cse30 (not (= 2 ~E_M~0)) .cse31 (not (= ~m_i~0 1)) (not (= 2 ~E_1~0)) (not (= 2 ~M_E~0))) (or .cse0 .cse4 .cse6 .cse8 .cse9 .cse10 .cse31 (and .cse30 .cse32 .cse22) .cse16 .cse17 .cse19 .cse11 .cse14 .cse20 .cse12) (or .cse8 .cse28 .cse10 .cse0 .cse11 .cse12 .cse6 .cse13 .cse7 .cse27 .cse26) (or .cse0 .cse2 .cse5 (and .cse32 .cse15) .cse6 .cse8 .cse10 .cse17 .cse21 .cse11 .cse14 .cse12))))) [2018-11-23 05:11:48,373 INFO L444 ceAbstractionStarter]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse32 (= 1 ~m_pc~0))) (let ((.cse19 (not (= 0 ~local~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse24 (not .cse32)) (.cse22 (not (= 2 |old(~m_st~0)|))) (.cse20 (not (= 0 |old(~m_st~0)|))) (.cse3 (not (= (mod |old(~t1_st~0)| 2) 0))) (.cse13 (not (= 0 ~m_pc~0))) (.cse34 (+ ~local~0 1)) (.cse26 (= (mod ~t1_st~0 2) 0)) (.cse27 (<= 2 ~t1_st~0)) (.cse15 (= activate_threads_~tmp~1 0))) (let ((.cse10 (and .cse26 .cse27 .cse15)) (.cse16 (= ~t1_st~0 0)) (.cse17 (not (= |old(~t1_st~0)| 0))) (.cse14 (not (= ~t1_pc~0 0))) (.cse21 (= ~m_st~0 0)) (.cse28 (< ~token~0 .cse34)) (.cse29 (< .cse34 ~token~0)) (.cse30 (<= 2 ~m_st~0)) (.cse31 (< |old(~m_st~0)| 2)) (.cse6 (= 1 ~M_E~0)) (.cse8 (< |old(~t1_st~0)| 2)) (.cse0 (= ~T1_E~0 0)) (.cse25 (= ~m_st~0 2)) (.cse1 (< ~local~0 ~token~0)) (.cse4 (< ~token~0 ~local~0)) (.cse5 (= 0 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse9 (= ~T1_E~0 1)) (.cse23 (= 1 ~E_1~0)) (.cse33 (and (or .cse24 .cse22 .cse3) (or .cse20 .cse3 .cse13))) (.cse11 (= 0 ~E_1~0)) (.cse18 (and (or .cse24 .cse2) (or (not (= ~token~0 1)) .cse19 .cse2 .cse13))) (.cse12 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse7 .cse14 .cse9 .cse0 .cse11 (and .cse15 .cse16) .cse12 .cse5 .cse13 .cse6 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse18 .cse12) (or (not (= ~T1_E~0 2)) .cse17 .cse14 (or (not (= ~token~0 0)) .cse19) (not (= 1 ~t1_i~0)) .cse13 (not (= 2 ~E_M~0)) .cse20 (not (= ~m_i~0 1)) (not (= 2 ~E_1~0)) .cse21 (not (= 2 ~M_E~0))) (or .cse0 .cse22 .cse2 .cse5 .cse7 (not (= |old(~t1_st~0)| 2)) .cse9 .cse23 .cse24 .cse11 .cse12 (and .cse25 (= ~t1_st~0 2))) (or .cse0 .cse3 (and .cse21 .cse26 .cse27 .cse15) .cse5 .cse7 .cse8 .cse9 .cse20 .cse28 .cse23 .cse24 .cse11 .cse18 .cse29 .cse12) (or .cse0 .cse22 (and .cse25 .cse15 .cse16) .cse5 .cse17 .cse7 .cse14 .cse9 .cse23 .cse24 .cse11 .cse12) (or (not .cse7) .cse0 .cse21 .cse25 .cse5 .cse6 .cse9 .cse28 .cse23 (or .cse22 .cse2) .cse24 .cse11 .cse29) (or .cse7 .cse30 .cse9 .cse0 .cse23 .cse11 .cse12 .cse31 .cse5 .cse32) (or .cse30 .cse9 .cse0 .cse23 .cse11 .cse12 .cse31 .cse5 .cse32 .cse6) (or .cse0 .cse1 .cse4 .cse5 .cse7 .cse8 .cse9 .cse23 .cse33 .cse27 .cse11 .cse18 .cse12) (or .cse0 (and .cse26 .cse25 .cse15) .cse1 .cse4 .cse5 .cse7 .cse9 .cse23 .cse33 .cse11 .cse18 .cse12))))) [2018-11-23 05:11:48,373 INFO L448 ceAbstractionStarter]: For program point L307-1(line 307) no Hoare annotation was computed. [2018-11-23 05:11:48,373 INFO L444 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse25 (= 1 ~m_pc~0))) (let ((.cse29 (not (= 0 ~local~0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse19 (not .cse25)) (.cse18 (not (= 2 |old(~m_st~0)|))) (.cse31 (not (= 0 |old(~m_st~0)|))) (.cse4 (not (= (mod |old(~t1_st~0)| 2) 0))) (.cse13 (not (= 0 ~m_pc~0))) (.cse33 (+ ~local~0 1)) (.cse32 (= (mod ~t1_st~0 2) 0)) (.cse22 (<= 2 ~t1_st~0))) (let ((.cse1 (and .cse32 .cse22)) (.cse23 (<= 2 ~m_st~0)) (.cse24 (< |old(~m_st~0)| 2)) (.cse9 (< |old(~t1_st~0)| 2)) (.cse30 (= ~m_st~0 0)) (.cse16 (< ~token~0 .cse33)) (.cse20 (< .cse33 ~token~0)) (.cse28 (not (= ~t1_pc~0 0))) (.cse7 (= 1 ~M_E~0)) (.cse27 (not (= |old(~t1_st~0)| 0))) (.cse26 (= ~t1_st~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse2 (< ~local~0 ~token~0)) (.cse5 (< ~token~0 ~local~0)) (.cse15 (= ~m_st~0 2)) (.cse6 (= 0 ~M_E~0)) (.cse8 (= 1 ~E_M~0)) (.cse10 (= ~T1_E~0 1)) (.cse17 (= 1 ~E_1~0)) (.cse21 (and (or .cse19 .cse18 .cse4) (or .cse31 .cse4 .cse13))) (.cse11 (= 0 ~E_1~0)) (.cse14 (and (or .cse19 .cse3) (or (not (= ~token~0 1)) .cse29 .cse3 .cse13))) (.cse12 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse1 .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse14 .cse12) (or (not .cse8) .cse0 .cse15 .cse6 .cse7 .cse10 .cse16 .cse17 (or .cse18 .cse3) .cse19 .cse11 .cse20) (or .cse0 .cse2 .cse5 .cse6 .cse8 .cse9 .cse10 .cse17 .cse21 .cse11 .cse14 .cse12 .cse22) (or .cse0 .cse18 .cse3 .cse6 .cse8 (not (= |old(~t1_st~0)| 2)) .cse10 .cse17 .cse19 .cse11 .cse12 (and .cse15 (= ~t1_st~0 2))) (or .cse8 .cse10 .cse0 .cse17 .cse23 .cse11 .cse12 .cse24 .cse6 .cse25) (or .cse23 .cse10 .cse0 .cse17 .cse11 .cse12 .cse24 .cse6 .cse25 .cse7) (or .cse0 .cse18 (and .cse15 .cse26) .cse6 .cse27 .cse8 .cse28 .cse10 .cse17 .cse19 .cse11 .cse12) (or (not (= ~T1_E~0 2)) .cse27 .cse28 (or (not (= ~token~0 0)) .cse29) (not (= 1 ~t1_i~0)) .cse13 .cse30 (not (= 2 ~E_M~0)) .cse31 (not (= ~m_i~0 1)) (not (= 2 ~E_1~0)) (not (= 2 ~M_E~0))) (or .cse0 .cse4 .cse6 .cse8 .cse9 .cse10 .cse31 (and .cse30 .cse32 .cse22) .cse16 .cse17 .cse19 .cse11 .cse14 .cse20 .cse12) (or .cse8 .cse28 .cse10 .cse0 .cse11 .cse12 .cse6 .cse13 .cse7 .cse27 .cse26) (or .cse0 .cse2 .cse5 (and .cse32 .cse15) .cse6 .cse8 .cse10 .cse17 .cse21 .cse11 .cse14 .cse12))))) [2018-11-23 05:11:48,373 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2018-11-23 05:11:48,373 INFO L444 ceAbstractionStarter]: At program point L89-1(lines 77 108) the Hoare annotation is: (let ((.cse4 (= ~T1_E~0 1)) (.cse14 (not (= ~E_M~0 0))) (.cse5 (= ~T1_E~0 0)) (.cse16 (not (= ~E_M~0 1)))) (let ((.cse2 (not (= |old(~t1_pc~0)| 0))) (.cse8 (and (not .cse4) (not (= ~M_E~0 0)) (<= 2 ~m_st~0) .cse14 (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) (not .cse5) (not (= ~M_E~0 1)) (not (= ~E_1~0 0)) .cse16)) (.cse1 (= ~t1_pc~0 0)) (.cse10 (= 0 ~M_E~0)) (.cse12 (= 1 ~M_E~0)) (.cse3 (= 1 |old(~E_M~0)|)) (.cse0 (= ~m_st~0 0)) (.cse6 (= 1 ~E_1~0)) (.cse13 (not (= 2 |old(~m_st~0)|))) (.cse7 (= 0 ~E_1~0)) (.cse11 (= 1 ~m_pc~0)) (.cse9 (= 0 |old(~E_M~0)|)) (.cse15 (= ~m_st~0 2))) (and (or (and .cse0 (= ~E_M~0 2) (= ~token~0 0) .cse1) (not (= 0 ~local~0)) (not (= ~T1_E~0 2)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~token~0)| 0)) .cse2 (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 2 ~E_1~0)) (not (= 1 ~t1_i~0)) (not (= 2 ~M_E~0)) (not (= 0 ~m_pc~0))) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< |old(~m_st~0)| 2) .cse10 .cse11 .cse12) (or .cse5 .cse13 .cse10 .cse12 .cse3 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 (and .cse14 .cse15 .cse1 .cse16)) (or .cse5 (< ~local~0 |old(~token~0)|) (< |old(~token~0)| ~local~0) .cse10 .cse12 .cse3 (and .cse0 .cse14 (= ~t1_pc~0 1) (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0) .cse16) .cse4 .cse6 .cse13 .cse7 (or (not .cse11) (not (= |old(~t1_pc~0)| 1))) .cse9 (and .cse14 .cse15 .cse16))))) [2018-11-23 05:11:48,373 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2018-11-23 05:11:48,374 INFO L444 ceAbstractionStarter]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse14 (= 1 ~m_pc~0))) (let ((.cse2 (= ~T1_E~0 0)) (.cse8 (not (= 2 |old(~m_st~0)|))) (.cse9 (= ~m_st~0 2)) (.cse0 (= ~t1_pc~0 0)) (.cse10 (= |old(~E_M~0)| ~E_M~0)) (.cse3 (= 0 ~M_E~0)) (.cse4 (= 1 ~M_E~0)) (.cse5 (= 1 |old(~E_M~0)|)) (.cse1 (not (= |old(~t1_pc~0)| 0))) (.cse6 (= ~T1_E~0 1)) (.cse7 (= 1 ~E_1~0)) (.cse12 (not .cse14)) (.cse11 (= 0 ~E_1~0)) (.cse13 (= 0 |old(~E_M~0)|))) (and (or (and (= ~m_st~0 0) (= ~E_M~0 2) (= ~token~0 0) .cse0) (not (= 0 ~local~0)) (not (= ~T1_E~0 2)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~token~0)| 0)) .cse1 (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 2 ~E_1~0)) (not (= 1 ~t1_i~0)) (not (= 2 ~M_E~0)) (not (= 0 ~m_pc~0))) (or .cse2 (< ~local~0 |old(~token~0)|) (< |old(~token~0)| ~local~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and (= ~t1_pc~0 1) .cse9 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse10) .cse11 (or .cse12 (not (= |old(~t1_pc~0)| 1))) .cse13) (or .cse5 .cse6 .cse2 .cse7 (and (<= 2 ~m_st~0) .cse10) .cse11 .cse13 (< |old(~m_st~0)| 2) .cse3 .cse14 .cse4) (or .cse2 .cse8 (and .cse9 .cse0 .cse10) .cse3 .cse4 .cse5 .cse1 .cse6 .cse7 .cse12 .cse11 .cse13)))) [2018-11-23 05:11:48,374 INFO L448 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-11-23 05:11:48,374 INFO L444 ceAbstractionStarter]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse11 (= 1 ~m_pc~0))) (let ((.cse7 (= |old(~E_M~0)| ~E_M~0)) (.cse3 (= 1 |old(~E_M~0)|)) (.cse4 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse5 (= 1 ~E_1~0)) (.cse9 (not .cse11)) (.cse6 (not (= 2 |old(~m_st~0)|))) (.cse8 (= 0 ~E_1~0)) (.cse10 (= 0 |old(~E_M~0)|)) (.cse1 (= 0 ~M_E~0)) (.cse2 (= 1 ~M_E~0)) (.cse12 (not (= |old(~t1_pc~0)| 0)))) (and (or .cse0 (< ~local~0 |old(~token~0)|) (< |old(~token~0)| ~local~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and (= ~t1_pc~0 1) (= ~m_st~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse7) .cse8 (or .cse9 (not (= |old(~t1_pc~0)| 1))) .cse10) (or .cse3 .cse4 .cse0 .cse5 (and (<= 2 ~m_st~0) .cse7) .cse8 .cse10 (< |old(~m_st~0)| 2) .cse1 .cse11 .cse2) (or .cse3 .cse12 .cse4 .cse0 .cse5 .cse9 .cse6 .cse8 .cse10 .cse1 .cse2) (or (not (= 0 ~local~0)) (not (= ~T1_E~0 2)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~token~0)| 0)) .cse12 (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 2 ~E_1~0)) (not (= 1 ~t1_i~0)) (not (= 2 ~M_E~0)) (not (= 0 ~m_pc~0)))))) [2018-11-23 05:11:48,374 INFO L448 ceAbstractionStarter]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2018-11-23 05:11:48,374 INFO L444 ceAbstractionStarter]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse2 (= ~T1_E~0 0))) (let ((.cse1 (= ~T1_E~0 1)) (.cse12 (= ~t1_pc~0 1)) (.cse13 (not (= ~E_M~0 0))) (.cse17 (= ~t1_st~0 2)) (.cse18 (not .cse2)) (.cse14 (not (= ~E_M~0 1)))) (let ((.cse8 (= 1 ~m_pc~0)) (.cse11 (= ~m_st~0 0)) (.cse10 (and .cse12 .cse13 (= ~m_st~0 2) .cse17 .cse18 .cse14)) (.cse15 (not (= 2 |old(~m_st~0)|))) (.cse7 (= 0 ~M_E~0)) (.cse9 (= 1 ~M_E~0)) (.cse0 (= 1 |old(~E_M~0)|)) (.cse16 (not (= |old(~t1_pc~0)| 0))) (.cse3 (= 1 ~E_1~0)) (.cse4 (= 0 ~E_1~0)) (.cse5 (and (not .cse1) (not (= ~M_E~0 0)) (<= 2 ~m_st~0) .cse13 (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) .cse18 (not (= ~M_E~0 1)) (not (= ~E_1~0 0)) .cse14)) (.cse6 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< |old(~m_st~0)| 2) .cse7 .cse8 .cse9) (or .cse10 .cse2 (< ~local~0 |old(~token~0)|) (< |old(~token~0)| ~local~0) (and .cse11 (= (mod ~t1_st~0 2) 0) .cse12 .cse13 (<= 2 ~t1_st~0) (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0) .cse14) .cse7 .cse9 .cse0 .cse1 .cse3 .cse15 .cse4 (or (not .cse8) (not (= |old(~t1_pc~0)| 1))) .cse6) (or (not (= 0 ~local~0)) (not (= ~T1_E~0 2)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~token~0)| 0)) .cse16 (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 2 ~E_1~0)) (and .cse11 .cse12 .cse13 .cse17 (= ~token~0 0) .cse14) (not (= 1 ~t1_i~0)) (not (= 2 ~M_E~0)) (not (= 0 ~m_pc~0))) (or .cse2 .cse10 .cse15 .cse7 .cse9 .cse0 .cse16 .cse1 .cse3 .cse4 .cse5 .cse6))))) [2018-11-23 05:11:48,374 INFO L444 ceAbstractionStarter]: At program point L99(line 99) the Hoare annotation is: (let ((.cse10 (= 1 ~m_pc~0))) (let ((.cse3 (= 1 |old(~E_M~0)|)) (.cse4 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse5 (= 1 ~E_1~0)) (.cse8 (not .cse10)) (.cse6 (not (= 2 |old(~m_st~0)|))) (.cse7 (= 0 ~E_1~0)) (.cse9 (= 0 |old(~E_M~0)|)) (.cse1 (= 0 ~M_E~0)) (.cse2 (= 1 ~M_E~0)) (.cse11 (not (= |old(~t1_pc~0)| 0)))) (and (or .cse0 (< ~local~0 |old(~token~0)|) (< |old(~token~0)| ~local~0) (and (= ~t1_pc~0 1) (= ~m_st~0 2) (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0) (= ~E_M~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (or .cse8 (not (= |old(~t1_pc~0)| 1))) .cse9) (or .cse3 .cse4 .cse0 .cse5 (and (<= 2 ~m_st~0) (not (= ~E_M~0 0))) .cse7 .cse9 (< |old(~m_st~0)| 2) .cse1 .cse10 .cse2) (or .cse3 .cse11 .cse4 .cse0 .cse5 .cse8 .cse6 .cse7 .cse9 .cse1 .cse2) (or (not (= 0 ~local~0)) (not (= ~T1_E~0 2)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~token~0)| 0)) .cse11 (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 2 ~E_1~0)) (not (= 1 ~t1_i~0)) (not (= 2 ~M_E~0)) (not (= 0 ~m_pc~0)))))) [2018-11-23 05:11:48,374 INFO L448 ceAbstractionStarter]: For program point L99-1(line 99) no Hoare annotation was computed. [2018-11-23 05:11:48,374 INFO L448 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2018-11-23 05:11:48,375 INFO L444 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse17 (= 1 ~m_pc~0))) (let ((.cse15 (= 1 ~E_1~0)) (.cse13 (not (= 0 ~m_pc~0))) (.cse1 (and (= (mod ~t1_st~0 2) 0) (<= 2 ~t1_st~0))) (.cse0 (= ~T1_E~0 0)) (.cse2 (< ~local~0 ~token~0)) (.cse4 (not (= (mod |old(~t1_st~0)| 2) 0))) (.cse5 (< ~token~0 ~local~0)) (.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)) (.cse11 (= 0 ~E_1~0)) (.cse16 (not .cse17)) (.cse3 (not (= ~t1_pc~0 1))) (.cse12 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse14 (+ ~local~0 1))) (or (not .cse8) .cse0 (= ~m_st~0 2) .cse6 .cse7 .cse10 (< ~token~0 .cse14) .cse15 (or (not (= 2 |old(~m_st~0)|)) .cse3) .cse16 .cse11 (< .cse14 ~token~0))) (or (<= 2 ~m_st~0) .cse10 .cse0 .cse15 .cse11 .cse12 (< |old(~m_st~0)| 2) .cse6 .cse17 .cse7) (or .cse8 (not (= ~t1_pc~0 0)) .cse10 .cse0 .cse11 .cse12 .cse6 .cse13 .cse7 (not (= |old(~t1_st~0)| 0)) (= ~t1_st~0 0)) (or .cse1 .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or .cse16 .cse3) .cse12)))) [2018-11-23 05:11:48,375 INFO L448 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2018-11-23 05:11:48,375 INFO L444 ceAbstractionStarter]: At program point L190(lines 177 192) the Hoare annotation is: (let ((.cse1 (not (= ~token~0 0))) (.cse2 (not (= 0 ~local~0))) (.cse3 (not (= 0 ~m_pc~0))) (.cse4 (= exists_runnable_thread_~__retres1~2 1)) (.cse0 (not (= 0 ~m_st~0)))) (and (or (= ~T1_E~0 0) (= 0 ~M_E~0) (= 1 ~M_E~0) (not (= ~t1_st~0 2)) (= 1 ~E_M~0) (= ~T1_E~0 1) .cse0 (or .cse1 .cse2 (not (= ~t1_pc~0 1)) .cse3) (= 1 ~E_1~0) .cse4 (= 0 ~E_1~0) (= 0 ~E_M~0)) (or (not (= ~T1_E~0 2)) (not (= ~t1_st~0 0)) (not (= ~t1_pc~0 0)) (or .cse1 .cse2) (not (= 1 ~t1_i~0)) .cse3 .cse4 (not (= 2 ~E_M~0)) .cse0 (not (= ~m_i~0 1)) (not (= 2 ~E_1~0)) (not (= 2 ~M_E~0))))) [2018-11-23 05:11:48,375 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2018-11-23 05:11:48,375 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 187) no Hoare annotation was computed. [2018-11-23 05:11:48,375 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2018-11-23 05:11:48,375 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 188) no Hoare annotation was computed. [2018-11-23 05:11:48,375 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2018-11-23 05:11:48,375 INFO L448 ceAbstractionStarter]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2018-11-23 05:11:48,375 INFO L448 ceAbstractionStarter]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2018-11-23 05:11:48,375 INFO L448 ceAbstractionStarter]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2018-11-23 05:11:48,376 INFO L444 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse12 (= 1 ~m_pc~0))) (let ((.cse17 (= |old(~T1_E~0)| ~T1_E~0)) (.cse18 (= |old(~M_E~0)| ~M_E~0)) (.cse21 (not .cse12)) (.cse15 (not (= 0 ~local~0))) (.cse22 (not (= ~t1_pc~0 1))) (.cse16 (not (= 0 ~m_pc~0)))) (let ((.cse7 (not (= (mod ~t1_st~0 2) 0))) (.cse19 (not (= 0 ~m_st~0))) (.cse9 (and (or .cse21 .cse22) (or (not (= ~token~0 1)) .cse15 .cse22 .cse16))) (.cse11 (and (= |old(~E_1~0)| ~E_1~0) .cse17 .cse18 (= |old(~E_M~0)| ~E_M~0))) (.cse0 (= |old(~T1_E~0)| 0)) (.cse6 (not (= 2 ~m_st~0))) (.cse1 (= 0 |old(~M_E~0)|)) (.cse2 (= 1 |old(~M_E~0)|)) (.cse13 (not (= ~t1_st~0 0))) (.cse3 (= 1 |old(~E_M~0)|)) (.cse14 (not (= ~t1_pc~0 0))) (.cse4 (= |old(~T1_E~0)| 1)) (.cse5 (= 1 |old(~E_1~0)|)) (.cse8 (= 0 |old(~E_1~0)|)) (.cse10 (= 0 |old(~E_M~0)|))) (and (or .cse0 (< ~local~0 ~token~0) (< ~token~0 ~local~0) .cse1 .cse2 .cse3 .cse4 .cse5 (or .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or .cse3 .cse4 .cse0 .cse5 .cse11 .cse8 .cse10 (< ~m_st~0 2) .cse1 .cse12 .cse2) (or (not (= |old(~T1_E~0)| 2)) .cse13 .cse14 (or (not (= ~token~0 0)) .cse15) (not (= 1 ~t1_i~0)) .cse16 (and (= ~E_1~0 2) (= ~E_M~0 2) .cse17 .cse18) (not (= 2 |old(~E_M~0)|)) .cse19 (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|))) (let ((.cse20 (+ ~local~0 1))) (or .cse0 .cse7 .cse11 .cse1 .cse2 .cse3 (< ~t1_st~0 2) .cse4 .cse19 (< ~token~0 .cse20) .cse5 .cse21 .cse8 .cse9 (< .cse20 ~token~0) .cse10)) (or .cse0 .cse11 .cse6 .cse22 .cse1 .cse2 .cse3 (not (= ~t1_st~0 2)) .cse4 .cse5 .cse8 .cse10) (or .cse11 .cse0 .cse6 .cse1 .cse2 .cse13 .cse3 .cse14 .cse4 .cse5 .cse8 .cse10))))) [2018-11-23 05:11:48,376 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2018-11-23 05:11:48,376 INFO L448 ceAbstractionStarter]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2018-11-23 05:11:48,376 INFO L448 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2018-11-23 05:11:48,376 INFO L451 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2018-11-23 05:11:48,376 INFO L448 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2018-11-23 05:11:48,377 INFO L444 ceAbstractionStarter]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse25 (= 1 ~m_pc~0))) (let ((.cse9 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse11 (= 0 ~E_1~0)) (.cse13 (= 0 ~E_M~0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse18 (not .cse25)) (.cse2 (not (= ~t1_pc~0 1))) (.cse14 (not (= 0 ~m_pc~0))) (.cse26 (+ ~local~0 1))) (let ((.cse8 (< ~t1_st~0 2)) (.cse16 (not (= 0 ~m_st~0))) (.cse17 (< ~token~0 .cse26)) (.cse20 (< .cse26 ~token~0)) (.cse22 (not (= ~t1_pc~0 0))) (.cse21 (not (= ~t1_st~0 0))) (.cse1 (< ~local~0 ~token~0)) (.cse4 (< ~token~0 ~local~0)) (.cse3 (not (= (mod ~t1_st~0 2) 0))) (.cse23 (and (or .cse18 .cse2) (or (not (= ~token~0 1)) (not (= 0 ~local~0)) .cse2 .cse14))) (.cse15 (not (= 2 ~m_st~0))) (.cse19 (or .cse9 .cse0 .cse11 .cse13 .cse5 .cse6)) (.cse7 (= 1 ~E_M~0)) (.cse12 (= 1 ~E_1~0)) (.cse10 (= 0 is_transmit1_triggered_~__retres1~1)) (.cse24 (< ~m_st~0 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse15 .cse2 .cse5 .cse10 .cse7 (not (= ~t1_st~0 2)) .cse9 .cse12 .cse11 .cse13) (or (not .cse7) .cse16 .cse12 .cse17 .cse18 .cse19 .cse2 .cse20 .cse10) (or .cse0 .cse15 .cse5 .cse21 .cse7 .cse22 .cse9 .cse12 .cse11 .cse10 .cse13) (or .cse0 .cse1 .cse10 .cse3 .cse4 .cse5 .cse12 .cse6 .cse7 .cse8 .cse9 .cse11 .cse23 .cse13) (or .cse0 .cse10 .cse3 .cse5 .cse7 .cse8 .cse9 .cse16 .cse17 .cse12 .cse18 .cse11 .cse23 .cse20 .cse13) (or .cse7 .cse22 .cse9 .cse0 .cse11 .cse13 .cse10 .cse5 .cse14 .cse6 .cse21) (or .cse0 .cse1 .cse4 .cse10 .cse5 .cse7 .cse9 .cse12 (or .cse15 .cse3) .cse11 .cse23 .cse13) (or .cse12 .cse10 .cse19 .cse15) (or .cse12 .cse19 .cse10 .cse24 .cse25) (or .cse7 .cse9 .cse0 .cse12 .cse10 .cse11 .cse13 .cse24 .cse5 .cse25))))) [2018-11-23 05:11:48,377 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 139) no Hoare annotation was computed. [2018-11-23 05:11:48,377 INFO L448 ceAbstractionStarter]: For program point L133(lines 133 142) no Hoare annotation was computed. [2018-11-23 05:11:48,377 INFO L448 ceAbstractionStarter]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2018-11-23 05:11:48,377 INFO L448 ceAbstractionStarter]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2018-11-23 05:11:48,377 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2018-11-23 05:11:48,377 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 156 173) the Hoare annotation is: (or (not (= ~T1_E~0 2)) (not (= |old(~t1_st~0)| 0)) (not (= ~t1_pc~0 0)) (or (not (= ~token~0 0)) (not (= 0 ~local~0))) (not (= 1 ~t1_i~0)) (not (= 0 ~m_pc~0)) (and (= ~m_st~0 0) (= ~t1_st~0 0)) (not (= 2 ~E_M~0)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 2 ~E_1~0)) (not (= 2 ~M_E~0))) [2018-11-23 05:11:48,377 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2018-11-23 05:11:48,377 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 462 473) the Hoare annotation is: (or (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= ~token~0 0) (= ~local~0 0) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|))) [2018-11-23 05:11:48,377 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2018-11-23 05:11:48,378 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2018-11-23 05:11:48,378 INFO L448 ceAbstractionStarter]: For program point L468(line 468) no Hoare annotation was computed. [2018-11-23 05:11:48,378 INFO L444 ceAbstractionStarter]: At program point L467(line 467) the Hoare annotation is: (or (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (and (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= ~token~0 0) (= ~local~0 0) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|))) [2018-11-23 05:11:48,378 INFO L444 ceAbstractionStarter]: At program point L467-1(line 467) the Hoare annotation is: (or (and (= ~m_st~0 0) (= ~m_i~0 1) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t1_i~0 1) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= ~token~0 0) (= ~local~0 0) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|))) [2018-11-23 05:11:48,378 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-23 05:11:48,378 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-11-23 05:11:48,378 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-11-23 05:11:48,378 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-11-23 05:11:48,378 INFO L448 ceAbstractionStarter]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2018-11-23 05:11:48,379 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-23 05:11:48,379 INFO L444 ceAbstractionStarter]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse3 (= 0 ~M_E~0)) (.cse4 (= 1 ~M_E~0)) (.cse5 (= 1 ~E_M~0)) (.cse6 (< |old(~t1_st~0)| 2)) (.cse7 (= ~T1_E~0 1)) (.cse14 (not (= |old(~token~0)| 0))) (.cse13 (not (= 0 |old(~local~0)|))) (.cse11 (not (= ~t1_pc~0 1))) (.cse15 (not (= 0 |old(~m_pc~0)|))) (.cse9 (= 1 |old(~E_1~0)|)) (.cse2 (not (= (mod |old(~t1_st~0)| 2) 0))) (.cse10 (= 0 |old(~E_1~0)|)) (.cse12 (= 0 ~E_M~0))) (and (let ((.cse8 (+ |old(~local~0)| 1))) (or .cse0 (let ((.cse1 (+ ~local~0 1))) (and (= ~m_pc~0 1) (<= ~token~0 .cse1) (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (= (mod ~t1_st~0 2) 0) (<= 2 ~t1_st~0) (<= .cse1 ~token~0))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< |old(~token~0)| .cse8) .cse9 .cse10 (or (not (= 1 |old(~m_pc~0)|)) .cse11) (< .cse8 |old(~token~0)|) .cse12)) (or .cse13 (not (= ~T1_E~0 2)) (not (= 2 ~E_M~0)) (not (= |old(~t1_st~0)| 0)) .cse14 (not (= ~t1_pc~0 0)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t1_i~0)) (not (= 2 ~M_E~0)) .cse15) (or .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 (or .cse14 .cse13 .cse11 .cse15) .cse9 .cse2 .cse10 .cse12))) [2018-11-23 05:11:48,379 INFO L444 ceAbstractionStarter]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse16 (= ~m_st~0 2)) (.cse17 (not (= ~E_1~0 1))) (.cse18 (not (= ~E_1~0 0))) (.cse15 (= ~m_pc~0 1))) (let ((.cse0 (= ~T1_E~0 0)) (.cse3 (= 0 ~M_E~0)) (.cse4 (= 1 ~M_E~0)) (.cse5 (= 1 ~E_M~0)) (.cse6 (< |old(~t1_st~0)| 2)) (.cse7 (= ~T1_E~0 1)) (.cse14 (not (= |old(~token~0)| 0))) (.cse13 (not (= 0 |old(~local~0)|))) (.cse11 (not (= ~t1_pc~0 1))) (.cse19 (not (= 0 |old(~m_pc~0)|))) (.cse9 (= 1 |old(~E_1~0)|)) (.cse2 (not (= (mod |old(~t1_st~0)| 2) 0))) (.cse10 (= 0 |old(~E_1~0)|)) (.cse12 (= 0 ~E_M~0)) (.cse1 (and .cse16 .cse17 (<= ~token~0 ~local~0) .cse18 (and .cse15 (= (mod ~t1_st~0 2) 0)) (<= ~local~0 ~token~0)))) (and (let ((.cse8 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< |old(~token~0)| .cse8) .cse9 .cse10 (or (not (= 1 |old(~m_pc~0)|)) .cse11) (< .cse8 |old(~token~0)|) .cse12)) (or .cse13 (not (= ~T1_E~0 2)) (not (= 2 ~E_M~0)) (not (= |old(~t1_st~0)| 0)) .cse14 (not (= ~t1_pc~0 0)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t1_i~0)) (and .cse15 .cse16 .cse17 (= ~t1_st~0 0) .cse18) (not (= 2 ~M_E~0)) .cse19) (or .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 (or .cse14 .cse13 .cse11 .cse19) .cse9 .cse2 .cse10 .cse12 .cse1)))) [2018-11-23 05:11:48,379 INFO L444 ceAbstractionStarter]: At program point L61(line 61) the Hoare annotation is: (let ((.cse3 (= ~T1_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse8 (< |old(~t1_st~0)| 2)) (.cse9 (= ~T1_E~0 1)) (.cse1 (not (= |old(~token~0)| 0))) (.cse0 (not (= 0 |old(~local~0)|))) (.cse13 (not (= ~t1_pc~0 1))) (.cse2 (not (= 0 |old(~m_pc~0)|))) (.cse11 (= 1 |old(~E_1~0)|)) (.cse4 (not (= (mod |old(~t1_st~0)| 2) 0))) (.cse12 (= 0 |old(~E_1~0)|)) (.cse14 (= 0 ~E_M~0))) (and (or .cse0 (not (= ~T1_E~0 2)) (not (= 2 ~E_M~0)) (not (= |old(~t1_st~0)| 0)) .cse1 (not (= ~t1_pc~0 0)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t1_i~0)) (not (= 2 ~M_E~0)) .cse2) (let ((.cse10 (+ |old(~local~0)| 1))) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< |old(~token~0)| .cse10) .cse11 .cse12 (or (not (= 1 |old(~m_pc~0)|)) .cse13) (< .cse10 |old(~token~0)|) .cse14)) (or .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 (or .cse1 .cse0 .cse13 .cse2) .cse11 .cse4 .cse12 .cse14))) [2018-11-23 05:11:48,380 INFO L444 ceAbstractionStarter]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse6 (= ~T1_E~0 0)) (.cse12 (= 0 ~M_E~0)) (.cse13 (= 1 ~M_E~0)) (.cse14 (= 1 ~E_M~0)) (.cse15 (< |old(~t1_st~0)| 2)) (.cse16 (= ~T1_E~0 1)) (.cse4 (not (= |old(~token~0)| 0))) (.cse0 (not (= 0 |old(~local~0)|))) (.cse20 (not (= ~t1_pc~0 1))) (.cse5 (not (= 0 |old(~m_pc~0)|))) (.cse18 (= 1 |old(~E_1~0)|)) (.cse8 (= |old(~E_1~0)| ~E_1~0)) (.cse9 (= (mod ~t1_st~0 2) 0)) (.cse1 (= ~m_pc~0 0)) (.cse10 (<= 2 ~t1_st~0)) (.cse2 (= ~token~0 0)) (.cse3 (= ~local~0 0)) (.cse11 (not (= (mod |old(~t1_st~0)| 2) 0))) (.cse19 (= 0 |old(~E_1~0)|)) (.cse21 (= 0 ~E_M~0))) (and (or .cse0 (and .cse1 (= ~E_1~0 2) (= ~t1_st~0 0) .cse2 .cse3) (not (= ~T1_E~0 2)) (not (= 2 ~E_M~0)) (not (= |old(~t1_st~0)| 0)) .cse4 (not (= ~t1_pc~0 0)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t1_i~0)) (not (= 2 ~M_E~0)) .cse5) (let ((.cse17 (+ |old(~local~0)| 1))) (or .cse6 (let ((.cse7 (+ ~local~0 1))) (and (= ~m_pc~0 1) (<= ~token~0 .cse7) .cse8 (= ~token~0 |old(~token~0)|) .cse9 .cse10 (<= .cse7 ~token~0))) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (< |old(~token~0)| .cse17) .cse18 .cse19 (or (not (= 1 |old(~m_pc~0)|)) .cse20) (< .cse17 |old(~token~0)|) .cse21)) (or .cse6 .cse12 .cse13 .cse14 .cse15 .cse16 (or .cse4 .cse0 .cse20 .cse5) .cse18 (and .cse8 .cse9 .cse1 .cse10 .cse2 .cse3) .cse11 .cse19 .cse21))) [2018-11-23 05:11:48,380 INFO L444 ceAbstractionStarter]: At program point L51(line 51) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse2 (= 0 ~M_E~0)) (.cse3 (= 1 ~M_E~0)) (.cse11 (= (mod ~t1_st~0 2) 0)) (.cse17 (= ~m_pc~0 0)) (.cse12 (<= 2 ~t1_st~0)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (not (= ~E_1~0 0))) (.cse15 (<= ~local~0 ~token~0)) (.cse4 (= 1 ~E_M~0)) (.cse5 (< |old(~t1_st~0)| 2)) (.cse6 (= ~T1_E~0 1)) (.cse19 (not (= |old(~token~0)| 0))) (.cse18 (not (= 0 |old(~local~0)|))) (.cse10 (not (= ~t1_pc~0 1))) (.cse20 (not (= 0 |old(~m_pc~0)|))) (.cse8 (= 1 |old(~E_1~0)|)) (.cse1 (not (= (mod |old(~t1_st~0)| 2) 0))) (.cse9 (= 0 |old(~E_1~0)|)) (.cse16 (= 0 ~E_M~0))) (and (let ((.cse7 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< |old(~token~0)| .cse7) .cse8 .cse9 (or (not (= 1 |old(~m_pc~0)|)) .cse10) (and (= ~m_pc~0 1) .cse11 .cse12 .cse13 .cse14 .cse15) (< .cse7 |old(~token~0)|) .cse16)) (or (and .cse17 (= ~t1_st~0 0) .cse14) .cse18 (not (= ~T1_E~0 2)) (not (= 2 ~E_M~0)) (not (= |old(~t1_st~0)| 0)) .cse19 (not (= ~t1_pc~0 0)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t1_i~0)) (not (= 2 ~M_E~0)) .cse20) (or .cse0 .cse2 .cse3 (and .cse11 .cse17 .cse12 .cse13 .cse14 .cse15) .cse4 .cse5 .cse6 (or .cse19 .cse18 .cse10 .cse20) .cse8 .cse1 .cse9 .cse16))) [2018-11-23 05:11:48,380 INFO L448 ceAbstractionStarter]: For program point L51-1(line 51) no Hoare annotation was computed. [2018-11-23 05:11:48,380 INFO L444 ceAbstractionStarter]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse8 (= |old(~E_1~0)| ~E_1~0)) (.cse9 (= (mod ~t1_st~0 2) 0)) (.cse1 (= ~m_pc~0 0)) (.cse10 (<= 2 ~t1_st~0)) (.cse2 (= ~token~0 0)) (.cse3 (= ~local~0 0)) (.cse6 (= ~T1_E~0 0)) (.cse12 (= 0 ~M_E~0)) (.cse13 (= 1 ~M_E~0)) (.cse14 (= 1 ~E_M~0)) (.cse15 (< |old(~t1_st~0)| 2)) (.cse16 (= ~T1_E~0 1)) (.cse4 (not (= |old(~token~0)| 0))) (.cse0 (not (= 0 |old(~local~0)|))) (.cse20 (not (= ~t1_pc~0 1))) (.cse5 (not (= 0 |old(~m_pc~0)|))) (.cse18 (= 1 |old(~E_1~0)|)) (.cse11 (not (= (mod |old(~t1_st~0)| 2) 0))) (.cse19 (= 0 |old(~E_1~0)|)) (.cse21 (= 0 ~E_M~0))) (and (or .cse0 (and .cse1 (= ~E_1~0 2) (= ~t1_st~0 0) .cse2 .cse3) (not (= ~T1_E~0 2)) (not (= 2 ~E_M~0)) (not (= |old(~t1_st~0)| 0)) .cse4 (not (= ~t1_pc~0 0)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t1_i~0)) (not (= 2 ~M_E~0)) .cse5) (let ((.cse17 (+ |old(~local~0)| 1))) (or .cse6 (let ((.cse7 (+ ~local~0 1))) (and (= ~m_pc~0 1) (<= ~token~0 .cse7) .cse8 (= ~token~0 |old(~token~0)|) .cse9 .cse10 (<= .cse7 ~token~0))) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (< |old(~token~0)| .cse17) .cse18 .cse19 (or (not (= 1 |old(~m_pc~0)|)) .cse20) (< .cse17 |old(~token~0)|) .cse21)) (or (and .cse8 .cse9 .cse1 .cse10 .cse2 .cse3) .cse6 .cse12 .cse13 .cse14 .cse15 .cse16 (or .cse4 .cse0 .cse20 .cse5) .cse18 .cse11 .cse19 .cse21))) [2018-11-23 05:11:48,380 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-23 05:11:48,381 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2018-11-23 05:11:48,381 INFO L444 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse15 (= 1 ~m_pc~0))) (let ((.cse13 (not .cse15)) (.cse10 (not (= ~t1_pc~0 1)))) (let ((.cse2 (not (= 2 ~m_st~0))) (.cse11 (not (= (mod ~t1_st~0 2) 0))) (.cse14 (and (or .cse13 .cse10) (or (not (= ~token~0 1)) (not (= 0 ~local~0)) .cse10 (not (= 0 ~m_pc~0))))) (.cse5 (= 1 ~E_M~0)) (.cse6 (= ~T1_E~0 1)) (.cse1 (= ~T1_E~0 0)) (.cse7 (= 1 ~E_1~0)) (.cse0 (= |old(~M_E~0)| ~M_E~0)) (.cse8 (= 0 ~E_1~0)) (.cse9 (= 0 ~E_M~0)) (.cse3 (= 0 |old(~M_E~0)|)) (.cse4 (= 1 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~t1_st~0 0)) .cse5 (not (= ~t1_pc~0 0)) .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse0 .cse2 .cse10 .cse3 .cse4 .cse5 (not (= ~t1_st~0 2)) .cse6 .cse7 .cse8 .cse9) (let ((.cse12 (+ ~local~0 1))) (or .cse1 .cse11 .cse0 .cse3 .cse4 .cse5 (< ~t1_st~0 2) .cse6 (not (= 0 ~m_st~0)) (< ~token~0 .cse12) .cse7 .cse13 .cse8 .cse14 (< .cse12 ~token~0) .cse9)) (or .cse1 (< ~local~0 ~token~0) (< ~token~0 ~local~0) .cse3 .cse4 .cse5 .cse6 .cse7 (or .cse2 .cse11) .cse8 .cse14 .cse9 .cse0) (or .cse5 .cse6 .cse1 .cse7 .cse0 .cse8 .cse9 (< ~m_st~0 2) .cse3 .cse15 .cse4))))) [2018-11-23 05:11:48,381 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2018-11-23 05:11:48,381 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 05:11:48,381 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T1_E~0)| ~T1_E~0) (= ~token~0 |old(~token~0)|) (= |old(~M_E~0)| ~M_E~0) (= |old(~E_M~0)| ~E_M~0)) [2018-11-23 05:11:48,381 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 05:11:48,381 INFO L451 ceAbstractionStarter]: At program point L399(lines 388 401) the Hoare annotation is: true [2018-11-23 05:11:48,381 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 397) no Hoare annotation was computed. [2018-11-23 05:11:48,381 INFO L451 ceAbstractionStarter]: At program point L390(line 390) the Hoare annotation is: true [2018-11-23 05:11:48,382 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2018-11-23 05:11:48,382 INFO L448 ceAbstractionStarter]: For program point L390-1(line 390) no Hoare annotation was computed. [2018-11-23 05:11:48,382 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2018-11-23 05:11:48,382 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2018-11-23 05:11:48,382 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse27 (= 1 |old(~m_pc~0)|))) (let ((.cse33 (not (= 0 |old(~local~0)|))) (.cse35 (not (= |old(~t1_pc~0)| 1))) (.cse25 (not .cse27)) (.cse30 (not (= 2 |old(~m_st~0)|))) (.cse23 (not (= 0 |old(~m_st~0)|))) (.cse14 (not (= (mod |old(~t1_st~0)| 2) 0))) (.cse34 (not (= 0 |old(~m_pc~0)|)))) (let ((.cse9 (<= 2 ~t1_st~0)) (.cse6 (< |old(~t1_st~0)| 2)) (.cse1 (< |old(~local~0)| |old(~token~0)|)) (.cse2 (< |old(~token~0)| |old(~local~0)|)) (.cse10 (and (or .cse25 .cse30 .cse14) (or .cse23 .cse14 .cse34))) (.cse12 (and (or .cse25 .cse35) (or (not (= |old(~token~0)| 1)) .cse33 .cse35 .cse34))) (.cse18 (= ~token~0 |old(~token~0)|)) (.cse20 (= (mod ~t1_st~0 2) 0)) (.cse31 (not (= |old(~t1_st~0)| 0))) (.cse32 (not (= |old(~t1_pc~0)| 0))) (.cse19 (= ~m_st~0 0)) (.cse28 (= ~t1_st~0 0)) (.cse29 (= ~t1_pc~0 0)) (.cse0 (= ~T1_E~0 0)) (.cse15 (= ~m_pc~0 1)) (.cse17 (= |old(~E_1~0)| ~E_1~0)) (.cse21 (= ~t1_pc~0 1)) (.cse26 (= ~m_st~0 2)) (.cse22 (= |old(~E_M~0)| ~E_M~0)) (.cse3 (= 0 ~M_E~0)) (.cse4 (= 1 ~M_E~0)) (.cse5 (= 1 |old(~E_M~0)|)) (.cse7 (= ~T1_E~0 1)) (.cse8 (= 1 |old(~E_1~0)|)) (.cse11 (= 0 |old(~E_1~0)|)) (.cse13 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (let ((.cse24 (+ |old(~local~0)| 1))) (or .cse0 .cse14 (let ((.cse16 (+ ~local~0 1))) (and .cse15 (<= ~token~0 .cse16) .cse17 .cse18 .cse19 .cse20 .cse21 .cse9 (<= .cse16 ~token~0) .cse22)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 (< |old(~token~0)| .cse24) .cse8 .cse25 .cse11 .cse12 (< .cse24 |old(~token~0)|) .cse13)) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 (and .cse15 .cse17 .cse18 .cse20 .cse21 .cse26 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse22)) (or .cse5 .cse7 .cse0 .cse8 (and .cse17 (<= 2 ~m_st~0) (not .cse15) .cse22) .cse11 .cse13 (< |old(~m_st~0)| 2) .cse3 .cse27 .cse4) (or (and .cse15 .cse17 .cse26 .cse28 .cse29 .cse22) .cse0 .cse30 .cse3 .cse4 .cse31 .cse5 .cse32 .cse7 .cse8 .cse25 .cse11 .cse13) (or (not (= ~T1_E~0 2)) .cse31 .cse32 (or (not (= |old(~token~0)| 0)) .cse33) (not (= 1 ~t1_i~0)) .cse34 (and .cse19 (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) .cse28 (= ~token~0 0) (= ~local~0 0) .cse29) (not (= 2 |old(~E_M~0)|)) .cse23 (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 2 ~M_E~0))) (or .cse0 (and .cse15 .cse17 .cse21 .cse26 (= ~t1_st~0 2) .cse22) .cse30 .cse35 .cse3 .cse4 .cse5 (not (= |old(~t1_st~0)| 2)) .cse7 .cse8 .cse25 .cse11 .cse13))))) [2018-11-23 05:11:48,382 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 220) no Hoare annotation was computed. [2018-11-23 05:11:48,382 INFO L448 ceAbstractionStarter]: For program point L205(lines 205 209) no Hoare annotation was computed. [2018-11-23 05:11:48,382 INFO L448 ceAbstractionStarter]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2018-11-23 05:11:48,383 INFO L448 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2018-11-23 05:11:48,383 INFO L444 ceAbstractionStarter]: At program point L201(line 201) the Hoare annotation is: (let ((.cse38 (= 1 |old(~m_pc~0)|)) (.cse7 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0))) (let ((.cse35 (= ~t1_st~0 2)) (.cse39 (= ~m_pc~0 1)) (.cse25 (= ~m_st~0 0)) (.cse18 (<= 2 ~t1_st~0)) (.cse34 (= ~t1_pc~0 1)) (.cse41 (= (mod ~t1_st~0 2) 0)) (.cse33 (and (and (not .cse7) (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)))) (.cse24 (= ~t1_st~0 0)) (.cse17 (= ~m_st~0 2)) (.cse29 (= ~t1_pc~0 0)) (.cse37 (not .cse38)) (.cse23 (not (= 0 |old(~local~0)|))) (.cse3 (not (= |old(~t1_pc~0)| 1))) (.cse30 (not (= 0 |old(~m_pc~0)|)))) (let ((.cse14 (< |old(~t1_st~0)| 2)) (.cse31 (not (= 0 |old(~m_st~0)|))) (.cse16 (and (or .cse37 .cse3) (or (not (= |old(~token~0)| 1)) .cse23 .cse3 .cse30))) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse22 (not (= |old(~t1_pc~0)| 0))) (.cse32 (and .cse33 .cse24 .cse17 .cse29)) (.cse19 (and .cse33 (<= ~token~0 ~local~0) .cse34 .cse17 .cse41 (<= ~local~0 ~token~0))) (.cse12 (< |old(~local~0)| |old(~token~0)|)) (.cse20 (let ((.cse40 (+ ~local~0 1))) (and .cse39 (<= ~token~0 .cse40) .cse33 .cse25 (<= .cse40 ~token~0) .cse41 .cse34 .cse18))) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse9 (= 1 |old(~E_1~0)|)) (.cse2 (not (= 2 |old(~m_st~0)|))) (.cse1 (and .cse33 .cse34 .cse17 .cse35)) (.cse15 (not (= (mod |old(~t1_st~0)| 2) 0))) (.cse13 (< |old(~token~0)| |old(~local~0)|)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse8 (and .cse33 (<= 2 ~m_st~0) (not .cse39))) (.cse10 (= 0 |old(~E_1~0)|)) (.cse11 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~t1_st~0)| 2)) .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse13 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 (or .cse2 .cse15) .cse10 .cse16 .cse11 (and (= ~token~0 |old(~token~0)|) .cse17 .cse18)) (let ((.cse26 (= ~m_pc~0 0)) (.cse27 (= ~token~0 0)) (.cse28 (= ~local~0 0))) (or .cse19 .cse20 (not (= ~T1_E~0 2)) .cse21 .cse22 (or (not (= |old(~token~0)| 0)) .cse23) (not (= 1 ~t1_i~0)) (and .cse24 (and (= ~E_1~0 2) (and (= ~E_M~0 2) .cse25) .cse26) .cse27 .cse28 .cse29) .cse30 .cse1 (not (= 2 |old(~E_M~0)|)) .cse31 .cse32 (not (= ~m_i~0 1)) .cse8 (not (= 2 |old(~E_1~0)|)) (not (= 2 ~M_E~0)) (and .cse33 .cse25 .cse26 .cse34 .cse35 .cse27 .cse28 (= eval_~tmp~0 1)))) (let ((.cse36 (+ |old(~local~0)| 1))) (or .cse0 .cse19 .cse1 .cse15 .cse20 .cse4 .cse5 .cse6 .cse14 .cse7 .cse31 (< |old(~token~0)| .cse36) .cse9 .cse8 .cse37 .cse10 .cse16 (< .cse36 |old(~token~0)|) .cse11)) (or .cse6 .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 (< |old(~m_st~0)| 2) .cse4 .cse38 .cse5) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse21 .cse6 .cse22 .cse7 .cse32 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse19 .cse12 .cse20 .cse4 .cse5 .cse9 .cse2 .cse1 .cse3 .cse15 .cse13 .cse6 .cse7 .cse8 .cse10 .cse11))))) [2018-11-23 05:11:48,384 INFO L444 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (let ((.cse26 (= 1 |old(~m_pc~0)|)) (.cse6 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0))) (let ((.cse32 (= ~t1_pc~0 0)) (.cse33 (= ~m_pc~0 1)) (.cse11 (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)))) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (= ~t1_pc~0 1)) (.cse14 (= ~m_st~0 2)) (.cse15 (<= ~local~0 ~token~0)) (.cse30 (not (= 0 |old(~local~0)|))) (.cse19 (not (= |old(~t1_pc~0)| 1))) (.cse25 (not .cse26)) (.cse18 (not (= 2 |old(~m_st~0)|))) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse21 (not (= (mod |old(~t1_st~0)| 2) 0))) (.cse31 (not (= 0 |old(~m_pc~0)|)))) (let ((.cse1 (< |old(~local~0)| |old(~token~0)|)) (.cse2 (< |old(~token~0)| |old(~local~0)|)) (.cse9 (and (or .cse25 .cse18 .cse21) (or .cse22 .cse21 .cse31))) (.cse20 (< |old(~t1_st~0)| 2)) (.cse16 (and (or .cse25 .cse19) (or (not (= |old(~token~0)| 1)) .cse30 .cse19 .cse31))) (.cse24 (and .cse33 .cse11 .cse12 .cse13 .cse14 .cse15)) (.cse27 (and .cse11 .cse14 .cse32)) (.cse3 (= 0 ~M_E~0)) (.cse4 (= 1 ~M_E~0)) (.cse28 (not (= |old(~t1_st~0)| 0))) (.cse5 (= 1 |old(~E_M~0)|)) (.cse29 (not (= |old(~t1_pc~0)| 0))) (.cse7 (and .cse11 (<= 2 ~m_st~0) (not .cse33))) (.cse8 (= 1 |old(~E_1~0)|)) (.cse10 (= 0 |old(~E_1~0)|)) (.cse17 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17) (or .cse0 .cse18 .cse19 .cse3 .cse4 .cse5 (not (= |old(~t1_st~0)| 2)) .cse6 .cse7 .cse8 .cse10 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse17) (let ((.cse23 (+ |old(~local~0)| 1))) (or .cse0 .cse21 .cse3 .cse4 .cse5 .cse20 .cse6 .cse22 (< |old(~token~0)| .cse23) .cse8 .cse7 .cse24 .cse25 .cse10 .cse16 (< .cse23 |old(~token~0)|) .cse17)) (or .cse5 .cse6 .cse0 .cse7 .cse8 .cse10 .cse17 (< |old(~m_st~0)| 2) .cse3 .cse26 .cse4) (or .cse27 (not (= ~T1_E~0 2)) .cse28 .cse29 .cse24 (or (not (= |old(~token~0)| 0)) .cse30) (not (= 1 ~t1_i~0)) .cse31 (not (= 2 |old(~E_M~0)|)) .cse22 (not (= ~m_i~0 1)) .cse7 (and (= ~E_M~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~token~0 0) (= ~local~0 0) .cse32 (= eval_~tmp~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 2 ~M_E~0))) (or .cse0 .cse18 .cse27 .cse3 .cse4 .cse28 .cse5 .cse29 .cse6 .cse7 .cse8 .cse10 .cse17))))) [2018-11-23 05:11:48,384 INFO L444 ceAbstractionStarter]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse38 (= 1 |old(~m_pc~0)|)) (.cse7 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0))) (let ((.cse35 (= ~t1_st~0 2)) (.cse39 (= ~m_pc~0 1)) (.cse25 (= ~m_st~0 0)) (.cse18 (<= 2 ~t1_st~0)) (.cse34 (= ~t1_pc~0 1)) (.cse41 (= (mod ~t1_st~0 2) 0)) (.cse33 (and (and (not .cse7) (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)))) (.cse24 (= ~t1_st~0 0)) (.cse17 (= ~m_st~0 2)) (.cse29 (= ~t1_pc~0 0)) (.cse37 (not .cse38)) (.cse23 (not (= 0 |old(~local~0)|))) (.cse3 (not (= |old(~t1_pc~0)| 1))) (.cse30 (not (= 0 |old(~m_pc~0)|)))) (let ((.cse14 (< |old(~t1_st~0)| 2)) (.cse31 (not (= 0 |old(~m_st~0)|))) (.cse16 (and (or .cse37 .cse3) (or (not (= |old(~token~0)| 1)) .cse23 .cse3 .cse30))) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse22 (not (= |old(~t1_pc~0)| 0))) (.cse32 (and .cse33 .cse24 .cse17 .cse29)) (.cse19 (and .cse33 (<= ~token~0 ~local~0) .cse34 .cse17 .cse41 (<= ~local~0 ~token~0))) (.cse12 (< |old(~local~0)| |old(~token~0)|)) (.cse20 (let ((.cse40 (+ ~local~0 1))) (and .cse39 (<= ~token~0 .cse40) .cse33 .cse25 (<= .cse40 ~token~0) .cse41 .cse34 .cse18))) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse9 (= 1 |old(~E_1~0)|)) (.cse2 (not (= 2 |old(~m_st~0)|))) (.cse1 (and .cse33 .cse34 .cse17 .cse35)) (.cse15 (not (= (mod |old(~t1_st~0)| 2) 0))) (.cse13 (< |old(~token~0)| |old(~local~0)|)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse8 (and .cse33 (<= 2 ~m_st~0) (not .cse39))) (.cse10 (= 0 |old(~E_1~0)|)) (.cse11 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~t1_st~0)| 2)) .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse13 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 (or .cse2 .cse15) .cse10 .cse16 .cse11 (and (= ~token~0 |old(~token~0)|) .cse17 .cse18)) (let ((.cse26 (= ~m_pc~0 0)) (.cse27 (= ~token~0 0)) (.cse28 (= ~local~0 0))) (or .cse19 .cse20 (not (= ~T1_E~0 2)) .cse21 .cse22 (or (not (= |old(~token~0)| 0)) .cse23) (not (= 1 ~t1_i~0)) (and .cse24 (and (= ~E_1~0 2) (and (= ~E_M~0 2) .cse25) .cse26) .cse27 .cse28 .cse29) .cse30 .cse1 (not (= 2 |old(~E_M~0)|)) .cse31 .cse32 (not (= ~m_i~0 1)) .cse8 (not (= 2 |old(~E_1~0)|)) (not (= 2 ~M_E~0)) (and .cse33 .cse25 .cse26 .cse34 .cse35 .cse27 .cse28 (= eval_~tmp~0 1)))) (let ((.cse36 (+ |old(~local~0)| 1))) (or .cse0 .cse19 .cse1 .cse15 .cse20 .cse4 .cse5 .cse6 .cse14 .cse7 .cse31 (< |old(~token~0)| .cse36) .cse9 .cse8 .cse37 .cse10 .cse16 (< .cse36 |old(~token~0)|) .cse11)) (or .cse6 .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 (< |old(~m_st~0)| 2) .cse4 .cse38 .cse5) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse21 .cse6 .cse22 .cse7 .cse32 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse19 .cse12 .cse20 .cse4 .cse5 .cse9 .cse2 .cse1 .cse3 .cse15 .cse13 .cse6 .cse7 .cse8 .cse10 .cse11))))) [2018-11-23 05:11:48,384 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2018-11-23 05:11:48,385 INFO L444 ceAbstractionStarter]: At program point L216(line 216) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse31 (= 1 |old(~m_pc~0)|))) (let ((.cse24 (not (= 0 |old(~local~0)|))) (.cse16 (not (= |old(~t1_pc~0)| 1))) (.cse30 (not .cse31)) (.cse1 (not (= 2 |old(~m_st~0)|))) (.cse26 (not (= 0 |old(~m_st~0)|))) (.cse27 (not (= (mod |old(~t1_st~0)| 2) 0))) (.cse25 (not (= 0 |old(~m_pc~0)|))) (.cse23 (<= 2 ~t1_st~0)) (.cse17 (and (and (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)))) (.cse18 (= (mod ~t1_st~0 2) 0)) (.cse20 (= ~t1_pc~0 1))) (let ((.cse4 (not (= |old(~t1_st~0)| 0))) (.cse6 (not (= |old(~t1_pc~0)| 0))) (.cse11 (and .cse23 (let ((.cse32 (+ ~local~0 1))) (and (= ~m_pc~0 1) (<= ~token~0 .cse32) .cse17 (<= .cse32 ~token~0) .cse18 .cse20)))) (.cse12 (< |old(~local~0)| |old(~token~0)|)) (.cse13 (< |old(~token~0)| |old(~local~0)|)) (.cse28 (< |old(~t1_st~0)| 2)) (.cse14 (and (or .cse30 .cse1 .cse27) (or .cse26 .cse27 .cse25))) (.cse15 (and (or .cse30 .cse16) (or (not (= |old(~token~0)| 1)) .cse24 .cse16 .cse25))) (.cse5 (= 1 |old(~E_M~0)|)) (.cse7 (= ~T1_E~0 1)) (.cse8 (= 1 |old(~E_1~0)|)) (.cse9 (= 0 |old(~E_1~0)|)) (.cse10 (= 0 |old(~E_M~0)|)) (.cse2 (= 0 ~M_E~0)) (.cse3 (= 1 ~M_E~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse0 .cse12 .cse13 .cse2 .cse3 .cse5 .cse7 .cse8 .cse14 .cse9 .cse15 .cse10) (or .cse0 .cse1 .cse16 .cse2 .cse3 .cse5 (not (= |old(~t1_st~0)| 2)) .cse7 .cse8 .cse9 .cse10) (let ((.cse19 (= ~m_pc~0 0)) (.cse21 (= ~token~0 0)) (.cse22 (= ~local~0 0))) (or .cse11 (not (= ~T1_E~0 2)) .cse4 .cse6 (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or (not (= |old(~token~0)| 0)) .cse24) (not (= 1 ~t1_i~0)) .cse25 (and (= ~E_M~0 2) .cse19 (= ~E_1~0 2) (= ~t1_st~0 0) .cse21 .cse22 (= ~t1_pc~0 0)) (not (= 2 |old(~E_M~0)|)) .cse26 (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 2 ~M_E~0)))) (let ((.cse29 (+ |old(~local~0)| 1))) (or .cse11 .cse0 .cse27 .cse2 .cse3 .cse5 .cse28 .cse7 .cse26 (< |old(~token~0)| .cse29) .cse8 .cse30 .cse9 .cse15 (< .cse29 |old(~token~0)|) .cse10)) (or .cse0 .cse12 .cse13 .cse2 .cse3 .cse5 .cse28 .cse7 .cse8 .cse14 .cse9 .cse15 .cse10) (or .cse5 .cse7 .cse0 .cse8 .cse9 .cse10 (< |old(~m_st~0)| 2) .cse2 .cse31 .cse3))))) [2018-11-23 05:11:48,385 INFO L448 ceAbstractionStarter]: For program point L210(lines 200 238) no Hoare annotation was computed. [2018-11-23 05:11:48,385 INFO L444 ceAbstractionStarter]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse29 (= 1 |old(~m_pc~0)|)) (.cse7 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0))) (let ((.cse31 (= ~m_pc~0 1)) (.cse18 (<= 2 ~t1_st~0)) (.cse32 (= ~t1_pc~0 1)) (.cse34 (= (mod ~t1_st~0 2) 0)) (.cse30 (and (and (not .cse7) (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)))) (.cse17 (= ~m_st~0 2)) (.cse28 (not .cse29)) (.cse23 (not (= 0 |old(~local~0)|))) (.cse3 (not (= |old(~t1_pc~0)| 1))) (.cse24 (not (= 0 |old(~m_pc~0)|)))) (let ((.cse14 (< |old(~t1_st~0)| 2)) (.cse25 (not (= 0 |old(~m_st~0)|))) (.cse16 (and (or .cse28 .cse3) (or (not (= |old(~token~0)| 1)) .cse23 .cse3 .cse24))) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse22 (not (= |old(~t1_pc~0)| 0))) (.cse26 (and .cse30 (= ~t1_st~0 0) .cse17 (= ~t1_pc~0 0))) (.cse19 (and .cse30 (<= ~token~0 ~local~0) .cse32 .cse17 .cse34 (<= ~local~0 ~token~0))) (.cse12 (< |old(~local~0)| |old(~token~0)|)) (.cse20 (let ((.cse33 (+ ~local~0 1))) (and .cse31 (<= ~token~0 .cse33) .cse30 (= ~m_st~0 0) (<= .cse33 ~token~0) .cse34 .cse32 .cse18))) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse9 (= 1 |old(~E_1~0)|)) (.cse2 (not (= 2 |old(~m_st~0)|))) (.cse1 (and .cse30 .cse32 .cse17 (= ~t1_st~0 2))) (.cse15 (not (= (mod |old(~t1_st~0)| 2) 0))) (.cse13 (< |old(~token~0)| |old(~local~0)|)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse8 (and .cse30 (<= 2 ~m_st~0) (not .cse31))) (.cse10 (= 0 |old(~E_1~0)|)) (.cse11 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~t1_st~0)| 2)) .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse13 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 (or .cse2 .cse15) .cse10 .cse16 .cse11 (and (= ~token~0 |old(~token~0)|) .cse17 .cse18)) (or .cse19 .cse20 (not (= ~T1_E~0 2)) .cse21 .cse22 (or (not (= |old(~token~0)| 0)) .cse23) (not (= 1 ~t1_i~0)) .cse24 .cse1 (not (= 2 |old(~E_M~0)|)) .cse25 .cse26 (not (= ~m_i~0 1)) .cse8 (not (= 2 |old(~E_1~0)|)) (not (= 2 ~M_E~0))) (let ((.cse27 (+ |old(~local~0)| 1))) (or .cse0 .cse19 .cse1 .cse15 .cse20 .cse4 .cse5 .cse6 .cse14 .cse7 .cse25 (< |old(~token~0)| .cse27) .cse9 .cse8 .cse28 .cse10 .cse16 (< .cse27 |old(~token~0)|) .cse11)) (or .cse6 .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 (< |old(~m_st~0)| 2) .cse4 .cse29 .cse5) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse21 .cse6 .cse22 .cse7 .cse26 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse19 .cse12 .cse20 .cse4 .cse5 .cse9 .cse2 .cse1 .cse3 .cse15 .cse13 .cse6 .cse7 .cse8 .cse10 .cse11))))) [2018-11-23 05:11:48,385 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 234) no Hoare annotation was computed. [2018-11-23 05:11:48,385 INFO L448 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-23 05:11:48,386 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse1 (= |old(~M_E~0)| ~M_E~0))) (or (not (= |old(~T1_E~0)| 2)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= |old(~E_1~0)| ~E_1~0) (<= 2 ~m_st~0) (not (= ~m_pc~0 1)) .cse0 .cse1 (= |old(~E_M~0)| ~E_M~0)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (and (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t1_st~0 0) .cse0 (= ~token~0 0) (= ~local~0 0) (= ~t1_pc~0 0) .cse1) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)))) [2018-11-23 05:11:48,386 INFO L444 ceAbstractionStarter]: At program point L411(line 411) the Hoare annotation is: (or (not (= |old(~T1_E~0)| 2)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (and (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= ~token~0 0) (= ~local~0 0) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-11-23 05:11:48,386 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2018-11-23 05:11:48,386 INFO L444 ceAbstractionStarter]: At program point L411-1(line 411) the Hoare annotation is: (or (not (= |old(~T1_E~0)| 2)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (and (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= ~token~0 0) (= ~local~0 0) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-11-23 05:11:48,386 INFO L444 ceAbstractionStarter]: At program point L440(line 440) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 1)) (.cse0 (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)))) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~m_st~0 2)) (.cse5 (= (mod ~t1_st~0 2) 0))) (or (not (= |old(~T1_E~0)| 2)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 2)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (and .cse0 (<= 2 ~m_st~0) (not .cse3)) (let ((.cse4 (+ ~local~0 1))) (and .cse3 .cse0 (<= ~token~0 .cse4) (= ~m_st~0 0) (<= .cse4 ~token~0) .cse5 .cse1 (<= 2 ~t1_st~0))) (not (= 2 |old(~E_M~0)|)) (and .cse0 (= ~t1_st~0 0) .cse2 (= ~t1_pc~0 0)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (and .cse0 (<= ~token~0 ~local~0) .cse1 .cse2 .cse5 (<= ~local~0 ~token~0)) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)))) [2018-11-23 05:11:48,386 INFO L444 ceAbstractionStarter]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse0 (= ~m_st~0 2)) (.cse4 (= ~m_pc~0 1)) (.cse3 (= (mod ~t1_st~0 2) 0)) (.cse2 (= ~t1_pc~0 1)) (.cse1 (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 (and (= ~t1_st~0 0) .cse0 (= ~t1_pc~0 0) .cse1) (not (= |old(~T1_E~0)| 2)) (and (<= ~token~0 ~local~0) .cse2 .cse0 .cse3 .cse1 (<= ~local~0 ~token~0)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (and (<= 2 ~m_st~0) .cse1 (not .cse4)) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (and .cse2 .cse0 .cse1 (= ~t1_st~0 2)) (let ((.cse5 (+ ~local~0 1))) (and .cse4 (<= ~token~0 .cse5) (= ~m_st~0 0) (<= .cse5 ~token~0) .cse3 .cse2 (<= 2 ~t1_st~0) .cse1)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)))) [2018-11-23 05:11:48,387 INFO L444 ceAbstractionStarter]: At program point L432(line 432) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 1)) (.cse0 (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)))) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~m_st~0 2)) (.cse5 (= (mod ~t1_st~0 2) 0))) (or (not (= |old(~T1_E~0)| 2)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 2)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (and .cse0 (<= 2 ~m_st~0) (not .cse3)) (let ((.cse4 (+ ~local~0 1))) (and .cse3 .cse0 (<= ~token~0 .cse4) (= ~m_st~0 0) (<= .cse4 ~token~0) .cse5 .cse1 (<= 2 ~t1_st~0))) (not (= 2 |old(~E_M~0)|)) (and .cse0 (= ~t1_st~0 0) .cse2 (= ~t1_pc~0 0)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (and .cse0 (<= ~token~0 ~local~0) .cse1 .cse2 .cse5 (<= ~local~0 ~token~0)) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)))) [2018-11-23 05:11:48,387 INFO L444 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 1)) (.cse0 (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)))) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~m_st~0 2)) (.cse5 (= (mod ~t1_st~0 2) 0))) (or (not (= |old(~T1_E~0)| 2)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 2)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (and .cse0 (<= 2 ~m_st~0) (not .cse3)) (let ((.cse4 (+ ~local~0 1))) (and .cse3 .cse0 (<= ~token~0 .cse4) (= ~m_st~0 0) (<= .cse4 ~token~0) .cse5 .cse1 (<= 2 ~t1_st~0))) (not (= 2 |old(~E_M~0)|)) (and .cse0 (= ~t1_st~0 0) .cse2 (= ~t1_pc~0 0)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (and .cse0 (<= ~token~0 ~local~0) .cse1 .cse2 .cse5 (<= ~local~0 ~token~0)) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)))) [2018-11-23 05:11:48,387 INFO L444 ceAbstractionStarter]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 1)) (.cse0 (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)))) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~m_st~0 2)) (.cse5 (= (mod ~t1_st~0 2) 0))) (or (not (= |old(~T1_E~0)| 2)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 2)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (and .cse0 (<= 2 ~m_st~0) (not .cse3)) (let ((.cse4 (+ ~local~0 1))) (and .cse3 .cse0 (<= ~token~0 .cse4) (= ~m_st~0 0) (<= .cse4 ~token~0) .cse5 .cse1 (<= 2 ~t1_st~0))) (not (= 2 |old(~E_M~0)|)) (and .cse0 (= ~t1_st~0 0) .cse2 (= ~t1_pc~0 0)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (and .cse0 (<= ~token~0 ~local~0) .cse1 .cse2 .cse5 (<= ~local~0 ~token~0)) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)))) [2018-11-23 05:11:48,388 INFO L444 ceAbstractionStarter]: At program point L426(line 426) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 1)) (.cse0 (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)))) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~m_st~0 2)) (.cse5 (= (mod ~t1_st~0 2) 0))) (or (not (= |old(~T1_E~0)| 2)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 2)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (and .cse0 (<= 2 ~m_st~0) (not .cse3)) (let ((.cse4 (+ ~local~0 1))) (and .cse3 .cse0 (<= ~token~0 .cse4) (= ~m_st~0 0) (<= .cse4 ~token~0) .cse5 .cse1 (<= 2 ~t1_st~0))) (not (= 2 |old(~E_M~0)|)) (and .cse0 (= ~t1_st~0 0) .cse2 (= ~t1_pc~0 0)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (and .cse0 (<= ~token~0 ~local~0) .cse1 .cse2 .cse5 (<= ~local~0 ~token~0)) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)))) [2018-11-23 05:11:48,388 INFO L448 ceAbstractionStarter]: For program point L426-1(line 426) no Hoare annotation was computed. [2018-11-23 05:11:48,388 INFO L444 ceAbstractionStarter]: At program point L422(line 422) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 1)) (.cse5 (= ~m_st~0 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= ~t1_pc~0 0)) (.cse0 (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)))) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~m_st~0 2)) (.cse6 (= (mod ~t1_st~0 2) 0))) (or (not (= |old(~T1_E~0)| 2)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 2)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (and .cse0 (<= 2 ~m_st~0) (not .cse3)) (let ((.cse4 (+ ~local~0 1))) (and .cse3 .cse0 (<= ~token~0 .cse4) .cse5 (<= .cse4 ~token~0) .cse6 .cse1 (<= 2 ~t1_st~0))) (not (= 2 |old(~E_M~0)|)) (and .cse0 .cse7 .cse2 .cse8) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (and (= ~T1_E~0 2) (= ~E_M~0 2) .cse5 (= ~m_pc~0 0) (= ~M_E~0 2) (= ~E_1~0 2) .cse7 (= ~token~0 0) (= ~local~0 0) .cse8) (and .cse0 (<= ~token~0 ~local~0) .cse1 .cse2 .cse6 (<= ~local~0 ~token~0)) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)))) [2018-11-23 05:11:48,388 INFO L448 ceAbstractionStarter]: For program point L422-1(line 422) no Hoare annotation was computed. [2018-11-23 05:11:48,388 INFO L444 ceAbstractionStarter]: At program point L418-1(lines 415 455) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 1)) (.cse5 (= ~m_st~0 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= ~t1_pc~0 0)) (.cse0 (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)))) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~m_st~0 2)) (.cse6 (= (mod ~t1_st~0 2) 0))) (or (not (= |old(~T1_E~0)| 2)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 2)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (and .cse0 (<= 2 ~m_st~0) (not .cse3)) (let ((.cse4 (+ ~local~0 1))) (and .cse3 .cse0 (<= ~token~0 .cse4) .cse5 (<= .cse4 ~token~0) .cse6 .cse1 (<= 2 ~t1_st~0))) (not (= 2 |old(~E_M~0)|)) (and .cse0 .cse7 .cse2 .cse8) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (and (= ~T1_E~0 2) (= ~E_M~0 2) .cse5 (= ~m_pc~0 0) (= ~M_E~0 2) (= ~E_1~0 2) .cse7 (= ~token~0 0) (= ~local~0 0) .cse8) (and .cse0 (<= ~token~0 ~local~0) .cse1 .cse2 .cse6 (<= ~local~0 ~token~0)) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)))) [2018-11-23 05:11:48,388 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 403 461) the Hoare annotation is: (or (not (= |old(~T1_E~0)| 2)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (and (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t1_st~0 0) (= |old(~T1_E~0)| ~T1_E~0) (= ~token~0 0) (= ~local~0 0) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-11-23 05:11:48,389 INFO L444 ceAbstractionStarter]: At program point L414(line 414) the Hoare annotation is: (let ((.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse1 (= |old(~M_E~0)| ~M_E~0))) (or (not (= |old(~T1_E~0)| 2)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= |old(~E_1~0)| ~E_1~0) (<= 2 ~m_st~0) (not (= ~m_pc~0 1)) .cse0 .cse1 (= |old(~E_M~0)| ~E_M~0)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (and (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t1_st~0 0) .cse0 (= ~token~0 0) (= ~local~0 0) (= ~t1_pc~0 0) .cse1) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)))) [2018-11-23 05:11:48,389 INFO L444 ceAbstractionStarter]: At program point L412(line 412) the Hoare annotation is: (let ((.cse0 (= |old(~T1_E~0)| ~T1_E~0)) (.cse1 (= |old(~M_E~0)| ~M_E~0))) (or (not (= |old(~T1_E~0)| 2)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and (= |old(~E_1~0)| ~E_1~0) (<= 2 ~m_st~0) (not (= ~m_pc~0 1)) .cse0 .cse1 (= |old(~E_M~0)| ~E_M~0)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (and (= ~m_st~0 0) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~E_M~0 2) (= ~t1_st~0 0) .cse0 (= ~token~0 0) (= ~local~0 0) (= ~t1_pc~0 0) .cse1) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)))) [2018-11-23 05:11:48,389 INFO L444 ceAbstractionStarter]: At program point L441(line 441) the Hoare annotation is: (let ((.cse0 (= ~m_st~0 2)) (.cse4 (= ~m_pc~0 1)) (.cse3 (= (mod ~t1_st~0 2) 0)) (.cse2 (= ~t1_pc~0 1)) (.cse1 (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 (and (= ~t1_st~0 0) .cse0 (= ~t1_pc~0 0) .cse1) (not (= |old(~T1_E~0)| 2)) (and (<= ~token~0 ~local~0) .cse2 .cse0 .cse3 .cse1 (<= ~local~0 ~token~0)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (and (<= 2 ~m_st~0) .cse1 (not .cse4)) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (and .cse2 .cse0 .cse1 (= ~t1_st~0 2)) (let ((.cse5 (+ ~local~0 1))) (and .cse4 (<= ~token~0 .cse5) (= ~m_st~0 0) (<= .cse5 ~token~0) .cse3 .cse2 (<= 2 ~t1_st~0) .cse1)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)))) [2018-11-23 05:11:48,389 INFO L448 ceAbstractionStarter]: For program point L437(lines 437 446) no Hoare annotation was computed. [2018-11-23 05:11:48,390 INFO L444 ceAbstractionStarter]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 1)) (.cse0 (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)))) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~m_st~0 2)) (.cse5 (= (mod ~t1_st~0 2) 0))) (or (not (= |old(~T1_E~0)| 2)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 2)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (and .cse0 (<= 2 ~m_st~0) (not .cse3)) (let ((.cse4 (+ ~local~0 1))) (and .cse3 .cse0 (<= ~token~0 .cse4) (= ~m_st~0 0) (<= .cse4 ~token~0) .cse5 .cse1 (<= 2 ~t1_st~0))) (not (= 2 |old(~E_M~0)|)) (and .cse0 (= ~t1_st~0 0) .cse2 (= ~t1_pc~0 0)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (and .cse0 (<= ~token~0 ~local~0) .cse1 .cse2 .cse5 (<= ~local~0 ~token~0)) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)))) [2018-11-23 05:11:48,390 INFO L448 ceAbstractionStarter]: For program point L435(line 435) no Hoare annotation was computed. [2018-11-23 05:11:48,390 INFO L444 ceAbstractionStarter]: At program point L431(line 431) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 1)) (.cse0 (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)))) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= ~m_st~0 2)) (.cse5 (= (mod ~t1_st~0 2) 0))) (or (not (= |old(~T1_E~0)| 2)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (and .cse0 .cse1 .cse2 (= ~t1_st~0 2)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (and .cse0 (<= 2 ~m_st~0) (not .cse3)) (let ((.cse4 (+ ~local~0 1))) (and .cse3 .cse0 (<= ~token~0 .cse4) (= ~m_st~0 0) (<= .cse4 ~token~0) .cse5 .cse1 (<= 2 ~t1_st~0))) (not (= 2 |old(~E_M~0)|)) (and .cse0 (= ~t1_st~0 0) .cse2 (= ~t1_pc~0 0)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (and .cse0 (<= ~token~0 ~local~0) .cse1 .cse2 .cse5 (<= ~local~0 ~token~0)) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|)))) [2018-11-23 05:11:48,390 INFO L444 ceAbstractionStarter]: At program point L456(lines 403 461) the Hoare annotation is: (or (not (= ~M_E~0 0)) (not (= |old(~T1_E~0)| 2)) (not (= |old(~t1_st~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (or (not (= |old(~token~0)| 0)) (not (= 0 |old(~local~0)|))) (not (= 1 ~t1_i~0)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-11-23 05:11:48,390 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-23 05:11:48,390 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 454) no Hoare annotation was computed. [2018-11-23 05:11:48,391 INFO L444 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse12 (= 1 ~m_pc~0))) (let ((.cse17 (= |old(~T1_E~0)| ~T1_E~0)) (.cse18 (= |old(~M_E~0)| ~M_E~0)) (.cse21 (not .cse12)) (.cse15 (not (= 0 ~local~0))) (.cse22 (not (= ~t1_pc~0 1))) (.cse16 (not (= 0 ~m_pc~0)))) (let ((.cse7 (not (= (mod ~t1_st~0 2) 0))) (.cse19 (not (= 0 ~m_st~0))) (.cse9 (and (or .cse21 .cse22) (or (not (= ~token~0 1)) .cse15 .cse22 .cse16))) (.cse11 (and (= |old(~E_1~0)| ~E_1~0) .cse17 .cse18 (= |old(~E_M~0)| ~E_M~0))) (.cse0 (= |old(~T1_E~0)| 0)) (.cse6 (not (= 2 ~m_st~0))) (.cse1 (= 0 |old(~M_E~0)|)) (.cse2 (= 1 |old(~M_E~0)|)) (.cse13 (not (= ~t1_st~0 0))) (.cse3 (= 1 |old(~E_M~0)|)) (.cse14 (not (= ~t1_pc~0 0))) (.cse4 (= |old(~T1_E~0)| 1)) (.cse5 (= 1 |old(~E_1~0)|)) (.cse8 (= 0 |old(~E_1~0)|)) (.cse10 (= 0 |old(~E_M~0)|))) (and (or .cse0 (< ~local~0 ~token~0) (< ~token~0 ~local~0) .cse1 .cse2 .cse3 .cse4 .cse5 (or .cse6 .cse7) .cse8 .cse9 .cse10 .cse11) (or .cse3 .cse4 .cse0 .cse5 .cse11 .cse8 .cse10 (< ~m_st~0 2) .cse1 .cse12 .cse2) (or (not (= |old(~T1_E~0)| 2)) .cse13 .cse14 (or (not (= ~token~0 0)) .cse15) (not (= 1 ~t1_i~0)) .cse16 (and (= ~E_1~0 2) (= ~E_M~0 2) .cse17 .cse18) (not (= 2 |old(~E_M~0)|)) .cse19 (not (= ~m_i~0 1)) (not (= 2 |old(~E_1~0)|)) (not (= 2 |old(~M_E~0)|))) (let ((.cse20 (+ ~local~0 1))) (or .cse0 .cse7 .cse11 .cse1 .cse2 .cse3 (< ~t1_st~0 2) .cse4 .cse19 (< ~token~0 .cse20) .cse5 .cse21 .cse8 .cse9 (< .cse20 ~token~0) .cse10)) (or .cse0 .cse11 .cse6 .cse22 .cse1 .cse2 .cse3 (not (= ~t1_st~0 2)) .cse4 .cse5 .cse8 .cse10) (or .cse11 .cse0 .cse6 .cse1 .cse2 .cse13 .cse3 .cse14 .cse4 .cse5 .cse8 .cse10))))) [2018-11-23 05:11:48,395 INFO L448 ceAbstractionStarter]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2018-11-23 05:11:48,395 INFO L448 ceAbstractionStarter]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2018-11-23 05:11:48,395 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2018-11-23 05:11:48,395 INFO L448 ceAbstractionStarter]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2018-11-23 05:11:48,395 INFO L448 ceAbstractionStarter]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2018-11-23 05:11:48,395 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2018-11-23 05:11:48,395 INFO L451 ceAbstractionStarter]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2018-11-23 05:11:48,396 INFO L444 ceAbstractionStarter]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse18 (= 1 ~m_pc~0))) (let ((.cse9 (not .cse18)) (.cse16 (not (= ~t1_pc~0 1))) (.cse22 (not (= 0 ~m_pc~0))) (.cse24 (+ ~local~0 1))) (let ((.cse7 (< ~token~0 .cse24)) (.cse12 (< .cse24 ~token~0)) (.cse17 (< ~m_st~0 2)) (.cse23 (not (= ~t1_st~0 0))) (.cse21 (not (= ~t1_pc~0 0))) (.cse15 (not (= 2 ~m_st~0))) (.cse8 (= 1 ~E_1~0)) (.cse0 (= ~T1_E~0 0)) (.cse19 (< ~local~0 ~token~0)) (.cse1 (not (= (mod ~t1_st~0 2) 0))) (.cse20 (< ~token~0 ~local~0)) (.cse2 (= 0 is_master_triggered_~__retres1~0)) (.cse3 (= 0 ~M_E~0)) (.cse14 (= 1 ~M_E~0)) (.cse4 (= 1 ~E_M~0)) (.cse5 (< ~t1_st~0 2)) (.cse6 (= ~T1_E~0 1)) (.cse10 (= 0 ~E_1~0)) (.cse11 (and (or .cse9 .cse16) (or (not (= ~token~0 1)) (not (= 0 ~local~0)) .cse16 .cse22))) (.cse13 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 0 ~m_st~0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or (not .cse4) .cse0 (= is_master_triggered_~__retres1~0 1) .cse3 .cse14 .cse6 .cse7 .cse8 (or .cse15 .cse16) .cse9 .cse10 .cse12) (or .cse4 .cse6 .cse0 .cse8 .cse2 .cse10 .cse13 .cse17 .cse3 .cse18) (or .cse0 .cse2 .cse19 .cse20 .cse3 .cse4 .cse6 .cse8 (or .cse15 .cse1) .cse10 .cse11 .cse13) (or .cse6 .cse0 .cse2 .cse8 .cse10 .cse13 .cse17 .cse3 .cse18 .cse14) (or .cse4 .cse21 .cse6 .cse0 .cse2 .cse10 .cse13 .cse3 .cse22 .cse14 .cse23) (or .cse0 .cse15 .cse3 .cse23 .cse4 .cse21 .cse6 .cse8 .cse10 .cse13 .cse2) (or .cse0 .cse19 .cse16 .cse1 .cse20 .cse3 .cse2 .cse14 .cse4 .cse5 .cse6 .cse10 .cse13 .cse22) (or .cse0 .cse15 .cse16 .cse3 .cse4 (not (= ~t1_st~0 2)) .cse6 .cse8 .cse10 .cse13 .cse2) (or .cse0 .cse19 .cse1 .cse20 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse10 .cse11 .cse13))))) [2018-11-23 05:11:48,398 INFO L448 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2018-11-23 05:11:48,398 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2018-11-23 05:11:48,399 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 123) no Hoare annotation was computed. [2018-11-23 05:11:48,399 INFO L448 ceAbstractionStarter]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2018-11-23 05:11:48,399 INFO L448 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2018-11-23 05:11:48,399 INFO L451 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2018-11-23 05:11:48,399 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 05:11:48,399 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~E_1~0 2) (= ~T1_E~0 2) (= ~t1_st~0 0) (= ~E_M~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~token~0 0) (= ~local~0 0) (= ~t1_pc~0 0) (= ~M_E~0 2)) [2018-11-23 05:11:48,399 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 05:11:48,399 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 05:11:48,399 INFO L448 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2018-11-23 05:11:48,399 INFO L448 ceAbstractionStarter]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2018-11-23 05:11:48,400 INFO L444 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse8 (= 1 ~m_pc~0))) (let ((.cse14 (not .cse8)) (.cse10 (not (= ~t1_pc~0 1)))) (let ((.cse9 (not (= 2 ~m_st~0))) (.cse2 (= |old(~T1_E~0)| 0)) (.cse11 (not (= (mod ~t1_st~0 2) 0))) (.cse7 (= 0 |old(~M_E~0)|)) (.cse0 (= 1 |old(~E_M~0)|)) (.cse1 (= |old(~T1_E~0)| 1)) (.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))) (.cse3 (= 1 |old(~E_1~0)|)) (.cse5 (= 0 |old(~E_1~0)|)) (.cse12 (and (or .cse14 .cse10) (or (not (= ~token~0 1)) (not (= 0 ~local~0)) .cse10 (not (= 0 ~m_pc~0))))) (.cse6 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< ~m_st~0 2) .cse7 .cse8) (or .cse2 .cse9 .cse4 .cse7 (not (= ~t1_st~0 0)) .cse0 (not (= ~t1_pc~0 0)) .cse1 .cse3 .cse5 .cse6) (or .cse2 .cse9 .cse10 .cse7 .cse0 (not (= ~t1_st~0 2)) .cse1 .cse3 .cse5 .cse6 .cse4) (or .cse2 (< ~local~0 ~token~0) (< ~token~0 ~local~0) .cse4 .cse7 .cse0 .cse1 .cse3 (or .cse9 .cse11) .cse5 .cse12 .cse6) (let ((.cse13 (+ ~local~0 1))) (or .cse2 .cse11 .cse7 .cse0 (< ~t1_st~0 2) .cse1 (not (= 0 ~m_st~0)) .cse4 (< ~token~0 .cse13) .cse3 .cse14 .cse5 .cse12 (< .cse13 ~token~0) .cse6)))))) [2018-11-23 05:11:48,401 INFO L448 ceAbstractionStarter]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2018-11-23 05:11:48,401 INFO L448 ceAbstractionStarter]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2018-11-23 05:11:48,401 INFO L448 ceAbstractionStarter]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2018-11-23 05:11:48,401 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2018-11-23 05:11:48,401 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2018-11-23 05:11:48,401 INFO L451 ceAbstractionStarter]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: true [2018-11-23 05:11:48,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:11:48 BoogieIcfgContainer [2018-11-23 05:11:48,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:11:48,447 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:11:48,447 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:11:48,447 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:11:48,447 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:11:02" (3/4) ... [2018-11-23 05:11:48,454 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 05:11:48,460 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-23 05:11:48,460 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit1 [2018-11-23 05:11:48,460 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2018-11-23 05:11:48,460 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-23 05:11:48,460 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-23 05:11:48,460 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit1_triggered [2018-11-23 05:11:48,460 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-23 05:11:48,460 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 05:11:48,460 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-23 05:11:48,460 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure master [2018-11-23 05:11:48,460 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_time_events [2018-11-23 05:11:48,461 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 05:11:48,461 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-23 05:11:48,461 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-23 05:11:48,461 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-23 05:11:48,461 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-23 05:11:48,461 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-23 05:11:48,461 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_master_triggered [2018-11-23 05:11:48,462 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_time_events [2018-11-23 05:11:48,462 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-23 05:11:48,468 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-11-23 05:11:48,468 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 05:11:48,494 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(\old(T1_E) == 2) || !(\old(t1_st) == 0)) || !(\old(t1_pc) == 0)) || (((((((!(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_pc == 1) && m_st == 2) && t1_st == 2)) || !(\old(token) == 0) || !(0 == \old(local))) || !(1 == t1_i)) || !(0 == \old(m_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) && !(m_pc == 1))) || (((((((m_pc == 1 && (((!(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) && t1_st % 2 == 0) && t1_pc == 1) && 2 <= t1_st)) || !(2 == \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)) && t1_st == 0) && m_st == 2) && t1_pc == 0)) || !(0 == \old(m_st))) || !(m_i == 1)) || (((((((((T1_E == 2 && E_M == 2) && m_st == 0) && m_pc == 0) && M_E == 2) && E_1 == 2) && t1_st == 0) && token == 0) && local == 0) && t1_pc == 0)) || (((((((((!(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) && t1_pc == 1) && m_st == 2) && t1_st % 2 == 0) && local <= token)) || !(2 == \old(E_1))) || !(2 == \old(M_E)) [2018-11-23 05:11:48,494 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(M_E == 0) || !(\old(T1_E) == 2)) || !(\old(t1_st) == 0)) || !(\old(t1_pc) == 0)) || !(\old(token) == 0) || !(0 == \old(local))) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == \old(E_1))) || !(2 == \old(M_E)) [2018-11-23 05:11:48,495 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((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)) && t1_pc == 1) && m_st == 2) && t1_st == 2)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || 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)) && (((((((((((((((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)) && t1_pc == 1) && m_st == 2) && t1_st == 2)) || \old(local) < \old(token)) || \old(token) < \old(local)) || 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)) || !(2 == \old(m_st)) || !(\old(t1_st) % 2 == 0)) || 0 == \old(E_1)) || ((!(1 == \old(m_pc)) || !(\old(t1_pc) == 1)) && (((!(\old(token) == 1) || !(0 == \old(local))) || !(\old(t1_pc) == 1)) || !(0 == \old(m_pc))))) || 0 == \old(E_M)) || ((token == \old(token) && m_st == 2) && 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)) && token <= local) && t1_pc == 1) && m_st == 2) && t1_st % 2 == 0) && local <= token) || (((((((m_pc == 1 && 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_st % 2 == 0) && t1_pc == 1) && 2 <= t1_st)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(\old(t1_pc) == 0)) || !(\old(token) == 0) || !(0 == \old(local))) || !(1 == t1_i)) || ((((t1_st == 0 && (E_1 == 2 && E_M == 2 && m_st == 0) && m_pc == 0) && token == 0) && local == 0) && t1_pc == 0)) || !(0 == \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) && m_st == 2) && t1_st == 2)) || !(2 == \old(E_M))) || !(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)) && t1_st == 0) && m_st == 2) && t1_pc == 0)) || !(m_i == 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))) || !(2 == \old(E_1))) || !(2 == 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)) && m_st == 0) && m_pc == 0) && t1_pc == 1) && t1_st == 2) && token == 0) && local == 0) && tmp == 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)) && token <= local) && t1_pc == 1) && m_st == 2) && t1_st % 2 == 0) && local <= token)) || (((((((!(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) && m_st == 2) && t1_st == 2)) || !(\old(t1_st) % 2 == 0)) || (((((((m_pc == 1 && 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_st % 2 == 0) && t1_pc == 1) && 2 <= t1_st)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || \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)) && 2 <= m_st) && !(m_pc == 1))) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || ((!(1 == \old(m_pc)) || !(\old(t1_pc) == 1)) && (((!(\old(token) == 1) || !(0 == \old(local))) || !(\old(t1_pc) == 1)) || !(0 == \old(m_pc))))) || \old(local) + 1 < \old(token)) || 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 == 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)) && t1_pc == 1) && m_st == 2) && t1_st == 2)) || !(2 == \old(m_st))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(\old(t1_pc) == 0)) || 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)) && t1_st == 0) && m_st == 2) && t1_pc == 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))) && ((((((((((((((((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)) && token <= local) && t1_pc == 1) && m_st == 2) && t1_st % 2 == 0) && local <= token)) || \old(local) < \old(token)) || (((((((m_pc == 1 && 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_st % 2 == 0) && t1_pc == 1) && 2 <= t1_st)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_1)) || !(2 == \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)) && t1_pc == 1) && m_st == 2) && t1_st == 2)) || !(\old(t1_pc) == 1)) || !(\old(t1_st) % 2 == 0)) || \old(token) < \old(local)) || 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))) || 0 == \old(E_1)) || 0 == \old(E_M)) [2018-11-23 05:11:48,495 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((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)) && t1_pc == 1) && m_st == 2) && t1_st == 2)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || 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)) && (((((((((((((((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)) && t1_pc == 1) && m_st == 2) && t1_st == 2)) || \old(local) < \old(token)) || \old(token) < \old(local)) || 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)) || !(2 == \old(m_st)) || !(\old(t1_st) % 2 == 0)) || 0 == \old(E_1)) || ((!(1 == \old(m_pc)) || !(\old(t1_pc) == 1)) && (((!(\old(token) == 1) || !(0 == \old(local))) || !(\old(t1_pc) == 1)) || !(0 == \old(m_pc))))) || 0 == \old(E_M)) || ((token == \old(token) && m_st == 2) && 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)) && token <= local) && t1_pc == 1) && m_st == 2) && t1_st % 2 == 0) && local <= token) || (((((((m_pc == 1 && 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_st % 2 == 0) && t1_pc == 1) && 2 <= t1_st)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(\old(t1_pc) == 0)) || !(\old(token) == 0) || !(0 == \old(local))) || !(1 == t1_i)) || !(0 == \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) && m_st == 2) && t1_st == 2)) || !(2 == \old(E_M))) || !(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)) && t1_st == 0) && m_st == 2) && t1_pc == 0)) || !(m_i == 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))) || !(2 == \old(E_1))) || !(2 == M_E))) && ((((((((((((((((((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)) && token <= local) && t1_pc == 1) && m_st == 2) && t1_st % 2 == 0) && local <= token)) || (((((((!(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) && m_st == 2) && t1_st == 2)) || !(\old(t1_st) % 2 == 0)) || (((((((m_pc == 1 && 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_st % 2 == 0) && t1_pc == 1) && 2 <= t1_st)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || \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)) && 2 <= m_st) && !(m_pc == 1))) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || ((!(1 == \old(m_pc)) || !(\old(t1_pc) == 1)) && (((!(\old(token) == 1) || !(0 == \old(local))) || !(\old(t1_pc) == 1)) || !(0 == \old(m_pc))))) || \old(local) + 1 < \old(token)) || 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 == 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)) && t1_pc == 1) && m_st == 2) && t1_st == 2)) || !(2 == \old(m_st))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(\old(t1_pc) == 0)) || 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)) && t1_st == 0) && m_st == 2) && t1_pc == 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))) && ((((((((((((((((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)) && token <= local) && t1_pc == 1) && m_st == 2) && t1_st % 2 == 0) && local <= token)) || \old(local) < \old(token)) || (((((((m_pc == 1 && 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_st % 2 == 0) && t1_pc == 1) && 2 <= t1_st)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_1)) || !(2 == \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)) && t1_pc == 1) && m_st == 2) && t1_st == 2)) || !(\old(t1_pc) == 1)) || !(\old(t1_st) % 2 == 0)) || \old(token) < \old(local)) || 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))) || 0 == \old(E_1)) || 0 == \old(E_M)) [2018-11-23 05:11:48,496 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((m_st == 0 && E_M == 2) && token == 0) && t1_pc == 0) || !(0 == local)) || !(T1_E == 2)) || !(2 == \old(E_M))) || !(\old(token) == 0)) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t1_i)) || !(2 == M_E)) || !(0 == m_pc)) && ((((((((((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)) && (((((((((((T1_E == 0 || !(2 == \old(m_st))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(\old(t1_pc) == 0)) || 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)) || (((!(E_M == 0) && m_st == 2) && t1_pc == 0) && !(E_M == 1)))) && (((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || (((((m_st == 0 && !(E_M == 0)) && t1_pc == 1) && token <= \old(token) + 1) && local + 1 <= token) && !(E_M == 1))) || T1_E == 1) || 1 == E_1) || !(2 == \old(m_st))) || 0 == E_1) || !(1 == m_pc) || !(\old(t1_pc) == 1)) || 0 == \old(E_M)) || ((!(E_M == 0) && m_st == 2) && !(E_M == 1))) [2018-11-23 05:11:48,496 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) && ((((((((((((((((((t1_pc == 1 && !(E_M == 0)) && m_st == 2) && t1_st == 2) && !(T1_E == 0)) && !(E_M == 1)) || T1_E == 0) || local < \old(token)) || \old(token) < local) || (((((((m_st == 0 && t1_st % 2 == 0) && t1_pc == 1) && !(E_M == 0)) && 2 <= t1_st) && token <= \old(token) + 1) && local + 1 <= token) && !(E_M == 1))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_1) || !(2 == \old(m_st))) || 0 == E_1) || !(1 == m_pc) || !(\old(t1_pc) == 1)) || 0 == \old(E_M))) && (((((((((((!(0 == local) || !(T1_E == 2)) || !(2 == \old(E_M))) || !(\old(token) == 0)) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == E_1)) || (((((m_st == 0 && t1_pc == 1) && !(E_M == 0)) && t1_st == 2) && token == 0) && !(E_M == 1))) || !(1 == t1_i)) || !(2 == M_E)) || !(0 == m_pc))) && (((((((((((T1_E == 0 || (((((t1_pc == 1 && !(E_M == 0)) && m_st == 2) && t1_st == 2) && !(T1_E == 0)) && !(E_M == 1))) || !(2 == \old(m_st))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(\old(t1_pc) == 0)) || 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)) [2018-11-23 05:11:48,496 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((T1_E == 0 || (((((m_st == 2 && !(E_1 == 1)) && token <= local) && !(E_1 == 0)) && m_pc == 1 && t1_st % 2 == 0) && local <= token)) || !(\old(t1_st) % 2 == 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)) || !(1 == \old(m_pc)) || !(t1_pc == 1)) || \old(local) + 1 < \old(token)) || 0 == E_M) && (((((((((((!(0 == \old(local)) || !(T1_E == 2)) || !(2 == E_M)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(m_i == 1)) || !(2 == \old(E_1))) || !(1 == t1_i)) || ((((m_pc == 1 && m_st == 2) && !(E_1 == 1)) && t1_st == 0) && !(E_1 == 0))) || !(2 == M_E)) || !(0 == \old(m_pc)))) && (((((((((((T1_E == 0 || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || ((!(\old(token) == 0) || !(0 == \old(local))) || !(t1_pc == 1)) || !(0 == \old(m_pc))) || 1 == \old(E_1)) || !(\old(t1_st) % 2 == 0)) || 0 == \old(E_1)) || 0 == E_M) || (((((m_st == 2 && !(E_1 == 1)) && token <= local) && !(E_1 == 0)) && m_pc == 1 && t1_st % 2 == 0) && local <= token)) [2018-11-23 05:11:48,496 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(0 == \old(local)) || ((((m_pc == 0 && E_1 == 2) && t1_st == 0) && token == 0) && local == 0)) || !(T1_E == 2)) || !(2 == E_M)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(m_i == 1)) || !(2 == \old(E_1))) || !(1 == t1_i)) || !(2 == M_E)) || !(0 == \old(m_pc))) && (((((((((((((T1_E == 0 || ((((((m_pc == 1 && token <= local + 1) && \old(E_1) == E_1) && token == \old(token)) && t1_st % 2 == 0) && 2 <= t1_st) && local + 1 <= token)) || !(\old(t1_st) % 2 == 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)) || !(1 == \old(m_pc)) || !(t1_pc == 1)) || \old(local) + 1 < \old(token)) || 0 == E_M)) && (((((((((((T1_E == 0 || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || ((!(\old(token) == 0) || !(0 == \old(local))) || !(t1_pc == 1)) || !(0 == \old(m_pc))) || 1 == \old(E_1)) || (((((\old(E_1) == E_1 && t1_st % 2 == 0) && m_pc == 0) && 2 <= t1_st) && token == 0) && local == 0)) || !(\old(t1_st) % 2 == 0)) || 0 == \old(E_1)) || 0 == E_M) [2018-11-23 05:11:48,496 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((T1_E == 0 || ((((((m_pc == 1 && token <= local + 1) && \old(E_1) == E_1) && token == \old(token)) && t1_st % 2 == 0) && 2 <= t1_st) && local + 1 <= token)) || !(\old(t1_st) % 2 == 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)) || !(1 == \old(m_pc)) || !(t1_pc == 1)) || \old(local) + 1 < \old(token)) || 0 == E_M) && ((((((((((!(0 == \old(local)) || !(T1_E == 2)) || !(2 == E_M)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(m_i == 1)) || !(2 == \old(E_1))) || !(1 == t1_i)) || !(2 == M_E)) || !(0 == \old(m_pc)))) && ((((((((((T1_E == 0 || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || ((!(\old(token) == 0) || !(0 == \old(local))) || !(t1_pc == 1)) || !(0 == \old(m_pc))) || 1 == \old(E_1)) || !(\old(t1_st) % 2 == 0)) || 0 == \old(E_1)) || 0 == E_M) [2018-11-23 05:11:48,497 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_1) || !(2 == \old(m_st))) || ((((t1_pc == 1 && m_st == 2) && token <= local) && local <= token) && \old(E_M) == E_M)) || 0 == E_1) || !(1 == m_pc) || !(\old(t1_pc) == 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) || !(\old(t1_pc) == 0)) || T1_E == 1) || T1_E == 0) || 1 == E_1) || !(1 == m_pc)) || !(2 == \old(m_st))) || 0 == E_1) || 0 == \old(E_M)) || 0 == M_E) || 1 == M_E)) && ((((((((((!(0 == local) || !(T1_E == 2)) || !(2 == \old(E_M))) || !(\old(token) == 0)) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t1_i)) || !(2 == M_E)) || !(0 == m_pc)) [2018-11-23 05:11:48,531 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_abe16e72-4e49-41da-a6df-c098b7e80740/bin-2019/utaipan/witness.graphml [2018-11-23 05:11:48,531 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:11:48,532 INFO L168 Benchmark]: Toolchain (without parser) took 46379.58 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -80.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-23 05:11:48,532 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:11:48,532 INFO L168 Benchmark]: CACSL2BoogieTranslator took 183.08 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:11:48,532 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.29 ms. Allocated memory is still 1.0 GB. Free memory is still 943.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:11:48,533 INFO L168 Benchmark]: Boogie Preprocessor took 59.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -194.3 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 05:11:48,533 INFO L168 Benchmark]: RCFGBuilder took 371.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:11:48,533 INFO L168 Benchmark]: TraceAbstraction took 45665.41 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-23 05:11:48,533 INFO L168 Benchmark]: Witness Printer took 84.32 ms. Allocated memory is still 2.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-11-23 05:11:48,535 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 183.08 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.1 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 13.29 ms. Allocated memory is still 1.0 GB. Free memory is still 943.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -194.3 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 371.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 45665.41 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.3 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 84.32 ms. Allocated memory is still 2.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 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: (((((((((((T1_E == 0 || 0 == M_E) || 1 == M_E) || !(t1_st == 2)) || 1 == E_M) || T1_E == 1) || !(0 == m_st)) || ((!(token == 0) || !(0 == local)) || !(t1_pc == 1)) || !(0 == m_pc)) || 1 == E_1) || __retres1 == 1) || 0 == E_1) || 0 == E_M) && (((((((((((!(T1_E == 2) || !(t1_st == 0)) || !(t1_pc == 0)) || !(token == 0) || !(0 == local)) || !(1 == t1_i)) || !(0 == m_pc)) || __retres1 == 1) || !(2 == E_M)) || !(0 == m_st)) || !(m_i == 1)) || !(2 == E_1)) || !(2 == M_E)) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((((((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)) && t1_pc == 1) && m_st == 2) && t1_st == 2)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || 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)) && (((((((((((((((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)) && t1_pc == 1) && m_st == 2) && t1_st == 2)) || \old(local) < \old(token)) || \old(token) < \old(local)) || 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)) || !(2 == \old(m_st)) || !(\old(t1_st) % 2 == 0)) || 0 == \old(E_1)) || ((!(1 == \old(m_pc)) || !(\old(t1_pc) == 1)) && (((!(\old(token) == 1) || !(0 == \old(local))) || !(\old(t1_pc) == 1)) || !(0 == \old(m_pc))))) || 0 == \old(E_M)) || ((token == \old(token) && m_st == 2) && 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)) && token <= local) && t1_pc == 1) && m_st == 2) && t1_st % 2 == 0) && local <= token) || (((((((m_pc == 1 && 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_st % 2 == 0) && t1_pc == 1) && 2 <= t1_st)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(\old(t1_pc) == 0)) || !(\old(token) == 0) || !(0 == \old(local))) || !(1 == t1_i)) || ((((t1_st == 0 && (E_1 == 2 && E_M == 2 && m_st == 0) && m_pc == 0) && token == 0) && local == 0) && t1_pc == 0)) || !(0 == \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) && m_st == 2) && t1_st == 2)) || !(2 == \old(E_M))) || !(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)) && t1_st == 0) && m_st == 2) && t1_pc == 0)) || !(m_i == 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))) || !(2 == \old(E_1))) || !(2 == 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)) && m_st == 0) && m_pc == 0) && t1_pc == 1) && t1_st == 2) && token == 0) && local == 0) && tmp == 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)) && token <= local) && t1_pc == 1) && m_st == 2) && t1_st % 2 == 0) && local <= token)) || (((((((!(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) && m_st == 2) && t1_st == 2)) || !(\old(t1_st) % 2 == 0)) || (((((((m_pc == 1 && 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_st % 2 == 0) && t1_pc == 1) && 2 <= t1_st)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || \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)) && 2 <= m_st) && !(m_pc == 1))) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || ((!(1 == \old(m_pc)) || !(\old(t1_pc) == 1)) && (((!(\old(token) == 1) || !(0 == \old(local))) || !(\old(t1_pc) == 1)) || !(0 == \old(m_pc))))) || \old(local) + 1 < \old(token)) || 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 == 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)) && t1_pc == 1) && m_st == 2) && t1_st == 2)) || !(2 == \old(m_st))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(\old(t1_pc) == 0)) || 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)) && t1_st == 0) && m_st == 2) && t1_pc == 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))) && ((((((((((((((((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)) && token <= local) && t1_pc == 1) && m_st == 2) && t1_st % 2 == 0) && local <= token)) || \old(local) < \old(token)) || (((((((m_pc == 1 && 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_st % 2 == 0) && t1_pc == 1) && 2 <= t1_st)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_1)) || !(2 == \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)) && t1_pc == 1) && m_st == 2) && t1_st == 2)) || !(\old(t1_pc) == 1)) || !(\old(t1_st) % 2 == 0)) || \old(token) < \old(local)) || 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))) || 0 == \old(E_1)) || 0 == \old(E_M)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((T1_E == 0 || !(t1_st % 2 == 0)) || 0 == __retres1) || 0 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || token < local + 1) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || ((!(1 == m_pc) || !(t1_pc == 1)) && (((!(token == 1) || !(0 == local)) || !(t1_pc == 1)) || !(0 == m_pc)))) || local + 1 < token) || 0 == E_M) && (((((((((((!(1 == E_M) || T1_E == 0) || __retres1 == 1) || 0 == M_E) || 1 == M_E) || T1_E == 1) || token < local + 1) || 1 == E_1) || !(2 == m_st) || !(t1_pc == 1)) || !(1 == m_pc)) || 0 == E_1) || local + 1 < token)) && (((((((((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)) && (((((((((((T1_E == 0 || 0 == __retres1) || local < token) || token < local) || 0 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_1) || !(2 == m_st) || !(t1_st % 2 == 0)) || 0 == E_1) || ((!(1 == m_pc) || !(t1_pc == 1)) && (((!(token == 1) || !(0 == local)) || !(t1_pc == 1)) || !(0 == m_pc)))) || 0 == E_M)) && (((((((((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)) && ((((((((((1 == E_M || !(t1_pc == 0)) || T1_E == 1) || T1_E == 0) || 0 == __retres1) || 0 == E_1) || 0 == E_M) || 0 == M_E) || !(0 == m_pc)) || 1 == M_E) || !(t1_st == 0))) && ((((((((((T1_E == 0 || !(2 == m_st)) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(t1_pc == 0)) || T1_E == 1) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == __retres1)) && (((((((((((((T1_E == 0 || local < token) || !(t1_pc == 1)) || !(t1_st % 2 == 0)) || token < local) || 0 == M_E) || 0 == __retres1) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || 0 == E_1) || 0 == E_M) || !(0 == m_pc))) && ((((((((((T1_E == 0 || !(2 == m_st)) || !(t1_pc == 1)) || 0 == M_E) || 1 == E_M) || !(t1_st == 2)) || T1_E == 1) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 0 == __retres1)) && ((((((((((((T1_E == 0 || local < token) || !(t1_st % 2 == 0)) || token < local) || 0 == __retres1) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || 0 == E_1) || ((!(1 == m_pc) || !(t1_pc == 1)) && (((!(token == 1) || !(0 == local)) || !(t1_pc == 1)) || !(0 == m_pc)))) || 0 == E_M) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == 0 || (((((m_st == 2 && !(E_1 == 1)) && token <= local) && !(E_1 == 0)) && m_pc == 1 && t1_st % 2 == 0) && local <= token)) || !(\old(t1_st) % 2 == 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)) || !(1 == \old(m_pc)) || !(t1_pc == 1)) || \old(local) + 1 < \old(token)) || 0 == E_M) && (((((((((((!(0 == \old(local)) || !(T1_E == 2)) || !(2 == E_M)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(m_i == 1)) || !(2 == \old(E_1))) || !(1 == t1_i)) || ((((m_pc == 1 && m_st == 2) && !(E_1 == 1)) && t1_st == 0) && !(E_1 == 0))) || !(2 == M_E)) || !(0 == \old(m_pc)))) && (((((((((((T1_E == 0 || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || ((!(\old(token) == 0) || !(0 == \old(local))) || !(t1_pc == 1)) || !(0 == \old(m_pc))) || 1 == \old(E_1)) || !(\old(t1_st) % 2 == 0)) || 0 == \old(E_1)) || 0 == E_M) || (((((m_st == 2 && !(E_1 == 1)) && token <= local) && !(E_1 == 0)) && m_pc == 1 && t1_st % 2 == 0) && local <= token)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((((((((((m_st == 0 && E_M == 2) && token == 0) && t1_pc == 0) || !(0 == local)) || !(T1_E == 2)) || !(2 == \old(E_M))) || !(\old(token) == 0)) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t1_i)) || !(2 == M_E)) || !(0 == m_pc)) && ((((((((((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)) && (((((((((((T1_E == 0 || !(2 == \old(m_st))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(\old(t1_pc) == 0)) || 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)) || (((!(E_M == 0) && m_st == 2) && t1_pc == 0) && !(E_M == 1)))) && (((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || (((((m_st == 0 && !(E_M == 0)) && t1_pc == 1) && token <= \old(token) + 1) && local + 1 <= token) && !(E_M == 1))) || T1_E == 1) || 1 == E_1) || !(2 == \old(m_st))) || 0 == E_1) || !(1 == m_pc) || !(\old(t1_pc) == 1)) || 0 == \old(E_M)) || ((!(E_M == 0) && m_st == 2) && !(E_M == 1))) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((((((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)) && t1_pc == 1) && m_st == 2) && t1_st == 2)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || 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)) && (((((((((((((((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)) && t1_pc == 1) && m_st == 2) && t1_st == 2)) || \old(local) < \old(token)) || \old(token) < \old(local)) || 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)) || !(2 == \old(m_st)) || !(\old(t1_st) % 2 == 0)) || 0 == \old(E_1)) || ((!(1 == \old(m_pc)) || !(\old(t1_pc) == 1)) && (((!(\old(token) == 1) || !(0 == \old(local))) || !(\old(t1_pc) == 1)) || !(0 == \old(m_pc))))) || 0 == \old(E_M)) || ((token == \old(token) && m_st == 2) && 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)) && token <= local) && t1_pc == 1) && m_st == 2) && t1_st % 2 == 0) && local <= token) || (((((((m_pc == 1 && 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_st % 2 == 0) && t1_pc == 1) && 2 <= t1_st)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(\old(t1_pc) == 0)) || !(\old(token) == 0) || !(0 == \old(local))) || !(1 == t1_i)) || !(0 == \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) && m_st == 2) && t1_st == 2)) || !(2 == \old(E_M))) || !(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)) && t1_st == 0) && m_st == 2) && t1_pc == 0)) || !(m_i == 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))) || !(2 == \old(E_1))) || !(2 == M_E))) && ((((((((((((((((((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)) && token <= local) && t1_pc == 1) && m_st == 2) && t1_st % 2 == 0) && local <= token)) || (((((((!(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) && m_st == 2) && t1_st == 2)) || !(\old(t1_st) % 2 == 0)) || (((((((m_pc == 1 && 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_st % 2 == 0) && t1_pc == 1) && 2 <= t1_st)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || \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)) && 2 <= m_st) && !(m_pc == 1))) || !(1 == \old(m_pc))) || 0 == \old(E_1)) || ((!(1 == \old(m_pc)) || !(\old(t1_pc) == 1)) && (((!(\old(token) == 1) || !(0 == \old(local))) || !(\old(t1_pc) == 1)) || !(0 == \old(m_pc))))) || \old(local) + 1 < \old(token)) || 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 == 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)) && t1_pc == 1) && m_st == 2) && t1_st == 2)) || !(2 == \old(m_st))) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(\old(t1_pc) == 0)) || 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)) && t1_st == 0) && m_st == 2) && t1_pc == 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))) && ((((((((((((((((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)) && token <= local) && t1_pc == 1) && m_st == 2) && t1_st % 2 == 0) && local <= token)) || \old(local) < \old(token)) || (((((((m_pc == 1 && 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_st % 2 == 0) && t1_pc == 1) && 2 <= t1_st)) || 0 == M_E) || 1 == M_E) || 1 == \old(E_1)) || !(2 == \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)) && t1_pc == 1) && m_st == 2) && t1_st == 2)) || !(\old(t1_pc) == 1)) || !(\old(t1_st) % 2 == 0)) || \old(token) < \old(local)) || 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))) || 0 == \old(E_1)) || 0 == \old(E_M)) - 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) && ((((((((((((((((((t1_pc == 1 && !(E_M == 0)) && m_st == 2) && t1_st == 2) && !(T1_E == 0)) && !(E_M == 1)) || T1_E == 0) || local < \old(token)) || \old(token) < local) || (((((((m_st == 0 && t1_st % 2 == 0) && t1_pc == 1) && !(E_M == 0)) && 2 <= t1_st) && token <= \old(token) + 1) && local + 1 <= token) && !(E_M == 1))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_1) || !(2 == \old(m_st))) || 0 == E_1) || !(1 == m_pc) || !(\old(t1_pc) == 1)) || 0 == \old(E_M))) && (((((((((((!(0 == local) || !(T1_E == 2)) || !(2 == \old(E_M))) || !(\old(token) == 0)) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == E_1)) || (((((m_st == 0 && t1_pc == 1) && !(E_M == 0)) && t1_st == 2) && token == 0) && !(E_M == 1))) || !(1 == t1_i)) || !(2 == M_E)) || !(0 == m_pc))) && (((((((((((T1_E == 0 || (((((t1_pc == 1 && !(E_M == 0)) && m_st == 2) && t1_st == 2) && !(T1_E == 0)) && !(E_M == 1))) || !(2 == \old(m_st))) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || !(\old(t1_pc) == 0)) || 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)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == 0 || local < \old(token)) || \old(token) < local) || 0 == M_E) || 1 == M_E) || 1 == \old(E_M)) || T1_E == 1) || 1 == E_1) || !(2 == \old(m_st))) || ((((t1_pc == 1 && m_st == 2) && token <= local) && local <= token) && \old(E_M) == E_M)) || 0 == E_1) || !(1 == m_pc) || !(\old(t1_pc) == 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) || !(\old(t1_pc) == 0)) || T1_E == 1) || T1_E == 0) || 1 == E_1) || !(1 == m_pc)) || !(2 == \old(m_st))) || 0 == E_1) || 0 == \old(E_M)) || 0 == M_E) || 1 == M_E)) && ((((((((((!(0 == local) || !(T1_E == 2)) || !(2 == \old(E_M))) || !(\old(token) == 0)) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t1_i)) || !(2 == M_E)) || !(0 == m_pc)) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(T1_E) == 2) || !(\old(t1_st) == 0)) || !(\old(t1_pc) == 0)) || (((((((!(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_pc == 1) && m_st == 2) && t1_st == 2)) || !(\old(token) == 0) || !(0 == \old(local))) || !(1 == t1_i)) || !(0 == \old(m_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) && !(m_pc == 1))) || (((((((m_pc == 1 && (((!(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) && t1_st % 2 == 0) && t1_pc == 1) && 2 <= t1_st)) || !(2 == \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)) && t1_st == 0) && m_st == 2) && t1_pc == 0)) || !(0 == \old(m_st))) || !(m_i == 1)) || (((((((((T1_E == 2 && E_M == 2) && m_st == 0) && m_pc == 0) && M_E == 2) && E_1 == 2) && t1_st == 0) && token == 0) && local == 0) && t1_pc == 0)) || (((((((((!(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) && t1_pc == 1) && m_st == 2) && t1_st % 2 == 0) && local <= token)) || !(2 == \old(E_1))) || !(2 == \old(M_E)) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == 0 || ((((((m_pc == 1 && token <= local + 1) && \old(E_1) == E_1) && token == \old(token)) && t1_st % 2 == 0) && 2 <= t1_st) && local + 1 <= token)) || !(\old(t1_st) % 2 == 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)) || !(1 == \old(m_pc)) || !(t1_pc == 1)) || \old(local) + 1 < \old(token)) || 0 == E_M) && ((((((((((!(0 == \old(local)) || !(T1_E == 2)) || !(2 == E_M)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(m_i == 1)) || !(2 == \old(E_1))) || !(1 == t1_i)) || !(2 == M_E)) || !(0 == \old(m_pc)))) && ((((((((((T1_E == 0 || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || ((!(\old(token) == 0) || !(0 == \old(local))) || !(t1_pc == 1)) || !(0 == \old(m_pc))) || 1 == \old(E_1)) || !(\old(t1_st) % 2 == 0)) || 0 == \old(E_1)) || 0 == E_M) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((T1_E == 0 || local < token) || !(t1_pc == 1)) || !(t1_st % 2 == 0)) || token < local) || 0 == M_E) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || 0 == __retres1) || 0 == E_1) || 1 == E_1) || 0 == E_M) || !(0 == m_pc)) && ((((((((((T1_E == 0 || !(2 == m_st)) || !(t1_pc == 1)) || 0 == M_E) || 0 == __retres1) || 1 == E_M) || !(t1_st == 2)) || T1_E == 1) || 1 == E_1) || 0 == E_1) || 0 == E_M)) && ((((((((!(1 == E_M) || !(0 == m_st)) || 1 == E_1) || token < local + 1) || !(1 == m_pc)) || ((((T1_E == 1 || T1_E == 0) || 0 == E_1) || 0 == E_M) || 0 == M_E) || 1 == M_E) || !(t1_pc == 1)) || local + 1 < token) || 0 == __retres1)) && ((((((((((T1_E == 0 || !(2 == m_st)) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(t1_pc == 0)) || T1_E == 1) || 1 == E_1) || 0 == E_1) || 0 == __retres1) || 0 == E_M)) && (((((((((((((T1_E == 0 || local < token) || 0 == __retres1) || !(t1_st % 2 == 0)) || token < local) || 0 == M_E) || 1 == E_1) || 1 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || 0 == E_1) || ((!(1 == m_pc) || !(t1_pc == 1)) && (((!(token == 1) || !(0 == local)) || !(t1_pc == 1)) || !(0 == m_pc)))) || 0 == E_M)) && ((((((((((((((T1_E == 0 || 0 == __retres1) || !(t1_st % 2 == 0)) || 0 == M_E) || 1 == E_M) || t1_st < 2) || T1_E == 1) || !(0 == m_st)) || token < local + 1) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || ((!(1 == m_pc) || !(t1_pc == 1)) && (((!(token == 1) || !(0 == local)) || !(t1_pc == 1)) || !(0 == m_pc)))) || local + 1 < token) || 0 == E_M)) && ((((((((((1 == E_M || !(t1_pc == 0)) || T1_E == 1) || T1_E == 0) || 0 == E_1) || 0 == E_M) || 0 == __retres1) || 0 == M_E) || !(0 == m_pc)) || 1 == M_E) || !(t1_st == 0))) && (((((((((((T1_E == 0 || local < token) || token < local) || 0 == __retres1) || 0 == M_E) || 1 == E_M) || T1_E == 1) || 1 == E_1) || !(2 == m_st) || !(t1_st % 2 == 0)) || 0 == E_1) || ((!(1 == m_pc) || !(t1_pc == 1)) && (((!(token == 1) || !(0 == local)) || !(t1_pc == 1)) || !(0 == m_pc)))) || 0 == E_M)) && (((1 == E_1 || 0 == __retres1) || ((((T1_E == 1 || T1_E == 0) || 0 == E_1) || 0 == E_M) || 0 == M_E) || 1 == M_E) || !(2 == m_st))) && ((((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)) && (((((((((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: ((((((((((!(M_E == 0) || !(\old(T1_E) == 2)) || !(\old(t1_st) == 0)) || !(\old(t1_pc) == 0)) || !(\old(token) == 0) || !(0 == \old(local))) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == \old(E_1))) || !(2 == \old(M_E)) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((((!(0 == \old(local)) || ((((m_pc == 0 && E_1 == 2) && t1_st == 0) && token == 0) && local == 0)) || !(T1_E == 2)) || !(2 == E_M)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(m_i == 1)) || !(2 == \old(E_1))) || !(1 == t1_i)) || !(2 == M_E)) || !(0 == \old(m_pc))) && (((((((((((((T1_E == 0 || ((((((m_pc == 1 && token <= local + 1) && \old(E_1) == E_1) && token == \old(token)) && t1_st % 2 == 0) && 2 <= t1_st) && local + 1 <= token)) || !(\old(t1_st) % 2 == 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)) || !(1 == \old(m_pc)) || !(t1_pc == 1)) || \old(local) + 1 < \old(token)) || 0 == E_M)) && (((((((((((T1_E == 0 || 0 == M_E) || 1 == M_E) || 1 == E_M) || \old(t1_st) < 2) || T1_E == 1) || ((!(\old(token) == 0) || !(0 == \old(local))) || !(t1_pc == 1)) || !(0 == \old(m_pc))) || 1 == \old(E_1)) || (((((\old(E_1) == E_1 && t1_st % 2 == 0) && m_pc == 0) && 2 <= t1_st) && token == 0) && local == 0)) || !(\old(t1_st) % 2 == 0)) || 0 == \old(E_1)) || 0 == E_M) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 144 locations, 1 error locations. SAFE Result, 45.5s OverallTime, 18 OverallIterations, 4 TraceHistogramMax, 21.3s AutomataDifference, 0.0s DeadEndRemovalTime, 19.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 3698 SDtfs, 6273 SDslu, 12656 SDs, 0 SdLazy, 9416 SolverSat, 2562 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1569 GetRequests, 1201 SyntacticMatches, 29 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9026 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=754occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.9826797591845733 AbsIntWeakeningRatio, 0.5447316103379721 AbsIntAvgWeakeningVarsNumRemoved, 12.819085487077535 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 302 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 1846 PreInvPairs, 2314 NumberOfFragments, 18333 HoareAnnotationTreeSize, 1846 FomulaSimplifications, 132226 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 62 FomulaSimplificationsInter, 98440 FormulaSimplificationTreeSizeReductionInter, 17.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2450 NumberOfCodeBlocks, 2348 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2828 ConstructedInterpolants, 0 QuantifiedInterpolants, 583249 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1205 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 22 InterpolantComputations, 15 PerfectInterpolantSequences, 1370/1431 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...