./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_811a4691-44fd-48a1-8c9b-3fb4fda61973/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_811a4691-44fd-48a1-8c9b-3fb4fda61973/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_811a4691-44fd-48a1-8c9b-3fb4fda61973/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_811a4691-44fd-48a1-8c9b-3fb4fda61973/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_811a4691-44fd-48a1-8c9b-3fb4fda61973/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_811a4691-44fd-48a1-8c9b-3fb4fda61973/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-5842f4b [2018-11-18 13:04:39,305 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:04:39,306 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:04:39,312 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:04:39,312 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:04:39,313 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:04:39,314 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:04:39,315 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:04:39,316 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:04:39,316 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:04:39,317 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:04:39,317 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:04:39,318 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:04:39,319 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:04:39,319 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:04:39,320 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:04:39,320 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:04:39,321 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:04:39,323 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:04:39,324 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:04:39,324 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:04:39,325 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:04:39,327 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:04:39,327 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:04:39,327 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:04:39,327 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:04:39,328 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:04:39,328 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:04:39,329 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:04:39,329 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:04:39,330 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:04:39,330 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:04:39,330 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:04:39,330 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:04:39,331 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:04:39,331 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:04:39,331 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_811a4691-44fd-48a1-8c9b-3fb4fda61973/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 13:04:39,340 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:04:39,340 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:04:39,341 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 13:04:39,341 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 13:04:39,341 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 13:04:39,341 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 13:04:39,341 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 13:04:39,342 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 13:04:39,342 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 13:04:39,342 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 13:04:39,343 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 13:04:39,343 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 13:04:39,343 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 13:04:39,344 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:04:39,344 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:04:39,344 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:04:39,344 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:04:39,344 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:04:39,344 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 13:04:39,345 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 13:04:39,345 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 13:04:39,345 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:04:39,345 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:04:39,345 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:04:39,345 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 13:04:39,346 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:04:39,346 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:04:39,346 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 13:04:39,347 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 13:04:39,347 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:04:39,348 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:04:39,348 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 13:04:39,348 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 13:04:39,348 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 13:04:39,348 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 13:04:39,348 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 13:04:39,348 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 13:04:39,349 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_811a4691-44fd-48a1-8c9b-3fb4fda61973/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-18 13:04:39,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:04:39,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:04:39,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:04:39,385 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:04:39,385 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:04:39,385 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_811a4691-44fd-48a1-8c9b-3fb4fda61973/bin-2019/utaipan/../../sv-benchmarks/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c [2018-11-18 13:04:39,423 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_811a4691-44fd-48a1-8c9b-3fb4fda61973/bin-2019/utaipan/data/c4d201963/adae3e2bf0be4b49a20a62a46e712397/FLAG9b9124ca4 [2018-11-18 13:04:39,723 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:04:39,724 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_811a4691-44fd-48a1-8c9b-3fb4fda61973/sv-benchmarks/c/systemc/token_ring.01_true-unreach-call_false-termination.cil.c [2018-11-18 13:04:39,729 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_811a4691-44fd-48a1-8c9b-3fb4fda61973/bin-2019/utaipan/data/c4d201963/adae3e2bf0be4b49a20a62a46e712397/FLAG9b9124ca4 [2018-11-18 13:04:39,737 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_811a4691-44fd-48a1-8c9b-3fb4fda61973/bin-2019/utaipan/data/c4d201963/adae3e2bf0be4b49a20a62a46e712397 [2018-11-18 13:04:39,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:04:39,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:04:39,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:04:39,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:04:39,744 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:04:39,744 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:04:39" (1/1) ... [2018-11-18 13:04:39,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@252e0cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:39, skipping insertion in model container [2018-11-18 13:04:39,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:04:39" (1/1) ... [2018-11-18 13:04:39,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:04:39,778 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:04:39,917 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:04:39,922 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:04:39,947 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:04:39,961 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:04:39,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:39 WrapperNode [2018-11-18 13:04:39,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:04:39,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:04:39,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:04:39,962 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:04:39,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:39" (1/1) ... [2018-11-18 13:04:39,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:39" (1/1) ... [2018-11-18 13:04:39,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:04:39,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:04:39,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:04:39,975 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:04:40,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:39" (1/1) ... [2018-11-18 13:04:40,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:39" (1/1) ... [2018-11-18 13:04:40,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:39" (1/1) ... [2018-11-18 13:04:40,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:39" (1/1) ... [2018-11-18 13:04:40,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:39" (1/1) ... [2018-11-18 13:04:40,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:39" (1/1) ... [2018-11-18 13:04:40,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:39" (1/1) ... [2018-11-18 13:04:40,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:04:40,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:04:40,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:04:40,034 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:04:40,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_811a4691-44fd-48a1-8c9b-3fb4fda61973/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-18 13:04:40,067 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-18 13:04:40,067 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-18 13:04:40,067 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-11-18 13:04:40,067 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-11-18 13:04:40,067 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-11-18 13:04:40,067 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-11-18 13:04:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-18 13:04:40,068 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-18 13:04:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-18 13:04:40,068 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-18 13:04:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-11-18 13:04:40,068 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-11-18 13:04:40,068 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-18 13:04:40,068 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-18 13:04:40,069 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 13:04:40,069 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 13:04:40,069 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-18 13:04:40,069 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-18 13:04:40,069 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-11-18 13:04:40,069 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-11-18 13:04:40,069 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-11-18 13:04:40,069 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-11-18 13:04:40,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 13:04:40,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 13:04:40,070 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-18 13:04:40,070 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-18 13:04:40,070 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-18 13:04:40,070 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-18 13:04:40,070 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-18 13:04:40,070 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-18 13:04:40,070 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-18 13:04:40,071 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-18 13:04:40,071 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-18 13:04:40,071 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-18 13:04:40,071 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-11-18 13:04:40,071 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-11-18 13:04:40,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:04:40,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:04:40,071 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-11-18 13:04:40,071 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-11-18 13:04:40,072 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-18 13:04:40,072 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-18 13:04:40,358 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:04:40,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:04:40 BoogieIcfgContainer [2018-11-18 13:04:40,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:04:40,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 13:04:40,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 13:04:40,362 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 13:04:40,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:04:39" (1/3) ... [2018-11-18 13:04:40,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2bf0bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:04:40, skipping insertion in model container [2018-11-18 13:04:40,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:04:39" (2/3) ... [2018-11-18 13:04:40,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d2bf0bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:04:40, skipping insertion in model container [2018-11-18 13:04:40,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:04:40" (3/3) ... [2018-11-18 13:04:40,363 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01_true-unreach-call_false-termination.cil.c [2018-11-18 13:04:40,369 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 13:04:40,373 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 13:04:40,385 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 13:04:40,409 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 13:04:40,410 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 13:04:40,410 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 13:04:40,410 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:04:40,410 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:04:40,410 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 13:04:40,410 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:04:40,410 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 13:04:40,426 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2018-11-18 13:04:40,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 13:04:40,431 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:04:40,432 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:04:40,433 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:04:40,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:40,436 INFO L82 PathProgramCache]: Analyzing trace with hash 335814130, now seen corresponding path program 1 times [2018-11-18 13:04:40,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:04:40,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:40,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:04:40,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:40,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:04:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:04:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:04:40,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:04:40,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:04:40,641 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:04:40,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:04:40,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:04:40,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:04:40,657 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 5 states. [2018-11-18 13:04:41,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:04:41,015 INFO L93 Difference]: Finished difference Result 307 states and 433 transitions. [2018-11-18 13:04:41,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:04:41,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-11-18 13:04:41,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:04:41,028 INFO L225 Difference]: With dead ends: 307 [2018-11-18 13:04:41,028 INFO L226 Difference]: Without dead ends: 166 [2018-11-18 13:04:41,032 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:04:41,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-18 13:04:41,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 139. [2018-11-18 13:04:41,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 13:04:41,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 180 transitions. [2018-11-18 13:04:41,073 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 180 transitions. Word has length 79 [2018-11-18 13:04:41,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:04:41,073 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 180 transitions. [2018-11-18 13:04:41,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:04:41,074 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 180 transitions. [2018-11-18 13:04:41,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 13:04:41,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:04:41,076 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:04:41,076 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:04:41,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:41,076 INFO L82 PathProgramCache]: Analyzing trace with hash 769543216, now seen corresponding path program 1 times [2018-11-18 13:04:41,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:04:41,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:41,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:04:41,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:41,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:04:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:04:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:04:41,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:04:41,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:04:41,157 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:04:41,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:04:41,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:04:41,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:04:41,159 INFO L87 Difference]: Start difference. First operand 139 states and 180 transitions. Second operand 5 states. [2018-11-18 13:04:41,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:04:41,432 INFO L93 Difference]: Finished difference Result 286 states and 385 transitions. [2018-11-18 13:04:41,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:04:41,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-11-18 13:04:41,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:04:41,435 INFO L225 Difference]: With dead ends: 286 [2018-11-18 13:04:41,435 INFO L226 Difference]: Without dead ends: 166 [2018-11-18 13:04:41,437 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:04:41,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-18 13:04:41,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 139. [2018-11-18 13:04:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 13:04:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 179 transitions. [2018-11-18 13:04:41,450 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 179 transitions. Word has length 79 [2018-11-18 13:04:41,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:04:41,451 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 179 transitions. [2018-11-18 13:04:41,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:04:41,451 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 179 transitions. [2018-11-18 13:04:41,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 13:04:41,453 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:04:41,453 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:04:41,453 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:04:41,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:41,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2030460466, now seen corresponding path program 1 times [2018-11-18 13:04:41,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:04:41,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:41,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:04:41,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:41,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:04:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:04:41,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:04:41,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:04:41,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:04:41,506 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:04:41,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:04:41,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:04:41,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:04:41,507 INFO L87 Difference]: Start difference. First operand 139 states and 179 transitions. Second operand 5 states. [2018-11-18 13:04:41,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:04:41,700 INFO L93 Difference]: Finished difference Result 302 states and 407 transitions. [2018-11-18 13:04:41,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:04:41,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-11-18 13:04:41,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:04:41,702 INFO L225 Difference]: With dead ends: 302 [2018-11-18 13:04:41,702 INFO L226 Difference]: Without dead ends: 182 [2018-11-18 13:04:41,703 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:04:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-18 13:04:41,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 139. [2018-11-18 13:04:41,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 13:04:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 178 transitions. [2018-11-18 13:04:41,720 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 178 transitions. Word has length 79 [2018-11-18 13:04:41,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:04:41,720 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 178 transitions. [2018-11-18 13:04:41,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:04:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 178 transitions. [2018-11-18 13:04:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 13:04:41,721 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:04:41,722 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:04:41,722 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:04:41,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:41,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2071135216, now seen corresponding path program 1 times [2018-11-18 13:04:41,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:04:41,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:41,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:04:41,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:41,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:04:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:04:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:04:41,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:04:41,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:04:41,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:04:41,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:04:41,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:04:41,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:04:41,788 INFO L87 Difference]: Start difference. First operand 139 states and 178 transitions. Second operand 5 states. [2018-11-18 13:04:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:04:41,994 INFO L93 Difference]: Finished difference Result 295 states and 395 transitions. [2018-11-18 13:04:41,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:04:41,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-11-18 13:04:41,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:04:41,996 INFO L225 Difference]: With dead ends: 295 [2018-11-18 13:04:41,997 INFO L226 Difference]: Without dead ends: 175 [2018-11-18 13:04:41,997 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:04:41,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-18 13:04:42,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 139. [2018-11-18 13:04:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-18 13:04:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 177 transitions. [2018-11-18 13:04:42,014 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 177 transitions. Word has length 79 [2018-11-18 13:04:42,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:04:42,014 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 177 transitions. [2018-11-18 13:04:42,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:04:42,014 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 177 transitions. [2018-11-18 13:04:42,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 13:04:42,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:04:42,015 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:04:42,016 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:04:42,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:42,016 INFO L82 PathProgramCache]: Analyzing trace with hash -837046670, now seen corresponding path program 1 times [2018-11-18 13:04:42,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:04:42,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:42,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:04:42,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:42,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:04:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:04:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:04:42,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:04:42,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 13:04:42,070 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:04:42,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 13:04:42,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:04:42,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:04:42,071 INFO L87 Difference]: Start difference. First operand 139 states and 177 transitions. Second operand 6 states. [2018-11-18 13:04:42,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:04:42,093 INFO L93 Difference]: Finished difference Result 268 states and 354 transitions. [2018-11-18 13:04:42,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:04:42,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-11-18 13:04:42,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:04:42,095 INFO L225 Difference]: With dead ends: 268 [2018-11-18 13:04:42,095 INFO L226 Difference]: Without dead ends: 149 [2018-11-18 13:04:42,095 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:04:42,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-18 13:04:42,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2018-11-18 13:04:42,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-18 13:04:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 182 transitions. [2018-11-18 13:04:42,109 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 182 transitions. Word has length 79 [2018-11-18 13:04:42,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:04:42,110 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 182 transitions. [2018-11-18 13:04:42,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 13:04:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 182 transitions. [2018-11-18 13:04:42,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 13:04:42,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:04:42,111 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:04:42,111 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:04:42,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:42,111 INFO L82 PathProgramCache]: Analyzing trace with hash -588900176, now seen corresponding path program 1 times [2018-11-18 13:04:42,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:04:42,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:42,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:04:42,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:42,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:04:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:04:42,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:04:42,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:04:42,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 13:04:42,164 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:04:42,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 13:04:42,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:04:42,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:04:42,164 INFO L87 Difference]: Start difference. First operand 144 states and 182 transitions. Second operand 6 states. [2018-11-18 13:04:42,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:04:42,187 INFO L93 Difference]: Finished difference Result 275 states and 359 transitions. [2018-11-18 13:04:42,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:04:42,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-11-18 13:04:42,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:04:42,189 INFO L225 Difference]: With dead ends: 275 [2018-11-18 13:04:42,189 INFO L226 Difference]: Without dead ends: 151 [2018-11-18 13:04:42,190 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:04:42,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-18 13:04:42,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2018-11-18 13:04:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-18 13:04:42,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 187 transitions. [2018-11-18 13:04:42,200 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 187 transitions. Word has length 79 [2018-11-18 13:04:42,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:04:42,200 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 187 transitions. [2018-11-18 13:04:42,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 13:04:42,200 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 187 transitions. [2018-11-18 13:04:42,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 13:04:42,201 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:04:42,201 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:04:42,202 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:04:42,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:42,202 INFO L82 PathProgramCache]: Analyzing trace with hash -661286734, now seen corresponding path program 1 times [2018-11-18 13:04:42,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:04:42,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:42,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:04:42,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:42,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:04:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:04:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:04:42,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:04:42,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:04:42,260 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:04:42,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:04:42,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:04:42,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:04:42,261 INFO L87 Difference]: Start difference. First operand 149 states and 187 transitions. Second operand 5 states. [2018-11-18 13:04:42,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:04:42,468 INFO L93 Difference]: Finished difference Result 332 states and 422 transitions. [2018-11-18 13:04:42,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:04:42,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-11-18 13:04:42,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:04:42,469 INFO L225 Difference]: With dead ends: 332 [2018-11-18 13:04:42,470 INFO L226 Difference]: Without dead ends: 204 [2018-11-18 13:04:42,470 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:04:42,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-18 13:04:42,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 182. [2018-11-18 13:04:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-18 13:04:42,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 224 transitions. [2018-11-18 13:04:42,488 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 224 transitions. Word has length 79 [2018-11-18 13:04:42,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:04:42,488 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 224 transitions. [2018-11-18 13:04:42,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:04:42,489 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2018-11-18 13:04:42,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 13:04:42,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:04:42,489 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:04:42,490 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:04:42,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:42,490 INFO L82 PathProgramCache]: Analyzing trace with hash 724916660, now seen corresponding path program 1 times [2018-11-18 13:04:42,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:04:42,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:42,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:04:42,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:42,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:04:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:04:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:04:42,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:04:42,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:04:42,536 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:04:42,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:04:42,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:04:42,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:04:42,537 INFO L87 Difference]: Start difference. First operand 182 states and 224 transitions. Second operand 5 states. [2018-11-18 13:04:42,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:04:42,744 INFO L93 Difference]: Finished difference Result 343 states and 424 transitions. [2018-11-18 13:04:42,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:04:42,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-11-18 13:04:42,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:04:42,746 INFO L225 Difference]: With dead ends: 343 [2018-11-18 13:04:42,746 INFO L226 Difference]: Without dead ends: 182 [2018-11-18 13:04:42,747 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:04:42,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-18 13:04:42,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-11-18 13:04:42,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-18 13:04:42,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 222 transitions. [2018-11-18 13:04:42,760 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 222 transitions. Word has length 79 [2018-11-18 13:04:42,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:04:42,761 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 222 transitions. [2018-11-18 13:04:42,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:04:42,761 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 222 transitions. [2018-11-18 13:04:42,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 13:04:42,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:04:42,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:04:42,762 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:04:42,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:42,762 INFO L82 PathProgramCache]: Analyzing trace with hash 215443570, now seen corresponding path program 1 times [2018-11-18 13:04:42,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:04:42,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:42,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:04:42,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:42,763 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:04:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:04:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:04:42,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:04:42,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:04:42,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:04:42,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 13:04:42,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 13:04:42,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 13:04:42,820 INFO L87 Difference]: Start difference. First operand 182 states and 222 transitions. Second operand 5 states. [2018-11-18 13:04:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:04:43,080 INFO L93 Difference]: Finished difference Result 407 states and 526 transitions. [2018-11-18 13:04:43,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:04:43,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-11-18 13:04:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:04:43,083 INFO L225 Difference]: With dead ends: 407 [2018-11-18 13:04:43,084 INFO L226 Difference]: Without dead ends: 245 [2018-11-18 13:04:43,085 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:04:43,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-11-18 13:04:43,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 208. [2018-11-18 13:04:43,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-18 13:04:43,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 250 transitions. [2018-11-18 13:04:43,105 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 250 transitions. Word has length 79 [2018-11-18 13:04:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:04:43,105 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 250 transitions. [2018-11-18 13:04:43,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 13:04:43,105 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 250 transitions. [2018-11-18 13:04:43,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 13:04:43,107 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:04:43,107 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:04:43,107 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:04:43,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:43,107 INFO L82 PathProgramCache]: Analyzing trace with hash 277483184, now seen corresponding path program 1 times [2018-11-18 13:04:43,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:04:43,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:43,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:04:43,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:43,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:04:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:04:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:04:43,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:04:43,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:04:43,145 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:04:43,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:04:43,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:04:43,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:04:43,146 INFO L87 Difference]: Start difference. First operand 208 states and 250 transitions. Second operand 3 states. [2018-11-18 13:04:43,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:04:43,218 INFO L93 Difference]: Finished difference Result 559 states and 703 transitions. [2018-11-18 13:04:43,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:04:43,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-11-18 13:04:43,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:04:43,220 INFO L225 Difference]: With dead ends: 559 [2018-11-18 13:04:43,221 INFO L226 Difference]: Without dead ends: 371 [2018-11-18 13:04:43,221 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:04:43,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-11-18 13:04:43,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 370. [2018-11-18 13:04:43,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-11-18 13:04:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 453 transitions. [2018-11-18 13:04:43,256 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 453 transitions. Word has length 79 [2018-11-18 13:04:43,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:04:43,256 INFO L480 AbstractCegarLoop]: Abstraction has 370 states and 453 transitions. [2018-11-18 13:04:43,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:04:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 453 transitions. [2018-11-18 13:04:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-18 13:04:43,258 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:04:43,259 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:04:43,259 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:04:43,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:43,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1644138853, now seen corresponding path program 1 times [2018-11-18 13:04:43,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:04:43,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:43,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:04:43,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:43,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:04:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:04:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 13:04:43,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:04:43,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:04:43,324 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:04:43,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 13:04:43,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:04:43,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:04:43,325 INFO L87 Difference]: Start difference. First operand 370 states and 453 transitions. Second operand 4 states. [2018-11-18 13:04:43,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:04:43,469 INFO L93 Difference]: Finished difference Result 1023 states and 1270 transitions. [2018-11-18 13:04:43,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:04:43,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-11-18 13:04:43,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:04:43,473 INFO L225 Difference]: With dead ends: 1023 [2018-11-18 13:04:43,473 INFO L226 Difference]: Without dead ends: 544 [2018-11-18 13:04:43,474 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:04:43,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-11-18 13:04:43,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 515. [2018-11-18 13:04:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-11-18 13:04:43,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 617 transitions. [2018-11-18 13:04:43,512 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 617 transitions. Word has length 125 [2018-11-18 13:04:43,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:04:43,512 INFO L480 AbstractCegarLoop]: Abstraction has 515 states and 617 transitions. [2018-11-18 13:04:43,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 13:04:43,513 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 617 transitions. [2018-11-18 13:04:43,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-18 13:04:43,514 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:04:43,515 INFO L375 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:04:43,515 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:04:43,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:43,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1504755437, now seen corresponding path program 1 times [2018-11-18 13:04:43,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:04:43,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:43,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:04:43,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:43,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:04:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:04:43,586 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-11-18 13:04:43,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:04:43,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:04:43,587 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 162 with the following transitions: [2018-11-18 13:04:43,588 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [15], [17], [22], [25], [31], [37], [39], [41], [43], [47], [49], [50], [53], [62], [63], [68], [74], [80], [86], [88], [89], [99], [101], [103], [104], [107], [113], [117], [118], [123], [128], [130], [133], [139], [145], [147], [149], [153], [161], [164], [165], [177], [181], [187], [190], [193], [199], [202], [212], [215], [227], [236], [242], [244], [278], [284], [290], [296], [298], [299], [300], [303], [306], [310], [312], [314], [315], [344], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [358], [359], [360], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [400], [401], [402] [2018-11-18 13:04:43,618 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:04:43,618 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:04:43,797 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 13:04:43,799 INFO L272 AbstractInterpreter]: Visited 93 different actions 115 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-18 13:04:43,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:43,811 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 13:04:43,996 INFO L227 lantSequenceWeakener]: Weakened 122 states. On average, predicates are now at 77.47% of their original sizes. [2018-11-18 13:04:43,996 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 13:04:44,311 INFO L415 sIntCurrentIteration]: We unified 160 AI predicates to 160 [2018-11-18 13:04:44,311 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 13:04:44,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:04:44,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [6] total 44 [2018-11-18 13:04:44,311 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:04:44,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-18 13:04:44,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-18 13:04:44,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1356, Unknown=0, NotChecked=0, Total=1560 [2018-11-18 13:04:44,313 INFO L87 Difference]: Start difference. First operand 515 states and 617 transitions. Second operand 40 states. [2018-11-18 13:04:48,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:04:48,598 INFO L93 Difference]: Finished difference Result 1451 states and 1787 transitions. [2018-11-18 13:04:48,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-18 13:04:48,598 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 161 [2018-11-18 13:04:48,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:04:48,601 INFO L225 Difference]: With dead ends: 1451 [2018-11-18 13:04:48,601 INFO L226 Difference]: Without dead ends: 952 [2018-11-18 13:04:48,602 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 198 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=685, Invalid=5321, Unknown=0, NotChecked=0, Total=6006 [2018-11-18 13:04:48,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2018-11-18 13:04:48,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 920. [2018-11-18 13:04:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2018-11-18 13:04:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1075 transitions. [2018-11-18 13:04:48,645 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1075 transitions. Word has length 161 [2018-11-18 13:04:48,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:04:48,645 INFO L480 AbstractCegarLoop]: Abstraction has 920 states and 1075 transitions. [2018-11-18 13:04:48,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-18 13:04:48,645 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1075 transitions. [2018-11-18 13:04:48,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-18 13:04:48,648 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:04:48,648 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-18 13:04:48,648 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:04:48,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:48,649 INFO L82 PathProgramCache]: Analyzing trace with hash 521728019, now seen corresponding path program 1 times [2018-11-18 13:04:48,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:04:48,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:48,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:04:48,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:48,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:04:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:04:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-18 13:04:48,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:04:48,699 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:04:48,700 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 183 with the following transitions: [2018-11-18 13:04:48,700 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [15], [17], [20], [22], [25], [31], [37], [39], [41], [43], [47], [49], [50], [53], [55], [58], [62], [63], [68], [74], [80], [86], [88], [89], [99], [101], [103], [104], [107], [113], [117], [118], [123], [128], [130], [133], [139], [145], [147], [149], [153], [161], [164], [165], [177], [181], [187], [190], [193], [199], [202], [208], [212], [215], [227], [236], [242], [244], [278], [284], [290], [296], [298], [299], [300], [303], [306], [310], [312], [314], [315], [344], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [358], [359], [360], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [400], [401], [402] [2018-11-18 13:04:48,703 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:04:48,703 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:04:48,741 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 13:04:48,741 INFO L272 AbstractInterpreter]: Visited 102 different actions 133 times. Merged at 3 different actions 3 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-18 13:04:48,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:48,743 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 13:04:48,819 INFO L227 lantSequenceWeakener]: Weakened 148 states. On average, predicates are now at 78.24% of their original sizes. [2018-11-18 13:04:48,819 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 13:04:49,282 INFO L415 sIntCurrentIteration]: We unified 181 AI predicates to 181 [2018-11-18 13:04:49,282 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 13:04:49,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:04:49,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [4] total 54 [2018-11-18 13:04:49,283 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:04:49,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-18 13:04:49,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-18 13:04:49,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=2334, Unknown=0, NotChecked=0, Total=2652 [2018-11-18 13:04:49,284 INFO L87 Difference]: Start difference. First operand 920 states and 1075 transitions. Second operand 52 states. [2018-11-18 13:04:56,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:04:56,528 INFO L93 Difference]: Finished difference Result 1561 states and 1864 transitions. [2018-11-18 13:04:56,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-18 13:04:56,528 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 182 [2018-11-18 13:04:56,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:04:56,532 INFO L225 Difference]: With dead ends: 1561 [2018-11-18 13:04:56,532 INFO L226 Difference]: Without dead ends: 1067 [2018-11-18 13:04:56,535 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 227 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3155 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=972, Invalid=8534, Unknown=0, NotChecked=0, Total=9506 [2018-11-18 13:04:56,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-11-18 13:04:56,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1041. [2018-11-18 13:04:56,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2018-11-18 13:04:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1213 transitions. [2018-11-18 13:04:56,608 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1213 transitions. Word has length 182 [2018-11-18 13:04:56,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:04:56,608 INFO L480 AbstractCegarLoop]: Abstraction has 1041 states and 1213 transitions. [2018-11-18 13:04:56,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-18 13:04:56,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1213 transitions. [2018-11-18 13:04:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-18 13:04:56,612 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:04:56,612 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-18 13:04:56,612 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:04:56,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:56,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1450723211, now seen corresponding path program 1 times [2018-11-18 13:04:56,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:04:56,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:56,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:04:56,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:56,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:04:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:04:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 34 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-18 13:04:56,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:04:56,686 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:04:56,686 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 183 with the following transitions: [2018-11-18 13:04:56,687 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [15], [17], [20], [22], [25], [31], [37], [39], [41], [43], [47], [49], [50], [53], [62], [63], [68], [74], [80], [86], [88], [89], [99], [101], [103], [104], [107], [113], [117], [118], [123], [128], [130], [133], [139], [145], [147], [149], [153], [161], [164], [165], [177], [181], [187], [190], [193], [199], [202], [205], [212], [215], [227], [236], [242], [244], [278], [284], [290], [296], [298], [299], [300], [303], [306], [310], [312], [314], [315], [344], [345], [346], [347], [348], [349], [350], [351], [352], [353], [354], [355], [356], [358], [359], [360], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [400], [401], [402] [2018-11-18 13:04:56,690 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:04:56,690 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:04:56,785 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 13:04:56,785 INFO L272 AbstractInterpreter]: Visited 108 different actions 264 times. Merged at 18 different actions 26 times. Never widened. Performed 2391 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2391 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 4 different actions. Largest state had 30 variables. [2018-11-18 13:04:56,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:56,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 13:04:56,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:04:56,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_811a4691-44fd-48a1-8c9b-3fb4fda61973/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-18 13:04:56,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:04:56,817 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 13:04:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:04:56,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:04:56,947 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 13:04:56,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:04:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 34 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-18 13:04:57,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:04:57,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2018-11-18 13:04:57,210 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:04:57,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:04:57,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:04:57,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:04:57,211 INFO L87 Difference]: Start difference. First operand 1041 states and 1213 transitions. Second operand 3 states. [2018-11-18 13:04:57,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:04:57,290 INFO L93 Difference]: Finished difference Result 1685 states and 2043 transitions. [2018-11-18 13:04:57,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:04:57,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-11-18 13:04:57,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:04:57,295 INFO L225 Difference]: With dead ends: 1685 [2018-11-18 13:04:57,295 INFO L226 Difference]: Without dead ends: 1046 [2018-11-18 13:04:57,297 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 358 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-18 13:04:57,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2018-11-18 13:04:57,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1034. [2018-11-18 13:04:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1034 states. [2018-11-18 13:04:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1187 transitions. [2018-11-18 13:04:57,373 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1187 transitions. Word has length 182 [2018-11-18 13:04:57,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:04:57,373 INFO L480 AbstractCegarLoop]: Abstraction has 1034 states and 1187 transitions. [2018-11-18 13:04:57,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:04:57,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1187 transitions. [2018-11-18 13:04:57,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-18 13:04:57,402 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:04:57,402 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:04:57,403 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:04:57,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:57,403 INFO L82 PathProgramCache]: Analyzing trace with hash -406273108, now seen corresponding path program 1 times [2018-11-18 13:04:57,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:04:57,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:57,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:04:57,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:57,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:04:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:04:57,508 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-18 13:04:57,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:04:57,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 13:04:57,509 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:04:57,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 13:04:57,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:04:57,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:04:57,509 INFO L87 Difference]: Start difference. First operand 1034 states and 1187 transitions. Second operand 6 states. [2018-11-18 13:04:58,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:04:58,254 INFO L93 Difference]: Finished difference Result 2749 states and 3263 transitions. [2018-11-18 13:04:58,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:04:58,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2018-11-18 13:04:58,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:04:58,262 INFO L225 Difference]: With dead ends: 2749 [2018-11-18 13:04:58,263 INFO L226 Difference]: Without dead ends: 1843 [2018-11-18 13:04:58,265 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:04:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2018-11-18 13:04:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1786. [2018-11-18 13:04:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2018-11-18 13:04:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2107 transitions. [2018-11-18 13:04:58,401 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2107 transitions. Word has length 183 [2018-11-18 13:04:58,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:04:58,402 INFO L480 AbstractCegarLoop]: Abstraction has 1786 states and 2107 transitions. [2018-11-18 13:04:58,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 13:04:58,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2107 transitions. [2018-11-18 13:04:58,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-18 13:04:58,406 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:04:58,406 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:04:58,406 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:04:58,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:58,407 INFO L82 PathProgramCache]: Analyzing trace with hash -215989236, now seen corresponding path program 1 times [2018-11-18 13:04:58,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:04:58,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:58,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:04:58,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:04:58,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:04:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:04:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 19 proven. 20 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-18 13:04:58,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:04:58,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:04:58,510 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 209 with the following transitions: [2018-11-18 13:04:58,511 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [15], [17], [49], [50], [53], [55], [58], [62], [63], [68], [74], [80], [86], [88], [89], [99], [101], [103], [104], [107], [113], [117], [118], [123], [128], [130], [133], [139], [145], [147], [149], [153], [161], [164], [165], [166], [168], [171], [175], [176], [177], [181], [187], [190], [193], [195], [199], [202], [212], [218], [226], [227], [236], [242], [244], [246], [248], [253], [261], [264], [269], [278], [284], [290], [296], [298], [299], [300], [303], [306], [310], [312], [314], [315], [344], [345], [346], [347], [348], [349], [352], [353], [354], [355], [356], [358], [359], [360], [362], [363], [364], [365], [366], [367], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [398], [399], [400], [401], [402] [2018-11-18 13:04:58,514 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:04:58,515 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:04:58,548 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 13:04:58,549 INFO L272 AbstractInterpreter]: Visited 94 different actions 132 times. Merged at 9 different actions 9 times. Never widened. Performed 746 root evaluator evaluations with a maximum evaluation depth of 3. Performed 746 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 30 variables. [2018-11-18 13:04:58,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:04:58,570 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 13:04:58,665 INFO L227 lantSequenceWeakener]: Weakened 136 states. On average, predicates are now at 70.71% of their original sizes. [2018-11-18 13:04:58,666 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 13:04:59,074 INFO L415 sIntCurrentIteration]: We unified 207 AI predicates to 207 [2018-11-18 13:04:59,074 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 13:04:59,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:04:59,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [44] imperfect sequences [8] total 50 [2018-11-18 13:04:59,074 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:04:59,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-18 13:04:59,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-18 13:04:59,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1708, Unknown=0, NotChecked=0, Total=1892 [2018-11-18 13:04:59,075 INFO L87 Difference]: Start difference. First operand 1786 states and 2107 transitions. Second operand 44 states. [2018-11-18 13:05:04,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:05:04,269 INFO L93 Difference]: Finished difference Result 3206 states and 3817 transitions. [2018-11-18 13:05:04,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-18 13:05:04,270 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 208 [2018-11-18 13:05:04,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:05:04,275 INFO L225 Difference]: With dead ends: 3206 [2018-11-18 13:05:04,275 INFO L226 Difference]: Without dead ends: 1569 [2018-11-18 13:05:04,279 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 245 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2014 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=715, Invalid=5927, Unknown=0, NotChecked=0, Total=6642 [2018-11-18 13:05:04,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-11-18 13:05:04,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1536. [2018-11-18 13:05:04,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1536 states. [2018-11-18 13:05:04,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 1817 transitions. [2018-11-18 13:05:04,404 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 1817 transitions. Word has length 208 [2018-11-18 13:05:04,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:05:04,404 INFO L480 AbstractCegarLoop]: Abstraction has 1536 states and 1817 transitions. [2018-11-18 13:05:04,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-18 13:05:04,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 1817 transitions. [2018-11-18 13:05:04,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-18 13:05:04,408 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:05:04,408 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:05:04,408 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:05:04,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:05:04,409 INFO L82 PathProgramCache]: Analyzing trace with hash 104179936, now seen corresponding path program 1 times [2018-11-18 13:05:04,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:05:04,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:05:04,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:05:04,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:05:04,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:05:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:05:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-18 13:05:04,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:05:04,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:05:04,474 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-11-18 13:05:04,474 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [15], [17], [20], [31], [37], [39], [47], [49], [50], [53], [55], [60], [62], [63], [68], [74], [80], [86], [88], [89], [92], [97], [99], [101], [103], [104], [107], [113], [117], [118], [123], [128], [130], [133], [139], [145], [147], [149], [153], [161], [164], [165], [166], [168], [171], [175], [176], [177], [181], [187], [190], [193], [195], [199], [202], [212], [215], [226], [227], [236], [242], [244], [246], [248], [253], [261], [264], [269], [278], [284], [290], [296], [298], [299], [300], [303], [306], [310], [312], [314], [315], [344], [345], [346], [347], [348], [349], [352], [353], [354], [355], [356], [358], [359], [360], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [398], [399], [400], [401], [402] [2018-11-18 13:05:04,475 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:05:04,476 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:05:04,552 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 13:05:04,552 INFO L272 AbstractInterpreter]: Visited 130 different actions 276 times. Merged at 17 different actions 23 times. Never widened. Performed 1882 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1882 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 2 different actions. Largest state had 30 variables. [2018-11-18 13:05:04,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:05:04,554 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 13:05:04,691 INFO L227 lantSequenceWeakener]: Weakened 209 states. On average, predicates are now at 71.34% of their original sizes. [2018-11-18 13:05:04,691 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 13:05:05,401 INFO L415 sIntCurrentIteration]: We unified 215 AI predicates to 215 [2018-11-18 13:05:05,402 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 13:05:05,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:05:05,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [5] total 69 [2018-11-18 13:05:05,402 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:05:05,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-18 13:05:05,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-18 13:05:05,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=3959, Unknown=0, NotChecked=0, Total=4290 [2018-11-18 13:05:05,404 INFO L87 Difference]: Start difference. First operand 1536 states and 1817 transitions. Second operand 66 states. [2018-11-18 13:05:11,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:05:11,932 INFO L93 Difference]: Finished difference Result 2996 states and 3556 transitions. [2018-11-18 13:05:11,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-18 13:05:11,932 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 216 [2018-11-18 13:05:11,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:05:11,936 INFO L225 Difference]: With dead ends: 2996 [2018-11-18 13:05:11,936 INFO L226 Difference]: Without dead ends: 1621 [2018-11-18 13:05:11,941 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 241 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2966 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=809, Invalid=7563, Unknown=0, NotChecked=0, Total=8372 [2018-11-18 13:05:11,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2018-11-18 13:05:12,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1612. [2018-11-18 13:05:12,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1612 states. [2018-11-18 13:05:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 1898 transitions. [2018-11-18 13:05:12,070 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 1898 transitions. Word has length 216 [2018-11-18 13:05:12,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:05:12,071 INFO L480 AbstractCegarLoop]: Abstraction has 1612 states and 1898 transitions. [2018-11-18 13:05:12,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-18 13:05:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 1898 transitions. [2018-11-18 13:05:12,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-18 13:05:12,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:05:12,075 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:05:12,075 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:05:12,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:05:12,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1483741014, now seen corresponding path program 1 times [2018-11-18 13:05:12,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:05:12,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:05:12,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:05:12,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:05:12,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:05:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:05:12,134 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 34 proven. 2 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-11-18 13:05:12,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:05:12,134 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:05:12,135 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 230 with the following transitions: [2018-11-18 13:05:12,135 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [13], [15], [17], [20], [31], [37], [39], [47], [49], [50], [53], [55], [60], [62], [63], [68], [74], [80], [86], [88], [89], [92], [95], [97], [99], [101], [103], [104], [107], [113], [117], [118], [123], [128], [130], [133], [139], [145], [147], [149], [153], [161], [164], [165], [166], [168], [171], [175], [176], [177], [181], [187], [190], [193], [195], [199], [202], [205], [212], [215], [221], [226], [227], [236], [242], [244], [246], [248], [253], [261], [264], [269], [278], [284], [290], [296], [298], [299], [300], [303], [306], [310], [312], [314], [315], [344], [345], [346], [347], [348], [349], [352], [353], [354], [355], [356], [358], [359], [360], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [398], [399], [400], [401], [402] [2018-11-18 13:05:12,138 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:05:12,138 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:05:12,493 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 13:05:12,493 INFO L272 AbstractInterpreter]: Visited 139 different actions 1393 times. Merged at 52 different actions 322 times. Never widened. Performed 10618 root evaluator evaluations with a maximum evaluation depth of 3. Performed 10618 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 75 fixpoints after 13 different actions. Largest state had 30 variables. [2018-11-18 13:05:12,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:05:12,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 13:05:12,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:05:12,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_811a4691-44fd-48a1-8c9b-3fb4fda61973/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-18 13:05:12,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:05:12,508 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 13:05:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:05:12,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:05:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-11-18 13:05:12,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:05:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 34 proven. 2 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-11-18 13:05:12,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:05:12,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2018-11-18 13:05:12,750 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:05:12,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:05:12,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:05:12,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:05:12,751 INFO L87 Difference]: Start difference. First operand 1612 states and 1898 transitions. Second operand 3 states. [2018-11-18 13:05:12,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:05:12,915 INFO L93 Difference]: Finished difference Result 3829 states and 4767 transitions. [2018-11-18 13:05:12,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:05:12,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2018-11-18 13:05:12,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:05:12,924 INFO L225 Difference]: With dead ends: 3829 [2018-11-18 13:05:12,924 INFO L226 Difference]: Without dead ends: 2559 [2018-11-18 13:05:12,929 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 457 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:05:12,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2559 states. [2018-11-18 13:05:13,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2559 to 2555. [2018-11-18 13:05:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2555 states. [2018-11-18 13:05:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 3105 transitions. [2018-11-18 13:05:13,179 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 3105 transitions. Word has length 229 [2018-11-18 13:05:13,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:05:13,179 INFO L480 AbstractCegarLoop]: Abstraction has 2555 states and 3105 transitions. [2018-11-18 13:05:13,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:05:13,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 3105 transitions. [2018-11-18 13:05:13,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-11-18 13:05:13,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:05:13,184 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:05:13,185 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:05:13,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:05:13,185 INFO L82 PathProgramCache]: Analyzing trace with hash 679875560, now seen corresponding path program 1 times [2018-11-18 13:05:13,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:05:13,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:05:13,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:05:13,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:05:13,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:05:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:05:13,270 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 39 proven. 24 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-18 13:05:13,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:05:13,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:05:13,271 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 230 with the following transitions: [2018-11-18 13:05:13,271 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [15], [17], [20], [31], [37], [39], [47], [49], [50], [53], [55], [60], [62], [63], [68], [74], [80], [86], [88], [89], [92], [95], [97], [99], [101], [103], [104], [107], [113], [117], [118], [123], [128], [130], [133], [139], [145], [147], [149], [153], [161], [164], [165], [166], [168], [171], [175], [176], [177], [181], [187], [190], [193], [195], [199], [202], [205], [212], [215], [221], [226], [227], [236], [242], [244], [246], [248], [253], [261], [264], [269], [278], [284], [290], [296], [298], [299], [300], [303], [306], [310], [312], [314], [315], [344], [345], [346], [347], [348], [349], [352], [353], [354], [355], [356], [358], [359], [360], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [398], [399], [400], [401], [402] [2018-11-18 13:05:13,272 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:05:13,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:05:13,472 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 13:05:13,472 INFO L272 AbstractInterpreter]: Visited 138 different actions 1041 times. Merged at 44 different actions 211 times. Never widened. Performed 7587 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7587 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 52 fixpoints after 10 different actions. Largest state had 30 variables. [2018-11-18 13:05:13,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:05:13,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 13:05:13,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:05:13,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_811a4691-44fd-48a1-8c9b-3fb4fda61973/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:05:13,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:05:13,481 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 13:05:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:05:13,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:05:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-18 13:05:13,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:05:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-18 13:05:13,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:05:13,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 6] total 14 [2018-11-18 13:05:13,753 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:05:13,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 13:05:13,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:05:13,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-11-18 13:05:13,753 INFO L87 Difference]: Start difference. First operand 2555 states and 3105 transitions. Second operand 6 states. [2018-11-18 13:05:13,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:05:13,946 INFO L93 Difference]: Finished difference Result 4741 states and 5943 transitions. [2018-11-18 13:05:13,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:05:13,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 229 [2018-11-18 13:05:13,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:05:13,956 INFO L225 Difference]: With dead ends: 4741 [2018-11-18 13:05:13,956 INFO L226 Difference]: Without dead ends: 2559 [2018-11-18 13:05:13,962 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 453 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-18 13:05:13,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2559 states. [2018-11-18 13:05:14,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2559 to 2555. [2018-11-18 13:05:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2555 states. [2018-11-18 13:05:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 3102 transitions. [2018-11-18 13:05:14,130 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 3102 transitions. Word has length 229 [2018-11-18 13:05:14,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:05:14,131 INFO L480 AbstractCegarLoop]: Abstraction has 2555 states and 3102 transitions. [2018-11-18 13:05:14,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 13:05:14,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 3102 transitions. [2018-11-18 13:05:14,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-11-18 13:05:14,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:05:14,135 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:05:14,135 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:05:14,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:05:14,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1337863941, now seen corresponding path program 1 times [2018-11-18 13:05:14,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:05:14,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:05:14,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:05:14,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:05:14,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:05:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:05:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-18 13:05:14,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:05:14,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:05:14,196 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2018-11-18 13:05:14,196 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [15], [17], [20], [31], [37], [39], [47], [49], [50], [53], [55], [60], [62], [63], [68], [74], [80], [86], [88], [89], [92], [97], [99], [101], [103], [104], [107], [113], [117], [118], [123], [128], [130], [133], [139], [145], [147], [149], [153], [161], [164], [165], [166], [168], [171], [175], [176], [177], [181], [187], [190], [193], [195], [199], [202], [205], [212], [215], [221], [226], [227], [236], [242], [244], [246], [248], [253], [261], [264], [269], [278], [284], [290], [296], [298], [299], [300], [303], [306], [310], [312], [314], [315], [344], [345], [346], [347], [348], [349], [352], [353], [354], [355], [356], [358], [359], [360], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [398], [399], [400], [401], [402] [2018-11-18 13:05:14,197 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:05:14,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:05:14,378 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 13:05:14,378 INFO L272 AbstractInterpreter]: Visited 137 different actions 998 times. Merged at 32 different actions 164 times. Widened at 1 different actions 1 times. Performed 6983 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6983 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 45 fixpoints after 9 different actions. Largest state had 30 variables. [2018-11-18 13:05:14,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:05:14,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 13:05:14,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:05:14,390 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_811a4691-44fd-48a1-8c9b-3fb4fda61973/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:05:14,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:05:14,401 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 13:05:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:05:14,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:05:14,498 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-18 13:05:14,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:05:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-18 13:05:14,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:05:14,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2018-11-18 13:05:14,662 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:05:14,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:05:14,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:05:14,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:05:14,663 INFO L87 Difference]: Start difference. First operand 2555 states and 3102 transitions. Second operand 3 states. [2018-11-18 13:05:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:05:14,788 INFO L93 Difference]: Finished difference Result 4493 states and 5598 transitions. [2018-11-18 13:05:14,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:05:14,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-11-18 13:05:14,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:05:14,794 INFO L225 Difference]: With dead ends: 4493 [2018-11-18 13:05:14,795 INFO L226 Difference]: Without dead ends: 2311 [2018-11-18 13:05:14,800 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:05:14,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2018-11-18 13:05:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2231. [2018-11-18 13:05:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2018-11-18 13:05:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2667 transitions. [2018-11-18 13:05:14,943 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2667 transitions. Word has length 230 [2018-11-18 13:05:14,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:05:14,943 INFO L480 AbstractCegarLoop]: Abstraction has 2231 states and 2667 transitions. [2018-11-18 13:05:14,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:05:14,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2667 transitions. [2018-11-18 13:05:14,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-11-18 13:05:14,946 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:05:14,946 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:05:14,946 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:05:14,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:05:14,946 INFO L82 PathProgramCache]: Analyzing trace with hash -971639377, now seen corresponding path program 2 times [2018-11-18 13:05:14,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:05:14,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:05:14,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:05:14,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:05:14,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:05:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:05:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-11-18 13:05:14,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:05:14,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:05:14,999 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 13:05:14,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 13:05:14,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:05:14,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_811a4691-44fd-48a1-8c9b-3fb4fda61973/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:05:15,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 13:05:15,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 13:05:15,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 13:05:15,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:05:15,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:05:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-18 13:05:15,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:05:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-11-18 13:05:15,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:05:15,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 4 [2018-11-18 13:05:15,218 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:05:15,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:05:15,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:05:15,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:05:15,219 INFO L87 Difference]: Start difference. First operand 2231 states and 2667 transitions. Second operand 3 states. [2018-11-18 13:05:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:05:15,277 INFO L93 Difference]: Finished difference Result 2758 states and 3290 transitions. [2018-11-18 13:05:15,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:05:15,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2018-11-18 13:05:15,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:05:15,279 INFO L225 Difference]: With dead ends: 2758 [2018-11-18 13:05:15,280 INFO L226 Difference]: Without dead ends: 463 [2018-11-18 13:05:15,282 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 466 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-18 13:05:15,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-11-18 13:05:15,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2018-11-18 13:05:15,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-11-18 13:05:15,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 498 transitions. [2018-11-18 13:05:15,306 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 498 transitions. Word has length 233 [2018-11-18 13:05:15,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:05:15,306 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 498 transitions. [2018-11-18 13:05:15,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:05:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 498 transitions. [2018-11-18 13:05:15,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-11-18 13:05:15,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:05:15,308 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:05:15,308 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:05:15,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:05:15,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1801076583, now seen corresponding path program 1 times [2018-11-18 13:05:15,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:05:15,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:05:15,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:05:15,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:05:15,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:05:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:05:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 58 proven. 3 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-18 13:05:15,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:05:15,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:05:15,371 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 253 with the following transitions: [2018-11-18 13:05:15,371 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [7], [10], [15], [17], [20], [31], [37], [39], [47], [49], [50], [53], [55], [60], [62], [63], [68], [74], [80], [86], [88], [89], [92], [97], [99], [101], [103], [104], [107], [113], [117], [118], [123], [128], [130], [133], [139], [145], [147], [149], [153], [161], [162], [163], [164], [165], [166], [168], [171], [175], [176], [177], [181], [187], [190], [193], [195], [199], [202], [212], [215], [226], [227], [236], [242], [244], [246], [248], [253], [256], [264], [269], [278], [284], [290], [296], [298], [299], [300], [303], [306], [308], [310], [312], [314], [315], [321], [329], [333], [341], [343], [344], [345], [346], [347], [348], [349], [352], [353], [354], [355], [356], [358], [359], [360], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [399], [400], [401], [402] [2018-11-18 13:05:15,372 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:05:15,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:05:15,435 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 13:05:15,435 INFO L272 AbstractInterpreter]: Visited 131 different actions 373 times. Merged at 34 different actions 66 times. Never widened. Performed 2965 root evaluator evaluations with a maximum evaluation depth of 3. Performed 2965 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 4 different actions. Largest state had 30 variables. [2018-11-18 13:05:15,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:05:15,436 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 13:05:15,543 INFO L227 lantSequenceWeakener]: Weakened 228 states. On average, predicates are now at 67.13% of their original sizes. [2018-11-18 13:05:15,544 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 13:05:16,333 INFO L415 sIntCurrentIteration]: We unified 251 AI predicates to 251 [2018-11-18 13:05:16,333 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 13:05:16,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 13:05:16,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [68] imperfect sequences [6] total 72 [2018-11-18 13:05:16,333 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:05:16,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-11-18 13:05:16,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-11-18 13:05:16,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=4188, Unknown=0, NotChecked=0, Total=4556 [2018-11-18 13:05:16,335 INFO L87 Difference]: Start difference. First operand 463 states and 498 transitions. Second operand 68 states. [2018-11-18 13:05:21,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:05:21,752 INFO L93 Difference]: Finished difference Result 574 states and 627 transitions. [2018-11-18 13:05:21,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-18 13:05:21,753 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 252 [2018-11-18 13:05:21,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:05:21,753 INFO L225 Difference]: With dead ends: 574 [2018-11-18 13:05:21,753 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 13:05:21,756 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 291 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4187 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1029, Invalid=10527, Unknown=0, NotChecked=0, Total=11556 [2018-11-18 13:05:21,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 13:05:21,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 13:05:21,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 13:05:21,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 13:05:21,757 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 252 [2018-11-18 13:05:21,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:05:21,757 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:05:21,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-11-18 13:05:21,757 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:05:21,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 13:05:21,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 13:05:21,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:05:21,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:05:22,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:05:22,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:05:22,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:05:22,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:05:22,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:05:22,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:05:22,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:05:22,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:05:22,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:05:22,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:05:23,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:05:23,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:05:23,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:05:23,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:05:23,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:05:23,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:05:23,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:05:23,744 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 68 [2018-11-18 13:05:24,326 WARN L180 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 83 [2018-11-18 13:05:24,544 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 83 [2018-11-18 13:05:24,759 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 86 [2018-11-18 13:05:25,003 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 86 [2018-11-18 13:05:25,127 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2018-11-18 13:05:25,343 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 86 [2018-11-18 13:05:25,557 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 86 [2018-11-18 13:05:25,912 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 92 [2018-11-18 13:05:26,289 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 116 [2018-11-18 13:05:26,608 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 87 [2018-11-18 13:05:27,310 WARN L180 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 109 [2018-11-18 13:05:27,518 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 83 [2018-11-18 13:05:27,985 WARN L180 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 94 [2018-11-18 13:05:28,387 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 87 [2018-11-18 13:05:28,933 WARN L180 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 117 [2018-11-18 13:05:29,234 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 92 [2018-11-18 13:05:30,307 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 171 DAG size of output: 134 [2018-11-18 13:05:30,437 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 71 [2018-11-18 13:05:31,045 WARN L180 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 86 [2018-11-18 13:05:31,147 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 68 [2018-11-18 13:05:32,214 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 171 DAG size of output: 134 [2018-11-18 13:05:32,392 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 86 [2018-11-18 13:05:32,607 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 86 [2018-11-18 13:05:33,025 WARN L180 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 118 [2018-11-18 13:05:33,330 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2018-11-18 13:05:33,642 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 87 [2018-11-18 13:05:33,871 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 95 [2018-11-18 13:05:34,100 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 84 [2018-11-18 13:05:34,376 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 70 [2018-11-18 13:05:34,527 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 68 [2018-11-18 13:05:34,860 WARN L180 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 85 [2018-11-18 13:05:35,007 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 64 [2018-11-18 13:05:35,438 WARN L180 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 113 [2018-11-18 13:05:35,731 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 67 [2018-11-18 13:05:35,959 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 86 [2018-11-18 13:05:36,538 WARN L180 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 94 [2018-11-18 13:05:36,742 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 59 [2018-11-18 13:05:37,091 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 86 [2018-11-18 13:05:37,315 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 76 [2018-11-18 13:05:37,534 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 75 [2018-11-18 13:05:37,801 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 78 [2018-11-18 13:05:37,877 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 321) no Hoare annotation was computed. [2018-11-18 13:05:37,877 INFO L425 ceAbstractionStarter]: For program point L315(line 315) no Hoare annotation was computed. [2018-11-18 13:05:37,877 INFO L425 ceAbstractionStarter]: For program point L317-2(lines 301 325) no Hoare annotation was computed. [2018-11-18 13:05:37,877 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 313) no Hoare annotation was computed. [2018-11-18 13:05:37,877 INFO L421 ceAbstractionStarter]: At program point L307(line 307) the Hoare annotation is: (let ((.cse13 (= 1 ~m_pc~0)) (.cse16 (= ~m_st~0 2)) (.cse11 (= 1 ~E_1~0)) (.cse30 (= ~m_st~0 0)) (.cse1 (<= 2 ~t1_st~0)) (.cse32 (+ ~local~0 1))) (let ((.cse0 (< |old(~t1_st~0)| 2)) (.cse3 (= ~T1_E~0 1)) (.cse4 (= ~T1_E~0 0)) (.cse18 (< ~token~0 .cse32)) (.cse12 (= 0 ~E_1~0)) (.cse8 (= 0 ~E_M~0)) (.cse20 (< .cse32 ~token~0)) (.cse14 (and .cse30 .cse1)) (.cse9 (= 0 ~M_E~0)) (.cse2 (not .cse11)) (.cse26 (= ~t1_st~0 0)) (.cse27 (not (= ~t1_pc~0 0))) (.cse15 (not (= 0 |old(~m_st~0)|))) (.cse29 (not (= 0 ~m_pc~0))) (.cse25 (not (= |old(~t1_st~0)| 0))) (.cse28 (not (= 2 ~M_E~0))) (.cse22 (and .cse16 (= ~t1_st~0 2))) (.cse5 (< ~local~0 ~token~0)) (.cse7 (< ~token~0 ~local~0)) (.cse19 (not .cse13)) (.cse10 (= 1 ~M_E~0)) (.cse21 (not (= |old(~t1_st~0)| 2))) (.cse17 (not (= 2 |old(~m_st~0)|))) (.cse31 (not (= 2 ~E_1~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse23 (not (= ~T1_E~0 2))) (.cse24 (not (= 2 ~E_M~0)))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse3 .cse4 .cse11 .cse12 .cse8 (< |old(~m_st~0)| 2) .cse9 (<= 2 ~m_st~0) .cse13) (or .cse4 .cse5 .cse6 .cse7 .cse9 .cse14 .cse0 .cse15 .cse3 .cse11 .cse12 .cse8 .cse13) (or .cse4 .cse16 .cse17 .cse6 .cse9 .cse10 .cse3 .cse18 .cse11 .cse19 .cse12 .cse20 .cse8) (or .cse4 .cse17 .cse6 .cse9 .cse21 .cse3 .cse18 .cse11 .cse19 .cse12 .cse20 .cse8 .cse22) (or .cse0 .cse15 .cse3 .cse4 .cse11 .cse18 .cse12 .cse6 .cse8 .cse20 .cse14 .cse9) (or .cse5 .cse7 .cse23 .cse24 .cse25 .cse26 .cse27 .cse2 .cse28 .cse29) (or (not (= 1 ~t1_i~0)) (and .cse30 .cse26) (not (= ~m_i~0 1)) (or (not (= ~token~0 0)) .cse27 .cse15 (not (= 0 ~local~0)) .cse31 .cse23 .cse28 .cse29 .cse24 .cse25)) (or .cse5 .cse17 .cse6 .cse7 .cse23 .cse24 .cse21 .cse22 .cse19 .cse31 .cse28) (or .cse22 .cse5 .cse7 .cse19 (not .cse10) (or .cse21 .cse17 .cse31 .cse6 .cse23 .cse24))))) [2018-11-18 13:05:37,878 INFO L421 ceAbstractionStarter]: At program point L309-2(lines 309 313) the Hoare annotation is: (let ((.cse10 (= 1 ~E_1~0)) (.cse13 (= 1 ~m_pc~0)) (.cse15 (= ~m_st~0 2)) (.cse16 (= ~t1_st~0 2)) (.cse22 (= activate_threads_~tmp~1 0)) (.cse9 (= ~T1_E~0 1)) (.cse1 (= ~m_st~0 0)) (.cse34 (= ~t1_pc~0 1)) (.cse2 (<= 2 ~t1_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse35 (+ ~local~0 1))) (let ((.cse8 (not (= 0 |old(~m_st~0)|))) (.cse19 (< ~token~0 .cse35)) (.cse11 (= 0 ~E_1~0)) (.cse21 (< .cse35 ~token~0)) (.cse17 (and (not .cse9) (<= ~token~0 .cse35) .cse1 .cse34 (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) .cse2 (not (= ~E_1~0 1)) (not .cse0) (<= .cse35 ~token~0) (not (= ~E_1~0 0)))) (.cse31 (and .cse15 .cse16 .cse22)) (.cse20 (not .cse13)) (.cse18 (not (= |old(~t1_st~0)| 2))) (.cse14 (not (= 2 |old(~m_st~0)|))) (.cse25 (not (= 2 ~E_1~0))) (.cse7 (< |old(~t1_st~0)| 2)) (.cse4 (not .cse34)) (.cse12 (= 0 ~E_M~0)) (.cse6 (= 0 ~M_E~0)) (.cse32 (= 1 ~M_E~0)) (.cse3 (< ~local~0 ~token~0)) (.cse5 (< ~token~0 ~local~0)) (.cse26 (not (= ~T1_E~0 2))) (.cse29 (not (= 2 ~E_M~0))) (.cse30 (not (= |old(~t1_st~0)| 0))) (.cse23 (= ~t1_st~0 0)) (.cse24 (not (= ~t1_pc~0 0))) (.cse33 (not .cse10)) (.cse27 (not (= 2 ~M_E~0))) (.cse28 (not (= 0 ~m_pc~0)))) (and (or .cse0 (and .cse1 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse9 .cse0 .cse10 .cse11 .cse12 (< |old(~m_st~0)| 2) .cse6 .cse13 (<= 2 ~m_st~0)) (or .cse0 .cse14 (and .cse15 .cse16) .cse4 .cse6 .cse17 .cse18 .cse9 .cse19 .cse10 .cse20 .cse11 .cse21 .cse12) (or (not (= 1 ~t1_i~0)) (not (= ~m_i~0 1)) (and .cse1 .cse22 .cse23) (or (not (= ~token~0 0)) .cse24 .cse8 (not (= 0 ~local~0)) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30)) (or .cse3 .cse14 .cse4 .cse5 .cse26 .cse29 .cse18 .cse20 .cse25 .cse31 .cse27) (or .cse0 .cse1 .cse14 .cse4 .cse6 .cse32 .cse9 .cse19 .cse10 .cse20 .cse11 .cse21 .cse12 .cse15) (or .cse7 .cse8 .cse9 .cse0 .cse10 .cse19 .cse11 .cse4 .cse12 .cse21 .cse6 .cse17) (or .cse3 .cse5 .cse31 .cse20 (not .cse32) (or .cse18 .cse14 .cse25 .cse4 .cse26 .cse29)) (or .cse7 (or .cse33 .cse9 .cse0 .cse3 .cse4 .cse5 .cse12 .cse6 .cse32) .cse2) (or .cse3 .cse5 .cse26 .cse29 .cse30 (and .cse22 .cse23) .cse24 .cse33 .cse27 .cse28)))) [2018-11-18 13:05:37,878 INFO L425 ceAbstractionStarter]: For program point L307-1(line 307) no Hoare annotation was computed. [2018-11-18 13:05:37,878 INFO L421 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 301 325) the Hoare annotation is: (let ((.cse13 (= 1 ~m_pc~0)) (.cse16 (= ~m_st~0 2)) (.cse11 (= 1 ~E_1~0)) (.cse30 (= ~m_st~0 0)) (.cse1 (<= 2 ~t1_st~0)) (.cse32 (+ ~local~0 1))) (let ((.cse0 (< |old(~t1_st~0)| 2)) (.cse3 (= ~T1_E~0 1)) (.cse4 (= ~T1_E~0 0)) (.cse18 (< ~token~0 .cse32)) (.cse12 (= 0 ~E_1~0)) (.cse8 (= 0 ~E_M~0)) (.cse20 (< .cse32 ~token~0)) (.cse14 (and .cse30 .cse1)) (.cse9 (= 0 ~M_E~0)) (.cse2 (not .cse11)) (.cse26 (= ~t1_st~0 0)) (.cse27 (not (= ~t1_pc~0 0))) (.cse15 (not (= 0 |old(~m_st~0)|))) (.cse29 (not (= 0 ~m_pc~0))) (.cse25 (not (= |old(~t1_st~0)| 0))) (.cse28 (not (= 2 ~M_E~0))) (.cse22 (and .cse16 (= ~t1_st~0 2))) (.cse5 (< ~local~0 ~token~0)) (.cse7 (< ~token~0 ~local~0)) (.cse19 (not .cse13)) (.cse10 (= 1 ~M_E~0)) (.cse21 (not (= |old(~t1_st~0)| 2))) (.cse17 (not (= 2 |old(~m_st~0)|))) (.cse31 (not (= 2 ~E_1~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse23 (not (= ~T1_E~0 2))) (.cse24 (not (= 2 ~E_M~0)))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse3 .cse4 .cse11 .cse12 .cse8 (< |old(~m_st~0)| 2) .cse9 (<= 2 ~m_st~0) .cse13) (or .cse4 .cse5 .cse6 .cse7 .cse9 .cse14 .cse0 .cse15 .cse3 .cse11 .cse12 .cse8 .cse13) (or .cse4 .cse16 .cse17 .cse6 .cse9 .cse10 .cse3 .cse18 .cse11 .cse19 .cse12 .cse20 .cse8) (or .cse4 .cse17 .cse6 .cse9 .cse21 .cse3 .cse18 .cse11 .cse19 .cse12 .cse20 .cse8 .cse22) (or .cse0 .cse15 .cse3 .cse4 .cse11 .cse18 .cse12 .cse6 .cse8 .cse20 .cse14 .cse9) (or .cse5 .cse7 .cse23 .cse24 .cse25 .cse26 .cse27 .cse2 .cse28 .cse29) (or (not (= 1 ~t1_i~0)) (and .cse30 .cse26) (not (= ~m_i~0 1)) (or (not (= ~token~0 0)) .cse27 .cse15 (not (= 0 ~local~0)) .cse31 .cse23 .cse28 .cse29 .cse24 .cse25)) (or .cse5 .cse17 .cse6 .cse7 .cse23 .cse24 .cse21 .cse22 .cse19 .cse31 .cse28) (or .cse22 .cse5 .cse7 .cse19 (not .cse10) (or .cse21 .cse17 .cse31 .cse6 .cse23 .cse24))))) [2018-11-18 13:05:37,878 INFO L425 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 301 325) no Hoare annotation was computed. [2018-11-18 13:05:37,878 INFO L425 ceAbstractionStarter]: For program point L89(lines 89 102) no Hoare annotation was computed. [2018-11-18 13:05:37,879 INFO L421 ceAbstractionStarter]: At program point L89-2(lines 77 108) the Hoare annotation is: (let ((.cse20 (= 1 ~m_pc~0))) (let ((.cse0 (not (= ~T1_E~0 2))) (.cse1 (not (= 2 |old(~E_M~0)|))) (.cse2 (not (= |old(~t1_pc~0)| 0))) (.cse3 (not (= 2 ~E_1~0))) (.cse5 (= ~E_M~0 2)) (.cse6 (= ~t1_pc~0 0)) (.cse7 (not (= 2 ~M_E~0))) (.cse14 (= ~T1_E~0 0)) (.cse8 (< ~local~0 |old(~token~0)|)) (.cse9 (not (= 2 |old(~m_st~0)|))) (.cse10 (< |old(~token~0)| ~local~0)) (.cse18 (= 0 ~M_E~0)) (.cse12 (= ~m_st~0 2)) (.cse21 (= 1 ~M_E~0)) (.cse13 (= ~T1_E~0 1)) (.cse15 (= 1 ~E_1~0)) (.cse4 (= ~m_st~0 0)) (.cse19 (not (= ~E_M~0 0))) (.cse11 (not .cse20)) (.cse16 (= 0 ~E_1~0)) (.cse17 (= 0 |old(~E_M~0)|))) (and (or (not (= 0 ~local~0)) .cse0 .cse1 (not (= |old(~token~0)| 0)) .cse2 (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) .cse3 (and .cse4 .cse5 (= ~token~0 0) .cse6) (not (= 1 ~t1_i~0)) .cse7 (not (= 0 ~m_pc~0))) (or .cse8 .cse9 .cse10 .cse0 .cse1 .cse2 .cse11 .cse3 (and .cse5 (<= ~token~0 ~local~0) .cse12 .cse6 (<= ~local~0 ~token~0)) .cse7) (or .cse13 .cse14 .cse15 .cse16 .cse17 (< |old(~m_st~0)| 2) .cse18 (and (<= 2 ~m_st~0) .cse19) .cse20 .cse21) (let ((.cse22 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse23 (<= (+ ~local~0 1) ~token~0))) (or .cse14 .cse8 .cse9 (not (= |old(~t1_pc~0)| 1)) .cse10 .cse18 (and .cse22 (and .cse12 .cse19) .cse23) .cse21 .cse13 .cse15 (and .cse22 .cse23 (and .cse4 .cse19)) .cse11 .cse16 .cse17))))) [2018-11-18 13:05:37,879 INFO L425 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2018-11-18 13:05:37,879 INFO L421 ceAbstractionStarter]: At program point transmit1ENTRY(lines 74 109) the Hoare annotation is: (let ((.cse13 (= 1 ~m_pc~0))) (let ((.cse8 (= ~T1_E~0 0)) (.cse12 (= 0 ~M_E~0)) (.cse14 (= 1 ~M_E~0)) (.cse7 (= ~T1_E~0 1)) (.cse9 (= 1 ~E_1~0)) (.cse10 (= 0 ~E_1~0)) (.cse11 (= 0 |old(~E_M~0)|)) (.cse15 (< ~local~0 |old(~token~0)|)) (.cse16 (not (= 2 |old(~m_st~0)|))) (.cse17 (< |old(~token~0)| ~local~0)) (.cse19 (= ~m_st~0 2)) (.cse20 (<= ~token~0 ~local~0)) (.cse3 (= ~t1_pc~0 0)) (.cse21 (<= ~local~0 ~token~0)) (.cse6 (= |old(~E_M~0)| ~E_M~0)) (.cse0 (not (= ~T1_E~0 2))) (.cse1 (not (= 2 |old(~E_M~0)|))) (.cse2 (not (= |old(~t1_pc~0)| 0))) (.cse18 (not .cse13)) (.cse4 (not (= 2 ~E_1~0))) (.cse5 (not (= 2 ~M_E~0)))) (and (or (not (= 0 ~local~0)) .cse0 .cse1 (not (= |old(~token~0)| 0)) .cse2 (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) (and (= ~m_st~0 0) (= ~E_M~0 2) (= ~token~0 0) .cse3) .cse4 (not (= 1 ~t1_i~0)) .cse5 (not (= 0 ~m_pc~0))) (or (and (<= 2 ~m_st~0) .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 (< |old(~m_st~0)| 2) .cse12 .cse13 .cse14) (or .cse8 .cse15 .cse16 (not (= |old(~t1_pc~0)| 1)) .cse17 .cse12 .cse14 .cse7 .cse9 .cse18 (and (= ~t1_pc~0 1) .cse19 .cse20 .cse21 .cse6) .cse10 .cse11) (or .cse15 .cse16 .cse17 (and .cse19 .cse20 .cse3 .cse21 .cse6) .cse0 .cse1 .cse2 .cse18 .cse4 .cse5)))) [2018-11-18 13:05:37,879 INFO L425 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-11-18 13:05:37,879 INFO L421 ceAbstractionStarter]: At program point L82(lines 77 108) the Hoare annotation is: (let ((.cse16 (= 1 ~m_pc~0))) (let ((.cse11 (= ~T1_E~0 0)) (.cse0 (< ~local~0 |old(~token~0)|)) (.cse1 (not (= 2 |old(~m_st~0)|))) (.cse2 (< |old(~token~0)| ~local~0)) (.cse15 (= 0 ~M_E~0)) (.cse17 (= 1 ~M_E~0)) (.cse10 (= ~T1_E~0 1)) (.cse12 (= 1 ~E_1~0)) (.cse6 (not .cse16)) (.cse9 (= |old(~E_M~0)| ~E_M~0)) (.cse13 (= 0 ~E_1~0)) (.cse14 (= 0 |old(~E_M~0)|)) (.cse3 (not (= ~T1_E~0 2))) (.cse4 (not (= 2 |old(~E_M~0)|))) (.cse5 (not (= |old(~t1_pc~0)| 0))) (.cse7 (not (= 2 ~E_1~0))) (.cse8 (not (= 2 ~M_E~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (and (<= 2 ~m_st~0) .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 (< |old(~m_st~0)| 2) .cse15 .cse16 .cse17) (or .cse11 .cse0 .cse1 (not (= |old(~t1_pc~0)| 1)) .cse2 .cse15 .cse17 .cse10 .cse12 .cse6 (and (= ~t1_pc~0 1) (= ~m_st~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse9) .cse13 .cse14) (or (not (= 0 ~local~0)) .cse3 .cse4 (not (= |old(~token~0)| 0)) .cse5 (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) .cse7 (not (= 1 ~t1_i~0)) .cse8 (not (= 0 ~m_pc~0)))))) [2018-11-18 13:05:37,879 INFO L425 ceAbstractionStarter]: For program point transmit1EXIT(lines 74 109) no Hoare annotation was computed. [2018-11-18 13:05:37,880 INFO L421 ceAbstractionStarter]: At program point L103(lines 74 109) the Hoare annotation is: (let ((.cse16 (= 1 ~m_pc~0))) (let ((.cse10 (= ~T1_E~0 0)) (.cse14 (= 0 ~M_E~0)) (.cse17 (= 1 ~M_E~0)) (.cse9 (= ~T1_E~0 1)) (.cse11 (= 1 ~E_1~0)) (.cse12 (= 0 ~E_1~0)) (.cse13 (= 0 |old(~E_M~0)|)) (.cse6 (= ~m_st~0 0)) (.cse15 (not (= ~E_M~0 0))) (.cse8 (<= 2 ~t1_st~0)) (.cse5 (= ~E_M~0 2)) (.cse7 (= ~t1_pc~0 1)) (.cse21 (= ~m_st~0 2)) (.cse22 (= ~t1_st~0 2)) (.cse18 (< ~local~0 |old(~token~0)|)) (.cse19 (not (= 2 |old(~m_st~0)|))) (.cse20 (< |old(~token~0)| ~local~0)) (.cse0 (not (= ~T1_E~0 2))) (.cse1 (not (= 2 |old(~E_M~0)|))) (.cse2 (not (= |old(~t1_pc~0)| 0))) (.cse25 (not .cse16)) (.cse3 (not (= 2 ~E_1~0))) (.cse4 (not (= 2 ~M_E~0)))) (and (or (not (= 0 ~local~0)) .cse0 .cse1 (not (= |old(~token~0)| 0)) .cse2 (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) .cse3 (not (= 1 ~t1_i~0)) .cse4 (not (= 0 ~m_pc~0)) (and .cse5 .cse6 .cse7 .cse8 (= ~token~0 0))) (or .cse9 .cse10 .cse11 .cse12 .cse13 (< |old(~m_st~0)| 2) .cse14 (and (<= 2 ~m_st~0) .cse15) .cse16 .cse17) (let ((.cse23 (<= ~token~0 (+ |old(~token~0)| 1))) (.cse24 (<= (+ ~local~0 1) ~token~0))) (or .cse10 .cse18 .cse19 (not (= |old(~t1_pc~0)| 1)) .cse20 (and .cse7 .cse21 .cse15 .cse22 .cse23 .cse24) .cse14 .cse17 .cse9 .cse11 .cse25 .cse12 .cse13 (and .cse6 .cse7 .cse15 .cse8 .cse23 .cse24))) (or (and .cse5 .cse7 .cse21 .cse22 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)) .cse18 .cse19 .cse20 .cse0 .cse1 .cse2 .cse25 .cse3 .cse4)))) [2018-11-18 13:05:37,880 INFO L421 ceAbstractionStarter]: At program point L99(line 99) the Hoare annotation is: (let ((.cse17 (= 1 ~m_pc~0))) (let ((.cse1 (< ~local~0 |old(~token~0)|)) (.cse2 (not (= 2 |old(~m_st~0)|))) (.cse3 (< |old(~token~0)| ~local~0)) (.cse9 (not .cse17)) (.cse7 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse8 (= 1 ~E_1~0)) (.cse5 (not (= ~E_M~0 0))) (.cse10 (= 0 ~E_1~0)) (.cse11 (= 0 |old(~E_M~0)|)) (.cse4 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse12 (not (= ~T1_E~0 2))) (.cse13 (not (= 2 |old(~E_M~0)|))) (.cse14 (not (= |old(~t1_pc~0)| 0))) (.cse15 (not (= 2 ~E_1~0))) (.cse16 (not (= 2 ~M_E~0)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~t1_pc~0)| 1)) .cse3 .cse4 (and (= ~t1_pc~0 1) (= ~m_st~0 2) .cse5 (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 .cse3 .cse12 .cse13 .cse14 .cse9 .cse15 .cse16) (or .cse7 .cse0 .cse8 (and (<= 2 ~m_st~0) .cse5) .cse10 .cse11 (< |old(~m_st~0)| 2) .cse4 .cse17 .cse6) (or (not (= 0 ~local~0)) .cse12 .cse13 (not (= |old(~token~0)| 0)) .cse14 (not (= 0 |old(~m_st~0)|)) (not (= ~m_i~0 1)) .cse15 (not (= 1 ~t1_i~0)) .cse16 (not (= 0 ~m_pc~0)))))) [2018-11-18 13:05:37,880 INFO L425 ceAbstractionStarter]: For program point L99-1(line 99) no Hoare annotation was computed. [2018-11-18 13:05:37,880 INFO L425 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 326 336) no Hoare annotation was computed. [2018-11-18 13:05:37,880 INFO L421 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 326 336) the Hoare annotation is: (let ((.cse10 (= 1 ~E_1~0))) (let ((.cse4 (not (= ~t1_pc~0 1))) (.cse3 (< ~local~0 ~token~0)) (.cse5 (< ~token~0 ~local~0)) (.cse0 (not .cse10)) (.cse1 (= ~T1_E~0 1)) (.cse2 (= ~T1_E~0 0)) (.cse12 (= 0 ~E_1~0)) (.cse6 (= 0 ~E_M~0)) (.cse7 (= 0 ~M_E~0)) (.cse11 (= 1 ~m_pc~0)) (.cse8 (= 1 ~M_E~0))) (and (or (< |old(~t1_st~0)| 2) (<= 2 ~t1_st~0) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (let ((.cse9 (+ ~local~0 1))) (or .cse2 (= ~m_st~0 2) (not (= 2 |old(~m_st~0)|)) .cse4 .cse7 .cse8 .cse1 (< ~token~0 .cse9) .cse10 (not .cse11) .cse12 (< .cse9 ~token~0) .cse6)) (or .cse3 .cse5 (not (= ~T1_E~0 2)) (not (= 2 ~E_M~0)) (not (= |old(~t1_st~0)| 0)) (= ~t1_st~0 0) (not (= ~t1_pc~0 0)) .cse0 (not (= 2 ~M_E~0)) (not (= 0 ~m_pc~0))) (or (<= 2 ~m_st~0) .cse1 .cse2 .cse10 .cse12 .cse6 (< |old(~m_st~0)| 2) .cse7 .cse11 .cse8)))) [2018-11-18 13:05:37,880 INFO L425 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 326 336) no Hoare annotation was computed. [2018-11-18 13:05:37,881 INFO L421 ceAbstractionStarter]: At program point L190(lines 177 192) the Hoare annotation is: (let ((.cse10 (not (= 0 ~local~0))) (.cse7 (not (= ~token~0 0))) (.cse9 (not (= 0 ~m_st~0))) (.cse14 (not (= 0 ~m_pc~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse0 (< ~local~0 ~token~0)) (.cse1 (not (= 2 ~m_st~0))) (.cse3 (< ~token~0 ~local~0)) (.cse12 (not (= ~T1_E~0 2))) (.cse4 (= exists_runnable_thread_~__retres1~2 1)) (.cse15 (not (= 2 ~E_M~0))) (.cse5 (not (= ~t1_st~0 0))) (.cse8 (not (= ~t1_pc~0 0))) (.cse6 (not (= 1 ~m_pc~0))) (.cse11 (not (= 2 ~E_1~0))) (.cse13 (not (= 2 ~M_E~0)))) (and (or (= ~T1_E~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ~M_E~0) (= 1 ~M_E~0) .cse5 (= ~T1_E~0 1) (= 1 ~E_1~0) .cse6 (= 0 ~E_1~0) (= 0 ~E_M~0)) (or (not (= 1 ~t1_i~0)) .cse4 (not (= ~m_i~0 1)) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse5)) (or .cse10 .cse2 .cse12 .cse4 .cse15 .cse7 (< ~t1_st~0 2) .cse9 .cse11 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse12 .cse15 (not (= ~t1_st~0 2)) (= exists_runnable_thread_~__retres1~2 0) .cse6 .cse11 .cse13) (or .cse0 .cse1 .cse3 .cse12 .cse4 .cse15 .cse5 .cse8 .cse6 .cse11 .cse13))) [2018-11-18 13:05:37,881 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 174 193) no Hoare annotation was computed. [2018-11-18 13:05:37,881 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 187) no Hoare annotation was computed. [2018-11-18 13:05:37,881 INFO L428 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 174 193) the Hoare annotation is: true [2018-11-18 13:05:37,881 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 188) no Hoare annotation was computed. [2018-11-18 13:05:37,881 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 174 193) no Hoare annotation was computed. [2018-11-18 13:05:37,881 INFO L425 ceAbstractionStarter]: For program point L287-1(lines 276 299) no Hoare annotation was computed. [2018-11-18 13:05:37,881 INFO L425 ceAbstractionStarter]: For program point L282-1(lines 276 299) no Hoare annotation was computed. [2018-11-18 13:05:37,881 INFO L425 ceAbstractionStarter]: For program point L277-1(lines 276 299) no Hoare annotation was computed. [2018-11-18 13:05:37,881 INFO L421 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 273 300) the Hoare annotation is: (let ((.cse21 (= |old(~T1_E~0)| ~T1_E~0)) (.cse22 (= |old(~M_E~0)| ~M_E~0)) (.cse23 (= |old(~E_M~0)| ~E_M~0)) (.cse26 (+ ~local~0 1))) (let ((.cse8 (< ~token~0 .cse26)) (.cse12 (< .cse26 ~token~0)) (.cse4 (< ~t1_st~0 2)) (.cse15 (< ~local~0 ~token~0)) (.cse13 (not (= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse16 (< ~token~0 ~local~0)) (.cse14 (not (= ~t1_st~0 2))) (.cse20 (= ~E_1~0 2)) (.cse5 (not (= 0 ~m_st~0))) (.cse24 (not (= 2 |old(~E_1~0)|))) (.cse18 (not (= |old(~T1_E~0)| 2))) (.cse25 (not (= 2 |old(~M_E~0)|))) (.cse19 (not (= 2 |old(~E_M~0)|))) (.cse10 (and (= |old(~E_1~0)| ~E_1~0) .cse21 .cse22 .cse23)) (.cse6 (= |old(~T1_E~0)| 1)) (.cse0 (= |old(~T1_E~0)| 0)) (.cse7 (= 1 |old(~E_1~0)|)) (.cse9 (= 0 |old(~E_1~0)|)) (.cse11 (= 0 |old(~E_M~0)|)) (.cse2 (= 0 |old(~M_E~0)|)) (.cse17 (= 1 ~m_pc~0)) (.cse3 (= 1 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse13 .cse1 .cse2 .cse3 .cse10 .cse14 .cse6 .cse8 .cse7 .cse9 .cse12 .cse11) (or .cse10 .cse0 .cse15 .cse1 .cse16 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse9 .cse11 .cse17) (or .cse15 .cse13 .cse1 .cse16 .cse18 .cse19 .cse14 (and .cse20 .cse21 .cse22 .cse23) .cse24 .cse25) (or (not (= 1 ~t1_i~0)) (and .cse20 (= ~E_M~0 2) .cse21 .cse22) (not (= ~m_i~0 1)) (or (not (= ~token~0 0)) (not (= ~t1_pc~0 0)) .cse5 (not (= 0 ~local~0)) .cse24 .cse18 .cse25 (not (= 0 ~m_pc~0)) .cse19 (not (= ~t1_st~0 0)))) (or .cse10 .cse6 .cse0 .cse7 .cse9 .cse11 (< ~m_st~0 2) .cse2 .cse17 .cse3)))) [2018-11-18 13:05:37,882 INFO L425 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 273 300) no Hoare annotation was computed. [2018-11-18 13:05:37,882 INFO L425 ceAbstractionStarter]: For program point L292-1(lines 273 300) no Hoare annotation was computed. [2018-11-18 13:05:37,882 INFO L425 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 129 147) no Hoare annotation was computed. [2018-11-18 13:05:37,882 INFO L428 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 129 147) the Hoare annotation is: true [2018-11-18 13:05:37,882 INFO L425 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 129 147) no Hoare annotation was computed. [2018-11-18 13:05:37,882 INFO L421 ceAbstractionStarter]: At program point L144(lines 132 146) the Hoare annotation is: (let ((.cse26 (+ ~local~0 1)) (.cse7 (= 1 ~E_1~0))) (let ((.cse21 (not (= ~t1_st~0 0))) (.cse15 (not (= ~t1_pc~0 0))) (.cse19 (not (= 0 ~m_pc~0))) (.cse14 (= 1 ~m_pc~0)) (.cse12 (< ~t1_st~0 2)) (.cse24 (not .cse7)) (.cse18 (not (= 2 ~M_E~0))) (.cse13 (not (= 0 ~m_st~0))) (.cse5 (= ~T1_E~0 1)) (.cse0 (= ~T1_E~0 0)) (.cse6 (< ~token~0 .cse26)) (.cse8 (= 0 ~E_1~0)) (.cse11 (= 0 ~E_M~0)) (.cse10 (< .cse26 ~token~0)) (.cse3 (= 0 ~M_E~0)) (.cse22 (< ~local~0 ~token~0)) (.cse23 (< ~token~0 ~local~0)) (.cse25 (= 1 ~M_E~0)) (.cse9 (= 0 is_transmit1_triggered_~__retres1~1)) (.cse4 (not (= ~t1_st~0 2))) (.cse1 (not (= 2 ~m_st~0))) (.cse16 (not (= 2 ~E_1~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse17 (not (= ~T1_E~0 2))) (.cse20 (not (= 2 ~E_M~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse9 .cse12 .cse13 .cse5 .cse0 .cse7 .cse6 .cse8 .cse2 .cse11 .cse10 .cse3) (or .cse5 .cse0 .cse7 .cse8 .cse11 (< ~m_st~0 2) .cse3 .cse14 .cse9) (or (not (= 1 ~t1_i~0)) (not (= ~m_i~0 1)) .cse9 (or (not (= ~token~0 0)) .cse15 .cse13 (not (= 0 ~local~0)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)) (or .cse22 .cse23 .cse17 .cse20 .cse21 .cse15 .cse24 .cse18 .cse19 .cse9) (or .cse0 .cse1 .cse2 .cse9 .cse3 .cse25 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11) (or .cse0 .cse22 .cse2 .cse23 .cse3 .cse12 .cse13 .cse5 .cse7 .cse9 .cse8 .cse11 .cse14) (or .cse12 (<= 1 is_transmit1_triggered_~__retres1~1) (or .cse24 .cse5 .cse0 .cse22 .cse2 .cse23 .cse11 .cse3 .cse25)) (or .cse9 .cse22 .cse1 .cse2 .cse23 .cse17 .cse20 .cse4 .cse16 .cse18) (or .cse13 .cse5 .cse0 .cse7 .cse6 .cse8 .cse2 .cse11 .cse10 .cse3 .cse9 .cse25) (or .cse22 .cse23 (not .cse25) .cse9 (or .cse4 .cse1 .cse16 .cse2 .cse17 .cse20))))) [2018-11-18 13:05:37,882 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 139) no Hoare annotation was computed. [2018-11-18 13:05:37,882 INFO L425 ceAbstractionStarter]: For program point L133(lines 133 142) no Hoare annotation was computed. [2018-11-18 13:05:37,882 INFO L425 ceAbstractionStarter]: For program point L133-2(lines 133 142) no Hoare annotation was computed. [2018-11-18 13:05:37,883 INFO L425 ceAbstractionStarter]: For program point L160-1(lines 159 172) no Hoare annotation was computed. [2018-11-18 13:05:37,883 INFO L425 ceAbstractionStarter]: For program point init_threadsEXIT(lines 156 173) no Hoare annotation was computed. [2018-11-18 13:05:37,883 INFO L421 ceAbstractionStarter]: At program point init_threadsENTRY(lines 156 173) the Hoare annotation is: (or (not (= 1 ~t1_i~0)) (and (= ~m_st~0 0) (= ~t1_st~0 0)) (not (= ~m_i~0 1)) (or (not (= ~token~0 0)) (not (= ~t1_pc~0 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 ~local~0)) (not (= 2 ~E_1~0)) (not (= ~T1_E~0 2)) (not (= 2 ~M_E~0)) (not (= 0 ~m_pc~0)) (not (= 2 ~E_M~0)) (not (= |old(~t1_st~0)| 0)))) [2018-11-18 13:05:37,883 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 156 173) no Hoare annotation was computed. [2018-11-18 13:05:37,883 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 462 473) the Hoare annotation is: (or (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 (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 0 |old(~m_pc~0)|))) [2018-11-18 13:05:37,883 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 462 473) no Hoare annotation was computed. [2018-11-18 13:05:37,883 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 462 473) no Hoare annotation was computed. [2018-11-18 13:05:37,883 INFO L425 ceAbstractionStarter]: For program point L468(line 468) no Hoare annotation was computed. [2018-11-18 13:05:37,883 INFO L421 ceAbstractionStarter]: At program point L467(line 467) the Hoare annotation is: (or (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 (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 0 |old(~m_pc~0)|))) [2018-11-18 13:05:37,884 INFO L421 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)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 0 |old(~m_pc~0)|))) [2018-11-18 13:05:37,884 INFO L425 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-11-18 13:05:37,884 INFO L428 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-11-18 13:05:37,884 INFO L425 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-11-18 13:05:37,884 INFO L425 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-11-18 13:05:37,884 INFO L425 ceAbstractionStarter]: For program point masterEXIT(lines 30 73) no Hoare annotation was computed. [2018-11-18 13:05:37,884 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-18 13:05:37,884 INFO L421 ceAbstractionStarter]: At program point L38(lines 33 72) the Hoare annotation is: (let ((.cse0 (< |old(~t1_st~0)| 2)) (.cse2 (= ~T1_E~0 1)) (.cse3 (= ~T1_E~0 0)) (.cse4 (= 1 |old(~E_1~0)|)) (.cse6 (= 0 |old(~E_1~0)|)) (.cse7 (not (= ~t1_pc~0 1))) (.cse8 (= 0 ~E_M~0)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 ~M_E~0))) (and (or (not (= |old(~t1_st~0)| 0)) (not (= ~m_i~0 1)) (or (not (= |old(~token~0)| 0)) (not (= ~t1_pc~0 0)) (not (= 0 |old(~local~0)|)) (not (= ~T1_E~0 2)) (not (= 2 ~E_M~0))) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t1_i~0)) (not (= 2 ~M_E~0)) (not (= 0 |old(~m_pc~0)|))) (or .cse0 (let ((.cse1 (+ ~local~0 1))) (and (<= ~token~0 .cse1) (= |old(~E_1~0)| ~E_1~0) (= ~token~0 |old(~token~0)|) (<= 2 ~t1_st~0) (<= .cse1 ~token~0))) (let ((.cse5 (+ |old(~local~0)| 1))) (or .cse2 .cse3 .cse4 (< |old(~token~0)| .cse5) .cse6 .cse7 .cse8 (< .cse5 |old(~token~0)|) .cse9 .cse10))) (or .cse0 (or .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 (= 1 |old(~m_pc~0)|) .cse10)))) [2018-11-18 13:05:37,884 INFO L421 ceAbstractionStarter]: At program point L67(lines 30 73) the Hoare annotation is: (let ((.cse10 (= ~m_pc~0 1)) (.cse1 (= ~T1_E~0 1)) (.cse16 (= ~t1_pc~0 1)) (.cse11 (= ~m_st~0 2)) (.cse2 (= ~T1_E~0 0)) (.cse12 (= ~t1_st~0 0)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0))) (let ((.cse0 (< |old(~t1_st~0)| 2)) (.cse9 (and .cse10 (not .cse1) (not (= ~M_E~0 0)) .cse16 .cse11 (not (= ~E_M~0 0)) (not (= ~E_1~0 1)) (not .cse2) .cse12 (not (= ~M_E~0 1)) .cse13 (not (= ~E_1~0 0)) .cse14)) (.cse3 (= 1 |old(~E_1~0)|)) (.cse4 (= 0 |old(~E_1~0)|)) (.cse5 (not .cse16)) (.cse6 (= 0 ~E_M~0)) (.cse7 (= 0 ~M_E~0)) (.cse8 (= 1 ~M_E~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 1 |old(~m_pc~0)|) .cse8) .cse9) (or (and .cse10 .cse11 (= ~E_1~0 2) .cse12 .cse13 .cse14) (not (= |old(~t1_st~0)| 0)) (not (= ~m_i~0 1)) (or (not (= |old(~token~0)| 0)) (not (= ~t1_pc~0 0)) (not (= 0 |old(~local~0)|)) (not (= ~T1_E~0 2)) (not (= 2 ~E_M~0))) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t1_i~0)) (not (= 2 ~M_E~0)) (not (= 0 |old(~m_pc~0)|))) (or .cse0 .cse9 (let ((.cse15 (+ |old(~local~0)| 1))) (or .cse1 .cse2 .cse3 (< |old(~token~0)| .cse15) .cse4 .cse5 .cse6 (< .cse15 |old(~token~0)|) .cse7 .cse8)))))) [2018-11-18 13:05:37,884 INFO L421 ceAbstractionStarter]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (< |old(~t1_st~0)| 2)) (.cse1 (= ~T1_E~0 1)) (.cse2 (= ~T1_E~0 0)) (.cse3 (= 1 |old(~E_1~0)|)) (.cse5 (= 0 |old(~E_1~0)|)) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (= 0 ~E_M~0)) (.cse8 (= 0 ~M_E~0)) (.cse9 (= 1 ~M_E~0))) (and (or .cse0 (let ((.cse4 (+ |old(~local~0)| 1))) (or .cse1 .cse2 .cse3 (< |old(~token~0)| .cse4) .cse5 .cse6 .cse7 (< .cse4 |old(~token~0)|) .cse8 .cse9))) (or (not (= |old(~t1_st~0)| 0)) (not (= ~m_i~0 1)) (or (not (= |old(~token~0)| 0)) (not (= ~t1_pc~0 0)) (not (= 0 |old(~local~0)|)) (not (= ~T1_E~0 2)) (not (= 2 ~E_M~0))) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t1_i~0)) (not (= 2 ~M_E~0)) (not (= 0 |old(~m_pc~0)|))) (or .cse0 (or .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 (= 1 |old(~m_pc~0)|) .cse9)))) [2018-11-18 13:05:37,885 INFO L421 ceAbstractionStarter]: At program point L59(lines 33 72) the Hoare annotation is: (let ((.cse3 (= ~T1_E~0 1)) (.cse12 (= |old(~E_1~0)| ~E_1~0)) (.cse13 (= ~token~0 |old(~token~0)|)) (.cse15 (= ~t1_pc~0 1)) (.cse4 (= ~T1_E~0 0))) (let ((.cse2 (< |old(~t1_st~0)| 2)) (.cse0 (and (not .cse3) .cse12 .cse13 (not (= ~M_E~0 0)) .cse15 (not (= ~E_M~0 0)) (not (= ~E_1~0 1)) (not (= ~m_pc~0 1)) (not .cse4) (not (= ~M_E~0 1)) (not (= ~E_1~0 0)))) (.cse1 (<= 2 ~t1_st~0)) (.cse5 (= 1 |old(~E_1~0)|)) (.cse6 (= 0 |old(~E_1~0)|)) (.cse7 (not .cse15)) (.cse8 (= 0 ~E_M~0)) (.cse9 (= 0 ~M_E~0)) (.cse10 (= 1 ~M_E~0))) (and (or (and .cse0 .cse1) .cse2 (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 1 |old(~m_pc~0)|) .cse10)) (or (not (= |old(~t1_st~0)| 0)) (not (= ~m_i~0 1)) (or (not (= |old(~token~0)| 0)) (not (= ~t1_pc~0 0)) (not (= 0 |old(~local~0)|)) (not (= ~T1_E~0 2)) (not (= 2 ~E_M~0))) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t1_i~0)) (not (= 2 ~M_E~0)) (not (= 0 |old(~m_pc~0)|)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~t1_st~0 0) (= ~token~0 0) (= ~local~0 0))) (or .cse2 (and .cse1 .cse0) (let ((.cse11 (+ ~local~0 1))) (and (<= ~token~0 .cse11) .cse12 .cse13 .cse1 (<= .cse11 ~token~0))) (let ((.cse14 (+ |old(~local~0)| 1))) (or .cse3 .cse4 .cse5 (< |old(~token~0)| .cse14) .cse6 .cse7 .cse8 (< .cse14 |old(~token~0)|) .cse9 .cse10)))))) [2018-11-18 13:05:37,885 INFO L421 ceAbstractionStarter]: At program point L51(line 51) the Hoare annotation is: (let ((.cse12 (<= 2 ~t1_st~0)) (.cse0 (= ~E_1~0 1)) (.cse1 (<= ~token~0 ~local~0)) (.cse2 (<= ~local~0 ~token~0)) (.cse3 (< |old(~t1_st~0)| 2)) (.cse4 (= ~T1_E~0 1)) (.cse5 (= ~T1_E~0 0)) (.cse6 (= 1 |old(~E_1~0)|)) (.cse7 (= 0 |old(~E_1~0)|)) (.cse8 (not (= ~t1_pc~0 1))) (.cse9 (= 0 ~E_M~0)) (.cse10 (= 0 ~M_E~0)) (.cse11 (= 1 ~M_E~0))) (and (or (and (= ~m_pc~0 0) .cse0 (= ~t1_st~0 0) .cse1 .cse2) (not (= |old(~t1_st~0)| 0)) (not (= ~m_i~0 1)) (or (not (= |old(~token~0)| 0)) (not (= ~t1_pc~0 0)) (not (= 0 |old(~local~0)|)) (not (= ~T1_E~0 2)) (not (= 2 ~E_M~0))) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t1_i~0)) (not (= 2 ~M_E~0)) (not (= 0 |old(~m_pc~0)|))) (or .cse3 (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 1 |old(~m_pc~0)|) .cse11) (and .cse12 (not (= ~m_pc~0 1)) .cse0 .cse1 .cse2)) (or (and .cse12 .cse0 .cse1 .cse2) .cse3 (let ((.cse13 (+ |old(~local~0)| 1))) (or .cse4 .cse5 .cse6 (< |old(~token~0)| .cse13) .cse7 .cse8 .cse9 (< .cse13 |old(~token~0)|) .cse10 .cse11))))) [2018-11-18 13:05:37,885 INFO L425 ceAbstractionStarter]: For program point L51-1(line 51) no Hoare annotation was computed. [2018-11-18 13:05:37,885 INFO L425 ceAbstractionStarter]: For program point L45(lines 45 66) no Hoare annotation was computed. [2018-11-18 13:05:37,885 INFO L421 ceAbstractionStarter]: At program point masterENTRY(lines 30 73) the Hoare annotation is: (let ((.cse8 (not (= |old(~token~0)| 0))) (.cse4 (not (= 0 |old(~local~0)|))) (.cse13 (not (= 0 |old(~m_pc~0)|))) (.cse1 (= ~m_pc~0 0)) (.cse2 (= ~local~0 0)) (.cse0 (< |old(~t1_st~0)| 2)) (.cse14 (= |old(~E_1~0)| ~E_1~0)) (.cse15 (= ~token~0 |old(~token~0)|)) (.cse16 (<= 2 ~t1_st~0)) (.cse9 (= ~T1_E~0 1)) (.cse3 (= ~T1_E~0 0)) (.cse10 (= 1 |old(~E_1~0)|)) (.cse11 (= 0 |old(~E_1~0)|)) (.cse5 (not (= ~t1_pc~0 1))) (.cse12 (= 0 ~E_M~0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~M_E~0))) (and (or .cse0 (and .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) (or .cse0 (or .cse9 .cse3 .cse10 .cse11 .cse5 .cse12 .cse6 (= 1 |old(~m_pc~0)|) .cse7) (and .cse14 .cse15 .cse16 (not (= ~m_pc~0 1)))) (or (not (= |old(~t1_st~0)| 0)) (not (= ~m_i~0 1)) (or .cse8 (not (= ~t1_pc~0 0)) .cse4 (not (= ~T1_E~0 2)) (not (= 2 ~E_M~0))) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t1_i~0)) (not (= 2 ~M_E~0)) .cse13 (and .cse1 (= ~E_1~0 2) (= ~t1_st~0 0) (= ~token~0 0) .cse2)) (or .cse0 (let ((.cse17 (+ ~local~0 1))) (and (<= ~token~0 .cse17) .cse14 .cse15 .cse16 (<= .cse17 ~token~0))) (let ((.cse18 (+ |old(~local~0)| 1))) (or .cse9 .cse3 .cse10 (< |old(~token~0)| .cse18) .cse11 .cse5 .cse12 (< .cse18 |old(~token~0)|) .cse6 .cse7))))) [2018-11-18 13:05:37,885 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-18 13:05:37,885 INFO L425 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 337 345) no Hoare annotation was computed. [2018-11-18 13:05:37,885 INFO L421 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 337 345) the Hoare annotation is: (let ((.cse18 (+ ~local~0 1))) (let ((.cse0 (< ~local~0 ~token~0)) (.cse1 (< ~token~0 ~local~0)) (.cse4 (not (= 2 ~m_st~0))) (.cse2 (not (= ~t1_st~0 2))) (.cse15 (= 1 ~m_pc~0)) (.cse6 (= ~T1_E~0 0)) (.cse5 (not (= ~t1_pc~0 1))) (.cse7 (= 0 |old(~M_E~0)|)) (.cse8 (= 1 |old(~M_E~0)|)) (.cse9 (< ~t1_st~0 2)) (.cse11 (not (= 0 ~m_st~0))) (.cse10 (= ~T1_E~0 1)) (.cse12 (= 1 ~E_1~0)) (.cse16 (< ~token~0 .cse18)) (.cse13 (= 0 ~E_1~0)) (.cse3 (= |old(~M_E~0)| ~M_E~0)) (.cse14 (= 0 ~E_M~0)) (.cse17 (< .cse18 ~token~0))) (and (or (or .cse0 .cse1 .cse2) .cse3 .cse4 (not (= 2 ~E_1~0)) .cse5 (not (= ~T1_E~0 2)) (not (= 2 |old(~M_E~0)|)) (not (= 2 ~E_M~0))) (or .cse3 .cse6 .cse0 .cse5 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse6 .cse4 .cse5 .cse7 .cse8 .cse3 .cse2 .cse10 .cse16 .cse12 .cse13 .cse17 .cse14) (or .cse3 .cse10 .cse6 .cse12 .cse13 .cse14 (< ~m_st~0 2) .cse7 .cse15 .cse8) (or .cse6 .cse5 .cse7 .cse8 .cse9 .cse11 .cse10 .cse12 .cse16 .cse13 .cse3 .cse14 .cse17)))) [2018-11-18 13:05:37,885 INFO L425 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 337 345) no Hoare annotation was computed. [2018-11-18 13:05:37,885 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 13:05:37,885 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T1_E~0)| ~T1_E~0) (= ~token~0 |old(~token~0)|) (= |old(~M_E~0)| ~M_E~0) (= |old(~E_M~0)| ~E_M~0)) [2018-11-18 13:05:37,885 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 13:05:37,885 INFO L428 ceAbstractionStarter]: At program point L399(lines 388 401) the Hoare annotation is: true [2018-11-18 13:05:37,886 INFO L425 ceAbstractionStarter]: For program point L392(lines 392 397) no Hoare annotation was computed. [2018-11-18 13:05:37,886 INFO L428 ceAbstractionStarter]: At program point L390(line 390) the Hoare annotation is: true [2018-11-18 13:05:37,886 INFO L425 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 384 402) no Hoare annotation was computed. [2018-11-18 13:05:37,886 INFO L425 ceAbstractionStarter]: For program point L390-1(line 390) no Hoare annotation was computed. [2018-11-18 13:05:37,886 INFO L428 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 384 402) the Hoare annotation is: true [2018-11-18 13:05:37,886 INFO L425 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 384 402) no Hoare annotation was computed. [2018-11-18 13:05:37,886 INFO L421 ceAbstractionStarter]: At program point evalENTRY(lines 194 244) the Hoare annotation is: (let ((.cse21 (= 1 |old(~m_pc~0)|)) (.cse37 (+ |old(~local~0)| 1)) (.cse38 (+ ~local~0 1)) (.cse26 (= ~m_pc~0 1))) (let ((.cse10 (< |old(~local~0)| |old(~token~0)|)) (.cse12 (< |old(~token~0)| |old(~local~0)|)) (.cse6 (<= ~token~0 ~local~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse5 (not .cse26)) (.cse15 (< |old(~t1_st~0)| 2)) (.cse4 (<= 2 ~t1_st~0)) (.cse9 (= ~T1_E~0 0)) (.cse22 (not (= 2 |old(~m_st~0)|))) (.cse11 (not (= |old(~t1_pc~0)| 1))) (.cse13 (= 0 ~M_E~0)) (.cse14 (= 1 ~M_E~0)) (.cse35 (<= ~token~0 .cse38)) (.cse0 (= |old(~E_1~0)| ~E_1~0)) (.cse1 (= ~token~0 |old(~token~0)|)) (.cse3 (= ~t1_pc~0 1)) (.cse27 (= ~m_st~0 2)) (.cse28 (= ~t1_st~0 2)) (.cse36 (<= .cse38 ~token~0)) (.cse8 (= |old(~E_M~0)| ~E_M~0)) (.cse25 (not (= |old(~t1_st~0)| 2))) (.cse16 (= ~T1_E~0 1)) (.cse33 (< |old(~token~0)| .cse37)) (.cse18 (= 1 |old(~E_1~0)|)) (.cse30 (not .cse21)) (.cse19 (= 0 |old(~E_1~0)|)) (.cse34 (< .cse37 |old(~token~0)|)) (.cse20 (= 0 |old(~E_M~0)|)) (.cse2 (= ~m_st~0 0)) (.cse29 (= ~E_1~0 2)) (.cse17 (not (= 0 |old(~m_st~0)|))) (.cse31 (not (= 2 |old(~E_1~0)|))) (.cse23 (not (= ~T1_E~0 2))) (.cse32 (not (= 2 ~M_E~0))) (.cse24 (not (= 2 |old(~E_M~0)|)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse10 .cse22 .cse11 .cse12 .cse23 .cse24 .cse25 (and .cse26 .cse1 .cse3 .cse27 .cse28 .cse29 .cse6 .cse7 .cse8) .cse30 .cse31 .cse32) (or .cse9 .cse11 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17 .cse33 .cse18 .cse19 .cse34 .cse20 .cse21) (or (and .cse0 (<= 2 ~m_st~0) .cse5 .cse8) .cse16 .cse9 .cse18 .cse19 .cse20 (< |old(~m_st~0)| 2) .cse13 .cse21 .cse14) (or .cse9 .cse11 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse33 .cse19 (and .cse35 .cse0 .cse1 .cse2 .cse3 .cse4 .cse36 .cse8) .cse20 .cse34) (or .cse9 .cse22 .cse11 .cse13 .cse14 (and .cse26 .cse35 .cse0 .cse1 .cse3 .cse27 .cse28 .cse36 .cse8) .cse25 .cse16 .cse33 .cse18 .cse30 .cse19 .cse34 .cse20) (or (not (= 1 ~t1_i~0)) (and .cse2 (= ~m_pc~0 0) .cse29 (= ~E_M~0 2) (= ~t1_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~t1_pc~0 0)) (not (= ~m_i~0 1)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse17 (not (= 0 |old(~local~0)|)) .cse31 .cse23 .cse32 (not (= 0 |old(~m_pc~0)|)) .cse24 (not (= |old(~t1_st~0)| 0))))))) [2018-11-18 13:05:37,886 INFO L425 ceAbstractionStarter]: For program point L213(lines 213 220) no Hoare annotation was computed. [2018-11-18 13:05:37,886 INFO L425 ceAbstractionStarter]: For program point L205(lines 205 209) no Hoare annotation was computed. [2018-11-18 13:05:37,886 INFO L425 ceAbstractionStarter]: For program point L205-1(lines 200 238) no Hoare annotation was computed. [2018-11-18 13:05:37,886 INFO L425 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2018-11-18 13:05:37,887 INFO L421 ceAbstractionStarter]: At program point L201(line 201) the Hoare annotation is: (let ((.cse24 (= ~T1_E~0 0)) (.cse31 (= ~T1_E~0 1))) (let ((.cse51 (+ ~local~0 1)) (.cse47 (not .cse31)) (.cse34 (and (not .cse24) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse48 (not (= ~M_E~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= ~m_st~0 2)) (.cse36 (not (= ~E_1~0 1))) (.cse5 (<= ~local~0 ~token~0)) (.cse50 (= ~m_pc~0 1))) (let ((.cse37 (not .cse50)) (.cse49 (+ |old(~local~0)| 1)) (.cse15 (= ~t1_st~0 0)) (.cse16 (and .cse47 .cse34 .cse48 .cse4 .cse2 .cse3 .cse36 .cse5)) (.cse8 (= ~m_st~0 0)) (.cse7 (<= 2 ~t1_st~0)) (.cse44 (<= ~token~0 .cse51)) (.cse45 (<= .cse51 ~token~0)) (.cse6 (= ~t1_st~0 2))) (let ((.cse14 (and .cse44 .cse34 .cse45 .cse48 .cse2 .cse3 .cse36 .cse6)) (.cse30 (< |old(~t1_st~0)| 2)) (.cse19 (not (= 0 |old(~m_st~0)|))) (.cse13 (and .cse44 .cse47 .cse34 .cse8 .cse45 .cse48 .cse2 .cse7 .cse36)) (.cse39 (and .cse15 .cse16 .cse50)) (.cse41 (< |old(~token~0)| .cse49)) (.cse42 (< .cse49 |old(~token~0)|)) (.cse32 (= 1 |old(~E_1~0)|)) (.cse33 (= 0 |old(~E_1~0)|)) (.cse38 (= 0 |old(~E_M~0)|)) (.cse28 (= 0 ~M_E~0)) (.cse40 (= 1 |old(~m_pc~0)|)) (.cse29 (= 1 ~M_E~0)) (.cse25 (< |old(~local~0)| |old(~token~0)|)) (.cse43 (not (= 2 |old(~m_st~0)|))) (.cse26 (not (= |old(~t1_pc~0)| 1))) (.cse27 (< |old(~token~0)| |old(~local~0)|)) (.cse1 (= ~E_M~0 2)) (.cse35 (= ~token~0 |old(~token~0)|)) (.cse0 (= ~E_1~0 2)) (.cse21 (not (= ~T1_E~0 2))) (.cse23 (not (= 2 |old(~E_M~0)|))) (.cse46 (not (= |old(~t1_st~0)| 2))) (.cse18 (and .cse47 .cse34 .cse48 (<= 2 ~m_st~0) .cse36 .cse37)) (.cse20 (not (= 2 |old(~E_1~0)|))) (.cse22 (not (= 2 ~M_E~0)))) (and (let ((.cse9 (= ~m_pc~0 0)) (.cse10 (= ~token~0 0)) (.cse11 (= ~local~0 0)) (.cse17 (= ~t1_pc~0 0)) (.cse12 (= eval_~tmp~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5) .cse6) (and .cse1 .cse2 .cse7 .cse0 (and .cse8 .cse9 .cse10 .cse11 .cse12)) (not (= 1 ~t1_i~0)) .cse13 .cse14 (and .cse15 .cse16) (and .cse0 .cse17 .cse15 .cse1 .cse8 .cse9 .cse10 .cse11) (not (= ~m_i~0 1)) .cse18 (and .cse15 .cse4 .cse3 .cse5 (and .cse0 .cse1 .cse17 .cse12)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse19 (not (= 0 |old(~local~0)|)) .cse20 .cse21 .cse22 (not (= 0 |old(~m_pc~0)|)) .cse23 (not (= |old(~t1_st~0)| 0))))) (or .cse14 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse19 .cse32 .cse18 .cse33 .cse13 (and .cse34 .cse35 .cse8 .cse4 .cse2 .cse7 .cse36 .cse5 .cse37) .cse38 .cse39 .cse40) (or .cse14 .cse24 .cse26 .cse28 .cse29 .cse30 .cse19 .cse31 .cse32 .cse41 .cse18 .cse33 .cse13 .cse38 .cse42 .cse39) (or .cse24 .cse43 .cse26 (and .cse44 .cse34 .cse35 .cse2 .cse3 .cse36 .cse6 .cse45) .cse28 .cse29 .cse46 .cse31 .cse41 .cse32 .cse18 .cse33 .cse42 .cse38) (or .cse31 .cse24 .cse32 .cse18 .cse33 .cse38 (< |old(~m_st~0)| 2) .cse28 .cse40 .cse29) (or .cse25 .cse43 .cse26 .cse27 (and .cse1 .cse35 .cse2 .cse3 .cse6 .cse0 .cse4 .cse5) .cse21 .cse23 .cse46 .cse18 .cse20 .cse22)))))) [2018-11-18 13:05:37,887 INFO L421 ceAbstractionStarter]: At program point L230(line 230) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 0)) (.cse32 (= ~m_pc~0 1))) (let ((.cse8 (= ~T1_E~0 1)) (.cse23 (not .cse32)) (.cse33 (+ |old(~local~0)| 1)) (.cse34 (and (not .cse0) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse35 (not (= ~M_E~0 1))) (.cse25 (<= ~token~0 ~local~0)) (.cse26 (= ~m_st~0 2)) (.cse36 (not (= ~E_1~0 1))) (.cse27 (<= ~local~0 ~token~0))) (let ((.cse1 (< |old(~local~0)| |old(~token~0)|)) (.cse3 (< |old(~token~0)| |old(~local~0)|)) (.cse15 (not (= 2 |old(~m_st~0)|))) (.cse18 (not (= |old(~t1_st~0)| 2))) (.cse19 (not (= 2 |old(~E_1~0)|))) (.cse16 (not (= ~T1_E~0 2))) (.cse20 (not (= 2 ~M_E~0))) (.cse17 (not (= 2 |old(~E_M~0)|))) (.cse14 (= 1 |old(~m_pc~0)|)) (.cse2 (not (= |old(~t1_pc~0)| 1))) (.cse4 (= 0 ~M_E~0)) (.cse5 (= 1 ~M_E~0)) (.cse6 (and .cse34 .cse35 .cse25 (= ~t1_pc~0 1) .cse26 .cse36 .cse27)) (.cse7 (< |old(~t1_st~0)| 2)) (.cse9 (not (= 0 |old(~m_st~0)|))) (.cse10 (= 1 |old(~E_1~0)|)) (.cse21 (< |old(~token~0)| .cse33)) (.cse11 (and (not .cse8) .cse34 .cse35 (<= 2 ~m_st~0) .cse36 .cse23)) (.cse12 (= 0 |old(~E_1~0)|)) (.cse13 (= 0 |old(~E_M~0)|)) (.cse22 (< .cse33 |old(~token~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse1 .cse15 .cse2 .cse3 .cse16 .cse17 .cse18 .cse11 .cse19 .cse20) (or .cse0 .cse15 .cse2 .cse4 .cse5 .cse18 .cse8 .cse21 .cse10 .cse11 .cse12 .cse22 .cse13) (let ((.cse24 (let ((.cse28 (= ~E_1~0 2)) (.cse29 (= ~E_M~0 2)) (.cse30 (= ~t1_pc~0 0)) (.cse31 (= eval_~tmp~0 1))) (or (and .cse28 .cse29 (= ~m_pc~0 0) (= ~token~0 0) (= ~local~0 0) .cse30 .cse31) (and .cse32 .cse28 .cse29 .cse30 .cse31))))) (or (and (= ~m_st~0 0) .cse23 .cse24) (and .cse25 .cse26 .cse27 .cse24) .cse6 (not (= 1 ~t1_i~0)) (not (= ~m_i~0 1)) .cse11 (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse9 (not (= 0 |old(~local~0)|)) .cse19 .cse16 .cse20 (not (= 0 |old(~m_pc~0)|)) .cse17 (not (= |old(~t1_st~0)| 0))))) (or .cse8 .cse0 .cse10 .cse11 .cse12 .cse13 (< |old(~m_st~0)| 2) .cse4 .cse14 .cse5) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse8 .cse10 .cse21 .cse11 .cse12 .cse13 .cse22))))) [2018-11-18 13:05:37,888 INFO L421 ceAbstractionStarter]: At program point L224(lines 200 238) the Hoare annotation is: (let ((.cse24 (= ~T1_E~0 0)) (.cse31 (= ~T1_E~0 1))) (let ((.cse51 (+ ~local~0 1)) (.cse47 (not .cse31)) (.cse34 (and (not .cse24) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse48 (not (= ~M_E~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= ~m_st~0 2)) (.cse36 (not (= ~E_1~0 1))) (.cse5 (<= ~local~0 ~token~0)) (.cse50 (= ~m_pc~0 1))) (let ((.cse37 (not .cse50)) (.cse49 (+ |old(~local~0)| 1)) (.cse15 (= ~t1_st~0 0)) (.cse16 (and .cse47 .cse34 .cse48 .cse4 .cse2 .cse3 .cse36 .cse5)) (.cse8 (= ~m_st~0 0)) (.cse7 (<= 2 ~t1_st~0)) (.cse44 (<= ~token~0 .cse51)) (.cse45 (<= .cse51 ~token~0)) (.cse6 (= ~t1_st~0 2))) (let ((.cse14 (and .cse44 .cse34 .cse45 .cse48 .cse2 .cse3 .cse36 .cse6)) (.cse30 (< |old(~t1_st~0)| 2)) (.cse19 (not (= 0 |old(~m_st~0)|))) (.cse13 (and .cse44 .cse47 .cse34 .cse8 .cse45 .cse48 .cse2 .cse7 .cse36)) (.cse39 (and .cse15 .cse16 .cse50)) (.cse41 (< |old(~token~0)| .cse49)) (.cse42 (< .cse49 |old(~token~0)|)) (.cse32 (= 1 |old(~E_1~0)|)) (.cse33 (= 0 |old(~E_1~0)|)) (.cse38 (= 0 |old(~E_M~0)|)) (.cse28 (= 0 ~M_E~0)) (.cse40 (= 1 |old(~m_pc~0)|)) (.cse29 (= 1 ~M_E~0)) (.cse25 (< |old(~local~0)| |old(~token~0)|)) (.cse43 (not (= 2 |old(~m_st~0)|))) (.cse26 (not (= |old(~t1_pc~0)| 1))) (.cse27 (< |old(~token~0)| |old(~local~0)|)) (.cse1 (= ~E_M~0 2)) (.cse35 (= ~token~0 |old(~token~0)|)) (.cse0 (= ~E_1~0 2)) (.cse21 (not (= ~T1_E~0 2))) (.cse23 (not (= 2 |old(~E_M~0)|))) (.cse46 (not (= |old(~t1_st~0)| 2))) (.cse18 (and .cse47 .cse34 .cse48 (<= 2 ~m_st~0) .cse36 .cse37)) (.cse20 (not (= 2 |old(~E_1~0)|))) (.cse22 (not (= 2 ~M_E~0)))) (and (let ((.cse9 (= ~m_pc~0 0)) (.cse10 (= ~token~0 0)) (.cse11 (= ~local~0 0)) (.cse17 (= ~t1_pc~0 0)) (.cse12 (= eval_~tmp~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5) .cse6) (and .cse1 .cse2 .cse7 .cse0 (and .cse8 .cse9 .cse10 .cse11 .cse12)) (not (= 1 ~t1_i~0)) .cse13 .cse14 (and .cse15 .cse16) (and .cse0 .cse17 .cse15 .cse1 .cse8 .cse9 .cse10 .cse11) (not (= ~m_i~0 1)) .cse18 (and .cse15 .cse4 .cse3 .cse5 (and .cse0 .cse1 .cse17 .cse12)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse19 (not (= 0 |old(~local~0)|)) .cse20 .cse21 .cse22 (not (= 0 |old(~m_pc~0)|)) .cse23 (not (= |old(~t1_st~0)| 0))))) (or .cse14 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse19 .cse32 .cse18 .cse33 .cse13 (and .cse34 .cse35 .cse8 .cse4 .cse2 .cse7 .cse36 .cse5 .cse37) .cse38 .cse39 .cse40) (or .cse14 .cse24 .cse26 .cse28 .cse29 .cse30 .cse19 .cse31 .cse32 .cse41 .cse18 .cse33 .cse13 .cse38 .cse42 .cse39) (or .cse24 .cse43 .cse26 (and .cse44 .cse34 .cse35 .cse2 .cse3 .cse36 .cse6 .cse45) .cse28 .cse29 .cse46 .cse31 .cse41 .cse32 .cse18 .cse33 .cse42 .cse38) (or .cse31 .cse24 .cse32 .cse18 .cse33 .cse38 (< |old(~m_st~0)| 2) .cse28 .cse40 .cse29) (or .cse25 .cse43 .cse26 .cse27 (and .cse1 .cse35 .cse2 .cse3 .cse6 .cse0 .cse4 .cse5) .cse21 .cse23 .cse46 .cse18 .cse20 .cse22)))))) [2018-11-18 13:05:37,888 INFO L425 ceAbstractionStarter]: For program point evalEXIT(lines 194 244) no Hoare annotation was computed. [2018-11-18 13:05:37,888 INFO L421 ceAbstractionStarter]: At program point L216(line 216) the Hoare annotation is: (let ((.cse10 (= ~T1_E~0 0))) (let ((.cse25 (<= 2 ~t1_st~0)) (.cse22 (and (not .cse10) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse23 (= ~t1_pc~0 1)) (.cse24 (not (= ~E_1~0 1))) (.cse30 (+ |old(~local~0)| 1))) (let ((.cse0 (< |old(~local~0)| |old(~token~0)|)) (.cse3 (< |old(~token~0)| |old(~local~0)|)) (.cse13 (< |old(~t1_st~0)| 2)) (.cse21 (= 1 |old(~m_pc~0)|)) (.cse1 (not (= 2 |old(~m_st~0)|))) (.cse2 (not (= |old(~t1_pc~0)| 1))) (.cse11 (= 0 ~M_E~0)) (.cse12 (= 1 ~M_E~0)) (.cse6 (not (= |old(~t1_st~0)| 2))) (.cse15 (= ~T1_E~0 1)) (.cse17 (< |old(~token~0)| .cse30)) (.cse16 (= 1 |old(~E_1~0)|)) (.cse18 (= 0 |old(~E_1~0)|)) (.cse20 (< .cse30 |old(~token~0)|)) (.cse19 (= 0 |old(~E_M~0)|)) (.cse9 (and .cse25 (let ((.cse29 (+ ~local~0 1))) (and (<= ~token~0 .cse29) .cse22 (<= .cse29 ~token~0) (not (= ~M_E~0 1)) .cse23 .cse24)))) (.cse14 (not (= 0 |old(~m_st~0)|))) (.cse7 (not (= 2 |old(~E_1~0)|))) (.cse4 (not (= ~T1_E~0 2))) (.cse8 (not (= 2 ~M_E~0))) (.cse5 (not (= 2 |old(~E_M~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse10 .cse2 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse15 .cse10 .cse16 .cse18 .cse19 (< |old(~m_st~0)| 2) .cse11 .cse21 .cse12) (or .cse9 .cse10 (and (and .cse22 .cse23 .cse24 (not (= ~m_pc~0 1))) .cse25) .cse0 .cse2 .cse3 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse18 .cse19 .cse21) (or .cse10 .cse1 .cse2 .cse11 .cse12 .cse6 .cse15 .cse17 .cse16 .cse18 .cse20 .cse19) (let ((.cse26 (= ~m_pc~0 0)) (.cse27 (= ~token~0 0)) (.cse28 (= ~local~0 0))) (or (not (= 1 ~t1_i~0)) .cse9 (and (= ~E_M~0 2) .cse26 (= ~E_1~0 2) (= ~t1_st~0 0) .cse27 .cse28 (= ~t1_pc~0 0) (= eval_~tmp~0 1)) (and (and .cse22 .cse26 .cse23 .cse27 .cse28 .cse24) .cse25) (not (= ~m_i~0 1)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse14 (not (= 0 |old(~local~0)|)) .cse7 .cse4 .cse8 (not (= 0 |old(~m_pc~0)|)) .cse5 (not (= |old(~t1_st~0)| 0))))))))) [2018-11-18 13:05:37,888 INFO L425 ceAbstractionStarter]: For program point L210(lines 200 238) no Hoare annotation was computed. [2018-11-18 13:05:37,888 INFO L421 ceAbstractionStarter]: At program point L239(lines 194 244) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0)) (.cse42 (+ ~local~0 1)) (.cse8 (= ~T1_E~0 1))) (let ((.cse16 (= ~m_st~0 0)) (.cse19 (<= 2 ~t1_st~0)) (.cse40 (not .cse8)) (.cse22 (not (= ~m_pc~0 1))) (.cse39 (+ |old(~local~0)| 1)) (.cse26 (<= ~token~0 .cse42)) (.cse14 (and (not .cse1) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))) (.cse29 (<= .cse42 ~token~0)) (.cse41 (not (= ~M_E~0 1))) (.cse18 (= ~t1_pc~0 1)) (.cse27 (= ~m_st~0 2)) (.cse20 (not (= ~E_1~0 1))) (.cse28 (= ~t1_st~0 2))) (let ((.cse24 (= 1 |old(~m_pc~0)|)) (.cse2 (< |old(~local~0)| |old(~token~0)|)) (.cse25 (not (= 2 |old(~m_st~0)|))) (.cse4 (< |old(~token~0)| |old(~local~0)|)) (.cse33 (= ~E_M~0 2)) (.cse15 (= ~token~0 |old(~token~0)|)) (.cse34 (= ~E_1~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse21 (<= ~local~0 ~token~0)) (.cse36 (not (= ~T1_E~0 2))) (.cse38 (not (= 2 |old(~E_M~0)|))) (.cse30 (not (= |old(~t1_st~0)| 2))) (.cse35 (not (= 2 |old(~E_1~0)|))) (.cse37 (not (= 2 ~M_E~0))) (.cse0 (and .cse26 .cse14 .cse29 .cse41 .cse18 .cse27 .cse20 .cse28)) (.cse3 (not (= |old(~t1_pc~0)| 1))) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~M_E~0)) (.cse7 (< |old(~t1_st~0)| 2)) (.cse9 (not (= 0 |old(~m_st~0)|))) (.cse10 (= 1 |old(~E_1~0)|)) (.cse31 (< |old(~token~0)| .cse39)) (.cse11 (and .cse40 .cse14 .cse41 (<= 2 ~m_st~0) .cse20 .cse22)) (.cse12 (= 0 |old(~E_1~0)|)) (.cse13 (and .cse26 .cse40 .cse14 .cse16 .cse29 .cse41 .cse18 .cse19 .cse20)) (.cse23 (= 0 |old(~E_M~0)|)) (.cse32 (< .cse39 |old(~token~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse23 .cse24) (or .cse1 .cse25 .cse3 (and .cse26 .cse14 .cse15 .cse18 .cse27 .cse20 .cse28 .cse29) .cse5 .cse6 .cse30 .cse8 .cse31 .cse10 .cse11 .cse12 .cse32 .cse23) (or (not (= 1 ~t1_i~0)) .cse13 .cse0 (not (= ~m_i~0 1)) .cse11 (and .cse33 .cse18 .cse27 .cse28 .cse34 .cse17 .cse21) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse9 (not (= 0 |old(~local~0)|)) .cse35 .cse36 .cse37 (not (= 0 |old(~m_pc~0)|)) .cse38 (not (= |old(~t1_st~0)| 0)))) (or .cse8 .cse1 .cse10 .cse11 .cse12 .cse23 (< |old(~m_st~0)| 2) .cse5 .cse24 .cse6) (or .cse2 .cse25 .cse3 .cse4 (and .cse33 .cse15 .cse18 .cse27 .cse28 .cse34 .cse17 .cse21) .cse36 .cse38 .cse30 .cse11 .cse35 .cse37) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse9 .cse8 .cse10 .cse31 .cse11 .cse12 .cse13 .cse23 .cse32))))) [2018-11-18 13:05:37,889 INFO L425 ceAbstractionStarter]: For program point L200-1(lines 200 238) no Hoare annotation was computed. [2018-11-18 13:05:37,889 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 234) no Hoare annotation was computed. [2018-11-18 13:05:37,889 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-18 13:05:37,889 INFO L421 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 (= 1 ~t1_i~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)) (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 (= ~m_i~0 1)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0))))) [2018-11-18 13:05:37,889 INFO L421 ceAbstractionStarter]: At program point L411(line 411) the Hoare annotation is: (or (not (= 1 ~t1_i~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 (= ~m_i~0 1)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))) [2018-11-18 13:05:37,889 INFO L425 ceAbstractionStarter]: For program point start_simulationEXIT(lines 403 461) no Hoare annotation was computed. [2018-11-18 13:05:37,889 INFO L421 ceAbstractionStarter]: At program point L411-1(line 411) the Hoare annotation is: (or (not (= 1 ~t1_i~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 (= ~m_i~0 1)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))) [2018-11-18 13:05:37,890 INFO L421 ceAbstractionStarter]: At program point L440(line 440) the Hoare annotation is: (let ((.cse11 (+ ~local~0 1))) (let ((.cse1 (= ~m_st~0 0)) (.cse4 (<= 2 ~t1_st~0)) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse0 (<= ~token~0 .cse11)) (.cse2 (<= .cse11 ~token~0)) (.cse3 (= ~t1_pc~0 1)) (.cse9 (= ~m_st~0 2)) (.cse5 (and (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_1~0 1)) (and (not (= ~M_E~0 1)) (and (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))))) (.cse10 (= ~t1_st~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= 1 ~t1_i~0)) (and (<= 2 ~m_st~0) .cse5 .cse6) (and .cse1 .cse7 .cse3 .cse4 .cse5 .cse8 .cse6) (not (= ~m_i~0 1)) (and (= ~E_1~0 2) (= ~E_M~0 2) (and .cse3 .cse7 .cse9 .cse5 .cse10 .cse8) (= ~M_E~0 2)) (and .cse0 .cse2 .cse3 .cse9 .cse5 .cse10) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 13:05:37,890 INFO L421 ceAbstractionStarter]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse11 (+ ~local~0 1))) (let ((.cse0 (<= ~token~0 .cse11)) (.cse1 (<= .cse11 ~token~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (<= 2 ~t1_st~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= ~m_st~0 2)) (.cse4 (= ~t1_st~0 2)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse5 (and (= |old(~T1_E~0)| ~T1_E~0) (and (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_1~0 1))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse7 .cse5) (and (<= 2 ~m_st~0) .cse5 .cse8) (not (= 1 ~t1_i~0)) (and .cse6 .cse9 .cse2 .cse7 .cse10 .cse5 .cse8) (not (= ~m_i~0 1)) (and (= ~M_E~0 1) (= ~E_M~0 2) .cse2 .cse3 .cse4 (= ~E_1~0 2) .cse9 .cse10 .cse5) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 13:05:37,890 INFO L421 ceAbstractionStarter]: At program point L432(line 432) the Hoare annotation is: (let ((.cse11 (+ ~local~0 1))) (let ((.cse1 (= ~m_st~0 0)) (.cse4 (<= 2 ~t1_st~0)) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse0 (<= ~token~0 .cse11)) (.cse2 (<= .cse11 ~token~0)) (.cse3 (= ~t1_pc~0 1)) (.cse9 (= ~m_st~0 2)) (.cse5 (and (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_1~0 1)) (and (not (= ~M_E~0 1)) (and (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))))) (.cse10 (= ~t1_st~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= 1 ~t1_i~0)) (and (<= 2 ~m_st~0) .cse5 .cse6) (and .cse1 .cse7 .cse3 .cse4 .cse5 .cse8 .cse6) (and (= ~E_M~0 2) .cse3 .cse9 .cse5 .cse10 (= ~M_E~0 2) (= ~E_1~0 2) .cse7 .cse8) (not (= ~m_i~0 1)) (and .cse0 .cse2 .cse3 .cse9 .cse5 .cse10) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 13:05:37,890 INFO L421 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (let ((.cse11 (+ ~local~0 1))) (let ((.cse1 (= ~m_st~0 0)) (.cse4 (<= 2 ~t1_st~0)) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse0 (<= ~token~0 .cse11)) (.cse2 (<= .cse11 ~token~0)) (.cse3 (= ~t1_pc~0 1)) (.cse9 (= ~m_st~0 2)) (.cse5 (and (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_1~0 1)) (and (not (= ~M_E~0 1)) (and (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))))) (.cse10 (= ~t1_st~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= 1 ~t1_i~0)) (and (<= 2 ~m_st~0) .cse5 .cse6) (and .cse1 .cse7 .cse3 .cse4 .cse5 .cse8 .cse6) (and (= ~E_M~0 2) .cse3 .cse9 .cse5 .cse10 (= ~M_E~0 2) (= ~E_1~0 2) .cse7 .cse8) (not (= ~m_i~0 1)) (and .cse0 .cse2 .cse3 .cse9 .cse5 .cse10) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 13:05:37,891 INFO L421 ceAbstractionStarter]: At program point L430-1(line 430) the Hoare annotation is: (let ((.cse11 (+ ~local~0 1))) (let ((.cse1 (= ~m_st~0 0)) (.cse4 (<= 2 ~t1_st~0)) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse0 (<= ~token~0 .cse11)) (.cse2 (<= .cse11 ~token~0)) (.cse3 (= ~t1_pc~0 1)) (.cse9 (= ~m_st~0 2)) (.cse5 (and (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_1~0 1)) (and (not (= ~M_E~0 1)) (and (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))))) (.cse10 (= ~t1_st~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= 1 ~t1_i~0)) (and (<= 2 ~m_st~0) .cse5 .cse6) (and .cse1 .cse7 .cse3 .cse4 .cse5 .cse8 .cse6) (and (= ~E_M~0 2) .cse3 .cse9 .cse5 .cse10 (= ~M_E~0 2) (= ~E_1~0 2) .cse7 .cse8) (not (= ~m_i~0 1)) (and .cse0 .cse2 .cse3 .cse9 .cse5 .cse10) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 13:05:37,891 INFO L421 ceAbstractionStarter]: At program point L426(line 426) the Hoare annotation is: (let ((.cse11 (+ ~local~0 1))) (let ((.cse1 (= ~m_st~0 0)) (.cse4 (<= 2 ~t1_st~0)) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse0 (<= ~token~0 .cse11)) (.cse2 (<= .cse11 ~token~0)) (.cse3 (= ~t1_pc~0 1)) (.cse9 (= ~m_st~0 2)) (.cse5 (and (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_1~0 1)) (and (not (= ~M_E~0 1)) (and (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))))) (.cse10 (= ~t1_st~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= 1 ~t1_i~0)) (and (<= 2 ~m_st~0) .cse5 .cse6) (and .cse1 .cse7 .cse3 .cse4 .cse5 .cse8 .cse6) (and (= ~E_M~0 2) .cse3 .cse9 .cse5 .cse10 (= ~M_E~0 2) (= ~E_1~0 2) .cse7 .cse8) (not (= ~m_i~0 1)) (and .cse0 .cse2 .cse3 .cse9 .cse5 .cse10) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 13:05:37,891 INFO L425 ceAbstractionStarter]: For program point L426-1(line 426) no Hoare annotation was computed. [2018-11-18 13:05:37,891 INFO L421 ceAbstractionStarter]: At program point L422(line 422) the Hoare annotation is: (let ((.cse14 (+ ~local~0 1))) (let ((.cse1 (= ~m_st~0 0)) (.cse4 (<= 2 ~t1_st~0)) (.cse9 (not (= ~m_pc~0 1))) (.cse6 (= ~E_M~0 2)) (.cse7 (= ~M_E~0 2)) (.cse8 (= ~E_1~0 2)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse0 (<= ~token~0 .cse14)) (.cse2 (<= .cse14 ~token~0)) (.cse3 (= ~t1_pc~0 1)) (.cse12 (= ~m_st~0 2)) (.cse5 (and (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_1~0 1)) (and (not (= ~M_E~0 1)) (and (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))))) (.cse13 (= ~t1_st~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 (= ~m_pc~0 0) .cse5 .cse7 .cse8 (= ~t1_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) (and (<= 2 ~m_st~0) .cse5 .cse9) (and .cse1 .cse10 .cse3 .cse4 .cse5 .cse11 .cse9) (and .cse6 .cse3 .cse12 .cse5 .cse13 .cse7 .cse8 .cse10 .cse11) (not (= ~m_i~0 1)) (and .cse0 .cse2 .cse3 .cse12 .cse5 .cse13) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 13:05:37,891 INFO L425 ceAbstractionStarter]: For program point L422-1(line 422) no Hoare annotation was computed. [2018-11-18 13:05:37,891 INFO L425 ceAbstractionStarter]: For program point L418(lines 418 455) no Hoare annotation was computed. [2018-11-18 13:05:37,891 INFO L421 ceAbstractionStarter]: At program point start_simulationENTRY(lines 403 461) the Hoare annotation is: (or (not (= 1 ~t1_i~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 (= ~m_i~0 1)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))) [2018-11-18 13:05:37,892 INFO L421 ceAbstractionStarter]: At program point L418-2(lines 415 455) the Hoare annotation is: (let ((.cse14 (+ ~local~0 1))) (let ((.cse1 (= ~m_st~0 0)) (.cse4 (<= 2 ~t1_st~0)) (.cse9 (not (= ~m_pc~0 1))) (.cse6 (= ~E_M~0 2)) (.cse7 (= ~M_E~0 2)) (.cse8 (= ~E_1~0 2)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse0 (<= ~token~0 .cse14)) (.cse2 (<= .cse14 ~token~0)) (.cse3 (= ~t1_pc~0 1)) (.cse12 (= ~m_st~0 2)) (.cse5 (and (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_1~0 1)) (and (not (= ~M_E~0 1)) (and (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))))) (.cse13 (= ~t1_st~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 (= ~m_pc~0 0) .cse5 .cse7 .cse8 (= ~t1_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) (and (<= 2 ~m_st~0) .cse5 .cse9) (and .cse1 .cse10 .cse3 .cse4 .cse5 .cse11 .cse9) (and .cse6 .cse3 .cse12 .cse5 .cse13 .cse7 .cse8 .cse10 .cse11) (not (= ~m_i~0 1)) (and .cse0 .cse2 .cse3 .cse12 .cse5 .cse13) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 13:05:37,892 INFO L421 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 (= 1 ~t1_i~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)) (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 (= ~m_i~0 1)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0))))) [2018-11-18 13:05:37,892 INFO L421 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 (= 1 ~t1_i~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)) (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 (= ~m_i~0 1)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0))))) [2018-11-18 13:05:37,892 INFO L421 ceAbstractionStarter]: At program point L441(line 441) the Hoare annotation is: (let ((.cse11 (+ ~local~0 1))) (let ((.cse0 (<= ~token~0 .cse11)) (.cse1 (<= .cse11 ~token~0)) (.cse6 (= ~m_st~0 0)) (.cse7 (<= 2 ~t1_st~0)) (.cse8 (not (= ~m_pc~0 1))) (.cse2 (= ~t1_pc~0 1)) (.cse3 (= ~m_st~0 2)) (.cse4 (= ~t1_st~0 2)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse5 (and (= |old(~T1_E~0)| ~T1_E~0) (and (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_1~0 1))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse7 .cse5) (and (<= 2 ~m_st~0) .cse5 .cse8) (not (= 1 ~t1_i~0)) (and .cse6 .cse9 .cse2 .cse7 .cse10 .cse5 .cse8) (not (= ~m_i~0 1)) (and (= ~M_E~0 1) (= ~E_M~0 2) .cse2 .cse3 .cse4 (= ~E_1~0 2) .cse9 .cse10 .cse5) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 13:05:37,892 INFO L425 ceAbstractionStarter]: For program point L437(lines 437 446) no Hoare annotation was computed. [2018-11-18 13:05:37,893 INFO L421 ceAbstractionStarter]: At program point L437-1(lines 437 446) the Hoare annotation is: (let ((.cse11 (+ ~local~0 1))) (let ((.cse1 (= ~m_st~0 0)) (.cse4 (<= 2 ~t1_st~0)) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse0 (<= ~token~0 .cse11)) (.cse2 (<= .cse11 ~token~0)) (.cse3 (= ~t1_pc~0 1)) (.cse9 (= ~m_st~0 2)) (.cse5 (and (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_1~0 1)) (and (not (= ~M_E~0 1)) (and (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))))) (.cse10 (= ~t1_st~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= 1 ~t1_i~0)) (and (<= 2 ~m_st~0) .cse5 .cse6) (and .cse1 .cse7 .cse3 .cse4 .cse5 .cse8 .cse6) (and (= ~E_M~0 2) .cse3 .cse9 .cse5 .cse10 (= ~M_E~0 2) (= ~E_1~0 2) .cse7 .cse8) (not (= ~m_i~0 1)) (and .cse0 .cse2 .cse3 .cse9 .cse5 .cse10) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 13:05:37,895 INFO L425 ceAbstractionStarter]: For program point L435(line 435) no Hoare annotation was computed. [2018-11-18 13:05:37,895 INFO L421 ceAbstractionStarter]: At program point L431(line 431) the Hoare annotation is: (let ((.cse11 (+ ~local~0 1))) (let ((.cse1 (= ~m_st~0 0)) (.cse4 (<= 2 ~t1_st~0)) (.cse6 (not (= ~m_pc~0 1))) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse0 (<= ~token~0 .cse11)) (.cse2 (<= .cse11 ~token~0)) (.cse3 (= ~t1_pc~0 1)) (.cse9 (= ~m_st~0 2)) (.cse5 (and (= |old(~T1_E~0)| ~T1_E~0) (not (= ~E_1~0 1)) (and (not (= ~M_E~0 1)) (and (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0)))))) (.cse10 (= ~t1_st~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (not (= 1 ~t1_i~0)) (and (<= 2 ~m_st~0) .cse5 .cse6) (and .cse1 .cse7 .cse3 .cse4 .cse5 .cse8 .cse6) (and (= ~E_M~0 2) .cse3 .cse9 .cse5 .cse10 (= ~M_E~0 2) (= ~E_1~0 2) .cse7 .cse8) (not (= ~m_i~0 1)) (and .cse0 .cse2 .cse3 .cse9 .cse5 .cse10) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))))) [2018-11-18 13:05:37,895 INFO L421 ceAbstractionStarter]: At program point L456(lines 403 461) the Hoare annotation is: (or (not (= ~M_E~0 0)) (not (= 1 ~t1_i~0)) (not (= ~m_i~0 1)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~M_E~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= 2 |old(~E_M~0)|)) (not (= |old(~t1_st~0)| 0)))) [2018-11-18 13:05:37,895 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-18 13:05:37,896 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 454) no Hoare annotation was computed. [2018-11-18 13:05:37,896 INFO L421 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 245 272) the Hoare annotation is: (let ((.cse21 (= |old(~T1_E~0)| ~T1_E~0)) (.cse22 (= |old(~M_E~0)| ~M_E~0)) (.cse23 (= |old(~E_M~0)| ~E_M~0)) (.cse26 (+ ~local~0 1))) (let ((.cse8 (< ~token~0 .cse26)) (.cse12 (< .cse26 ~token~0)) (.cse4 (< ~t1_st~0 2)) (.cse15 (< ~local~0 ~token~0)) (.cse13 (not (= 2 ~m_st~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse16 (< ~token~0 ~local~0)) (.cse14 (not (= ~t1_st~0 2))) (.cse20 (= ~E_1~0 2)) (.cse5 (not (= 0 ~m_st~0))) (.cse24 (not (= 2 |old(~E_1~0)|))) (.cse18 (not (= |old(~T1_E~0)| 2))) (.cse25 (not (= 2 |old(~M_E~0)|))) (.cse19 (not (= 2 |old(~E_M~0)|))) (.cse10 (and (= |old(~E_1~0)| ~E_1~0) .cse21 .cse22 .cse23)) (.cse6 (= |old(~T1_E~0)| 1)) (.cse0 (= |old(~T1_E~0)| 0)) (.cse7 (= 1 |old(~E_1~0)|)) (.cse9 (= 0 |old(~E_1~0)|)) (.cse11 (= 0 |old(~E_M~0)|)) (.cse2 (= 0 |old(~M_E~0)|)) (.cse17 (= 1 ~m_pc~0)) (.cse3 (= 1 |old(~M_E~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse13 .cse1 .cse2 .cse3 .cse10 .cse14 .cse6 .cse8 .cse7 .cse9 .cse12 .cse11) (or .cse10 .cse0 .cse15 .cse1 .cse16 .cse2 .cse3 .cse4 .cse6 .cse5 .cse7 .cse9 .cse11 .cse17) (or .cse15 .cse13 .cse1 .cse16 .cse18 .cse19 .cse14 (and .cse20 .cse21 .cse22 .cse23) .cse24 .cse25) (or (not (= 1 ~t1_i~0)) (and .cse20 (= ~E_M~0 2) .cse21 .cse22) (not (= ~m_i~0 1)) (or (not (= ~token~0 0)) (not (= ~t1_pc~0 0)) .cse5 (not (= 0 ~local~0)) .cse24 .cse18 .cse25 (not (= 0 ~m_pc~0)) .cse19 (not (= ~t1_st~0 0)))) (or .cse10 .cse6 .cse0 .cse7 .cse9 .cse11 (< ~m_st~0 2) .cse2 .cse17 .cse3)))) [2018-11-18 13:05:37,900 INFO L425 ceAbstractionStarter]: For program point L254-1(lines 248 271) no Hoare annotation was computed. [2018-11-18 13:05:37,900 INFO L425 ceAbstractionStarter]: For program point L249-1(lines 248 271) no Hoare annotation was computed. [2018-11-18 13:05:37,900 INFO L425 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 245 272) no Hoare annotation was computed. [2018-11-18 13:05:37,900 INFO L425 ceAbstractionStarter]: For program point L264-1(lines 245 272) no Hoare annotation was computed. [2018-11-18 13:05:37,900 INFO L425 ceAbstractionStarter]: For program point L259-1(lines 248 271) no Hoare annotation was computed. [2018-11-18 13:05:37,900 INFO L425 ceAbstractionStarter]: For program point update_channelsEXIT(lines 148 155) no Hoare annotation was computed. [2018-11-18 13:05:37,900 INFO L428 ceAbstractionStarter]: At program point update_channelsFINAL(lines 148 155) the Hoare annotation is: true [2018-11-18 13:05:37,901 INFO L421 ceAbstractionStarter]: At program point L125(lines 113 127) the Hoare annotation is: (let ((.cse21 (= 1 ~E_1~0))) (let ((.cse5 (not (= 2 ~m_st~0))) (.cse4 (not (= ~t1_st~0 2))) (.cse23 (= 0 ~E_1~0)) (.cse0 (= 0 is_master_triggered_~__retres1~0)) (.cse18 (< ~t1_st~0 2)) (.cse12 (not .cse21)) (.cse20 (= ~T1_E~0 1)) (.cse16 (= ~T1_E~0 0)) (.cse1 (< ~local~0 ~token~0)) (.cse7 (not (= ~t1_pc~0 1))) (.cse2 (< ~token~0 ~local~0)) (.cse24 (= 0 ~E_M~0)) (.cse17 (= 0 ~M_E~0)) (.cse25 (= 1 ~m_pc~0)) (.cse3 (= 1 ~M_E~0)) (.cse15 (= is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~t1_pc~0 0))) (.cse19 (not (= 0 ~m_st~0))) (.cse6 (not (= 2 ~E_1~0))) (.cse8 (not (= ~T1_E~0 2))) (.cse13 (not (= 2 ~M_E~0))) (.cse14 (not (= 0 ~m_pc~0))) (.cse9 (not (= 2 ~E_M~0))) (.cse10 (not (= ~t1_st~0 0)))) (and (or .cse0 .cse1 .cse2 (not .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) (or .cse1 .cse0 .cse2 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse1 .cse5 .cse7 .cse2 .cse15 .cse8 .cse9 .cse4 .cse6 .cse13) (let ((.cse22 (+ ~local~0 1))) (or .cse16 .cse0 .cse7 .cse17 .cse18 .cse19 .cse20 .cse21 (< ~token~0 .cse22) .cse23 .cse24 (< .cse22 ~token~0) .cse25)) (or .cse20 .cse16 .cse21 .cse0 .cse23 .cse24 (< ~m_st~0 2) .cse17 .cse25) (or .cse16 .cse1 .cse7 .cse2 .cse0 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25) (or .cse0 .cse18 (or .cse12 .cse20 .cse16 .cse1 .cse7 .cse2 .cse24 .cse17 .cse25 .cse3)) (or (not (= 1 ~t1_i~0)) .cse15 (not (= ~m_i~0 1)) (or (not (= ~token~0 0)) .cse11 .cse19 (not (= 0 ~local~0)) .cse6 .cse8 .cse13 .cse14 .cse9 .cse10))))) [2018-11-18 13:05:37,905 INFO L425 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 110 128) no Hoare annotation was computed. [2018-11-18 13:05:37,905 INFO L425 ceAbstractionStarter]: For program point L115(lines 115 120) no Hoare annotation was computed. [2018-11-18 13:05:37,905 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 123) no Hoare annotation was computed. [2018-11-18 13:05:37,905 INFO L425 ceAbstractionStarter]: For program point L114-2(lines 114 123) no Hoare annotation was computed. [2018-11-18 13:05:37,905 INFO L425 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 110 128) no Hoare annotation was computed. [2018-11-18 13:05:37,905 INFO L428 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 110 128) the Hoare annotation is: true [2018-11-18 13:05:37,905 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 13:05:37,905 INFO L421 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-18 13:05:37,905 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 13:05:37,905 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 13:05:37,905 INFO L425 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 346 373) no Hoare annotation was computed. [2018-11-18 13:05:37,905 INFO L425 ceAbstractionStarter]: For program point L350-1(lines 349 372) no Hoare annotation was computed. [2018-11-18 13:05:37,905 INFO L421 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 346 373) the Hoare annotation is: (let ((.cse17 (= |old(~T1_E~0)| ~T1_E~0)) (.cse18 (= |old(~M_E~0)| ~M_E~0)) (.cse19 (= |old(~E_M~0)| ~E_M~0)) (.cse20 (+ ~local~0 1))) (let ((.cse6 (< ~t1_st~0 2)) (.cse7 (not (= 0 ~m_st~0))) (.cse13 (< ~token~0 .cse20)) (.cse14 (< .cse20 ~token~0)) (.cse1 (< ~local~0 ~token~0)) (.cse3 (< ~token~0 ~local~0)) (.cse16 (not (= ~t1_st~0 2))) (.cse15 (not (= 2 ~m_st~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse8 (= |old(~T1_E~0)| 1)) (.cse0 (= |old(~T1_E~0)| 0)) (.cse9 (= 1 |old(~E_1~0)|)) (.cse10 (= 0 |old(~E_1~0)|)) (.cse11 (= 0 |old(~E_M~0)|)) (.cse4 (= 0 |old(~M_E~0)|)) (.cse5 (and (= |old(~E_1~0)| ~E_1~0) .cse17 .cse18 .cse19)) (.cse12 (= 1 ~m_pc~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse6 .cse7 .cse8 .cse0 .cse9 .cse13 .cse10 .cse2 .cse11 .cse14 .cse5 .cse4) (or .cse0 .cse15 .cse2 .cse4 .cse16 .cse8 .cse13 .cse9 .cse10 .cse14 .cse11 .cse5) (or (and (= ~E_1~0 2) .cse17 .cse18 .cse19) .cse1 .cse3 (not (= 1 |old(~M_E~0)|)) (or .cse16 .cse15 (not (= 2 |old(~E_1~0)|)) .cse2 (not (= |old(~T1_E~0)| 2)) (not (= 2 |old(~E_M~0)|)))) (or .cse8 .cse0 .cse9 .cse10 .cse11 (< ~m_st~0 2) .cse4 .cse5 .cse12)))) [2018-11-18 13:05:37,908 INFO L425 ceAbstractionStarter]: For program point L365-1(lines 346 373) no Hoare annotation was computed. [2018-11-18 13:05:37,908 INFO L425 ceAbstractionStarter]: For program point L360-1(lines 349 372) no Hoare annotation was computed. [2018-11-18 13:05:37,908 INFO L425 ceAbstractionStarter]: For program point L355-1(lines 349 372) no Hoare annotation was computed. [2018-11-18 13:05:37,908 INFO L425 ceAbstractionStarter]: For program point init_modelFINAL(lines 374 383) no Hoare annotation was computed. [2018-11-18 13:05:37,908 INFO L425 ceAbstractionStarter]: For program point init_modelEXIT(lines 374 383) no Hoare annotation was computed. [2018-11-18 13:05:37,908 INFO L428 ceAbstractionStarter]: At program point init_modelENTRY(lines 374 383) the Hoare annotation is: true [2018-11-18 13:05:37,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 01:05:37 BoogieIcfgContainer [2018-11-18 13:05:37,959 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 13:05:37,959 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:05:37,959 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:05:37,959 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:05:37,960 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:04:40" (3/4) ... [2018-11-18 13:05:37,963 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 13:05:37,968 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-18 13:05:37,968 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit1 [2018-11-18 13:05:37,968 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2018-11-18 13:05:37,968 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-18 13:05:37,968 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-18 13:05:37,968 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit1_triggered [2018-11-18 13:05:37,968 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-18 13:05:37,968 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 13:05:37,968 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-18 13:05:37,968 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure master [2018-11-18 13:05:37,968 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_time_events [2018-11-18 13:05:37,968 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 13:05:37,969 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-18 13:05:37,969 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-18 13:05:37,969 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-18 13:05:37,969 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-18 13:05:37,969 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-18 13:05:37,969 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_master_triggered [2018-11-18 13:05:37,969 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_time_events [2018-11-18 13:05:37,969 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-18 13:05:37,975 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2018-11-18 13:05:37,975 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 13:05:37,998 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((token <= local + 1 && m_st == 0) && local + 1 <= token) && t1_pc == 1) && 2 <= t1_st) && (\old(T1_E) == T1_E && !(E_1 == 1)) && !(M_E == 1) && (!(M_E == 0) && !(E_1 == 0)) && !(E_M == 0)) || (((((((((E_M == 2 && m_st == 0) && m_pc == 0) && (\old(T1_E) == T1_E && !(E_1 == 1)) && !(M_E == 1) && (!(M_E == 0) && !(E_1 == 0)) && !(E_M == 0)) && M_E == 2) && E_1 == 2) && t1_st == 0) && token == 0) && local == 0) && t1_pc == 0)) || !(1 == t1_i)) || ((2 <= m_st && (\old(T1_E) == T1_E && !(E_1 == 1)) && !(M_E == 1) && (!(M_E == 0) && !(E_1 == 0)) && !(E_M == 0)) && !(m_pc == 1))) || ((((((m_st == 0 && token <= local) && t1_pc == 1) && 2 <= t1_st) && (\old(T1_E) == T1_E && !(E_1 == 1)) && !(M_E == 1) && (!(M_E == 0) && !(E_1 == 0)) && !(E_M == 0)) && local <= token) && !(m_pc == 1))) || ((((((((E_M == 2 && t1_pc == 1) && m_st == 2) && (\old(T1_E) == T1_E && !(E_1 == 1)) && !(M_E == 1) && (!(M_E == 0) && !(E_1 == 0)) && !(E_M == 0)) && t1_st == 2) && M_E == 2) && E_1 == 2) && token <= local) && local <= token)) || !(m_i == 1)) || (((((token <= local + 1 && local + 1 <= token) && t1_pc == 1) && m_st == 2) && (\old(T1_E) == T1_E && !(E_1 == 1)) && !(M_E == 1) && (!(M_E == 0) && !(E_1 == 0)) && !(E_M == 0)) && t1_st == 2)) || ((((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(2 == \old(E_1))) || !(\old(T1_E) == 2)) || !(2 == \old(M_E))) || !(0 == \old(m_pc))) || !(2 == \old(E_M))) || !(\old(t1_st) == 0) [2018-11-18 13:05:37,998 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(M_E == 0) || !(1 == t1_i)) || !(m_i == 1)) || ((((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(2 == \old(E_1))) || !(\old(T1_E) == 2)) || !(2 == \old(M_E))) || !(0 == \old(m_pc))) || !(2 == \old(E_M))) || !(\old(t1_st) == 0) [2018-11-18 13:05:37,999 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((E_1 == 2 && E_M == 2) && t1_pc == 1) && m_st == 2) && token <= local && local <= token) && t1_st == 2) || ((((E_M == 2 && t1_pc == 1) && 2 <= t1_st) && E_1 == 2) && (((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1)) || !(1 == t1_i)) || ((((((((token <= local + 1 && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && m_st == 0) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && 2 <= t1_st) && !(E_1 == 1))) || (((((((token <= local + 1 && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && t1_st == 2)) || (t1_st == 0 && ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && token <= local) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && local <= token)) || (((((((E_1 == 2 && t1_pc == 0) && t1_st == 0) && E_M == 2) && m_st == 0) && m_pc == 0) && token == 0) && local == 0)) || !(m_i == 1)) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || ((((t1_st == 0 && token <= local) && m_st == 2) && local <= token) && ((E_1 == 2 && E_M == 2) && t1_pc == 0) && tmp == 1)) || ((((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(2 == \old(E_1))) || !(T1_E == 2)) || !(2 == M_E)) || !(0 == \old(m_pc))) || !(2 == \old(E_M))) || !(\old(t1_st) == 0)) && ((((((((((((((((((((((((token <= local + 1 && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && t1_st == 2) || T1_E == 0) || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || ((((((((token <= local + 1 && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && m_st == 0) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && 2 <= t1_st) && !(E_1 == 1))) || (((((((((((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && token == \old(token)) && m_st == 0) && token <= local) && t1_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && local <= token) && !(m_pc == 1))) || 0 == \old(E_M)) || ((t1_st == 0 && ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && token <= local) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && local <= token) && m_pc == 1)) || 1 == \old(m_pc))) && ((((((((((((((((((((((token <= local + 1 && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && t1_st == 2) || T1_E == 0) || !(\old(t1_pc) == 1)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || !(0 == \old(m_st))) || T1_E == 1) || 1 == \old(E_1)) || \old(token) < \old(local) + 1) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || ((((((((token <= local + 1 && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && m_st == 0) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && 2 <= t1_st) && !(E_1 == 1))) || 0 == \old(E_M)) || \old(local) + 1 < \old(token)) || ((t1_st == 0 && ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && token <= local) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && local <= token) && m_pc == 1))) && (((((((((((((T1_E == 0 || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || (((((((token <= local + 1 && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && token == \old(token)) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && t1_st == 2) && local + 1 <= token)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 2)) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && ((((((((((\old(local) < \old(token) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((E_M == 2 && token == \old(token)) && t1_pc == 1) && m_st == 2) && t1_st == 2) && E_1 == 2) && token <= local) && local <= token)) || !(T1_E == 2)) || !(2 == \old(E_M))) || !(\old(t1_st) == 2)) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || !(2 == \old(E_1))) || !(2 == M_E)) [2018-11-18 13:05:37,999 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((token <= local + 1 && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && t1_st == 2) || T1_E == 0) || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || ((((((((token <= local + 1 && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && m_st == 0) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && 2 <= t1_st) && !(E_1 == 1))) || (((((((((((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && token == \old(token)) && m_st == 0) && token <= local) && t1_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && local <= token) && !(m_pc == 1))) || 0 == \old(E_M)) || 1 == \old(m_pc)) && (((((((((((((T1_E == 0 || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || (((((((token <= local + 1 && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && token == \old(token)) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && t1_st == 2) && local + 1 <= token)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 2)) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M))) && ((((((!(1 == t1_i) || ((((((((token <= local + 1 && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && m_st == 0) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && 2 <= t1_st) && !(E_1 == 1))) || (((((((token <= local + 1 && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && t1_st == 2)) || !(m_i == 1)) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || ((((((E_M == 2 && t1_pc == 1) && m_st == 2) && t1_st == 2) && E_1 == 2) && token <= local) && local <= token)) || ((((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(2 == \old(E_1))) || !(T1_E == 2)) || !(2 == M_E)) || !(0 == \old(m_pc))) || !(2 == \old(E_M))) || !(\old(t1_st) == 0))) && (((((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && ((((((((((\old(local) < \old(token) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((E_M == 2 && token == \old(token)) && t1_pc == 1) && m_st == 2) && t1_st == 2) && E_1 == 2) && token <= local) && local <= token)) || !(T1_E == 2)) || !(2 == \old(E_M))) || !(\old(t1_st) == 2)) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || !(2 == \old(E_1))) || !(2 == M_E))) && (((((((((((((((((((((token <= local + 1 && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && t1_st == 2) || T1_E == 0) || !(\old(t1_pc) == 1)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || !(0 == \old(m_st))) || T1_E == 1) || 1 == \old(E_1)) || \old(token) < \old(local) + 1) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || ((((((((token <= local + 1 && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && m_st == 0) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && 2 <= t1_st) && !(E_1 == 1))) || 0 == \old(E_M)) || \old(local) + 1 < \old(token)) [2018-11-18 13:05:38,000 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(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 && E_M == 2) && token == 0) && t1_pc == 0)) || !(1 == t1_i)) || !(2 == M_E)) || !(0 == m_pc)) && (((((((((local < \old(token) || !(2 == \old(m_st))) || \old(token) < local) || !(T1_E == 2)) || !(2 == \old(E_M))) || !(\old(t1_pc) == 0)) || !(1 == m_pc)) || !(2 == E_1)) || ((((E_M == 2 && token <= local) && m_st == 2) && t1_pc == 0) && local <= token)) || !(2 == M_E))) && (((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || (2 <= m_st && !(E_M == 0))) || 1 == m_pc) || 1 == M_E)) && (((((((((((((T1_E == 0 || local < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < local) || 0 == M_E) || ((token <= \old(token) + 1 && m_st == 2 && !(E_M == 0)) && local + 1 <= token)) || 1 == M_E) || T1_E == 1) || 1 == E_1) || ((token <= \old(token) + 1 && local + 1 <= token) && m_st == 0 && !(E_M == 0))) || !(1 == m_pc)) || 0 == E_1) || 0 == \old(E_M)) [2018-11-18 13:05:38,000 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(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)) || ((((E_M == 2 && m_st == 0) && t1_pc == 1) && 2 <= t1_st) && token == 0)) && (((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || (2 <= m_st && !(E_M == 0))) || 1 == m_pc) || 1 == M_E)) && (((((((((((((T1_E == 0 || local < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < local) || (((((t1_pc == 1 && m_st == 2) && !(E_M == 0)) && t1_st == 2) && token <= \old(token) + 1) && local + 1 <= token)) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || 0 == \old(E_M)) || (((((m_st == 0 && t1_pc == 1) && !(E_M == 0)) && 2 <= t1_st) && token <= \old(token) + 1) && local + 1 <= token))) && ((((((((((((((E_M == 2 && t1_pc == 1) && m_st == 2) && t1_st == 2) && token <= local) && local <= token) || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || !(T1_E == 2)) || !(2 == \old(E_M))) || !(\old(t1_pc) == 0)) || !(1 == m_pc)) || !(2 == E_1)) || !(2 == M_E)) [2018-11-18 13:05:38,000 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(t1_st) < 2 || (((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == E_M) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || ((((((((((((m_pc == 1 && !(T1_E == 1)) && !(M_E == 0)) && t1_pc == 1) && m_st == 2) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && !(M_E == 1)) && token <= local) && !(E_1 == 0)) && local <= token)) && ((((((((((((m_pc == 1 && m_st == 2) && E_1 == 2) && t1_st == 0) && token <= local) && local <= token) || !(\old(t1_st) == 0)) || !(m_i == 1)) || (((!(\old(token) == 0) || !(t1_pc == 0)) || !(0 == \old(local))) || !(T1_E == 2)) || !(2 == E_M)) || !(2 == \old(E_1))) || !(1 == t1_i)) || !(2 == M_E)) || !(0 == \old(m_pc)))) && ((\old(t1_st) < 2 || ((((((((((((m_pc == 1 && !(T1_E == 1)) && !(M_E == 0)) && t1_pc == 1) && m_st == 2) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && !(M_E == 1)) && token <= local) && !(E_1 == 0)) && local <= token)) || ((((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || \old(token) < \old(local) + 1) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == E_M) || \old(local) + 1 < \old(token)) || 0 == M_E) || 1 == M_E) [2018-11-18 13:05:38,000 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(T1_E == 1) && \old(E_1) == E_1) && token == \old(token)) && !(M_E == 0)) && t1_pc == 1) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && 2 <= t1_st) || \old(t1_st) < 2) || (((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == E_M) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) && (((((((!(\old(t1_st) == 0) || !(m_i == 1)) || (((!(\old(token) == 0) || !(t1_pc == 0)) || !(0 == \old(local))) || !(T1_E == 2)) || !(2 == E_M)) || !(2 == \old(E_1))) || !(1 == t1_i)) || !(2 == M_E)) || !(0 == \old(m_pc))) || ((((m_pc == 0 && E_1 == 2) && t1_st == 0) && token == 0) && local == 0))) && (((\old(t1_st) < 2 || (2 <= t1_st && (((((((((!(T1_E == 1) && \old(E_1) == E_1) && token == \old(token)) && !(M_E == 0)) && t1_pc == 1) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0))) || ((((token <= local + 1 && \old(E_1) == E_1) && token == \old(token)) && 2 <= t1_st) && local + 1 <= token)) || ((((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || \old(token) < \old(local) + 1) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == E_M) || \old(local) + 1 < \old(token)) || 0 == M_E) || 1 == M_E) [2018-11-18 13:05:38,000 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(\old(t1_st) == 0) || !(m_i == 1)) || (((!(\old(token) == 0) || !(t1_pc == 0)) || !(0 == \old(local))) || !(T1_E == 2)) || !(2 == E_M)) || !(2 == \old(E_1))) || !(1 == t1_i)) || !(2 == M_E)) || !(0 == \old(m_pc))) && ((\old(t1_st) < 2 || ((((token <= local + 1 && \old(E_1) == E_1) && token == \old(token)) && 2 <= t1_st) && local + 1 <= token)) || ((((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || \old(token) < \old(local) + 1) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == E_M) || \old(local) + 1 < \old(token)) || 0 == M_E) || 1 == M_E)) && (\old(t1_st) < 2 || (((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == E_M) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) [2018-11-18 13:05:38,000 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((local < \old(token) || !(2 == \old(m_st))) || \old(token) < local) || !(T1_E == 2)) || !(2 == \old(E_M))) || !(\old(t1_pc) == 0)) || !(1 == m_pc)) || !(2 == E_1)) || !(2 == M_E)) && ((((((((((2 <= m_st && \old(E_M) == E_M) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && ((((((((((((T1_E == 0 || local < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < local) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || !(1 == m_pc)) || ((((t1_pc == 1 && m_st == 2) && token <= local) && local <= token) && \old(E_M) == E_M)) || 0 == E_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)) || !(1 == t1_i)) || !(2 == M_E)) || !(0 == m_pc)) [2018-11-18 13:05:38,039 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_811a4691-44fd-48a1-8c9b-3fb4fda61973/bin-2019/utaipan/witness.graphml [2018-11-18 13:05:38,039 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:05:38,040 INFO L168 Benchmark]: Toolchain (without parser) took 58299.61 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 959.1 MB in the beginning and 2.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 380.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:05:38,040 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:05:38,040 INFO L168 Benchmark]: CACSL2BoogieTranslator took 220.12 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 943.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:05:38,040 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.27 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:05:38,040 INFO L168 Benchmark]: Boogie Preprocessor took 58.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -194.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-18 13:05:38,041 INFO L168 Benchmark]: RCFGBuilder took 325.09 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: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-11-18 13:05:38,041 INFO L168 Benchmark]: TraceAbstraction took 57599.37 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -955.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-18 13:05:38,041 INFO L168 Benchmark]: Witness Printer took 79.75 ms. Allocated memory is still 2.5 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:05:38,042 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 220.12 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 943.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.27 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -194.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 325.09 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: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 57599.37 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -955.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 79.75 ms. Allocated memory is still 2.5 GB. Free memory is still 2.1 GB. There was no memory consumed. 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 || local < token) || !(2 == m_st)) || !(t1_pc == 1)) || token < local) || __retres1 == 1) || 0 == M_E) || 1 == M_E) || !(t1_st == 0)) || T1_E == 1) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || 0 == E_M) && (((!(1 == t1_i) || __retres1 == 1) || !(m_i == 1)) || ((((((((!(token == 0) || !(t1_pc == 0)) || !(0 == m_st)) || !(0 == local)) || !(2 == E_1)) || !(T1_E == 2)) || !(2 == M_E)) || !(0 == m_pc)) || !(2 == E_M)) || !(t1_st == 0))) && ((((((((((!(0 == local) || !(t1_pc == 1)) || !(T1_E == 2)) || __retres1 == 1) || !(2 == E_M)) || !(token == 0)) || t1_st < 2) || !(0 == m_st)) || !(2 == E_1)) || !(2 == M_E)) || !(0 == m_pc))) && ((((((((((local < token || !(2 == m_st)) || !(t1_pc == 1)) || token < local) || !(T1_E == 2)) || !(2 == E_M)) || !(t1_st == 2)) || __retres1 == 0) || !(1 == m_pc)) || !(2 == E_1)) || !(2 == M_E))) && ((((((((((local < token || !(2 == m_st)) || token < local) || !(T1_E == 2)) || __retres1 == 1) || !(2 == E_M)) || !(t1_st == 0)) || !(t1_pc == 0)) || !(1 == m_pc)) || !(2 == E_1)) || !(2 == M_E)) - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((((((((((((((E_1 == 2 && E_M == 2) && t1_pc == 1) && m_st == 2) && token <= local && local <= token) && t1_st == 2) || ((((E_M == 2 && t1_pc == 1) && 2 <= t1_st) && E_1 == 2) && (((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1)) || !(1 == t1_i)) || ((((((((token <= local + 1 && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && m_st == 0) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && 2 <= t1_st) && !(E_1 == 1))) || (((((((token <= local + 1 && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && t1_st == 2)) || (t1_st == 0 && ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && token <= local) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && local <= token)) || (((((((E_1 == 2 && t1_pc == 0) && t1_st == 0) && E_M == 2) && m_st == 0) && m_pc == 0) && token == 0) && local == 0)) || !(m_i == 1)) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || ((((t1_st == 0 && token <= local) && m_st == 2) && local <= token) && ((E_1 == 2 && E_M == 2) && t1_pc == 0) && tmp == 1)) || ((((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(2 == \old(E_1))) || !(T1_E == 2)) || !(2 == M_E)) || !(0 == \old(m_pc))) || !(2 == \old(E_M))) || !(\old(t1_st) == 0)) && ((((((((((((((((((((((((token <= local + 1 && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && t1_st == 2) || T1_E == 0) || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || ((((((((token <= local + 1 && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && m_st == 0) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && 2 <= t1_st) && !(E_1 == 1))) || (((((((((((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && token == \old(token)) && m_st == 0) && token <= local) && t1_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && local <= token) && !(m_pc == 1))) || 0 == \old(E_M)) || ((t1_st == 0 && ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && token <= local) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && local <= token) && m_pc == 1)) || 1 == \old(m_pc))) && ((((((((((((((((((((((token <= local + 1 && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && t1_st == 2) || T1_E == 0) || !(\old(t1_pc) == 1)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || !(0 == \old(m_st))) || T1_E == 1) || 1 == \old(E_1)) || \old(token) < \old(local) + 1) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || ((((((((token <= local + 1 && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && m_st == 0) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && 2 <= t1_st) && !(E_1 == 1))) || 0 == \old(E_M)) || \old(local) + 1 < \old(token)) || ((t1_st == 0 && ((((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && token <= local) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && local <= token) && m_pc == 1))) && (((((((((((((T1_E == 0 || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || (((((((token <= local + 1 && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && token == \old(token)) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && t1_st == 2) && local + 1 <= token)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 2)) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && ((((((((((\old(local) < \old(token) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((E_M == 2 && token == \old(token)) && t1_pc == 1) && m_st == 2) && t1_st == 2) && E_1 == 2) && token <= local) && local <= token)) || !(T1_E == 2)) || !(2 == \old(E_M))) || !(\old(t1_st) == 2)) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || !(2 == \old(E_1))) || !(2 == M_E)) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((0 == __retres1 || local < token) || token < local) || !(1 == M_E)) || ((((!(t1_st == 2) || !(2 == m_st)) || !(2 == E_1)) || !(t1_pc == 1)) || !(T1_E == 2)) || !(2 == E_M)) && (((((((((local < token || 0 == __retres1) || token < local) || !(T1_E == 2)) || !(2 == E_M)) || !(t1_st == 0)) || !(t1_pc == 0)) || !(1 == E_1)) || !(2 == M_E)) || !(0 == m_pc))) && (((((((((local < token || !(2 == m_st)) || !(t1_pc == 1)) || token < local) || __retres1 == 0) || !(T1_E == 2)) || !(2 == E_M)) || !(t1_st == 2)) || !(2 == E_1)) || !(2 == M_E))) && ((((((((((((T1_E == 0 || 0 == __retres1) || !(t1_pc == 1)) || 0 == M_E) || t1_st < 2) || !(0 == m_st)) || T1_E == 1) || 1 == E_1) || token < local + 1) || 0 == E_1) || 0 == E_M) || local + 1 < token) || 1 == m_pc)) && ((((((((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 || local < token) || !(t1_pc == 1)) || token < local) || 0 == __retres1) || 0 == M_E) || t1_st < 2) || !(0 == m_st)) || T1_E == 1) || 1 == E_1) || 0 == E_1) || 0 == E_M) || 1 == m_pc)) && ((0 == __retres1 || t1_st < 2) || ((((((((!(1 == E_1) || T1_E == 1) || T1_E == 0) || local < token) || !(t1_pc == 1)) || token < local) || 0 == E_M) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && (((!(1 == t1_i) || __retres1 == 0) || !(m_i == 1)) || ((((((((!(token == 0) || !(t1_pc == 0)) || !(0 == m_st)) || !(0 == local)) || !(2 == E_1)) || !(T1_E == 2)) || !(2 == M_E)) || !(0 == m_pc)) || !(2 == E_M)) || !(t1_st == 0)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: (((((((((((((!(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 && E_M == 2) && token == 0) && t1_pc == 0)) || !(1 == t1_i)) || !(2 == M_E)) || !(0 == m_pc)) && (((((((((local < \old(token) || !(2 == \old(m_st))) || \old(token) < local) || !(T1_E == 2)) || !(2 == \old(E_M))) || !(\old(t1_pc) == 0)) || !(1 == m_pc)) || !(2 == E_1)) || ((((E_M == 2 && token <= local) && m_st == 2) && t1_pc == 0) && local <= token)) || !(2 == M_E))) && (((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || (2 <= m_st && !(E_M == 0))) || 1 == m_pc) || 1 == M_E)) && (((((((((((((T1_E == 0 || local < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < local) || 0 == M_E) || ((token <= \old(token) + 1 && m_st == 2 && !(E_M == 0)) && local + 1 <= token)) || 1 == M_E) || T1_E == 1) || 1 == E_1) || ((token <= \old(token) + 1 && local + 1 <= token) && m_st == 0 && !(E_M == 0))) || !(1 == m_pc)) || 0 == E_1) || 0 == \old(E_M)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((\old(t1_st) < 2 || (((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == E_M) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) || ((((((((((((m_pc == 1 && !(T1_E == 1)) && !(M_E == 0)) && t1_pc == 1) && m_st == 2) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && !(M_E == 1)) && token <= local) && !(E_1 == 0)) && local <= token)) && ((((((((((((m_pc == 1 && m_st == 2) && E_1 == 2) && t1_st == 0) && token <= local) && local <= token) || !(\old(t1_st) == 0)) || !(m_i == 1)) || (((!(\old(token) == 0) || !(t1_pc == 0)) || !(0 == \old(local))) || !(T1_E == 2)) || !(2 == E_M)) || !(2 == \old(E_1))) || !(1 == t1_i)) || !(2 == M_E)) || !(0 == \old(m_pc)))) && ((\old(t1_st) < 2 || ((((((((((((m_pc == 1 && !(T1_E == 1)) && !(M_E == 0)) && t1_pc == 1) && m_st == 2) && !(E_M == 0)) && !(E_1 == 1)) && !(T1_E == 0)) && t1_st == 0) && !(M_E == 1)) && token <= local) && !(E_1 == 0)) && local <= token)) || ((((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || \old(token) < \old(local) + 1) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == E_M) || \old(local) + 1 < \old(token)) || 0 == M_E) || 1 == M_E) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((token <= local + 1 && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && t1_st == 2) || T1_E == 0) || \old(local) < \old(token)) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || T1_E == 1) || !(0 == \old(m_st))) || 1 == \old(E_1)) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || ((((((((token <= local + 1 && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && m_st == 0) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && 2 <= t1_st) && !(E_1 == 1))) || (((((((((((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && token == \old(token)) && m_st == 0) && token <= local) && t1_pc == 1) && 2 <= t1_st) && !(E_1 == 1)) && local <= token) && !(m_pc == 1))) || 0 == \old(E_M)) || 1 == \old(m_pc)) && (((((((((((((T1_E == 0 || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || (((((((token <= local + 1 && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && token == \old(token)) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && t1_st == 2) && local + 1 <= token)) || 0 == M_E) || 1 == M_E) || !(\old(t1_st) == 2)) || T1_E == 1) || \old(token) < \old(local) + 1) || 1 == \old(E_1)) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || \old(local) + 1 < \old(token)) || 0 == \old(E_M))) && ((((((!(1 == t1_i) || ((((((((token <= local + 1 && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && m_st == 0) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && 2 <= t1_st) && !(E_1 == 1))) || (((((((token <= local + 1 && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && t1_st == 2)) || !(m_i == 1)) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || ((((((E_M == 2 && t1_pc == 1) && m_st == 2) && t1_st == 2) && E_1 == 2) && token <= local) && local <= token)) || ((((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(2 == \old(E_1))) || !(T1_E == 2)) || !(2 == M_E)) || !(0 == \old(m_pc))) || !(2 == \old(E_M))) || !(\old(t1_st) == 0))) && (((((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E)) && ((((((((((\old(local) < \old(token) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < \old(local)) || (((((((E_M == 2 && token == \old(token)) && t1_pc == 1) && m_st == 2) && t1_st == 2) && E_1 == 2) && token <= local) && local <= token)) || !(T1_E == 2)) || !(2 == \old(E_M))) || !(\old(t1_st) == 2)) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || !(2 == \old(E_1))) || !(2 == M_E))) && (((((((((((((((((((((token <= local + 1 && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && m_st == 2) && !(E_1 == 1)) && t1_st == 2) || T1_E == 0) || !(\old(t1_pc) == 1)) || 0 == M_E) || 1 == M_E) || \old(t1_st) < 2) || !(0 == \old(m_st))) || T1_E == 1) || 1 == \old(E_1)) || \old(token) < \old(local) + 1) || (((((!(T1_E == 1) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && !(M_E == 1)) && 2 <= m_st) && !(E_1 == 1)) && !(m_pc == 1))) || 0 == \old(E_1)) || ((((((((token <= local + 1 && !(T1_E == 1)) && ((!(T1_E == 0) && !(M_E == 0)) && !(E_1 == 0)) && !(E_M == 0)) && m_st == 0) && local + 1 <= token) && !(M_E == 1)) && t1_pc == 1) && 2 <= t1_st) && !(E_1 == 1))) || 0 == \old(E_M)) || \old(local) + 1 < \old(token)) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (((((((((((((!(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)) || ((((E_M == 2 && m_st == 0) && t1_pc == 1) && 2 <= t1_st) && token == 0)) && (((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || (2 <= m_st && !(E_M == 0))) || 1 == m_pc) || 1 == M_E)) && (((((((((((((T1_E == 0 || local < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < local) || (((((t1_pc == 1 && m_st == 2) && !(E_M == 0)) && t1_st == 2) && token <= \old(token) + 1) && local + 1 <= token)) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || !(1 == m_pc)) || 0 == E_1) || 0 == \old(E_M)) || (((((m_st == 0 && t1_pc == 1) && !(E_M == 0)) && 2 <= t1_st) && token <= \old(token) + 1) && local + 1 <= token))) && ((((((((((((((E_M == 2 && t1_pc == 1) && m_st == 2) && t1_st == 2) && token <= local) && local <= token) || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || !(T1_E == 2)) || !(2 == \old(E_M))) || !(\old(t1_pc) == 0)) || !(1 == m_pc)) || !(2 == E_1)) || !(2 == M_E)) - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: ((((((((((local < \old(token) || !(2 == \old(m_st))) || \old(token) < local) || !(T1_E == 2)) || !(2 == \old(E_M))) || !(\old(t1_pc) == 0)) || !(1 == m_pc)) || !(2 == E_1)) || !(2 == M_E)) && ((((((((((2 <= m_st && \old(E_M) == E_M) || T1_E == 1) || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == \old(E_M)) || \old(m_st) < 2) || 0 == M_E) || 1 == m_pc) || 1 == M_E)) && ((((((((((((T1_E == 0 || local < \old(token)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || \old(token) < local) || 0 == M_E) || 1 == M_E) || T1_E == 1) || 1 == E_1) || !(1 == m_pc)) || ((((t1_pc == 1 && m_st == 2) && token <= local) && local <= token) && \old(E_M) == E_M)) || 0 == E_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)) || !(1 == t1_i)) || !(2 == M_E)) || !(0 == m_pc)) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((((((((((((token <= local + 1 && m_st == 0) && local + 1 <= token) && t1_pc == 1) && 2 <= t1_st) && (\old(T1_E) == T1_E && !(E_1 == 1)) && !(M_E == 1) && (!(M_E == 0) && !(E_1 == 0)) && !(E_M == 0)) || (((((((((E_M == 2 && m_st == 0) && m_pc == 0) && (\old(T1_E) == T1_E && !(E_1 == 1)) && !(M_E == 1) && (!(M_E == 0) && !(E_1 == 0)) && !(E_M == 0)) && M_E == 2) && E_1 == 2) && t1_st == 0) && token == 0) && local == 0) && t1_pc == 0)) || !(1 == t1_i)) || ((2 <= m_st && (\old(T1_E) == T1_E && !(E_1 == 1)) && !(M_E == 1) && (!(M_E == 0) && !(E_1 == 0)) && !(E_M == 0)) && !(m_pc == 1))) || ((((((m_st == 0 && token <= local) && t1_pc == 1) && 2 <= t1_st) && (\old(T1_E) == T1_E && !(E_1 == 1)) && !(M_E == 1) && (!(M_E == 0) && !(E_1 == 0)) && !(E_M == 0)) && local <= token) && !(m_pc == 1))) || ((((((((E_M == 2 && t1_pc == 1) && m_st == 2) && (\old(T1_E) == T1_E && !(E_1 == 1)) && !(M_E == 1) && (!(M_E == 0) && !(E_1 == 0)) && !(E_M == 0)) && t1_st == 2) && M_E == 2) && E_1 == 2) && token <= local) && local <= token)) || !(m_i == 1)) || (((((token <= local + 1 && local + 1 <= token) && t1_pc == 1) && m_st == 2) && (\old(T1_E) == T1_E && !(E_1 == 1)) && !(M_E == 1) && (!(M_E == 0) && !(E_1 == 0)) && !(E_M == 0)) && t1_st == 2)) || ((((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(2 == \old(E_1))) || !(\old(T1_E) == 2)) || !(2 == \old(M_E))) || !(0 == \old(m_pc))) || !(2 == \old(E_M))) || !(\old(t1_st) == 0) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((!(\old(t1_st) == 0) || !(m_i == 1)) || (((!(\old(token) == 0) || !(t1_pc == 0)) || !(0 == \old(local))) || !(T1_E == 2)) || !(2 == E_M)) || !(2 == \old(E_1))) || !(1 == t1_i)) || !(2 == M_E)) || !(0 == \old(m_pc))) && ((\old(t1_st) < 2 || ((((token <= local + 1 && \old(E_1) == E_1) && token == \old(token)) && 2 <= t1_st) && local + 1 <= token)) || ((((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || \old(token) < \old(local) + 1) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == E_M) || \old(local) + 1 < \old(token)) || 0 == M_E) || 1 == M_E)) && (\old(t1_st) < 2 || (((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == E_M) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == 0 || !(2 == m_st)) || !(t1_pc == 1)) || 0 == M_E) || !(t1_st == 2)) || T1_E == 1) || token < local + 1) || 1 == E_1) || 0 == E_1) || 0 == __retres1) || local + 1 < token) || 0 == E_M) && (((((((((((0 == __retres1 || t1_st < 2) || !(0 == m_st)) || T1_E == 1) || T1_E == 0) || 1 == E_1) || token < local + 1) || 0 == E_1) || !(t1_pc == 1)) || 0 == E_M) || local + 1 < token) || 0 == M_E)) && ((((((((T1_E == 1 || T1_E == 0) || 1 == E_1) || 0 == E_1) || 0 == E_M) || m_st < 2) || 0 == M_E) || 1 == m_pc) || 0 == __retres1)) && (((!(1 == t1_i) || !(m_i == 1)) || 0 == __retres1) || ((((((((!(token == 0) || !(t1_pc == 0)) || !(0 == m_st)) || !(0 == local)) || !(2 == E_1)) || !(T1_E == 2)) || !(2 == M_E)) || !(0 == m_pc)) || !(2 == E_M)) || !(t1_st == 0))) && (((((((((local < token || token < local) || !(T1_E == 2)) || !(2 == E_M)) || !(t1_st == 0)) || !(t1_pc == 0)) || !(1 == E_1)) || !(2 == M_E)) || !(0 == m_pc)) || 0 == __retres1)) && (((((((((((T1_E == 0 || !(2 == m_st)) || !(t1_pc == 1)) || 0 == __retres1) || 0 == M_E) || 1 == M_E) || T1_E == 1) || token < local + 1) || 1 == E_1) || 0 == E_1) || local + 1 < token) || 0 == E_M)) && ((((((((((((T1_E == 0 || local < token) || !(t1_pc == 1)) || token < local) || 0 == M_E) || t1_st < 2) || !(0 == m_st)) || T1_E == 1) || 1 == E_1) || 0 == __retres1) || 0 == E_1) || 0 == E_M) || 1 == m_pc)) && ((t1_st < 2 || 1 <= __retres1) || (((((((!(1 == E_1) || T1_E == 1) || T1_E == 0) || local < token) || !(t1_pc == 1)) || token < local) || 0 == E_M) || 0 == M_E) || 1 == M_E)) && (((((((((0 == __retres1 || local < token) || !(2 == m_st)) || !(t1_pc == 1)) || token < local) || !(T1_E == 2)) || !(2 == E_M)) || !(t1_st == 2)) || !(2 == E_1)) || !(2 == M_E))) && (((((((((((!(0 == m_st) || T1_E == 1) || T1_E == 0) || 1 == E_1) || token < local + 1) || 0 == E_1) || !(t1_pc == 1)) || 0 == E_M) || local + 1 < token) || 0 == M_E) || 0 == __retres1) || 1 == M_E)) && ((((local < token || token < local) || !(1 == M_E)) || 0 == __retres1) || ((((!(t1_st == 2) || !(2 == m_st)) || !(2 == E_1)) || !(t1_pc == 1)) || !(T1_E == 2)) || !(2 == E_M)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((!(M_E == 0) || !(1 == t1_i)) || !(m_i == 1)) || ((((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(2 == \old(E_1))) || !(\old(T1_E) == 2)) || !(2 == \old(M_E))) || !(0 == \old(m_pc))) || !(2 == \old(E_M))) || !(\old(t1_st) == 0) - InvariantResult [Line: 388]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((((((((((!(T1_E == 1) && \old(E_1) == E_1) && token == \old(token)) && !(M_E == 0)) && t1_pc == 1) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0)) && 2 <= t1_st) || \old(t1_st) < 2) || (((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == E_M) || 0 == M_E) || 1 == \old(m_pc)) || 1 == M_E) && (((((((!(\old(t1_st) == 0) || !(m_i == 1)) || (((!(\old(token) == 0) || !(t1_pc == 0)) || !(0 == \old(local))) || !(T1_E == 2)) || !(2 == E_M)) || !(2 == \old(E_1))) || !(1 == t1_i)) || !(2 == M_E)) || !(0 == \old(m_pc))) || ((((m_pc == 0 && E_1 == 2) && t1_st == 0) && token == 0) && local == 0))) && (((\old(t1_st) < 2 || (2 <= t1_st && (((((((((!(T1_E == 1) && \old(E_1) == E_1) && token == \old(token)) && !(M_E == 0)) && t1_pc == 1) && !(E_M == 0)) && !(E_1 == 1)) && !(m_pc == 1)) && !(T1_E == 0)) && !(M_E == 1)) && !(E_1 == 0))) || ((((token <= local + 1 && \old(E_1) == E_1) && token == \old(token)) && 2 <= t1_st) && local + 1 <= token)) || ((((((((T1_E == 1 || T1_E == 0) || 1 == \old(E_1)) || \old(token) < \old(local) + 1) || 0 == \old(E_1)) || !(t1_pc == 1)) || 0 == E_M) || \old(local) + 1 < \old(token)) || 0 == M_E) || 1 == M_E) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 148 locations, 1 error locations. SAFE Result, 57.5s OverallTime, 22 OverallIterations, 6 TraceHistogramMax, 32.1s AutomataDifference, 0.0s DeadEndRemovalTime, 16.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 4767 SDtfs, 7028 SDslu, 24743 SDs, 0 SdLazy, 14288 SolverSat, 2375 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 3539 GetRequests, 2989 SyntacticMatches, 32 SemanticMatches, 518 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14178 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2555occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.3s AbstIntTime, 9 AbstIntIterations, 5 AbstIntStrong, 0.9840728867158877 AbsIntWeakeningRatio, 0.5069033530571992 AbsIntAvgWeakeningVarsNumRemoved, 10.391518737672584 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 486 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 5134 PreInvPairs, 5963 NumberOfFragments, 14804 HoareAnnotationTreeSize, 5134 FomulaSimplifications, 131208 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 62 FomulaSimplificationsInter, 67077 FormulaSimplificationTreeSizeReductionInter, 14.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 4323 NumberOfCodeBlocks, 4216 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 5394 ConstructedInterpolants, 0 QuantifiedInterpolants, 1309675 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3707 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 32 InterpolantComputations, 17 PerfectInterpolantSequences, 3502/3628 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...