./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/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 e3d58fadf54daed6107b58402b79d250d23d0301 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 01:48:45,257 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 01:48:45,258 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 01:48:45,264 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 01:48:45,264 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 01:48:45,265 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 01:48:45,265 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 01:48:45,266 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 01:48:45,267 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 01:48:45,267 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 01:48:45,268 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 01:48:45,268 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 01:48:45,268 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 01:48:45,269 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 01:48:45,269 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 01:48:45,269 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 01:48:45,270 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 01:48:45,271 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 01:48:45,272 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 01:48:45,272 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 01:48:45,273 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 01:48:45,273 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 01:48:45,274 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 01:48:45,275 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 01:48:45,275 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 01:48:45,275 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 01:48:45,276 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 01:48:45,276 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 01:48:45,276 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 01:48:45,277 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 01:48:45,277 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 01:48:45,277 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 01:48:45,277 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 01:48:45,277 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 01:48:45,278 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 01:48:45,278 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 01:48:45,278 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 01:48:45,286 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 01:48:45,286 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 01:48:45,286 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 01:48:45,286 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 01:48:45,286 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 01:48:45,287 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 01:48:45,287 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 01:48:45,287 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 01:48:45,287 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 01:48:45,287 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 01:48:45,287 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 01:48:45,287 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 01:48:45,287 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 01:48:45,288 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 01:48:45,288 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 01:48:45,288 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 01:48:45,288 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 01:48:45,288 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 01:48:45,288 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 01:48:45,288 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 01:48:45,288 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 01:48:45,288 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 01:48:45,288 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 01:48:45,288 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 01:48:45,289 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 01:48:45,289 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 01:48:45,289 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 01:48:45,289 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 01:48:45,289 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 01:48:45,289 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 01:48:45,289 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 01:48:45,289 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 01:48:45,289 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 01:48:45,289 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 01:48:45,290 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 01:48:45,290 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 01:48:45,290 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_c4fe49f9-cb54-49b0-9a21-60da664afe6b/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 -> e3d58fadf54daed6107b58402b79d250d23d0301 [2018-12-03 01:48:45,308 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 01:48:45,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 01:48:45,319 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 01:48:45,320 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 01:48:45,321 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 01:48:45,321 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/bin-2019/utaipan/../../sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c [2018-12-03 01:48:45,364 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/bin-2019/utaipan/data/857d67738/4b5a614e358248c69e9edd913e3ca600/FLAG05a8f2713 [2018-12-03 01:48:45,697 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 01:48:45,697 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/sv-benchmarks/c/systemc/token_ring.02_true-unreach-call_false-termination.cil.c [2018-12-03 01:48:45,702 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/bin-2019/utaipan/data/857d67738/4b5a614e358248c69e9edd913e3ca600/FLAG05a8f2713 [2018-12-03 01:48:45,712 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/bin-2019/utaipan/data/857d67738/4b5a614e358248c69e9edd913e3ca600 [2018-12-03 01:48:45,714 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 01:48:45,715 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 01:48:45,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 01:48:45,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 01:48:45,718 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 01:48:45,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:48:45" (1/1) ... [2018-12-03 01:48:45,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65c40e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:48:45, skipping insertion in model container [2018-12-03 01:48:45,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:48:45" (1/1) ... [2018-12-03 01:48:45,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 01:48:45,748 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 01:48:45,863 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:48:45,867 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 01:48:45,889 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:48:45,899 INFO L195 MainTranslator]: Completed translation [2018-12-03 01:48:45,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:48:45 WrapperNode [2018-12-03 01:48:45,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 01:48:45,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 01:48:45,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 01:48:45,900 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 01:48:45,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:48:45" (1/1) ... [2018-12-03 01:48:45,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:48:45" (1/1) ... [2018-12-03 01:48:45,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 01:48:45,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 01:48:45,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 01:48:45,944 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 01:48:45,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:48:45" (1/1) ... [2018-12-03 01:48:45,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:48:45" (1/1) ... [2018-12-03 01:48:45,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:48:45" (1/1) ... [2018-12-03 01:48:45,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:48:45" (1/1) ... [2018-12-03 01:48:45,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:48:45" (1/1) ... [2018-12-03 01:48:45,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:48:45" (1/1) ... [2018-12-03 01:48:45,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:48:45" (1/1) ... [2018-12-03 01:48:45,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 01:48:45,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 01:48:45,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 01:48:45,964 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 01:48:45,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:48:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/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-12-03 01:48:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2018-12-03 01:48:45,994 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2018-12-03 01:48:45,994 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2018-12-03 01:48:45,994 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2018-12-03 01:48:45,995 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 01:48:45,995 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 01:48:45,995 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-12-03 01:48:45,995 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-12-03 01:48:45,995 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-12-03 01:48:45,995 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-12-03 01:48:45,995 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2018-12-03 01:48:45,995 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2018-12-03 01:48:45,995 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-12-03 01:48:45,995 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-12-03 01:48:45,995 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2018-12-03 01:48:45,995 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2018-12-03 01:48:45,995 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2018-12-03 01:48:45,995 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2018-12-03 01:48:45,995 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-12-03 01:48:45,996 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-12-03 01:48:45,996 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2018-12-03 01:48:45,996 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2018-12-03 01:48:45,996 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-12-03 01:48:45,996 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-12-03 01:48:45,996 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-12-03 01:48:45,996 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-12-03 01:48:45,996 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2018-12-03 01:48:45,996 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2018-12-03 01:48:45,996 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-12-03 01:48:45,996 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-12-03 01:48:45,997 INFO L130 BoogieDeclarations]: Found specification of procedure master [2018-12-03 01:48:45,997 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2018-12-03 01:48:45,997 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2018-12-03 01:48:45,997 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2018-12-03 01:48:45,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 01:48:45,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 01:48:45,997 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-12-03 01:48:45,997 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-12-03 01:48:45,997 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-12-03 01:48:45,997 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-12-03 01:48:45,997 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-12-03 01:48:45,998 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-12-03 01:48:45,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 01:48:45,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 01:48:45,998 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-12-03 01:48:45,998 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-12-03 01:48:46,263 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 01:48:46,263 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-03 01:48:46,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:48:46 BoogieIcfgContainer [2018-12-03 01:48:46,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 01:48:46,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 01:48:46,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 01:48:46,266 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 01:48:46,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 01:48:45" (1/3) ... [2018-12-03 01:48:46,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e9bb20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:48:46, skipping insertion in model container [2018-12-03 01:48:46,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:48:45" (2/3) ... [2018-12-03 01:48:46,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e9bb20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:48:46, skipping insertion in model container [2018-12-03 01:48:46,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:48:46" (3/3) ... [2018-12-03 01:48:46,268 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.02_true-unreach-call_false-termination.cil.c [2018-12-03 01:48:46,274 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 01:48:46,278 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 01:48:46,287 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 01:48:46,305 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 01:48:46,305 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 01:48:46,305 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 01:48:46,305 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 01:48:46,306 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 01:48:46,306 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 01:48:46,306 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 01:48:46,306 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 01:48:46,318 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2018-12-03 01:48:46,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 01:48:46,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:46,324 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:46,325 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:46,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:46,329 INFO L82 PathProgramCache]: Analyzing trace with hash -698129678, now seen corresponding path program 1 times [2018-12-03 01:48:46,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:46,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:46,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:46,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:46,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:48:46,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:46,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:48:46,498 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:46,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:48:46,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:48:46,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:46,511 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 5 states. [2018-12-03 01:48:46,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:46,817 INFO L93 Difference]: Finished difference Result 361 states and 527 transitions. [2018-12-03 01:48:46,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:48:46,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-03 01:48:46,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:46,830 INFO L225 Difference]: With dead ends: 361 [2018-12-03 01:48:46,830 INFO L226 Difference]: Without dead ends: 195 [2018-12-03 01:48:46,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:48:46,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-03 01:48:46,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2018-12-03 01:48:46,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 01:48:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2018-12-03 01:48:46,872 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 91 [2018-12-03 01:48:46,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:46,872 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2018-12-03 01:48:46,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:48:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2018-12-03 01:48:46,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 01:48:46,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:46,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:46,875 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:46,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:46,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1190755852, now seen corresponding path program 1 times [2018-12-03 01:48:46,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:46,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:46,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:46,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:46,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:48:46,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:46,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:48:46,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:46,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:48:46,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:48:46,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:46,960 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand 5 states. [2018-12-03 01:48:47,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:47,195 INFO L93 Difference]: Finished difference Result 340 states and 474 transitions. [2018-12-03 01:48:47,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:48:47,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-03 01:48:47,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:47,198 INFO L225 Difference]: With dead ends: 340 [2018-12-03 01:48:47,198 INFO L226 Difference]: Without dead ends: 195 [2018-12-03 01:48:47,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:48:47,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-03 01:48:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2018-12-03 01:48:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 01:48:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2018-12-03 01:48:47,217 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 91 [2018-12-03 01:48:47,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:47,218 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2018-12-03 01:48:47,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:48:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2018-12-03 01:48:47,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 01:48:47,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:47,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:47,220 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:47,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:47,220 INFO L82 PathProgramCache]: Analyzing trace with hash -236815694, now seen corresponding path program 1 times [2018-12-03 01:48:47,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:47,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:47,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:47,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:47,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:48:47,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:47,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:48:47,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:47,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:48:47,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:48:47,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:47,282 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand 5 states. [2018-12-03 01:48:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:47,491 INFO L93 Difference]: Finished difference Result 338 states and 468 transitions. [2018-12-03 01:48:47,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:48:47,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-03 01:48:47,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:47,492 INFO L225 Difference]: With dead ends: 338 [2018-12-03 01:48:47,492 INFO L226 Difference]: Without dead ends: 193 [2018-12-03 01:48:47,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:48:47,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-03 01:48:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 165. [2018-12-03 01:48:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 01:48:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2018-12-03 01:48:47,506 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 91 [2018-12-03 01:48:47,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:47,507 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2018-12-03 01:48:47,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:48:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2018-12-03 01:48:47,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 01:48:47,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:47,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:47,508 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:47,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:47,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1452969420, now seen corresponding path program 1 times [2018-12-03 01:48:47,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:47,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:47,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:47,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:47,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:47,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:48:47,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:47,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:48:47,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:47,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:48:47,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:48:47,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:47,556 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand 5 states. [2018-12-03 01:48:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:47,774 INFO L93 Difference]: Finished difference Result 355 states and 494 transitions. [2018-12-03 01:48:47,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:48:47,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-03 01:48:47,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:47,775 INFO L225 Difference]: With dead ends: 355 [2018-12-03 01:48:47,775 INFO L226 Difference]: Without dead ends: 210 [2018-12-03 01:48:47,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:48:47,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-03 01:48:47,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 165. [2018-12-03 01:48:47,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 01:48:47,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 219 transitions. [2018-12-03 01:48:47,786 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 219 transitions. Word has length 91 [2018-12-03 01:48:47,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:47,786 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 219 transitions. [2018-12-03 01:48:47,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:48:47,786 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 219 transitions. [2018-12-03 01:48:47,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 01:48:47,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:47,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:47,787 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:47,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:47,788 INFO L82 PathProgramCache]: Analyzing trace with hash 2110030450, now seen corresponding path program 1 times [2018-12-03 01:48:47,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:47,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:47,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:47,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:47,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:48:47,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:47,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:48:47,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:47,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:48:47,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:48:47,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:47,821 INFO L87 Difference]: Start difference. First operand 165 states and 219 transitions. Second operand 5 states. [2018-12-03 01:48:48,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:48,072 INFO L93 Difference]: Finished difference Result 349 states and 483 transitions. [2018-12-03 01:48:48,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:48:48,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-03 01:48:48,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:48,074 INFO L225 Difference]: With dead ends: 349 [2018-12-03 01:48:48,074 INFO L226 Difference]: Without dead ends: 204 [2018-12-03 01:48:48,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:48:48,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-03 01:48:48,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 165. [2018-12-03 01:48:48,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 01:48:48,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 218 transitions. [2018-12-03 01:48:48,087 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 218 transitions. Word has length 91 [2018-12-03 01:48:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:48,087 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 218 transitions. [2018-12-03 01:48:48,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:48:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 218 transitions. [2018-12-03 01:48:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 01:48:48,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:48,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:48,089 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:48,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:48,089 INFO L82 PathProgramCache]: Analyzing trace with hash 423850612, now seen corresponding path program 1 times [2018-12-03 01:48:48,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:48,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:48,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:48,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:48,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:48:48,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:48,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:48:48,140 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:48,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:48:48,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:48:48,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:48:48,141 INFO L87 Difference]: Start difference. First operand 165 states and 218 transitions. Second operand 5 states. [2018-12-03 01:48:48,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:48,390 INFO L93 Difference]: Finished difference Result 351 states and 482 transitions. [2018-12-03 01:48:48,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:48:48,391 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-03 01:48:48,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:48,392 INFO L225 Difference]: With dead ends: 351 [2018-12-03 01:48:48,392 INFO L226 Difference]: Without dead ends: 206 [2018-12-03 01:48:48,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:48:48,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-03 01:48:48,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 165. [2018-12-03 01:48:48,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 01:48:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 217 transitions. [2018-12-03 01:48:48,403 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 217 transitions. Word has length 91 [2018-12-03 01:48:48,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:48,403 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 217 transitions. [2018-12-03 01:48:48,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:48:48,403 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 217 transitions. [2018-12-03 01:48:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 01:48:48,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:48,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:48,404 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:48,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:48,404 INFO L82 PathProgramCache]: Analyzing trace with hash 369457714, now seen corresponding path program 1 times [2018-12-03 01:48:48,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:48,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:48,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:48,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:48,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:48,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:48:48,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:48,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:48:48,437 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:48,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:48:48,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:48:48,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:48,438 INFO L87 Difference]: Start difference. First operand 165 states and 217 transitions. Second operand 4 states. [2018-12-03 01:48:48,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:48,565 INFO L93 Difference]: Finished difference Result 445 states and 612 transitions. [2018-12-03 01:48:48,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:48:48,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-03 01:48:48,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:48,567 INFO L225 Difference]: With dead ends: 445 [2018-12-03 01:48:48,567 INFO L226 Difference]: Without dead ends: 301 [2018-12-03 01:48:48,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:48:48,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-12-03 01:48:48,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2018-12-03 01:48:48,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-12-03 01:48:48,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 393 transitions. [2018-12-03 01:48:48,594 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 393 transitions. Word has length 91 [2018-12-03 01:48:48,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:48,594 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 393 transitions. [2018-12-03 01:48:48,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:48:48,594 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 393 transitions. [2018-12-03 01:48:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 01:48:48,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:48,596 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-03 01:48:48,596 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:48,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:48,596 INFO L82 PathProgramCache]: Analyzing trace with hash -515079540, now seen corresponding path program 1 times [2018-12-03 01:48:48,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:48,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:48,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:48,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:48,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:48,650 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-03 01:48:48,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:48:48,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:48:48,651 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2018-12-03 01:48:48,652 INFO L205 CegarAbsIntRunner]: [29], [31], [34], [39], [42], [47], [50], [54], [56], [86], [89], [103], [104], [107], [113], [119], [125], [131], [137], [141], [142], [145], [148], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [278], [291], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-03 01:48:48,673 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:48:48,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:48:48,774 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 01:48:48,775 INFO L272 AbstractInterpreter]: Visited 41 different actions 41 times. Never merged. Never widened. Performed 385 root evaluator evaluations with a maximum evaluation depth of 3. Performed 385 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 40 variables. [2018-12-03 01:48:48,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:48,780 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 01:48:48,882 INFO L227 lantSequenceWeakener]: Weakened 39 states. On average, predicates are now at 69.09% of their original sizes. [2018-12-03 01:48:48,882 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 01:48:48,941 INFO L418 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2018-12-03 01:48:48,941 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 01:48:48,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 01:48:48,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-12-03 01:48:48,942 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:48,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 01:48:48,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 01:48:48,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:48:48,943 INFO L87 Difference]: Start difference. First operand 300 states and 393 transitions. Second operand 10 states. [2018-12-03 01:48:49,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:49,771 INFO L93 Difference]: Finished difference Result 689 states and 918 transitions. [2018-12-03 01:48:49,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 01:48:49,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 145 [2018-12-03 01:48:49,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:49,773 INFO L225 Difference]: With dead ends: 689 [2018-12-03 01:48:49,773 INFO L226 Difference]: Without dead ends: 404 [2018-12-03 01:48:49,774 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 148 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-03 01:48:49,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-12-03 01:48:49,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 396. [2018-12-03 01:48:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-12-03 01:48:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 507 transitions. [2018-12-03 01:48:49,811 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 507 transitions. Word has length 145 [2018-12-03 01:48:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:49,812 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 507 transitions. [2018-12-03 01:48:49,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 01:48:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 507 transitions. [2018-12-03 01:48:49,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-03 01:48:49,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:49,813 INFO L402 BasicCegarLoop]: trace histogram [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, 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-12-03 01:48:49,814 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:49,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:49,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1214533374, now seen corresponding path program 1 times [2018-12-03 01:48:49,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:49,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:49,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:49,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:49,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:49,871 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-03 01:48:49,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:48:49,871 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:48:49,871 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 165 with the following transitions: [2018-12-03 01:48:49,872 INFO L205 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [42], [47], [50], [54], [56], [59], [75], [77], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [265], [278], [282], [285], [291], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-03 01:48:49,875 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:48:49,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:48:49,901 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 01:48:49,902 INFO L272 AbstractInterpreter]: Visited 52 different actions 52 times. Never merged. Never widened. Performed 437 root evaluator evaluations with a maximum evaluation depth of 3. Performed 437 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 40 variables. [2018-12-03 01:48:49,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:49,903 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 01:48:49,941 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 67.8% of their original sizes. [2018-12-03 01:48:49,941 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 01:48:50,020 INFO L418 sIntCurrentIteration]: We unified 163 AI predicates to 163 [2018-12-03 01:48:50,020 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 01:48:50,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 01:48:50,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-12-03 01:48:50,020 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:50,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 01:48:50,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 01:48:50,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-12-03 01:48:50,021 INFO L87 Difference]: Start difference. First operand 396 states and 507 transitions. Second operand 15 states. [2018-12-03 01:48:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:51,218 INFO L93 Difference]: Finished difference Result 777 states and 1004 transitions. [2018-12-03 01:48:51,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 01:48:51,218 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 164 [2018-12-03 01:48:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:51,220 INFO L225 Difference]: With dead ends: 777 [2018-12-03 01:48:51,220 INFO L226 Difference]: Without dead ends: 402 [2018-12-03 01:48:51,221 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 172 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2018-12-03 01:48:51,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-12-03 01:48:51,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 394. [2018-12-03 01:48:51,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-12-03 01:48:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 500 transitions. [2018-12-03 01:48:51,254 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 500 transitions. Word has length 164 [2018-12-03 01:48:51,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:51,254 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 500 transitions. [2018-12-03 01:48:51,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 01:48:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 500 transitions. [2018-12-03 01:48:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-03 01:48:51,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:51,256 INFO L402 BasicCegarLoop]: trace histogram [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, 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] [2018-12-03 01:48:51,256 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:51,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:51,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1162528349, now seen corresponding path program 1 times [2018-12-03 01:48:51,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:51,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:51,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:51,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:51,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:51,311 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-12-03 01:48:51,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:48:51,312 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:48:51,312 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 166 with the following transitions: [2018-12-03 01:48:51,312 INFO L205 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [42], [44], [47], [50], [54], [56], [59], [75], [77], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [278], [282], [285], [291], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-03 01:48:51,314 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:48:51,315 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:48:51,340 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 01:48:51,340 INFO L272 AbstractInterpreter]: Visited 62 different actions 62 times. Never merged. Never widened. Performed 486 root evaluator evaluations with a maximum evaluation depth of 3. Performed 486 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 40 variables. [2018-12-03 01:48:51,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:51,341 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 01:48:51,395 INFO L227 lantSequenceWeakener]: Weakened 57 states. On average, predicates are now at 66.11% of their original sizes. [2018-12-03 01:48:51,395 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 01:48:51,534 INFO L418 sIntCurrentIteration]: We unified 164 AI predicates to 164 [2018-12-03 01:48:51,534 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 01:48:51,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 01:48:51,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [6] total 23 [2018-12-03 01:48:51,535 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:51,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 01:48:51,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 01:48:51,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2018-12-03 01:48:51,535 INFO L87 Difference]: Start difference. First operand 394 states and 500 transitions. Second operand 19 states. [2018-12-03 01:48:53,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:53,356 INFO L93 Difference]: Finished difference Result 775 states and 990 transitions. [2018-12-03 01:48:53,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 01:48:53,356 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 165 [2018-12-03 01:48:53,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:53,358 INFO L225 Difference]: With dead ends: 775 [2018-12-03 01:48:53,358 INFO L226 Difference]: Without dead ends: 402 [2018-12-03 01:48:53,359 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 178 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=215, Invalid=841, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 01:48:53,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-12-03 01:48:53,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 394. [2018-12-03 01:48:53,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-12-03 01:48:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 498 transitions. [2018-12-03 01:48:53,390 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 498 transitions. Word has length 165 [2018-12-03 01:48:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:53,390 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 498 transitions. [2018-12-03 01:48:53,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 01:48:53,390 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 498 transitions. [2018-12-03 01:48:53,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-03 01:48:53,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:53,392 INFO L402 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:48:53,392 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:53,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:53,392 INFO L82 PathProgramCache]: Analyzing trace with hash 2051811056, now seen corresponding path program 1 times [2018-12-03 01:48:53,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:53,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:53,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:53,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:53,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-03 01:48:53,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:48:53,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:48:53,438 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:53,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:48:53,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:48:53,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:48:53,438 INFO L87 Difference]: Start difference. First operand 394 states and 498 transitions. Second operand 6 states. [2018-12-03 01:48:53,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:48:53,477 INFO L93 Difference]: Finished difference Result 685 states and 906 transitions. [2018-12-03 01:48:53,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:48:53,478 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2018-12-03 01:48:53,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:48:53,479 INFO L225 Difference]: With dead ends: 685 [2018-12-03 01:48:53,479 INFO L226 Difference]: Without dead ends: 407 [2018-12-03 01:48:53,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:48:53,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-12-03 01:48:53,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 399. [2018-12-03 01:48:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-12-03 01:48:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 502 transitions. [2018-12-03 01:48:53,498 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 502 transitions. Word has length 165 [2018-12-03 01:48:53,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:48:53,498 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 502 transitions. [2018-12-03 01:48:53,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:48:53,498 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 502 transitions. [2018-12-03 01:48:53,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 01:48:53,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:48:53,499 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-03 01:48:53,499 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:48:53,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:53,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1240585105, now seen corresponding path program 1 times [2018-12-03 01:48:53,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:48:53,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:53,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:48:53,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:48:53,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:48:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:48:53,532 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 01:48:53,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:48:53,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:48:53,533 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2018-12-03 01:48:53,533 INFO L205 CegarAbsIntRunner]: [29], [31], [36], [39], [42], [44], [47], [50], [52], [54], [56], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [278], [291], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-03 01:48:53,535 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:48:53,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:48:53,576 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 01:48:53,576 INFO L272 AbstractInterpreter]: Visited 102 different actions 134 times. Never merged. Never widened. Performed 900 root evaluator evaluations with a maximum evaluation depth of 3. Performed 900 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 40 variables. [2018-12-03 01:48:53,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:48:53,578 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 01:48:53,656 INFO L227 lantSequenceWeakener]: Weakened 137 states. On average, predicates are now at 79.84% of their original sizes. [2018-12-03 01:48:53,656 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 01:48:54,150 INFO L418 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2018-12-03 01:48:54,150 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 01:48:54,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 01:48:54,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [4] total 56 [2018-12-03 01:48:54,151 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:48:54,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 01:48:54,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 01:48:54,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2563, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 01:48:54,152 INFO L87 Difference]: Start difference. First operand 399 states and 502 transitions. Second operand 54 states. [2018-12-03 01:49:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:03,569 INFO L93 Difference]: Finished difference Result 1798 states and 2515 transitions. [2018-12-03 01:49:03,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 01:49:03,570 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 145 [2018-12-03 01:49:03,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:03,575 INFO L225 Difference]: With dead ends: 1798 [2018-12-03 01:49:03,575 INFO L226 Difference]: Without dead ends: 1421 [2018-12-03 01:49:03,581 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 227 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6417 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1662, Invalid=16970, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 01:49:03,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2018-12-03 01:49:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1359. [2018-12-03 01:49:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1359 states. [2018-12-03 01:49:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1800 transitions. [2018-12-03 01:49:03,682 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1800 transitions. Word has length 145 [2018-12-03 01:49:03,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:03,682 INFO L480 AbstractCegarLoop]: Abstraction has 1359 states and 1800 transitions. [2018-12-03 01:49:03,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 01:49:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1800 transitions. [2018-12-03 01:49:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 01:49:03,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:03,683 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-03 01:49:03,684 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:03,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:03,684 INFO L82 PathProgramCache]: Analyzing trace with hash 321546296, now seen corresponding path program 1 times [2018-12-03 01:49:03,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:03,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:03,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:03,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:03,685 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-03 01:49:03,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:49:03,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:49:03,719 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:03,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:49:03,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:49:03,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:49:03,719 INFO L87 Difference]: Start difference. First operand 1359 states and 1800 transitions. Second operand 5 states. [2018-12-03 01:49:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:04,179 INFO L93 Difference]: Finished difference Result 3262 states and 4615 transitions. [2018-12-03 01:49:04,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:49:04,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2018-12-03 01:49:04,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:04,187 INFO L225 Difference]: With dead ends: 3262 [2018-12-03 01:49:04,187 INFO L226 Difference]: Without dead ends: 2104 [2018-12-03 01:49:04,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:49:04,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states. [2018-12-03 01:49:04,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 2040. [2018-12-03 01:49:04,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2040 states. [2018-12-03 01:49:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 2753 transitions. [2018-12-03 01:49:04,309 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 2753 transitions. Word has length 152 [2018-12-03 01:49:04,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:04,310 INFO L480 AbstractCegarLoop]: Abstraction has 2040 states and 2753 transitions. [2018-12-03 01:49:04,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:49:04,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2753 transitions. [2018-12-03 01:49:04,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-03 01:49:04,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:04,312 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-03 01:49:04,312 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:04,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:04,312 INFO L82 PathProgramCache]: Analyzing trace with hash 348520683, now seen corresponding path program 1 times [2018-12-03 01:49:04,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:04,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:04,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:04,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:04,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:04,362 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-03 01:49:04,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:04,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:04,363 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2018-12-03 01:49:04,363 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [269], [272], [282], [285], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-03 01:49:04,365 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:04,365 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:04,410 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 01:49:04,410 INFO L272 AbstractInterpreter]: Visited 114 different actions 147 times. Never merged. Never widened. Performed 1000 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1000 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-12-03 01:49:04,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:04,412 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 01:49:04,472 INFO L227 lantSequenceWeakener]: Weakened 149 states. On average, predicates are now at 76.11% of their original sizes. [2018-12-03 01:49:04,472 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 01:49:04,987 INFO L418 sIntCurrentIteration]: We unified 195 AI predicates to 195 [2018-12-03 01:49:04,987 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 01:49:04,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 01:49:04,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [6] total 58 [2018-12-03 01:49:04,987 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:04,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 01:49:04,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 01:49:04,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=2546, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 01:49:04,988 INFO L87 Difference]: Start difference. First operand 2040 states and 2753 transitions. Second operand 54 states. [2018-12-03 01:49:12,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:12,447 INFO L93 Difference]: Finished difference Result 4234 states and 6031 transitions. [2018-12-03 01:49:12,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 01:49:12,447 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 196 [2018-12-03 01:49:12,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:12,453 INFO L225 Difference]: With dead ends: 4234 [2018-12-03 01:49:12,454 INFO L226 Difference]: Without dead ends: 2888 [2018-12-03 01:49:12,458 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 258 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4417 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1185, Invalid=12387, Unknown=0, NotChecked=0, Total=13572 [2018-12-03 01:49:12,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2018-12-03 01:49:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2783. [2018-12-03 01:49:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2783 states. [2018-12-03 01:49:12,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2783 states and 3756 transitions. [2018-12-03 01:49:12,620 INFO L78 Accepts]: Start accepts. Automaton has 2783 states and 3756 transitions. Word has length 196 [2018-12-03 01:49:12,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:12,621 INFO L480 AbstractCegarLoop]: Abstraction has 2783 states and 3756 transitions. [2018-12-03 01:49:12,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 01:49:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 3756 transitions. [2018-12-03 01:49:12,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-03 01:49:12,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:12,624 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12-03 01:49:12,624 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:12,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:12,624 INFO L82 PathProgramCache]: Analyzing trace with hash 272949603, now seen corresponding path program 1 times [2018-12-03 01:49:12,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:12,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:12,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:12,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:12,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 26 proven. 20 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-03 01:49:12,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:12,689 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:12,690 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 210 with the following transitions: [2018-12-03 01:49:12,690 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [278], [282], [285], [291], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-03 01:49:12,691 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:12,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:12,757 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 01:49:12,757 INFO L272 AbstractInterpreter]: Visited 118 different actions 166 times. Merged at 6 different actions 6 times. Never widened. Performed 1344 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1344 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-12-03 01:49:12,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:12,759 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 01:49:12,873 INFO L227 lantSequenceWeakener]: Weakened 161 states. On average, predicates are now at 76.92% of their original sizes. [2018-12-03 01:49:12,873 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 01:49:13,571 INFO L418 sIntCurrentIteration]: We unified 208 AI predicates to 208 [2018-12-03 01:49:13,572 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 01:49:13,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 01:49:13,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [10] total 73 [2018-12-03 01:49:13,572 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:13,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 01:49:13,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 01:49:13,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=3675, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 01:49:13,573 INFO L87 Difference]: Start difference. First operand 2783 states and 3756 transitions. Second operand 65 states. [2018-12-03 01:49:25,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:25,228 INFO L93 Difference]: Finished difference Result 5229 states and 7150 transitions. [2018-12-03 01:49:25,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 01:49:25,228 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 209 [2018-12-03 01:49:25,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:25,235 INFO L225 Difference]: With dead ends: 5229 [2018-12-03 01:49:25,235 INFO L226 Difference]: Without dead ends: 2866 [2018-12-03 01:49:25,243 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 289 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7225 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1728, Invalid=19442, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 01:49:25,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2866 states. [2018-12-03 01:49:25,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2866 to 2824. [2018-12-03 01:49:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2018-12-03 01:49:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3772 transitions. [2018-12-03 01:49:25,383 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3772 transitions. Word has length 209 [2018-12-03 01:49:25,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:25,383 INFO L480 AbstractCegarLoop]: Abstraction has 2824 states and 3772 transitions. [2018-12-03 01:49:25,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 01:49:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3772 transitions. [2018-12-03 01:49:25,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-03 01:49:25,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:25,386 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:25,386 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:25,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:25,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1614110952, now seen corresponding path program 1 times [2018-12-03 01:49:25,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:25,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:25,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:25,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:25,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-12-03 01:49:25,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:25,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:25,423 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-12-03 01:49:25,423 INFO L205 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [42], [44], [47], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [91], [94], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [265], [269], [275], [282], [285], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-03 01:49:25,424 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:25,424 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:25,465 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 01:49:25,465 INFO L272 AbstractInterpreter]: Visited 116 different actions 167 times. Merged at 11 different actions 11 times. Never widened. Performed 1177 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1177 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-03 01:49:25,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:25,467 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 01:49:25,561 INFO L227 lantSequenceWeakener]: Weakened 168 states. On average, predicates are now at 76.3% of their original sizes. [2018-12-03 01:49:25,562 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 01:49:26,861 INFO L418 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2018-12-03 01:49:26,861 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 01:49:26,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 01:49:26,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [64] imperfect sequences [3] total 65 [2018-12-03 01:49:26,862 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:26,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 01:49:26,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 01:49:26,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=3644, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 01:49:26,865 INFO L87 Difference]: Start difference. First operand 2824 states and 3772 transitions. Second operand 64 states. [2018-12-03 01:49:41,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:41,001 INFO L93 Difference]: Finished difference Result 3998 states and 5427 transitions. [2018-12-03 01:49:41,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 01:49:41,001 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 211 [2018-12-03 01:49:41,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:41,005 INFO L225 Difference]: With dead ends: 3998 [2018-12-03 01:49:41,005 INFO L226 Difference]: Without dead ends: 1888 [2018-12-03 01:49:41,010 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 271 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5306 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1387, Invalid=14113, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 01:49:41,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2018-12-03 01:49:41,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1804. [2018-12-03 01:49:41,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2018-12-03 01:49:41,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2374 transitions. [2018-12-03 01:49:41,107 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2374 transitions. Word has length 211 [2018-12-03 01:49:41,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:41,108 INFO L480 AbstractCegarLoop]: Abstraction has 1804 states and 2374 transitions. [2018-12-03 01:49:41,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 01:49:41,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2374 transitions. [2018-12-03 01:49:41,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-03 01:49:41,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:41,110 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12-03 01:49:41,110 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:41,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:41,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1197391980, now seen corresponding path program 1 times [2018-12-03 01:49:41,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:41,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:41,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:41,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:41,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-12-03 01:49:41,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:41,165 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:41,165 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-12-03 01:49:41,165 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [275], [282], [285], [288], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-03 01:49:41,167 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:41,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:41,305 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:49:41,305 INFO L272 AbstractInterpreter]: Visited 122 different actions 506 times. Merged at 31 different actions 121 times. Never widened. Performed 4987 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4987 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 16 fixpoints after 5 different actions. Largest state had 42 variables. [2018-12-03 01:49:41,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:41,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:49:41,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:41,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/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-12-03 01:49:41,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:41,322 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:49:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:41,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:49:41,424 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-03 01:49:41,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:49:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-12-03 01:49:41,562 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 01:49:41,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 8 [2018-12-03 01:49:41,563 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:41,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:49:41,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:49:41,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:49:41,564 INFO L87 Difference]: Start difference. First operand 1804 states and 2374 transitions. Second operand 3 states. [2018-12-03 01:49:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:41,657 INFO L93 Difference]: Finished difference Result 3408 states and 4730 transitions. [2018-12-03 01:49:41,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:49:41,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-12-03 01:49:41,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:41,661 INFO L225 Difference]: With dead ends: 3408 [2018-12-03 01:49:41,661 INFO L226 Difference]: Without dead ends: 1888 [2018-12-03 01:49:41,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 416 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:49:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2018-12-03 01:49:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1802. [2018-12-03 01:49:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2018-12-03 01:49:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2330 transitions. [2018-12-03 01:49:41,747 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2330 transitions. Word has length 211 [2018-12-03 01:49:41,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:41,747 INFO L480 AbstractCegarLoop]: Abstraction has 1802 states and 2330 transitions. [2018-12-03 01:49:41,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:49:41,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2330 transitions. [2018-12-03 01:49:41,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-03 01:49:41,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:41,750 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:41,750 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:41,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:41,750 INFO L82 PathProgramCache]: Analyzing trace with hash 609584715, now seen corresponding path program 1 times [2018-12-03 01:49:41,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:41,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:41,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:41,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:41,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 19 proven. 33 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-03 01:49:41,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:41,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:41,810 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-12-03 01:49:41,811 INFO L205 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [42], [44], [47], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [275], [282], [285], [297], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-03 01:49:41,812 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:41,812 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:41,916 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:49:41,916 INFO L272 AbstractInterpreter]: Visited 122 different actions 346 times. Merged at 23 different actions 35 times. Never widened. Performed 3976 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3976 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-03 01:49:41,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:41,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:49:41,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:41,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/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-12-03 01:49:41,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:41,929 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:49:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:42,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:49:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 01:49:42,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:49:42,124 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-12-03 01:49:42,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 01:49:42,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2018-12-03 01:49:42,140 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:42,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:49:42,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:49:42,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:49:42,140 INFO L87 Difference]: Start difference. First operand 1802 states and 2330 transitions. Second operand 3 states. [2018-12-03 01:49:42,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:42,255 INFO L93 Difference]: Finished difference Result 4299 states and 5988 transitions. [2018-12-03 01:49:42,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:49:42,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2018-12-03 01:49:42,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:42,265 INFO L225 Difference]: With dead ends: 4299 [2018-12-03 01:49:42,265 INFO L226 Difference]: Without dead ends: 2711 [2018-12-03 01:49:42,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:49:42,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2018-12-03 01:49:42,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 2688. [2018-12-03 01:49:42,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2688 states. [2018-12-03 01:49:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2688 states to 2688 states and 3583 transitions. [2018-12-03 01:49:42,414 INFO L78 Accepts]: Start accepts. Automaton has 2688 states and 3583 transitions. Word has length 211 [2018-12-03 01:49:42,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:42,415 INFO L480 AbstractCegarLoop]: Abstraction has 2688 states and 3583 transitions. [2018-12-03 01:49:42,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:49:42,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2688 states and 3583 transitions. [2018-12-03 01:49:42,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-03 01:49:42,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:42,418 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:42,418 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:42,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:42,418 INFO L82 PathProgramCache]: Analyzing trace with hash 73236914, now seen corresponding path program 1 times [2018-12-03 01:49:42,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:42,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:42,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:42,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:42,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 27 proven. 20 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-03 01:49:42,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:42,513 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:42,513 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-12-03 01:49:42,513 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [278], [282], [285], [288], [297], [300], [303], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-03 01:49:42,514 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:42,515 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:42,612 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:49:42,612 INFO L272 AbstractInterpreter]: Visited 124 different actions 392 times. Merged at 30 different actions 76 times. Never widened. Performed 4032 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4032 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 5 different actions. Largest state had 42 variables. [2018-12-03 01:49:42,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:42,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:49:42,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:42,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/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-12-03 01:49:42,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:42,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:49:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:42,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:49:42,719 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 01:49:42,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:49:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 01:49:42,840 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 01:49:42,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [10] total 12 [2018-12-03 01:49:42,840 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:42,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:49:42,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:49:42,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 01:49:42,841 INFO L87 Difference]: Start difference. First operand 2688 states and 3583 transitions. Second operand 3 states. [2018-12-03 01:49:42,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:42,991 INFO L93 Difference]: Finished difference Result 6009 states and 8558 transitions. [2018-12-03 01:49:42,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:49:42,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2018-12-03 01:49:42,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:43,002 INFO L225 Difference]: With dead ends: 6009 [2018-12-03 01:49:43,002 INFO L226 Difference]: Without dead ends: 3563 [2018-12-03 01:49:43,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 01:49:43,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2018-12-03 01:49:43,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 3532. [2018-12-03 01:49:43,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3532 states. [2018-12-03 01:49:43,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 4685 transitions. [2018-12-03 01:49:43,181 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 4685 transitions. Word has length 210 [2018-12-03 01:49:43,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:43,182 INFO L480 AbstractCegarLoop]: Abstraction has 3532 states and 4685 transitions. [2018-12-03 01:49:43,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:49:43,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4685 transitions. [2018-12-03 01:49:43,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-03 01:49:43,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:43,185 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:43,185 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:43,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:43,185 INFO L82 PathProgramCache]: Analyzing trace with hash -326896353, now seen corresponding path program 1 times [2018-12-03 01:49:43,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:43,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:43,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:43,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:43,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 29 proven. 12 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-03 01:49:43,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:43,235 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:43,235 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-12-03 01:49:43,235 INFO L205 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [275], [282], [285], [297], [300], [303], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-03 01:49:43,236 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:43,236 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:43,317 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:49:43,318 INFO L272 AbstractInterpreter]: Visited 125 different actions 362 times. Merged at 23 different actions 35 times. Never widened. Performed 3999 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3999 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 3 different actions. Largest state had 42 variables. [2018-12-03 01:49:43,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:43,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:49:43,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:43,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/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-12-03 01:49:43,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:43,327 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:49:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:43,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:49:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 01:49:43,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:49:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 45 proven. 13 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-12-03 01:49:43,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 01:49:43,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 8 [2018-12-03 01:49:43,560 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:43,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:49:43,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:49:43,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:49:43,560 INFO L87 Difference]: Start difference. First operand 3532 states and 4685 transitions. Second operand 3 states. [2018-12-03 01:49:43,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:43,701 INFO L93 Difference]: Finished difference Result 5059 states and 6684 transitions. [2018-12-03 01:49:43,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:49:43,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-12-03 01:49:43,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:43,709 INFO L225 Difference]: With dead ends: 5059 [2018-12-03 01:49:43,709 INFO L226 Difference]: Without dead ends: 3541 [2018-12-03 01:49:43,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:49:43,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541 states. [2018-12-03 01:49:43,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3541 to 3532. [2018-12-03 01:49:43,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3532 states. [2018-12-03 01:49:43,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 4604 transitions. [2018-12-03 01:49:43,885 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 4604 transitions. Word has length 212 [2018-12-03 01:49:43,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:43,885 INFO L480 AbstractCegarLoop]: Abstraction has 3532 states and 4604 transitions. [2018-12-03 01:49:43,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:49:43,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4604 transitions. [2018-12-03 01:49:43,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-03 01:49:43,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:43,888 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:43,888 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:43,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:43,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1411595648, now seen corresponding path program 1 times [2018-12-03 01:49:43,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:43,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:43,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:43,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:43,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-12-03 01:49:43,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:43,936 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:43,936 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-12-03 01:49:43,936 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [275], [282], [285], [288], [297], [300], [303], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-03 01:49:43,937 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:43,937 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:44,023 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:49:44,023 INFO L272 AbstractInterpreter]: Visited 125 different actions 404 times. Merged at 31 different actions 80 times. Never widened. Performed 3622 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3622 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 12 fixpoints after 5 different actions. Largest state had 42 variables. [2018-12-03 01:49:44,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:44,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:49:44,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:44,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/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-12-03 01:49:44,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:44,031 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:49:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:44,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:49:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-03 01:49:44,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:49:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-12-03 01:49:44,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 01:49:44,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2018-12-03 01:49:44,275 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:44,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:49:44,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:49:44,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:49:44,275 INFO L87 Difference]: Start difference. First operand 3532 states and 4604 transitions. Second operand 3 states. [2018-12-03 01:49:44,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:44,462 INFO L93 Difference]: Finished difference Result 4599 states and 6014 transitions. [2018-12-03 01:49:44,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:49:44,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-12-03 01:49:44,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:44,469 INFO L225 Difference]: With dead ends: 4599 [2018-12-03 01:49:44,469 INFO L226 Difference]: Without dead ends: 3543 [2018-12-03 01:49:44,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 415 SyntacticMatches, 9 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:49:44,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2018-12-03 01:49:44,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 3532. [2018-12-03 01:49:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3532 states. [2018-12-03 01:49:44,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3532 states to 3532 states and 4482 transitions. [2018-12-03 01:49:44,620 INFO L78 Accepts]: Start accepts. Automaton has 3532 states and 4482 transitions. Word has length 212 [2018-12-03 01:49:44,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:44,621 INFO L480 AbstractCegarLoop]: Abstraction has 3532 states and 4482 transitions. [2018-12-03 01:49:44,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:49:44,621 INFO L276 IsEmpty]: Start isEmpty. Operand 3532 states and 4482 transitions. [2018-12-03 01:49:44,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-03 01:49:44,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:44,623 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:44,623 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:44,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:44,623 INFO L82 PathProgramCache]: Analyzing trace with hash 925553302, now seen corresponding path program 1 times [2018-12-03 01:49:44,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:44,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:44,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:44,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:44,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:44,659 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-12-03 01:49:44,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:49:44,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 01:49:44,659 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:44,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:49:44,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:49:44,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:49:44,660 INFO L87 Difference]: Start difference. First operand 3532 states and 4482 transitions. Second operand 4 states. [2018-12-03 01:49:44,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:44,884 INFO L93 Difference]: Finished difference Result 6346 states and 8314 transitions. [2018-12-03 01:49:44,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 01:49:44,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2018-12-03 01:49:44,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:44,891 INFO L225 Difference]: With dead ends: 6346 [2018-12-03 01:49:44,891 INFO L226 Difference]: Without dead ends: 3177 [2018-12-03 01:49:44,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-12-03 01:49:44,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2018-12-03 01:49:45,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 3159. [2018-12-03 01:49:45,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3159 states. [2018-12-03 01:49:45,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 3159 states and 3868 transitions. [2018-12-03 01:49:45,036 INFO L78 Accepts]: Start accepts. Automaton has 3159 states and 3868 transitions. Word has length 211 [2018-12-03 01:49:45,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:45,036 INFO L480 AbstractCegarLoop]: Abstraction has 3159 states and 3868 transitions. [2018-12-03 01:49:45,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:49:45,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3159 states and 3868 transitions. [2018-12-03 01:49:45,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-12-03 01:49:45,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:45,039 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:45,039 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:45,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:45,039 INFO L82 PathProgramCache]: Analyzing trace with hash -22073876, now seen corresponding path program 1 times [2018-12-03 01:49:45,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:45,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:45,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:45,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:45,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 29 proven. 12 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-12-03 01:49:45,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:45,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:45,081 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2018-12-03 01:49:45,081 INFO L205 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [275], [282], [285], [297], [300], [303], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-03 01:49:45,082 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:45,082 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:45,151 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:49:45,151 INFO L272 AbstractInterpreter]: Visited 120 different actions 290 times. Merged at 13 different actions 25 times. Never widened. Performed 3441 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3441 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 2 different actions. Largest state had 42 variables. [2018-12-03 01:49:45,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:45,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:49:45,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:45,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 01:49:45,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:45,159 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:49:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:45,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:49:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-03 01:49:45,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:49:45,410 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-12-03 01:49:45,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 01:49:45,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 10 [2018-12-03 01:49:45,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:45,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:49:45,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:49:45,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:49:45,435 INFO L87 Difference]: Start difference. First operand 3159 states and 3868 transitions. Second operand 4 states. [2018-12-03 01:49:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:45,723 INFO L93 Difference]: Finished difference Result 6336 states and 8538 transitions. [2018-12-03 01:49:45,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:49:45,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2018-12-03 01:49:45,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:45,731 INFO L225 Difference]: With dead ends: 6336 [2018-12-03 01:49:45,731 INFO L226 Difference]: Without dead ends: 3578 [2018-12-03 01:49:45,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 408 SyntacticMatches, 11 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-03 01:49:45,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2018-12-03 01:49:45,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 3222. [2018-12-03 01:49:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3222 states. [2018-12-03 01:49:45,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 3873 transitions. [2018-12-03 01:49:45,904 INFO L78 Accepts]: Start accepts. Automaton has 3222 states and 3873 transitions. Word has length 211 [2018-12-03 01:49:45,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:45,904 INFO L480 AbstractCegarLoop]: Abstraction has 3222 states and 3873 transitions. [2018-12-03 01:49:45,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:49:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3222 states and 3873 transitions. [2018-12-03 01:49:45,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-03 01:49:45,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:45,906 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:45,906 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:45,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:45,906 INFO L82 PathProgramCache]: Analyzing trace with hash 467873814, now seen corresponding path program 1 times [2018-12-03 01:49:45,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:45,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:45,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:45,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:45,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:45,945 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 29 proven. 12 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-12-03 01:49:45,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:45,945 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:45,945 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-12-03 01:49:45,945 INFO L205 CegarAbsIntRunner]: [29], [31], [34], [36], [39], [42], [44], [47], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [275], [282], [285], [297], [300], [305], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-03 01:49:45,946 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:45,946 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:46,045 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:49:46,045 INFO L272 AbstractInterpreter]: Visited 125 different actions 430 times. Merged at 39 different actions 89 times. Never widened. Performed 4250 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4250 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 9 fixpoints after 4 different actions. Largest state had 42 variables. [2018-12-03 01:49:46,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:46,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:49:46,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:46,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 01:49:46,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:46,054 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:49:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:46,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:49:46,131 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 01:49:46,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:49:46,266 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 37 proven. 17 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-12-03 01:49:46,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 01:49:46,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2018-12-03 01:49:46,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:46,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:49:46,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:49:46,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:49:46,282 INFO L87 Difference]: Start difference. First operand 3222 states and 3873 transitions. Second operand 4 states. [2018-12-03 01:49:46,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:46,635 INFO L93 Difference]: Finished difference Result 6519 states and 8242 transitions. [2018-12-03 01:49:46,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:49:46,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 213 [2018-12-03 01:49:46,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:46,643 INFO L225 Difference]: With dead ends: 6519 [2018-12-03 01:49:46,643 INFO L226 Difference]: Without dead ends: 3919 [2018-12-03 01:49:46,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-03 01:49:46,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2018-12-03 01:49:46,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3800. [2018-12-03 01:49:46,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3800 states. [2018-12-03 01:49:46,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3800 states to 3800 states and 4781 transitions. [2018-12-03 01:49:46,833 INFO L78 Accepts]: Start accepts. Automaton has 3800 states and 4781 transitions. Word has length 213 [2018-12-03 01:49:46,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:46,834 INFO L480 AbstractCegarLoop]: Abstraction has 3800 states and 4781 transitions. [2018-12-03 01:49:46,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:49:46,834 INFO L276 IsEmpty]: Start isEmpty. Operand 3800 states and 4781 transitions. [2018-12-03 01:49:46,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-12-03 01:49:46,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:46,836 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:46,836 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:46,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:46,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2089762448, now seen corresponding path program 1 times [2018-12-03 01:49:46,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:46,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:46,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:46,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:46,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2018-12-03 01:49:46,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:46,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:46,876 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 278 with the following transitions: [2018-12-03 01:49:46,876 INFO L205 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [278], [282], [285], [291], [297], [300], [303], [305], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [455], [456], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-03 01:49:46,877 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:46,877 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:47,086 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:49:47,086 INFO L272 AbstractInterpreter]: Visited 144 different actions 901 times. Merged at 54 different actions 180 times. Never widened. Performed 8304 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8304 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 43 fixpoints after 14 different actions. Largest state had 42 variables. [2018-12-03 01:49:47,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:47,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:49:47,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:47,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 01:49:47,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:47,093 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:49:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:47,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:49:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-12-03 01:49:47,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:49:47,294 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2018-12-03 01:49:47,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 01:49:47,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2018-12-03 01:49:47,309 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:47,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 01:49:47,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 01:49:47,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:49:47,309 INFO L87 Difference]: Start difference. First operand 3800 states and 4781 transitions. Second operand 4 states. [2018-12-03 01:49:47,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:47,605 INFO L93 Difference]: Finished difference Result 6415 states and 8184 transitions. [2018-12-03 01:49:47,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:49:47,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 277 [2018-12-03 01:49:47,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:47,612 INFO L225 Difference]: With dead ends: 6415 [2018-12-03 01:49:47,612 INFO L226 Difference]: Without dead ends: 3005 [2018-12-03 01:49:47,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-03 01:49:47,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2018-12-03 01:49:47,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2897. [2018-12-03 01:49:47,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2897 states. [2018-12-03 01:49:47,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 3497 transitions. [2018-12-03 01:49:47,760 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 3497 transitions. Word has length 277 [2018-12-03 01:49:47,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:47,761 INFO L480 AbstractCegarLoop]: Abstraction has 2897 states and 3497 transitions. [2018-12-03 01:49:47,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 01:49:47,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 3497 transitions. [2018-12-03 01:49:47,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-03 01:49:47,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:47,762 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:47,762 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:47,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:47,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1992903186, now seen corresponding path program 1 times [2018-12-03 01:49:47,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:47,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:47,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:47,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:47,763 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:47,827 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 28 proven. 20 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-12-03 01:49:47,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:47,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:47,828 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-12-03 01:49:47,828 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [278], [282], [285], [297], [300], [305], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-03 01:49:47,829 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:47,829 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:47,973 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:49:47,973 INFO L272 AbstractInterpreter]: Visited 136 different actions 640 times. Merged at 45 different actions 139 times. Never widened. Performed 6100 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6100 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 27 fixpoints after 10 different actions. Largest state had 42 variables. [2018-12-03 01:49:47,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:47,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:49:47,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:47,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 01:49:47,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:47,982 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:49:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:48,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:49:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-03 01:49:48,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:49:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-03 01:49:48,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 01:49:48,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 6] total 14 [2018-12-03 01:49:48,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:48,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:49:48,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:49:48,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-12-03 01:49:48,207 INFO L87 Difference]: Start difference. First operand 2897 states and 3497 transitions. Second operand 6 states. [2018-12-03 01:49:48,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:48,356 INFO L93 Difference]: Finished difference Result 5423 states and 6695 transitions. [2018-12-03 01:49:48,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:49:48,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 219 [2018-12-03 01:49:48,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:48,362 INFO L225 Difference]: With dead ends: 5423 [2018-12-03 01:49:48,363 INFO L226 Difference]: Without dead ends: 2957 [2018-12-03 01:49:48,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 433 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-12-03 01:49:48,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2018-12-03 01:49:48,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2928. [2018-12-03 01:49:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2928 states. [2018-12-03 01:49:48,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3528 transitions. [2018-12-03 01:49:48,533 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3528 transitions. Word has length 219 [2018-12-03 01:49:48,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:48,533 INFO L480 AbstractCegarLoop]: Abstraction has 2928 states and 3528 transitions. [2018-12-03 01:49:48,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:49:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3528 transitions. [2018-12-03 01:49:48,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-03 01:49:48,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:48,534 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:48,534 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:48,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:48,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1673241968, now seen corresponding path program 1 times [2018-12-03 01:49:48,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:48,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:48,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:48,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:48,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 29 proven. 13 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-03 01:49:48,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:48,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:48,575 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 221 with the following transitions: [2018-12-03 01:49:48,575 INFO L205 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [278], [282], [285], [297], [300], [305], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [407], [409], [411], [412], [453], [454], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-03 01:49:48,576 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:48,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:48,666 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:49:48,666 INFO L272 AbstractInterpreter]: Visited 135 different actions 436 times. Merged at 40 different actions 68 times. Never widened. Performed 4139 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4139 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 13 fixpoints after 7 different actions. Largest state had 42 variables. [2018-12-03 01:49:48,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:48,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:49:48,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:48,668 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 01:49:48,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:48,673 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:49:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:48,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:49:48,745 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-03 01:49:48,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:49:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 29 proven. 13 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-03 01:49:48,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 01:49:48,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2018-12-03 01:49:48,869 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:48,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:49:48,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:49:48,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 01:49:48,869 INFO L87 Difference]: Start difference. First operand 2928 states and 3528 transitions. Second operand 3 states. [2018-12-03 01:49:49,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:49,018 INFO L93 Difference]: Finished difference Result 5235 states and 6446 transitions. [2018-12-03 01:49:49,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:49:49,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2018-12-03 01:49:49,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:49,024 INFO L225 Difference]: With dead ends: 5235 [2018-12-03 01:49:49,024 INFO L226 Difference]: Without dead ends: 2676 [2018-12-03 01:49:49,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 441 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-12-03 01:49:49,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2018-12-03 01:49:49,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2620. [2018-12-03 01:49:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2620 states. [2018-12-03 01:49:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 3111 transitions. [2018-12-03 01:49:49,161 INFO L78 Accepts]: Start accepts. Automaton has 2620 states and 3111 transitions. Word has length 220 [2018-12-03 01:49:49,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:49,161 INFO L480 AbstractCegarLoop]: Abstraction has 2620 states and 3111 transitions. [2018-12-03 01:49:49,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:49:49,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2620 states and 3111 transitions. [2018-12-03 01:49:49,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-03 01:49:49,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:49,163 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:49,163 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:49,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:49,163 INFO L82 PathProgramCache]: Analyzing trace with hash -614304329, now seen corresponding path program 1 times [2018-12-03 01:49:49,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:49,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:49,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:49,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:49,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 43 proven. 12 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-12-03 01:49:49,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:49,234 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:49:49,234 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 266 with the following transitions: [2018-12-03 01:49:49,234 INFO L205 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [29], [31], [34], [36], [39], [42], [44], [47], [50], [52], [54], [56], [59], [61], [64], [75], [77], [79], [81], [85], [86], [89], [103], [104], [109], [115], [121], [127], [133], [139], [141], [142], [145], [148], [150], [152], [154], [156], [157], [160], [166], [172], [176], [177], [182], [187], [189], [192], [203], [205], [207], [211], [219], [222], [223], [235], [244], [247], [250], [256], [259], [262], [269], [272], [282], [285], [297], [300], [303], [305], [307], [309], [311], [312], [317], [323], [329], [335], [341], [347], [349], [350], [364], [366], [396], [397], [400], [403], [405], [407], [409], [411], [412], [453], [454], [455], [456], [457], [458], [459], [460], [461], [462], [463], [464], [465], [466], [467], [468], [469], [471], [472], [473], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2018-12-03 01:49:49,235 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:49:49,236 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:49:49,382 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:49:49,382 INFO L272 AbstractInterpreter]: Visited 143 different actions 604 times. Merged at 48 different actions 123 times. Never widened. Performed 5088 root evaluator evaluations with a maximum evaluation depth of 3. Performed 5088 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 19 fixpoints after 10 different actions. Largest state had 42 variables. [2018-12-03 01:49:49,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:49,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:49:49,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:49:49,384 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 01:49:49,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:49,390 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:49:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:49,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:49:49,490 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-03 01:49:49,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:49:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 43 proven. 12 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-12-03 01:49:49,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 01:49:49,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 6 [2018-12-03 01:49:49,664 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:49,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:49:49,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:49:49,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:49:49,664 INFO L87 Difference]: Start difference. First operand 2620 states and 3111 transitions. Second operand 6 states. [2018-12-03 01:49:49,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:49,776 INFO L93 Difference]: Finished difference Result 4017 states and 4827 transitions. [2018-12-03 01:49:49,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:49:49,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2018-12-03 01:49:49,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:49,780 INFO L225 Difference]: With dead ends: 4017 [2018-12-03 01:49:49,780 INFO L226 Difference]: Without dead ends: 1777 [2018-12-03 01:49:49,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 527 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:49:49,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2018-12-03 01:49:49,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1775. [2018-12-03 01:49:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2018-12-03 01:49:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2013 transitions. [2018-12-03 01:49:49,868 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2013 transitions. Word has length 265 [2018-12-03 01:49:49,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:49,868 INFO L480 AbstractCegarLoop]: Abstraction has 1775 states and 2013 transitions. [2018-12-03 01:49:49,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:49:49,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2013 transitions. [2018-12-03 01:49:49,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-03 01:49:49,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:49,870 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:49,870 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:49,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:49,870 INFO L82 PathProgramCache]: Analyzing trace with hash -553144647, now seen corresponding path program 2 times [2018-12-03 01:49:49,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:49,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:49,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:49:49,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:49,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-12-03 01:49:49,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:49:49,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:49:49,922 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:49,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:49:49,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:49:49,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:49:49,922 INFO L87 Difference]: Start difference. First operand 1775 states and 2013 transitions. Second operand 6 states. [2018-12-03 01:49:50,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:50,009 INFO L93 Difference]: Finished difference Result 2496 states and 2870 transitions. [2018-12-03 01:49:50,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:49:50,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2018-12-03 01:49:50,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:50,011 INFO L225 Difference]: With dead ends: 2496 [2018-12-03 01:49:50,011 INFO L226 Difference]: Without dead ends: 679 [2018-12-03 01:49:50,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:49:50,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2018-12-03 01:49:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 669. [2018-12-03 01:49:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2018-12-03 01:49:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 727 transitions. [2018-12-03 01:49:50,067 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 727 transitions. Word has length 265 [2018-12-03 01:49:50,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:50,067 INFO L480 AbstractCegarLoop]: Abstraction has 669 states and 727 transitions. [2018-12-03 01:49:50,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:49:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 727 transitions. [2018-12-03 01:49:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-03 01:49:50,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:49:50,068 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:49:50,068 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:49:50,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:49:50,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1370083387, now seen corresponding path program 3 times [2018-12-03 01:49:50,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:49:50,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:50,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 01:49:50,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:49:50,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:49:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:49:50,174 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2018-12-03 01:49:50,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:49:50,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 01:49:50,175 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:49:50,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:49:50,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:49:50,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:49:50,175 INFO L87 Difference]: Start difference. First operand 669 states and 727 transitions. Second operand 7 states. [2018-12-03 01:49:50,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:49:50,693 INFO L93 Difference]: Finished difference Result 671 states and 731 transitions. [2018-12-03 01:49:50,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 01:49:50,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 265 [2018-12-03 01:49:50,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:49:50,695 INFO L225 Difference]: With dead ends: 671 [2018-12-03 01:49:50,695 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 01:49:50,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-03 01:49:50,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 01:49:50,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 01:49:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 01:49:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 01:49:50,697 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 265 [2018-12-03 01:49:50,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:49:50,697 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 01:49:50,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:49:50,697 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 01:49:50,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 01:49:50,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 01:49:50,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:50,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:50,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:51,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:52,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:52,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:52,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:52,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:52,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:52,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:52,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 01:49:52,911 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 110 [2018-12-03 01:49:53,899 WARN L180 SmtUtils]: Spent 927.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 112 [2018-12-03 01:49:54,256 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 110 [2018-12-03 01:49:55,535 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 138 DAG size of output: 102 [2018-12-03 01:49:58,081 WARN L180 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 202 DAG size of output: 131 [2018-12-03 01:50:00,030 WARN L180 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 192 DAG size of output: 137 [2018-12-03 01:50:00,142 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 82 [2018-12-03 01:50:00,431 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 125 [2018-12-03 01:50:00,546 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 85 [2018-12-03 01:50:00,650 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 75 [2018-12-03 01:50:00,802 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 85 [2018-12-03 01:50:01,147 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 111 [2018-12-03 01:50:01,977 WARN L180 SmtUtils]: Spent 827.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 117 [2018-12-03 01:50:02,512 WARN L180 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 110 [2018-12-03 01:50:02,771 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 105 [2018-12-03 01:50:03,372 WARN L180 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 125 [2018-12-03 01:50:04,217 WARN L180 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 137 [2018-12-03 01:50:04,748 WARN L180 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 119 [2018-12-03 01:50:04,925 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 85 [2018-12-03 01:50:06,170 WARN L180 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 156 DAG size of output: 115 [2018-12-03 01:50:09,483 WARN L180 SmtUtils]: Spent 3.30 s on a formula simplification. DAG size of input: 193 DAG size of output: 138 [2018-12-03 01:50:10,345 WARN L180 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 106 [2018-12-03 01:50:11,484 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 193 DAG size of output: 137 [2018-12-03 01:50:12,350 WARN L180 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 126 [2018-12-03 01:50:12,460 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 63 [2018-12-03 01:50:12,722 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 110 [2018-12-03 01:50:13,116 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 112 [2018-12-03 01:50:13,600 WARN L180 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 121 [2018-12-03 01:50:13,871 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 107 [2018-12-03 01:50:14,119 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 92 [2018-12-03 01:50:14,894 WARN L180 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 160 [2018-12-03 01:50:15,568 WARN L180 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 111 [2018-12-03 01:50:15,687 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 85 [2018-12-03 01:50:15,813 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 85 [2018-12-03 01:50:16,678 WARN L180 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 162 [2018-12-03 01:50:16,815 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 75 [2018-12-03 01:50:17,262 WARN L180 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 110 [2018-12-03 01:50:18,441 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 190 DAG size of output: 101 [2018-12-03 01:50:18,974 WARN L180 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 112 [2018-12-03 01:50:19,718 WARN L180 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 122 [2018-12-03 01:50:19,826 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 1 [2018-12-03 01:50:20,424 WARN L180 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 95 [2018-12-03 01:50:20,890 WARN L180 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 138 [2018-12-03 01:50:21,147 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 70 [2018-12-03 01:50:21,555 WARN L180 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 114 [2018-12-03 01:50:22,624 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 184 DAG size of output: 126 [2018-12-03 01:50:22,802 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 1 [2018-12-03 01:50:22,912 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2018-12-03 01:50:23,132 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 1 [2018-12-03 01:50:23,919 WARN L180 SmtUtils]: Spent 782.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 139 [2018-12-03 01:50:24,059 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 85 [2018-12-03 01:50:27,762 WARN L180 SmtUtils]: Spent 3.70 s on a formula simplification. DAG size of input: 273 DAG size of output: 188 [2018-12-03 01:50:27,980 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2018-12-03 01:50:28,373 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 122 [2018-12-03 01:50:28,649 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 110 [2018-12-03 01:50:30,354 WARN L180 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 190 DAG size of output: 118 [2018-12-03 01:50:30,756 WARN L180 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 111 [2018-12-03 01:50:31,003 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 110 [2018-12-03 01:50:32,157 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 199 DAG size of output: 151 [2018-12-03 01:50:32,941 WARN L180 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 118 [2018-12-03 01:50:34,531 WARN L180 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 273 DAG size of output: 188 [2018-12-03 01:50:34,534 INFO L444 ceAbstractionStarter]: At program point L95-1(lines 83 114) the Hoare annotation is: (let ((.cse14 (= 0 |old(~m_st~0)|)) (.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse0 (= ~T1_E~0 0)) (.cse6 (= ~T2_E~0 0)) (.cse34 (= 1 ~m_pc~0))) (let ((.cse26 (and .cse3 (= ~m_st~0 2) (and (not .cse0) (not .cse6) .cse34 (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (not (= ~E_2~0 0))))) (.cse32 (= 1 ~t2_pc~0)) (.cse23 (not .cse34)) (.cse18 (not (= 2 |old(~m_st~0)|))) (.cse31 (not .cse14)) (.cse29 (not (= 0 ~m_pc~0)))) (let ((.cse21 (<= 2 ~E_2~0)) (.cse8 (let ((.cse33 (not (= 0 |old(~t2_st~0)|)))) (and (or .cse33 .cse23 .cse18) (or .cse31 .cse33 .cse29)))) (.cse10 (not (= |old(~t1_pc~0)| 0))) (.cse4 (= ~t2_st~0 0)) (.cse1 (= ~t1_pc~0 0)) (.cse11 (not (= 2 ~E_1~0))) (.cse15 (not (= 0 ~t2_pc~0))) (.cse28 (not (= 0 ~local~0))) (.cse25 (= 1 ~t1_pc~0)) (.cse30 (= ~token~0 0)) (.cse27 (not (= |old(~token~0)| 0))) (.cse16 (< ~E_1~0 2)) (.cse17 (< |old(~t2_st~0)| 2)) (.cse24 (= |old(~t1_pc~0)| 1)) (.cse7 (= 0 ~M_E~0)) (.cse9 (= 1 ~E_M~0)) (.cse22 (not .cse32)) (.cse19 (and .cse32 .cse26 (<= 2 ~E_1~0))) (.cse20 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse2 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (<= |old(~E_2~0)| ~E_2~0)) (.cse12 (< |old(~E_2~0)| 2)) (.cse13 (= 0 ~E_M~0))) (and (or .cse0 (and .cse1 .cse2 (and .cse3 .cse4) .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse16 .cse0 .cse17 (< ~local~0 |old(~token~0)|) .cse18 (< |old(~token~0)| ~local~0) .cse6 .cse7 (and .cse19 .cse20 .cse21) .cse9 .cse22 .cse23 .cse12 .cse13 (and (<= ~token~0 (+ |old(~token~0)| 1)) (<= (+ ~local~0 1) ~token~0) (and .cse19 .cse21))) (or .cse16 .cse0 (< 0 ~t2_pc~0) .cse18 (not .cse24) .cse6 .cse7 .cse9 (and .cse25 .cse26 .cse21) .cse23 .cse12 .cse13) (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) .cse8 .cse10 (not (= 1 ~t1_i~0)) (or .cse27 .cse28 .cse29) (not (= ~T2_E~0 2)) (and .cse3 .cse4 .cse30 (= ~E_2~0 2) .cse1 .cse2) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) .cse11 (not (= 1 ~t2_i~0)) .cse15 (not (= 2 ~M_E~0))) (or .cse16 .cse0 .cse17 .cse28 .cse24 .cse6 (and (not .cse25) .cse20 .cse30 (= ~m_st~0 0) .cse2 .cse5) .cse7 .cse9 .cse22 .cse27 .cse31 .cse12 .cse13 .cse29) (or .cse16 .cse0 .cse17 .cse18 .cse24 .cse6 .cse7 .cse9 .cse22 (and .cse19 .cse20 .cse2 .cse5) .cse23 .cse12 .cse13))))) [2018-12-03 01:50:34,534 INFO L448 ceAbstractionStarter]: For program point L87(lines 87 91) no Hoare annotation was computed. [2018-12-03 01:50:34,534 INFO L444 ceAbstractionStarter]: At program point transmit1ENTRY(lines 80 115) the Hoare annotation is: (let ((.cse31 (= 0 |old(~m_st~0)|))) (let ((.cse25 (not (= 1 ~m_pc~0))) (.cse15 (not (= 2 |old(~m_st~0)|))) (.cse30 (not .cse31)) (.cse4 (not (= 0 ~m_pc~0))) (.cse28 (= 1 ~t1_pc~0)) (.cse16 (= |old(~t1_pc~0)| 1))) (let ((.cse29 (not .cse16)) (.cse12 (< ~E_1~0 2)) (.cse14 (< |old(~t2_st~0)| 2)) (.cse3 (not (= 0 ~local~0))) (.cse2 (not (= |old(~token~0)| 0))) (.cse21 (not .cse28)) (.cse5 (= ~m_st~0 |old(~m_st~0)|)) (.cse22 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse7 (= ~token~0 0)) (.cse20 (not (= 1 ~t2_pc~0))) (.cse13 (= ~T1_E~0 0)) (.cse17 (= ~T2_E~0 0)) (.cse18 (= 0 ~M_E~0)) (.cse0 (let ((.cse32 (not (= 0 |old(~t2_st~0)|)))) (and (or .cse32 .cse25 .cse15) (or .cse30 .cse32 .cse4)))) (.cse19 (= 1 ~E_M~0)) (.cse1 (not (= |old(~t1_pc~0)| 0))) (.cse10 (not (= 2 ~E_1~0))) (.cse26 (< |old(~E_2~0)| 2)) (.cse27 (= 0 ~E_M~0)) (.cse23 (= ~m_st~0 2)) (.cse24 (= |old(~E_2~0)| ~E_2~0)) (.cse6 (= ~t2_st~0 0)) (.cse8 (= ~t1_pc~0 0)) (.cse9 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (not (= 0 ~t2_pc~0)))) (and (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) .cse0 .cse1 (not (= 1 ~t1_i~0)) (or .cse2 .cse3 .cse4) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) (and .cse5 .cse6 .cse7 (= ~E_2~0 2) .cse8 .cse9) .cse10 (not (= 1 ~t2_i~0)) .cse11 (not (= 2 ~M_E~0))) (or .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (and .cse21 .cse22 .cse23 .cse24 .cse9) .cse25 .cse26 .cse27) (or .cse12 .cse13 (and .cse28 .cse22 .cse23 .cse24 .cse9) (< 0 ~t2_pc~0) .cse15 .cse29 .cse17 .cse18 .cse19 .cse25 .cse26 .cse27) (or .cse12 .cse13 .cse14 (< ~local~0 |old(~token~0)|) .cse15 .cse29 (< |old(~token~0)| ~local~0) (and .cse28 .cse22 (= ~token~0 |old(~token~0)|) .cse23 .cse24 .cse9) .cse17 .cse18 .cse19 .cse20 .cse25 .cse26 .cse27) (or .cse12 .cse13 .cse14 .cse3 .cse16 .cse17 .cse18 .cse19 .cse20 .cse2 .cse30 .cse26 (and .cse21 .cse5 .cse22 .cse24 .cse7 .cse9) .cse27 .cse4) (or (and (= ~t2_st~0 2) .cse8) .cse13 .cse15 .cse17 (or .cse1 .cse10 (not (= 2 |old(~t2_st~0)|))) .cse18 .cse19 .cse20 .cse25 .cse26 .cse27) (or .cse13 .cse17 .cse18 .cse0 .cse19 .cse1 .cse10 .cse26 .cse27 (and .cse23 .cse24 .cse6 .cse8 .cse9) .cse31 .cse11))))) [2018-12-03 01:50:34,535 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-12-03 01:50:34,535 INFO L444 ceAbstractionStarter]: At program point L88(lines 83 114) the Hoare annotation is: (let ((.cse21 (= 0 |old(~m_st~0)|))) (let ((.cse18 (not (= 1 ~m_pc~0))) (.cse13 (not (= 2 |old(~m_st~0)|))) (.cse24 (not .cse21)) (.cse25 (not (= 0 ~m_pc~0)))) (let ((.cse0 (let ((.cse26 (not (= 0 |old(~t2_st~0)|)))) (and (or .cse26 .cse18 .cse13) (or .cse24 .cse26 .cse25)))) (.cse1 (not (= |old(~t1_pc~0)| 0))) (.cse4 (not (= 2 ~E_1~0))) (.cse5 (not (= 0 ~t2_pc~0))) (.cse8 (= 1 ~t1_pc~0)) (.cse9 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse10 (= ~m_st~0 2)) (.cse11 (= |old(~E_2~0)| ~E_2~0)) (.cse12 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse3 (not (= 0 ~local~0))) (.cse2 (not (= |old(~token~0)| 0))) (.cse6 (< ~E_1~0 2)) (.cse7 (= ~T1_E~0 0)) (.cse22 (< |old(~t2_st~0)| 2)) (.cse14 (= |old(~t1_pc~0)| 1)) (.cse15 (= ~T2_E~0 0)) (.cse16 (= 0 ~M_E~0)) (.cse17 (= 1 ~E_M~0)) (.cse23 (not (= 1 ~t2_pc~0))) (.cse19 (< |old(~E_2~0)| 2)) (.cse20 (= 0 ~E_M~0))) (and (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) .cse0 .cse1 (not (= 1 ~t1_i~0)) (or .cse2 .cse3) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) .cse4 (not (= 1 ~t2_i~0)) .cse5 (not (= 2 ~M_E~0))) (or .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12) (< 0 ~t2_pc~0) .cse13 (not .cse14) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse7 .cse15 .cse16 .cse0 .cse17 .cse1 .cse4 .cse19 .cse20 .cse21 .cse5) (or .cse6 .cse7 .cse22 (< ~local~0 |old(~token~0)|) .cse13 (< |old(~token~0)| ~local~0) (and .cse8 .cse9 (= ~token~0 |old(~token~0)|) .cse10 .cse11 .cse12) .cse15 .cse16 .cse17 .cse23 .cse18 .cse19 .cse20) (or .cse6 .cse7 .cse22 .cse3 .cse14 .cse15 .cse16 .cse17 .cse23 .cse2 .cse24 .cse19 .cse20 .cse25) (or .cse6 .cse7 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse23 .cse18 .cse19 .cse20))))) [2018-12-03 01:50:34,535 INFO L448 ceAbstractionStarter]: For program point transmit1EXIT(lines 80 115) no Hoare annotation was computed. [2018-12-03 01:50:34,535 INFO L444 ceAbstractionStarter]: At program point L109(lines 80 115) the Hoare annotation is: (let ((.cse31 (= 0 |old(~m_st~0)|))) (let ((.cse13 (not (= 1 ~m_pc~0))) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse22 (not .cse31)) (.cse23 (not (= 0 ~m_pc~0)))) (let ((.cse6 (<= 2 ~E_2~0)) (.cse0 (< ~E_1~0 2)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse17 (= |old(~t1_pc~0)| 1)) (.cse4 (= 1 ~t1_pc~0)) (.cse5 (<= 2 ~t1_st~0)) (.cse10 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse12 (not (= 1 ~t2_pc~0))) (.cse19 (= ~m_st~0 |old(~m_st~0)|)) (.cse20 (= ~token~0 0)) (.cse21 (not (= |old(~token~0)| 0))) (.cse18 (not (= 0 ~local~0))) (.cse1 (= ~T1_E~0 0)) (.cse8 (= ~T2_E~0 0)) (.cse9 (= 0 ~M_E~0)) (.cse26 (= ~t1_pc~0 1)) (.cse7 (= ~m_st~0 2)) (.cse27 (= ~t1_st~0 2)) (.cse28 (= ~t2_st~0 0)) (.cse16 (<= |old(~E_2~0)| ~E_2~0)) (.cse24 (let ((.cse32 (not (= 0 |old(~t2_st~0)|)))) (and (or .cse32 .cse13 .cse3) (or .cse22 .cse32 .cse23)))) (.cse11 (= 1 ~E_M~0)) (.cse25 (not (= |old(~t1_pc~0)| 0))) (.cse29 (not (= 2 ~E_1~0))) (.cse14 (< |old(~E_2~0)| 2)) (.cse15 (= 0 ~E_M~0)) (.cse30 (not (= 0 ~t2_pc~0)))) (and (or .cse0 .cse1 .cse2 (< ~local~0 |old(~token~0)|) .cse3 (< |old(~token~0)| ~local~0) (and .cse4 .cse5 (<= ~token~0 (+ |old(~token~0)| 1)) .cse6 .cse7 (<= (+ ~local~0 1) ~token~0)) .cse8 .cse9 (and .cse4 .cse10 .cse7 .cse5 .cse6) .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 (and .cse4 .cse5 .cse10 .cse7 .cse16) .cse2 .cse3 .cse17 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 (< 0 ~t2_pc~0) .cse3 (not .cse17) .cse8 .cse9 .cse11 (and .cse4 .cse7 .cse5 .cse6) .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse2 .cse18 .cse17 (and .cse4 .cse5 .cse19 .cse10 .cse20 .cse16) .cse8 .cse9 .cse11 .cse12 .cse21 .cse22 .cse14 .cse15 .cse23) (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) .cse24 .cse25 (and .cse26 .cse19 .cse27 .cse28 .cse20 .cse16) (not (= 1 ~t1_i~0)) (or .cse21 .cse18 .cse23) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) .cse29 (not (= 1 ~t2_i~0)) .cse30 (not (= 2 ~M_E~0))) (or .cse1 .cse8 .cse9 (and .cse26 .cse7 .cse27 .cse28 .cse16) .cse24 .cse11 .cse25 .cse29 .cse14 .cse15 .cse31 .cse30))))) [2018-12-03 01:50:34,535 INFO L444 ceAbstractionStarter]: At program point L105(line 105) the Hoare annotation is: (let ((.cse22 (= 0 |old(~m_st~0)|))) (let ((.cse8 (not (= 1 ~m_pc~0))) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse24 (not .cse22)) (.cse25 (not (= 0 ~m_pc~0)))) (let ((.cse16 (let ((.cse26 (not (= 0 |old(~t2_st~0)|)))) (and (or .cse26 .cse8 .cse3) (or .cse24 .cse26 .cse25)))) (.cse17 (not (= |old(~t1_pc~0)| 0))) (.cse20 (not (= 2 ~E_1~0))) (.cse21 (not (= 0 ~t2_pc~0))) (.cse19 (not (= 0 ~local~0))) (.cse18 (not (= |old(~token~0)| 0))) (.cse11 (= 1 ~t1_pc~0)) (.cse13 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse14 (= ~m_st~0 2)) (.cse15 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse12 (not (= ~E_2~0 0))) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse23 (= |old(~t1_pc~0)| 1)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse6 (= 1 ~E_M~0)) (.cse7 (not (= 1 ~t2_pc~0))) (.cse9 (< |old(~E_2~0)| 2)) (.cse10 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 (< ~local~0 |old(~token~0)|) .cse3 (< |old(~token~0)| ~local~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 (<= ~token~0 (+ |old(~token~0)| 1)) .cse12 .cse13 .cse14 (<= (+ ~local~0 1) ~token~0) .cse15)) (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) .cse16 .cse17 (not (= 1 ~t1_i~0)) (or .cse18 .cse19) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) .cse20 (not (= 1 ~t2_i~0)) .cse21 (not (= 2 ~M_E~0))) (or .cse1 .cse4 .cse5 .cse16 .cse6 .cse17 .cse20 .cse9 .cse10 .cse22 .cse21) (or .cse0 .cse1 .cse2 .cse19 .cse23 .cse4 .cse5 .cse6 .cse7 .cse18 .cse24 .cse9 .cse10 .cse25) (or .cse0 .cse1 (and .cse11 .cse13 .cse14 .cse15 .cse12) (< 0 ~t2_pc~0) .cse3 (not .cse23) .cse4 .cse5 .cse6 .cse8 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))))) [2018-12-03 01:50:34,536 INFO L448 ceAbstractionStarter]: For program point L105-1(line 105) no Hoare annotation was computed. [2018-12-03 01:50:34,536 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 419) no Hoare annotation was computed. [2018-12-03 01:50:34,536 INFO L444 ceAbstractionStarter]: At program point L413(line 413) the Hoare annotation is: (let ((.cse32 (= ~t1_pc~0 1)) (.cse37 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse33 (= 1 ~m_pc~0)) (.cse20 (= 0 |old(~m_st~0)|)) (.cse38 (+ ~local~0 2)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse30 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse39 (= ~t1_st~0 0)) (.cse40 (+ ~local~0 1))) (let ((.cse13 (= 0 ~E_2~0)) (.cse9 (< ~token~0 .cse40)) (.cse11 (< .cse40 ~token~0)) (.cse31 (and .cse29 .cse30 .cse39)) (.cse24 (and .cse29 .cse39 (= ~t2_st~0 0))) (.cse25 (not (= ~t1_pc~0 0))) (.cse28 (not (= 0 ~m_pc~0))) (.cse23 (not (= |old(~t1_st~0)| 0))) (.cse26 (not (= 0 |old(~t2_st~0)|))) (.cse27 (not (= 0 ~t2_pc~0))) (.cse35 (< .cse38 ~token~0)) (.cse34 (not .cse20)) (.cse36 (< ~token~0 .cse38)) (.cse0 (< ~E_1~0 2)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse8 (not (= 1 ~t2_pc~0))) (.cse10 (not .cse33)) (.cse14 (and .cse30 (= ~m_st~0 2) .cse37)) (.cse21 (and .cse29 .cse30 .cse37)) (.cse1 (= ~T1_E~0 0)) (.cse22 (< 0 ~t2_pc~0)) (.cse15 (< ~local~0 ~token~0)) (.cse4 (not .cse32)) (.cse16 (< ~token~0 ~local~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse17 (< |old(~t1_st~0)| 2)) (.cse18 (not (= 1 ~E_1~0))) (.cse19 (< ~E_2~0 2)) (.cse12 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse1 .cse2 .cse15 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse17 .cse18 .cse19 .cse12 .cse20 .cse21) (or .cse0 .cse1 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse14 .cse12 .cse13) (or .cse1 .cse5 .cse6 .cse23 .cse7 .cse24 .cse25 .cse18 .cse26 .cse19 .cse12 .cse20 .cse27 .cse28) (or (or (and (<= 2 ~t1_st~0) .cse29 .cse30) .cse31) .cse15 .cse16 (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse18 .cse10 .cse19 .cse12 .cse20)) (or .cse0 .cse1 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse19 .cse11 .cse12) (or .cse1 .cse2 .cse31 .cse32 .cse5 .cse6 .cse23 .cse7 .cse8 .cse18 .cse19 .cse12 .cse20 .cse33) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) .cse24 (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (or (not (= ~token~0 0)) .cse25 .cse34 (not (= 0 ~local~0)) .cse28 .cse23) (not (= ~m_i~0 1)) .cse26 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) .cse27 (not (= 2 ~M_E~0))) (or .cse0 (not .cse7) .cse1 .cse3 .cse35 .cse4 .cse5 .cse6 .cse8 .cse17 .cse10 .cse14 .cse19 .cse36) (or .cse0 .cse1 .cse2 .cse35 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse34 .cse10 .cse19 .cse12 .cse21 .cse36) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse14 .cse19 .cse12) (or .cse21 .cse1 .cse22 .cse15 .cse4 .cse16 .cse5 .cse6 .cse7 .cse17 .cse18 .cse19 .cse12 .cse20 .cse33)))) [2018-12-03 01:50:34,536 INFO L444 ceAbstractionStarter]: At program point L415-2(lines 415 419) the Hoare annotation is: (let ((.cse28 (= 1 ~m_pc~0)) (.cse38 (= ~t1_pc~0 1)) (.cse37 (= ~t1_st~0 0)) (.cse15 (= ~m_st~0 |old(~m_st~0)|)) (.cse16 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse36 (= activate_threads_~tmp~1 0)) (.cse17 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse40 (+ ~local~0 2)) (.cse41 (+ ~local~0 1)) (.cse27 (= 0 |old(~m_st~0)|))) (let ((.cse13 (= 0 ~E_2~0)) (.cse20 (not .cse27)) (.cse9 (< ~token~0 .cse41)) (.cse11 (< .cse41 ~token~0)) (.cse18 (< .cse40 ~token~0)) (.cse39 (= ~m_st~0 0)) (.cse22 (< ~token~0 .cse40)) (.cse29 (< 0 ~t2_pc~0)) (.cse23 (< ~local~0 ~token~0)) (.cse24 (< ~token~0 ~local~0)) (.cse25 (and .cse15 .cse16 .cse36 .cse17)) (.cse33 (not (= |old(~t1_st~0)| 0))) (.cse31 (not (= ~t1_pc~0 0))) (.cse26 (not (= 1 ~E_1~0))) (.cse34 (not (= 0 |old(~t2_st~0)|))) (.cse30 (and .cse15 .cse36 .cse37 (= ~t2_st~0 0))) (.cse35 (not (= 0 ~t2_pc~0))) (.cse32 (not (= 0 ~m_pc~0))) (.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse4 (not .cse38)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse19 (< |old(~t1_st~0)| 2)) (.cse10 (not .cse28)) (.cse14 (and .cse16 (= ~m_st~0 2) .cse17)) (.cse21 (< ~E_2~0 2)) (.cse12 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 (and .cse15 .cse16 .cse17) .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse20 .cse10 .cse21 .cse12 .cse22) (or .cse1 .cse2 .cse23 .cse4 .cse24 .cse25 .cse5 .cse6 .cse7 .cse8 .cse19 .cse26 .cse21 .cse12 .cse27 .cse28) (or .cse0 .cse1 .cse29 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse14 .cse12 .cse13) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) .cse30 (or (not (= ~token~0 0)) .cse31 .cse20 (not (= 0 ~local~0)) .cse32 .cse33) (not (= ~m_i~0 1)) .cse34 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) .cse35 (not (= 2 ~M_E~0))) (or .cse0 .cse1 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse21 .cse11 .cse12) (or .cse1 (and .cse15 .cse16 .cse36 .cse37) .cse2 .cse38 .cse5 .cse6 .cse33 .cse7 .cse8 .cse26 .cse21 .cse12 .cse27 .cse28) (or .cse23 .cse24 (and (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse26 .cse21 .cse12 .cse27) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse33 .cse7 .cse8 .cse26 .cse10 .cse21 .cse12 .cse27)) (or (and (or (and .cse39 .cse37) (and .cse15 .cse37)) .cse16 .cse17) (and .cse16 (or .cse15 .cse39) (<= 2 ~t1_st~0) .cse17))) (or .cse0 (not .cse7) .cse1 .cse3 .cse18 .cse4 (and .cse39 .cse16 .cse17) .cse5 .cse6 .cse8 .cse19 .cse10 .cse14 .cse21 .cse22) (or .cse1 .cse29 .cse23 .cse4 .cse24 .cse25 .cse5 .cse6 .cse7 .cse19 .cse26 .cse21 .cse12 .cse27 .cse28) (or .cse1 .cse5 .cse6 .cse33 .cse7 .cse31 .cse26 .cse34 .cse30 .cse21 .cse12 .cse27 .cse35 .cse32) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse10 .cse14 .cse21 .cse12)))) [2018-12-03 01:50:34,537 INFO L448 ceAbstractionStarter]: For program point L413-1(line 413) no Hoare annotation was computed. [2018-12-03 01:50:34,537 INFO L448 ceAbstractionStarter]: For program point L431(lines 431 435) no Hoare annotation was computed. [2018-12-03 01:50:34,537 INFO L444 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 406 439) the Hoare annotation is: (let ((.cse32 (= ~t1_pc~0 1)) (.cse37 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse33 (= 1 ~m_pc~0)) (.cse20 (= 0 |old(~m_st~0)|)) (.cse38 (+ ~local~0 2)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse30 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse39 (= ~t1_st~0 0)) (.cse40 (+ ~local~0 1))) (let ((.cse13 (= 0 ~E_2~0)) (.cse9 (< ~token~0 .cse40)) (.cse11 (< .cse40 ~token~0)) (.cse31 (and .cse29 .cse30 .cse39)) (.cse24 (and .cse29 .cse39 (= ~t2_st~0 0))) (.cse25 (not (= ~t1_pc~0 0))) (.cse28 (not (= 0 ~m_pc~0))) (.cse23 (not (= |old(~t1_st~0)| 0))) (.cse26 (not (= 0 |old(~t2_st~0)|))) (.cse27 (not (= 0 ~t2_pc~0))) (.cse35 (< .cse38 ~token~0)) (.cse34 (not .cse20)) (.cse36 (< ~token~0 .cse38)) (.cse0 (< ~E_1~0 2)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse8 (not (= 1 ~t2_pc~0))) (.cse10 (not .cse33)) (.cse14 (and .cse30 (= ~m_st~0 2) .cse37)) (.cse21 (and .cse29 .cse30 .cse37)) (.cse1 (= ~T1_E~0 0)) (.cse22 (< 0 ~t2_pc~0)) (.cse15 (< ~local~0 ~token~0)) (.cse4 (not .cse32)) (.cse16 (< ~token~0 ~local~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse17 (< |old(~t1_st~0)| 2)) (.cse18 (not (= 1 ~E_1~0))) (.cse19 (< ~E_2~0 2)) (.cse12 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse1 .cse2 .cse15 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse17 .cse18 .cse19 .cse12 .cse20 .cse21) (or .cse0 .cse1 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse14 .cse12 .cse13) (or .cse1 .cse5 .cse6 .cse23 .cse7 .cse24 .cse25 .cse18 .cse26 .cse19 .cse12 .cse20 .cse27 .cse28) (or (or (and (<= 2 ~t1_st~0) .cse29 .cse30) .cse31) .cse15 .cse16 (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse18 .cse10 .cse19 .cse12 .cse20)) (or .cse0 .cse1 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse19 .cse11 .cse12) (or .cse1 .cse2 .cse31 .cse32 .cse5 .cse6 .cse23 .cse7 .cse8 .cse18 .cse19 .cse12 .cse20 .cse33) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) .cse24 (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (or (not (= ~token~0 0)) .cse25 .cse34 (not (= 0 ~local~0)) .cse28 .cse23) (not (= ~m_i~0 1)) .cse26 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) .cse27 (not (= 2 ~M_E~0))) (or .cse0 (not .cse7) .cse1 .cse3 .cse35 .cse4 .cse5 .cse6 .cse8 .cse17 .cse10 .cse14 .cse19 .cse36) (or .cse0 .cse1 .cse2 .cse35 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse34 .cse10 .cse19 .cse12 .cse21 .cse36) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse17 .cse10 .cse14 .cse19 .cse12) (or .cse21 .cse1 .cse22 .cse15 .cse4 .cse16 .cse5 .cse6 .cse7 .cse17 .cse18 .cse19 .cse12 .cse20 .cse33)))) [2018-12-03 01:50:34,537 INFO L448 ceAbstractionStarter]: For program point L429(line 429) no Hoare annotation was computed. [2018-12-03 01:50:34,537 INFO L448 ceAbstractionStarter]: For program point L431-2(lines 406 439) no Hoare annotation was computed. [2018-12-03 01:50:34,537 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 406 439) no Hoare annotation was computed. [2018-12-03 01:50:34,537 INFO L448 ceAbstractionStarter]: For program point L423(lines 423 427) no Hoare annotation was computed. [2018-12-03 01:50:34,537 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-12-03 01:50:34,538 INFO L444 ceAbstractionStarter]: At program point L423-2(lines 423 427) the Hoare annotation is: (let ((.cse33 (= 1 ~m_pc~0)) (.cse40 (+ ~local~0 1)) (.cse39 (= ~t1_pc~0 1)) (.cse19 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse35 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (= 0 |old(~m_st~0)|)) (.cse34 (= activate_threads_~tmp___0~0 0)) (.cse18 (= ~m_st~0 |old(~m_st~0)|)) (.cse32 (= activate_threads_~tmp~1 0)) (.cse17 (= ~t1_st~0 0)) (.cse41 (+ ~local~0 2))) (let ((.cse16 (= ~m_st~0 0)) (.cse36 (< .cse41 ~token~0)) (.cse37 (< ~token~0 .cse41)) (.cse14 (< ~local~0 ~token~0)) (.cse15 (< ~token~0 ~local~0)) (.cse8 (and .cse34 .cse18 .cse32 .cse17 (= ~t2_st~0 0))) (.cse5 (not (= ~t1_pc~0 0))) (.cse38 (not .cse11)) (.cse13 (not (= 0 ~m_pc~0))) (.cse7 (not (= 0 |old(~t2_st~0)|))) (.cse12 (not (= 0 ~t2_pc~0))) (.cse31 (< 0 ~t2_pc~0)) (.cse29 (= 0 ~E_2~0)) (.cse25 (< ~E_1~0 2)) (.cse30 (and .cse34 .cse19 (= ~m_st~0 2) .cse35)) (.cse26 (not (= 2 |old(~m_st~0)|))) (.cse21 (not .cse39)) (.cse23 (< |old(~t1_st~0)| 2)) (.cse27 (< ~token~0 .cse40)) (.cse24 (not .cse33)) (.cse28 (< .cse40 ~token~0)) (.cse0 (= ~T1_E~0 0)) (.cse20 (< |old(~t2_st~0)| 2)) (.cse1 (= ~T2_E~0 0)) (.cse2 (= 0 ~M_E~0)) (.cse3 (not (= |old(~t1_st~0)| 0))) (.cse4 (= 1 ~E_M~0)) (.cse22 (not (= 1 ~t2_pc~0))) (.cse6 (not (= 1 ~E_1~0))) (.cse9 (< ~E_2~0 2)) (.cse10 (= 0 ~E_M~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse15 (and (or (and .cse16 .cse17) (and .cse18 .cse17)) .cse19) (and (or .cse0 .cse20 .cse21 .cse1 .cse2 .cse4 .cse22 .cse23 .cse6 .cse9 .cse10 .cse11) (or .cse0 .cse20 .cse21 .cse1 .cse2 .cse3 .cse4 .cse22 .cse6 .cse24 .cse9 .cse10 .cse11))) (or .cse25 .cse0 .cse20 .cse26 .cse21 .cse1 .cse2 .cse4 .cse22 .cse27 .cse24 .cse28 .cse10 .cse29 .cse30) (or .cse0 .cse31 .cse14 .cse21 .cse15 .cse1 .cse2 .cse4 .cse23 .cse6 (and .cse18 .cse19 .cse32 .cse17) .cse9 .cse10 .cse11 .cse33) (or .cse25 (not .cse4) .cse0 .cse26 (and .cse16 .cse34 .cse19 .cse35) .cse36 .cse21 .cse1 .cse2 .cse22 .cse23 .cse30 .cse24 .cse9 .cse37) (or .cse25 .cse0 .cse20 .cse36 .cse21 .cse1 .cse2 .cse4 .cse22 .cse23 .cse38 .cse24 .cse9 .cse10 .cse37 (and .cse34 .cse18 .cse19 .cse35)) (or .cse25 .cse0 .cse20 .cse26 .cse21 .cse1 .cse30 .cse2 .cse4 .cse22 .cse23 .cse24 .cse9 .cse10) (or .cse0 .cse20 (and .cse18 .cse32) .cse14 .cse21 .cse15 .cse1 .cse2 .cse4 .cse22 .cse23 .cse6 .cse9 .cse10 .cse11 .cse33) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) .cse8 (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (or (not (= ~token~0 0)) .cse5 .cse38 (not (= 0 ~local~0)) .cse13 .cse3) (not (= ~m_i~0 1)) .cse7 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) .cse12 (not (= 2 ~M_E~0))) (or .cse25 .cse0 .cse31 .cse26 .cse21 .cse1 .cse2 .cse30 .cse4 .cse24 .cse10 .cse29) (or .cse25 .cse30 .cse0 .cse26 .cse21 .cse1 .cse2 .cse4 .cse22 .cse23 .cse27 .cse24 .cse9 .cse28 .cse10) (or .cse0 .cse20 .cse39 .cse1 .cse2 .cse3 .cse4 .cse22 .cse6 .cse9 .cse10 .cse11 (and .cse34 .cse18 .cse19 .cse32 .cse17) .cse33)))) [2018-12-03 01:50:34,538 INFO L448 ceAbstractionStarter]: For program point immediate_notifyEXIT(lines 440 450) no Hoare annotation was computed. [2018-12-03 01:50:34,538 INFO L444 ceAbstractionStarter]: At program point immediate_notifyENTRY(lines 440 450) the Hoare annotation is: (let ((.cse27 (= ~t1_pc~0 1)) (.cse30 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse28 (= 1 ~m_pc~0)) (.cse23 (= ~m_st~0 |old(~m_st~0)|)) (.cse25 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse24 (= ~t1_st~0 0))) (let ((.cse12 (= 0 ~E_2~0)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse26 (and .cse23 .cse25 .cse24)) (.cse22 (not (= |old(~t1_st~0)| 0))) (.cse0 (< ~E_1~0 2)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse8 (not (= 1 ~t2_pc~0))) (.cse10 (not .cse28)) (.cse13 (and .cse25 (= ~m_st~0 2) .cse30)) (.cse20 (and .cse23 .cse25 .cse30)) (.cse1 (= ~T1_E~0 0)) (.cse21 (< 0 ~t2_pc~0)) (.cse14 (< ~local~0 ~token~0)) (.cse4 (not .cse27)) (.cse15 (< ~token~0 ~local~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse16 (< |old(~t1_st~0)| 2)) (.cse17 (not (= 1 ~E_1~0))) (.cse18 (< ~E_2~0 2)) (.cse11 (= 0 ~E_M~0)) (.cse19 (= 0 |old(~m_st~0)|))) (and (let ((.cse9 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< ~token~0 .cse9) .cse10 (< .cse9 ~token~0) .cse11 .cse12 .cse13)) (or .cse1 .cse2 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse16 .cse17 .cse18 .cse11 .cse19 .cse20) (or .cse0 .cse1 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse13 .cse11 .cse12) (or .cse1 .cse5 .cse6 .cse22 .cse7 (and .cse23 .cse24 (= ~t2_st~0 0)) (not (= ~t1_pc~0 0)) .cse17 (not (= 0 |old(~t2_st~0)|)) .cse18 .cse11 .cse19 (not (= 0 ~t2_pc~0)) (not (= 0 ~m_pc~0))) (or (or (and (<= 2 ~t1_st~0) .cse23 .cse25) .cse26) .cse14 .cse15 (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse17 .cse10 .cse18 .cse11 .cse19)) (or .cse1 .cse2 .cse26 .cse27 .cse5 .cse6 .cse22 .cse7 .cse8 .cse17 .cse18 .cse11 .cse19 .cse28) (let ((.cse29 (+ ~local~0 2))) (or .cse0 (not .cse7) .cse1 .cse3 (< .cse29 ~token~0) .cse4 .cse5 .cse6 .cse8 .cse16 .cse10 .cse13 .cse18 (< ~token~0 .cse29))) (or .cse20 .cse1 .cse21 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16 .cse17 .cse18 .cse11 .cse19 .cse28)))) [2018-12-03 01:50:34,538 INFO L448 ceAbstractionStarter]: For program point immediate_notifyFINAL(lines 440 450) no Hoare annotation was computed. [2018-12-03 01:50:34,539 INFO L444 ceAbstractionStarter]: At program point L124(lines 119 150) the Hoare annotation is: (let ((.cse13 (not (= ~t1_pc~0 0))) (.cse0 (< ~E_1~0 2)) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse12 (not (= |old(~t1_st~0)| 0))) (.cse9 (not (= 1 ~m_pc~0))) (.cse1 (= ~T1_E~0 0)) (.cse15 (not (= 0 ~local~0))) (.cse18 (not (= 2 ~E_1~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse19 (not (= 0 |old(~t2_pc~0)|))) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse14 (not (= |old(~token~0)| 0))) (.cse8 (< |old(~t1_st~0)| 2)) (.cse17 (not (= 0 |old(~m_st~0)|))) (.cse10 (< ~E_2~0 2)) (.cse11 (= 0 |old(~E_M~0)|)) (.cse16 (not (= 0 ~m_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) .cse12 .cse13 (not (= 1 ~t1_i~0)) (or .cse14 .cse15 .cse16) (not (= ~T2_E~0 2)) (not (= 2 |old(~E_M~0)|)) .cse17 (not (= ~m_i~0 1)) .cse18 (not (= 1 ~t2_i~0)) .cse19 (not (= 2 ~M_E~0))) (or .cse7 .cse13 (or .cse1 .cse11 .cse5 .cse6) .cse9 .cse3 .cse18 .cse10 .cse19 .cse12) (let ((.cse20 (+ ~local~0 1))) (or .cse0 .cse1 (and (= |old(~E_M~0)| ~E_M~0) (= 1 ~t2_pc~0) (<= |old(~t2_st~0)| ~t2_st~0) (= ~token~0 |old(~token~0)|) (= ~m_st~0 2) (<= |old(~t1_st~0)| ~t1_st~0)) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 1 |old(~t2_pc~0)|)) .cse8 (< |old(~token~0)| .cse20) .cse9 .cse10 (< .cse20 |old(~token~0)|) .cse11)) (or .cse0 .cse1 .cse2 (< ~local~0 |old(~token~0)|) .cse3 .cse4 (< |old(~token~0)| ~local~0) .cse5 .cse6 .cse12 .cse7 .cse9 .cse10 .cse11) (or .cse1 (or .cse15 .cse18 .cse4 .cse19) .cse5 .cse6 .cse7 .cse14 .cse8 .cse17 .cse10 .cse11 .cse16))) [2018-12-03 01:50:34,539 INFO L444 ceAbstractionStarter]: At program point L145(lines 116 151) the Hoare annotation is: (let ((.cse8 (not (= ~E_M~0 0))) (.cse9 (not (= ~E_M~0 1))) (.cse10 (= 1 ~t2_pc~0)) (.cse11 (= ~m_st~0 2)) (.cse22 (<= 2 ~t2_st~0)) (.cse0 (= ~T1_E~0 0)) (.cse26 (<= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse19 (< 0 |old(~t2_pc~0)|)) (.cse5 (not (= |old(~t1_st~0)| 0))) (.cse7 (not (= ~t1_pc~0 0))) (.cse27 (not (= |old(~token~0)| 0))) (.cse23 (not (= 0 ~local~0))) (.cse29 (not (= 0 ~m_pc~0))) (.cse24 (= ~m_st~0 |old(~m_st~0)|)) (.cse12 (= ~t1_st~0 0)) (.cse25 (= ~token~0 0)) (.cse28 (not (= 0 |old(~m_st~0)|))) (.cse14 (not (= 2 ~E_1~0))) (.cse16 (not (= 0 |old(~t2_pc~0)|))) (.cse17 (< ~E_1~0 2)) (.cse18 (and .cse8 (<= 2 ~E_1~0) .cse9 .cse10 .cse11 .cse22 (not .cse0) .cse26)) (.cse4 (not (= 2 |old(~m_st~0)|))) (.cse20 (not (= ~t1_pc~0 1))) (.cse2 (= ~T2_E~0 0)) (.cse3 (= 0 ~M_E~0)) (.cse6 (= 1 |old(~E_M~0)|)) (.cse21 (< |old(~t1_st~0)| 2)) (.cse13 (not (= 1 ~m_pc~0))) (.cse15 (< ~E_2~0 2)) (.cse1 (= 0 |old(~E_M~0)|))) (and (or (or .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 (= ~t2_st~0 2) .cse12) .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 .cse18 .cse19 .cse4 .cse20 .cse2 .cse3 .cse6 .cse21 .cse13 .cse15 .cse1) (or .cse17 .cse0 (and .cse8 .cse9 .cse10 (= ~token~0 |old(~token~0)|) .cse11 .cse22 .cse12) .cse19 (< ~local~0 |old(~token~0)|) .cse4 .cse20 (< |old(~token~0)| ~local~0) .cse2 .cse3 .cse5 .cse6 .cse13 .cse15 .cse1) (or .cse0 (or .cse23 .cse14 .cse20 .cse16) (and .cse8 .cse9 .cse10 .cse24 .cse22 .cse25 .cse26) .cse2 .cse3 .cse6 .cse27 .cse21 .cse28 .cse15 .cse1 .cse29) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) .cse5 .cse7 (not (= 1 ~t1_i~0)) (or .cse27 .cse23 .cse29) (not (= ~T2_E~0 2)) (not (= 2 |old(~E_M~0)|)) (and .cse8 .cse9 .cse10 .cse24 .cse22 .cse12 .cse25) .cse28 (not (= ~m_i~0 1)) .cse14 (not (= 1 ~t2_i~0)) .cse16 (not (= 2 ~M_E~0))) (let ((.cse31 (+ ~local~0 1))) (or .cse17 .cse0 (let ((.cse30 (+ ~local~0 2))) (and (= ~m_st~0 0) .cse8 .cse9 (<= ~token~0 .cse30) .cse10 .cse22 (<= .cse30 ~token~0) .cse26)) .cse18 .cse4 .cse20 .cse2 .cse3 .cse6 (not (= 1 |old(~t2_pc~0)|)) .cse21 (< |old(~token~0)| .cse31) .cse13 .cse15 (< .cse31 |old(~token~0)|) .cse1))))) [2018-12-03 01:50:34,539 INFO L448 ceAbstractionStarter]: For program point transmit2EXIT(lines 116 151) no Hoare annotation was computed. [2018-12-03 01:50:34,539 INFO L444 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: (let ((.cse13 (not (= ~t1_pc~0 0))) (.cse0 (< ~E_1~0 2)) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse12 (not (= |old(~t1_st~0)| 0))) (.cse9 (not (= 1 ~m_pc~0))) (.cse1 (= ~T1_E~0 0)) (.cse15 (not (= 0 ~local~0))) (.cse18 (not (= 2 ~E_1~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse19 (not (= 0 |old(~t2_pc~0)|))) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse14 (not (= |old(~token~0)| 0))) (.cse8 (< |old(~t1_st~0)| 2)) (.cse17 (not (= 0 |old(~m_st~0)|))) (.cse10 (< ~E_2~0 2)) (.cse11 (= 0 |old(~E_M~0)|)) (.cse16 (not (= 0 ~m_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) .cse12 .cse13 (not (= 1 ~t1_i~0)) (or .cse14 .cse15 .cse16) (not (= ~T2_E~0 2)) (not (= 2 |old(~E_M~0)|)) .cse17 (not (= ~m_i~0 1)) .cse18 (not (= 1 ~t2_i~0)) .cse19 (not (= 2 ~M_E~0))) (or .cse7 .cse13 (or .cse1 .cse11 .cse5 .cse6) .cse9 .cse3 .cse18 .cse10 .cse19 .cse12) (let ((.cse20 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 1 |old(~t2_pc~0)|)) .cse8 (< |old(~token~0)| .cse20) .cse9 .cse10 (< .cse20 |old(~token~0)|) .cse11 (let ((.cse21 (+ ~local~0 2))) (and (<= ~token~0 .cse21) (= 1 ~t2_pc~0) (<= |old(~t2_st~0)| ~t2_st~0) (= ~m_st~0 2) (<= .cse21 ~token~0) (<= |old(~t1_st~0)| ~t1_st~0) (= 1 ~E_M~0))))) (or .cse0 .cse1 .cse2 (< ~local~0 |old(~token~0)|) .cse3 .cse4 (< |old(~token~0)| ~local~0) .cse5 .cse6 .cse12 .cse7 .cse9 .cse10 .cse11) (or .cse1 (or .cse15 .cse18 .cse4 .cse19) .cse5 .cse6 .cse7 .cse14 .cse8 .cse17 .cse10 .cse11 .cse16))) [2018-12-03 01:50:34,539 INFO L448 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-12-03 01:50:34,540 INFO L444 ceAbstractionStarter]: At program point L131-1(lines 119 150) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0))) (let ((.cse5 (= ~T2_E~0 0)) (.cse26 (= ~m_st~0 |old(~m_st~0)|)) (.cse16 (= ~m_st~0 2)) (.cse13 (not (= ~E_M~0 0))) (.cse34 (not .cse1)) (.cse35 (= 1 ~m_pc~0)) (.cse14 (not (= ~E_M~0 1))) (.cse24 (<= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse12 (and (<= 2 ~t1_st~0) (and (<= 2 ~E_2~0) (and (= 1 ~t1_pc~0) (not .cse5) .cse26 (not (= ~M_E~0 0)) .cse16 .cse13 .cse34 .cse35 (<= 2 ~E_1~0)) .cse14) .cse24)) (.cse0 (< ~E_1~0 2)) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse9 (not .cse35)) (.cse17 (= ~t1_st~0 0)) (.cse18 (not (= |old(~t1_st~0)| 0))) (.cse19 (not (= ~t1_pc~0 0))) (.cse31 (not (= 0 ~local~0))) (.cse20 (not (= 2 ~E_1~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse21 (not (= 0 |old(~t2_pc~0)|))) (.cse15 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse27 (<= ~t2_pc~0 0)) (.cse22 (= ~m_st~0 0)) (.cse28 (and .cse34 .cse13)) (.cse29 (= ~token~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse30 (not (= |old(~token~0)| 0))) (.cse8 (< |old(~t1_st~0)| 2)) (.cse33 (not (= 0 |old(~m_st~0)|))) (.cse10 (< ~E_2~0 2)) (.cse11 (= 0 |old(~E_M~0)|)) (.cse32 (not (= 0 ~m_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (and .cse13 .cse14 .cse15 .cse16 (= ~t2_pc~0 0) .cse17) (or .cse1 .cse11 .cse5 .cse6) .cse3 .cse18 .cse7 .cse19 .cse9 .cse20 .cse10 .cse21) (let ((.cse25 (+ ~local~0 1))) (or .cse0 .cse1 .cse3 .cse4 .cse5 (let ((.cse23 (+ ~local~0 2))) (and .cse22 .cse13 .cse14 (<= ~token~0 .cse23) (= 1 ~t2_pc~0) (<= .cse23 ~token~0) .cse24)) .cse6 .cse7 (not (= 1 |old(~t2_pc~0)|)) .cse8 (< |old(~token~0)| .cse25) .cse9 .cse10 (< .cse25 |old(~token~0)|) .cse11 .cse12)) (or .cse0 .cse1 .cse2 (< ~local~0 |old(~token~0)|) .cse3 .cse4 (< |old(~token~0)| ~local~0) (and .cse15 (<= ~token~0 ~local~0) (and .cse26 .cse13 .cse17) (<= ~local~0 ~token~0) .cse14) .cse5 .cse6 .cse18 .cse7 .cse9 .cse10 .cse11) (or (and .cse15 .cse27 (and (and .cse17 .cse28) (and .cse22 .cse29)) .cse14) (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) .cse18 .cse19 (not (= 1 ~t1_i~0)) (or .cse30 .cse31 .cse32) (not (= ~T2_E~0 2)) (not (= 2 |old(~E_M~0)|)) .cse33 (not (= ~m_i~0 1)) .cse20 (not (= 1 ~t2_i~0)) .cse21 (not (= 2 ~M_E~0))) (or .cse1 (or .cse31 .cse20 .cse4 .cse21) (and .cse15 .cse27 (and .cse22 .cse28) .cse29 .cse24 .cse14) .cse5 .cse6 .cse7 .cse30 .cse8 .cse33 .cse10 .cse11 .cse32))))) [2018-12-03 01:50:34,540 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 127) no Hoare annotation was computed. [2018-12-03 01:50:34,540 INFO L444 ceAbstractionStarter]: At program point transmit2ENTRY(lines 116 151) the Hoare annotation is: (let ((.cse0 (< ~E_1~0 2)) (.cse2 (< 0 |old(~t2_pc~0)|)) (.cse9 (<= ~t2_pc~0 0)) (.cse29 (= ~token~0 |old(~token~0)|)) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse12 (= ~m_st~0 2)) (.cse25 (= ~t1_st~0 0)) (.cse17 (not (= |old(~t1_st~0)| 0))) (.cse18 (not (= ~t1_pc~0 0))) (.cse14 (not (= 1 ~m_pc~0))) (.cse1 (= ~T1_E~0 0)) (.cse20 (not (= 0 ~local~0))) (.cse27 (not (= 2 ~E_1~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse28 (not (= 0 |old(~t2_pc~0)|))) (.cse10 (= |old(~E_M~0)| ~E_M~0)) (.cse23 (= ~m_st~0 |old(~m_st~0)|)) (.cse11 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse24 (= ~t2_pc~0 0)) (.cse26 (= ~token~0 0)) (.cse13 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse19 (not (= |old(~token~0)| 0))) (.cse8 (< |old(~t1_st~0)| 2)) (.cse22 (not (= 0 |old(~m_st~0)|))) (.cse15 (< ~E_2~0 2)) (.cse16 (= 0 |old(~E_M~0)|)) (.cse21 (not (= 0 ~m_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) .cse17 .cse18 (not (= 1 ~t1_i~0)) (or .cse19 .cse20 .cse21) (not (= ~T2_E~0 2)) (not (= 2 |old(~E_M~0)|)) .cse22 (and .cse23 .cse11 (= ~E_M~0 2) .cse24 .cse25 .cse26) (not (= ~m_i~0 1)) .cse27 (not (= 1 ~t2_i~0)) .cse28 (not (= 2 ~M_E~0))) (or .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse24 .cse27 .cse15 .cse16 .cse28) (let ((.cse30 (+ ~local~0 1))) (or .cse0 .cse1 (and .cse10 (= 1 ~t2_pc~0) .cse11 .cse29 .cse12 .cse13) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= 1 |old(~t2_pc~0)|)) .cse8 (< |old(~token~0)| .cse30) .cse14 .cse15 (< .cse30 |old(~token~0)|) .cse16)) (or .cse0 .cse1 .cse2 (< ~local~0 |old(~token~0)|) .cse3 .cse4 (< |old(~token~0)| ~local~0) .cse5 .cse6 .cse17 .cse7 .cse14 .cse15 .cse16 (and .cse9 .cse10 .cse11 .cse29 .cse12 .cse25)) (or (or .cse1 .cse16 .cse5 .cse6) .cse3 (and .cse10 .cse11 .cse12 .cse24 .cse25) .cse17 .cse7 .cse18 .cse14 .cse27 .cse15 .cse28) (or .cse1 (or .cse20 .cse27 .cse4 .cse28) (and .cse10 .cse23 .cse11 .cse24 .cse26 .cse13) .cse5 .cse6 .cse7 .cse19 .cse8 .cse22 .cse15 .cse16 .cse21))) [2018-12-03 01:50:34,540 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-12-03 01:50:34,540 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 240 264) no Hoare annotation was computed. [2018-12-03 01:50:34,540 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 257) no Hoare annotation was computed. [2018-12-03 01:50:34,540 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 258) no Hoare annotation was computed. [2018-12-03 01:50:34,540 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 240 264) the Hoare annotation is: true [2018-12-03 01:50:34,540 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 259) no Hoare annotation was computed. [2018-12-03 01:50:34,541 INFO L444 ceAbstractionStarter]: At program point L261(lines 243 263) the Hoare annotation is: (let ((.cse16 (= 0 ~m_st~0))) (let ((.cse26 (= ~t1_pc~0 1)) (.cse21 (not .cse16)) (.cse22 (not (= 0 ~m_pc~0))) (.cse24 (not (= 0 ~t2_st~0))) (.cse11 (not (= 1 ~m_pc~0))) (.cse4 (not (= 2 ~m_st~0))) (.cse25 (not (= 0 ~t2_pc~0)))) (let ((.cse3 (< ~local~0 ~token~0)) (.cse6 (< ~token~0 ~local~0)) (.cse23 (not (= ~t1_pc~0 0))) (.cse0 (< ~E_1~0 2)) (.cse17 (< ~t2_st~0 2)) (.cse9 (not (= ~t1_st~0 0))) (.cse19 (not (= 1 ~t2_pc~0))) (.cse2 (= exists_runnable_thread_~__retres1~3 1)) (.cse14 (let ((.cse27 (not (= ~t1_st~0 2)))) (and (or .cse21 .cse27 .cse24 .cse25 .cse22) (or .cse27 .cse24 .cse11 .cse4 .cse25)))) (.cse1 (= ~T1_E~0 0)) (.cse7 (= ~T2_E~0 0)) (.cse8 (= 0 ~M_E~0)) (.cse10 (= 1 ~E_M~0)) (.cse12 (< ~E_2~0 2)) (.cse13 (= 0 ~E_M~0)) (.cse20 (not (= ~token~0 0))) (.cse18 (not (= 0 ~local~0))) (.cse15 (not (= 2 ~E_1~0))) (.cse5 (not .cse26))) (and (or .cse0 .cse1 .cse2 (< 0 ~t2_pc~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse1 .cse5 .cse7 .cse8 .cse2 .cse10 .cse15 .cse12 .cse13 .cse16) (or .cse0 .cse2 .cse1 .cse17 .cse18 .cse5 .cse7 .cse8 .cse10 .cse19 .cse20 (< ~t1_st~0 2) .cse21 .cse12 .cse13 .cse22) (or .cse0 .cse1 .cse17 .cse3 .cse4 .cse6 .cse2 .cse7 .cse8 .cse9 .cse10 .cse19 .cse11 .cse12 .cse13) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) .cse2 (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (or .cse20 .cse23 .cse21 .cse18 .cse22 .cse9) (not (= ~m_i~0 1)) .cse24 .cse15 (not (= 1 ~t2_i~0)) .cse25 (not (= 2 ~M_E~0))) (or .cse1 .cse7 .cse8 .cse10 (or .cse23 .cse24 .cse11 .cse4 .cse9) .cse15 .cse12 .cse13 .cse25 .cse2) (or .cse0 .cse1 .cse17 .cse4 .cse26 .cse7 .cse2 .cse8 .cse9 .cse10 .cse19 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse17 .cse2 .cse18 .cse26 .cse7 .cse8 .cse9 .cse10 .cse19 .cse20 .cse21 .cse12 .cse13 .cse22) (or .cse2 .cse14 .cse1 .cse7 .cse8 .cse10 .cse12 .cse13 (or .cse20 .cse18 .cse15 .cse5)))))) [2018-12-03 01:50:34,541 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 240 264) no Hoare annotation was computed. [2018-12-03 01:50:34,541 INFO L448 ceAbstractionStarter]: For program point L382-1(lines 371 404) no Hoare annotation was computed. [2018-12-03 01:50:34,541 INFO L444 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 368 405) the Hoare annotation is: (let ((.cse15 (= |old(~T1_E~0)| ~T1_E~0)) (.cse16 (= |old(~M_E~0)| ~M_E~0))) (let ((.cse10 (not (= 0 ~m_st~0))) (.cse2 (< ~t2_st~0 2)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse0 (< |old(~E_1~0)| 2)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse17 (not (= 2 ~m_st~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= |old(~T2_E~0)| 0)) (.cse6 (= 0 |old(~M_E~0)|)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse9 (< ~t1_st~0 2)) (.cse14 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) .cse15 .cse16)) (.cse11 (not (= 1 ~m_pc~0))) (.cse12 (< |old(~E_2~0)| 2)) (.cse13 (= 0 |old(~E_M~0)|))) (and (let ((.cse3 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 (< .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~token~0 .cse3))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and (= ~E_1~0 2) (= ~E_M~0 2) (= ~T2_E~0 2) .cse15 (= ~E_2~0 2) .cse16) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= ~token~0 0)) (not (= ~t1_pc~0 0)) .cse10 (not (= 0 ~local~0)) (not (= 0 ~m_pc~0)) (not (= ~t1_st~0 0))) (not (= ~m_i~0 1)) (not (= 0 ~t2_st~0)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 ~t2_pc~0)) (not (= 2 |old(~M_E~0)|))) (let ((.cse18 (+ ~local~0 1))) (or .cse0 .cse1 .cse14 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< ~token~0 .cse18) .cse11 .cse12 (< .cse18 ~token~0) .cse13)) (or .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse14 .cse12 .cse13) (or .cse0 .cse1 (< 0 ~t2_pc~0) .cse17 .cse4 .cse5 .cse6 .cse7 .cse9 .cse14 .cse11 .cse12 .cse13)))) [2018-12-03 01:50:34,541 INFO L448 ceAbstractionStarter]: For program point L372-1(lines 371 404) no Hoare annotation was computed. [2018-12-03 01:50:34,541 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 368 405) no Hoare annotation was computed. [2018-12-03 01:50:34,541 INFO L448 ceAbstractionStarter]: For program point L387-1(lines 371 404) no Hoare annotation was computed. [2018-12-03 01:50:34,541 INFO L448 ceAbstractionStarter]: For program point L377-1(lines 371 404) no Hoare annotation was computed. [2018-12-03 01:50:34,542 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 368 405) no Hoare annotation was computed. [2018-12-03 01:50:34,542 INFO L448 ceAbstractionStarter]: For program point L392-1(lines 371 404) no Hoare annotation was computed. [2018-12-03 01:50:34,542 INFO L448 ceAbstractionStarter]: For program point is_transmit1_triggeredFINAL(lines 171 189) no Hoare annotation was computed. [2018-12-03 01:50:34,542 INFO L444 ceAbstractionStarter]: At program point L186(lines 174 188) the Hoare annotation is: (let ((.cse12 (= 0 ~m_st~0)) (.cse3 (= ~t1_pc~0 1)) (.cse13 (= 1 ~m_pc~0)) (.cse34 (+ ~local~0 1)) (.cse7 (= 1 ~E_M~0)) (.cse35 (+ ~local~0 2))) (let ((.cse15 (< .cse35 ~token~0)) (.cse20 (< ~token~0 .cse35)) (.cse21 (not .cse7)) (.cse30 (< ~token~0 .cse34)) (.cse31 (< .cse34 ~token~0)) (.cse14 (< ~E_1~0 2)) (.cse32 (< 0 ~t2_pc~0)) (.cse29 (not (= 2 ~m_st~0))) (.cse19 (not .cse13)) (.cse33 (= 0 ~E_2~0)) (.cse0 (= ~T1_E~0 0)) (.cse1 (< ~t2_st~0 2)) (.cse23 (<= 1 is_transmit1_triggered_~__retres1~1)) (.cse22 (< ~local~0 ~token~0)) (.cse16 (not .cse3)) (.cse24 (< ~token~0 ~local~0)) (.cse4 (= ~T2_E~0 0)) (.cse5 (= 0 ~M_E~0)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse17 (< ~t1_st~0 2)) (.cse9 (not (= 1 ~E_1~0))) (.cse10 (< ~E_2~0 2)) (.cse11 (= 0 ~E_M~0)) (.cse2 (= 0 is_transmit1_triggered_~__retres1~1)) (.cse25 (not (= ~t1_pc~0 0))) (.cse18 (not .cse12)) (.cse28 (not (= 0 ~m_pc~0))) (.cse6 (not (= ~t1_st~0 0))) (.cse26 (not (= 0 ~t2_st~0))) (.cse27 (not (= 0 ~t2_pc~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse8 .cse17 .cse18 .cse19 .cse10 .cse11 .cse20) (or .cse14 .cse21 .cse0 .cse15 .cse16 .cse4 .cse5 .cse8 .cse17 .cse18 .cse19 .cse10 .cse20 .cse2) (or .cse22 (and (or .cse7 .cse8 .cse9 .cse17 .cse1 (or .cse0 .cse19 .cse11 .cse4 .cse5) .cse16 .cse10) (or .cse7 .cse8 .cse9 .cse1 (or .cse0 .cse19 .cse11 .cse4 .cse5 .cse6) .cse16 .cse10)) .cse23 .cse24) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse25 .cse9 .cse26 .cse10 .cse11 .cse12 .cse27 .cse28) (or .cse14 .cse0 .cse2 .cse29 .cse16 .cse4 .cse5 .cse8 .cse17 .cse30 .cse19 .cse10 .cse31 .cse11) (or .cse0 .cse32 .cse23 .cse22 .cse16 .cse24 .cse4 .cse5 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 .cse21 .cse0 .cse29 .cse16 .cse4 .cse5 .cse8 .cse17 .cse19 .cse10 .cse2) (or .cse14 .cse2 .cse0 .cse1 .cse29 .cse16 .cse4 .cse5 .cse7 .cse8 .cse30 .cse19 .cse31 .cse11 .cse33) (or .cse14 .cse0 .cse1 .cse29 .cse16 .cse4 .cse5 .cse8 .cse17 .cse19 .cse10 .cse11 .cse2) (or .cse14 .cse2 .cse0 .cse32 .cse29 .cse16 .cse4 .cse5 .cse7 .cse19 .cse11 .cse33) (or .cse0 .cse1 .cse23 .cse22 .cse16 .cse24 .cse4 .cse5 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) .cse2 (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (or (not (= ~token~0 0)) .cse25 .cse18 (not (= 0 ~local~0)) .cse28 .cse6) (not (= ~m_i~0 1)) .cse26 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) .cse27 (not (= 2 ~M_E~0)))))) [2018-12-03 01:50:34,542 INFO L451 ceAbstractionStarter]: At program point is_transmit1_triggeredENTRY(lines 171 189) the Hoare annotation is: true [2018-12-03 01:50:34,542 INFO L448 ceAbstractionStarter]: For program point is_transmit1_triggeredEXIT(lines 171 189) no Hoare annotation was computed. [2018-12-03 01:50:34,542 INFO L448 ceAbstractionStarter]: For program point L176(lines 176 181) no Hoare annotation was computed. [2018-12-03 01:50:34,542 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 184) no Hoare annotation was computed. [2018-12-03 01:50:34,542 INFO L448 ceAbstractionStarter]: For program point L175-2(lines 175 184) no Hoare annotation was computed. [2018-12-03 01:50:34,542 INFO L448 ceAbstractionStarter]: For program point L226-1(lines 220 238) no Hoare annotation was computed. [2018-12-03 01:50:34,542 INFO L448 ceAbstractionStarter]: For program point L221-1(lines 220 238) no Hoare annotation was computed. [2018-12-03 01:50:34,543 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 217 239) no Hoare annotation was computed. [2018-12-03 01:50:34,543 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 217 239) the Hoare annotation is: (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) (and (= ~m_st~0 |old(~m_st~0)|) (= ~t1_st~0 0) (= ~t2_st~0 0)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (or (not (= ~token~0 0)) (not (= ~t1_pc~0 0)) (not (= 0 |old(~m_st~0)|)) (not (= 0 ~local~0)) (not (= 0 ~m_pc~0)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) [2018-12-03 01:50:34,543 INFO L448 ceAbstractionStarter]: For program point L231-1(lines 217 239) no Hoare annotation was computed. [2018-12-03 01:50:34,543 INFO L448 ceAbstractionStarter]: For program point L593(line 593) no Hoare annotation was computed. [2018-12-03 01:50:34,543 INFO L444 ceAbstractionStarter]: At program point L592(line 592) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= |old(~T2_E~0)| 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-03 01:50:34,543 INFO L444 ceAbstractionStarter]: At program point L592-1(line 592) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and (= ~m_i~0 1) (= ~m_pc~0 0) (= ~E_1~0 2) (= ~t2_i~0 1) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t1_i~0 1) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-03 01:50:34,543 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 587 598) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (not (= |old(~T2_E~0)| 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-03 01:50:34,543 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 587 598) no Hoare annotation was computed. [2018-12-03 01:50:34,543 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 587 598) no Hoare annotation was computed. [2018-12-03 01:50:34,543 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 6 13) no Hoare annotation was computed. [2018-12-03 01:50:34,544 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2018-12-03 01:50:34,544 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 6 13) the Hoare annotation is: true [2018-12-03 01:50:34,544 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 6 13) no Hoare annotation was computed. [2018-12-03 01:50:34,544 INFO L448 ceAbstractionStarter]: For program point masterEXIT(lines 36 79) no Hoare annotation was computed. [2018-12-03 01:50:34,544 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-12-03 01:50:34,544 INFO L444 ceAbstractionStarter]: At program point L44(lines 39 78) the Hoare annotation is: (let ((.cse23 (not (= |old(~token~0)| 0))) (.cse11 (= ~T1_E~0 0)) (.cse21 (not (= 0 |old(~local~0)|))) (.cse13 (= 0 ~E_M~0)) (.cse14 (= 0 |old(~m_st~0)|)) (.cse15 (= ~T2_E~0 0)) (.cse16 (= 0 ~M_E~0)) (.cse22 (= ~t1_pc~0 1))) (let ((.cse19 (not (= |old(~t1_st~0)| 0))) (.cse8 (< |old(~E_1~0)| 2)) (.cse10 (< |old(~t2_st~0)| 2)) (.cse17 (not .cse22)) (.cse25 (or .cse23 .cse11 .cse21 (= 0 |old(~E_1~0)|) .cse13 .cse14 .cse15 .cse16)) (.cse6 (= 1 ~E_M~0)) (.cse7 (not (= 1 ~t2_pc~0))) (.cse9 (< |old(~t1_st~0)| 2)) (.cse18 (< ~E_2~0 2)) (.cse24 (not (= 0 |old(~m_pc~0)|)))) (and (let ((.cse20 (+ |old(~local~0)| 2))) (or (let ((.cse0 (+ ~local~0 2))) (and (= ~token~0 |old(~token~0)|) (<= .cse0 ~token~0) (let ((.cse1 (= |old(~E_1~0)| ~E_1~0)) (.cse2 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse3 (= ~m_st~0 |old(~m_st~0)|)) (.cse4 (= 1 ~m_pc~0)) (.cse5 (<= |old(~t1_st~0)| ~t1_st~0))) (or (and .cse1 (<= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse3 (= ~t1_st~0 0) .cse4 .cse5))) (<= ~token~0 .cse0))) (let ((.cse12 (not (= 1 |old(~m_pc~0)|)))) (and (or .cse6 .cse7 .cse8 .cse9 .cse10 (or .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) .cse17 .cse18) (or .cse6 .cse7 .cse8 .cse10 .cse17 .cse18 (or .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19)))) (< .cse20 |old(~token~0)|) (< |old(~token~0)| .cse20))) (or .cse8 .cse11 .cse10 .cse21 .cse22 .cse15 .cse16 .cse19 .cse6 .cse7 .cse23 .cse18 .cse13 .cse14 .cse24) (or .cse6 .cse8 .cse25 .cse9 (< 0 ~t2_pc~0) .cse17 .cse18 .cse24) (or (not (= 2 ~E_2~0)) .cse21 (not (= ~T1_E~0 2)) .cse19 .cse23 (not (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) .cse24 (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse14 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (or .cse8 .cse10 .cse17 .cse25 .cse6 .cse7 .cse9 .cse18 .cse24)))) [2018-12-03 01:50:34,545 INFO L444 ceAbstractionStarter]: At program point L73(lines 36 79) the Hoare annotation is: (let ((.cse6 (<= ~token~0 ~local~0)) (.cse7 (<= 2 ~E_1~0)) (.cse8 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse9 (= ~m_st~0 2)) (.cse10 (= ~t1_st~0 0)) (.cse11 (= 1 ~m_pc~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse17 (= ~t1_pc~0 1)) (.cse28 (= 1 ~t2_pc~0)) (.cse22 (not (= |old(~token~0)| 0))) (.cse14 (= ~T1_E~0 0)) (.cse16 (not (= 0 |old(~local~0)|))) (.cse23 (= 0 ~E_M~0)) (.cse24 (= 0 |old(~m_st~0)|)) (.cse18 (= ~T2_E~0 0)) (.cse19 (= 0 ~M_E~0))) (let ((.cse3 (or .cse22 .cse14 .cse16 (= 0 |old(~E_1~0)|) .cse23 .cse24 .cse18 .cse19)) (.cse13 (not (= 0 |old(~m_pc~0)|))) (.cse4 (< |old(~t1_st~0)| 2)) (.cse2 (= 1 ~E_M~0)) (.cse21 (not .cse28)) (.cse0 (< |old(~E_1~0)| 2)) (.cse15 (< |old(~t2_st~0)| 2)) (.cse1 (not .cse17)) (.cse5 (< ~E_2~0 2)) (.cse20 (not (= |old(~t1_st~0)| 0))) (.cse25 (and (= 1 ~t1_pc~0) (not .cse18) (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (<= 2 ~E_2~0) .cse6 .cse7 (not (= ~E_M~0 1)) .cse28 .cse8 .cse9 (<= 2 ~t2_st~0) (not .cse14) .cse10 .cse11 .cse12))) (and (or .cse0 (< 0 ~t2_pc~0) .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) (or .cse0 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse2 .cse21 .cse22 (and .cse8 .cse9 .cse10 .cse11 .cse7) .cse5 .cse23 .cse24 .cse13) (or .cse0 .cse15 .cse1 .cse3 .cse2 .cse21 .cse4 .cse25 .cse5 .cse13) (or (not (= 2 ~E_2~0)) .cse16 (and (= ~E_1~0 2) .cse9 .cse10 (= ~t2_st~0 0) .cse11) (not (= ~T1_E~0 2)) .cse20 .cse22 (not (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) .cse13 (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse24 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (let ((.cse27 (+ |old(~local~0)| 2))) (or (let ((.cse26 (not (= 1 |old(~m_pc~0)|)))) (and (or .cse2 .cse21 .cse0 .cse4 .cse15 (or .cse14 .cse26 .cse23 .cse24 .cse18 .cse19) .cse1 .cse5) (or .cse2 .cse21 .cse0 .cse15 .cse1 .cse5 (or .cse14 .cse26 .cse23 .cse24 .cse18 .cse19 .cse20)))) .cse25 (< .cse27 |old(~token~0)|) (< |old(~token~0)| .cse27)))))) [2018-12-03 01:50:34,545 INFO L444 ceAbstractionStarter]: At program point L67(line 67) the Hoare annotation is: (let ((.cse10 (not (= |old(~token~0)| 0))) (.cse1 (= ~T1_E~0 0)) (.cse3 (not (= 0 |old(~local~0)|))) (.cse12 (= 0 ~E_M~0)) (.cse13 (= 0 |old(~m_st~0)|)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse4 (= ~t1_pc~0 1))) (let ((.cse7 (not (= |old(~t1_st~0)| 0))) (.cse0 (< |old(~E_1~0)| 2)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse17 (not .cse4)) (.cse15 (or .cse10 .cse1 .cse3 (= 0 |old(~E_1~0)|) .cse12 .cse13 .cse5 .cse6)) (.cse8 (= 1 ~E_M~0)) (.cse9 (not (= 1 ~t2_pc~0))) (.cse16 (< |old(~t1_st~0)| 2)) (.cse11 (< ~E_2~0 2)) (.cse14 (not (= 0 |old(~m_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse8 .cse0 .cse15 .cse16 (< 0 ~t2_pc~0) .cse17 .cse11 .cse14) (let ((.cse19 (+ |old(~local~0)| 2))) (or (let ((.cse18 (not (= 1 |old(~m_pc~0)|)))) (and (or .cse8 .cse9 .cse0 .cse16 .cse2 (or .cse1 .cse18 .cse12 .cse13 .cse5 .cse6) .cse17 .cse11) (or .cse8 .cse9 .cse0 .cse2 .cse17 .cse11 (or .cse1 .cse18 .cse12 .cse13 .cse5 .cse6 .cse7)))) (< .cse19 |old(~token~0)|) (< |old(~token~0)| .cse19))) (or (not (= 2 ~E_2~0)) .cse3 (not (= ~T1_E~0 2)) .cse7 .cse10 (not (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) .cse14 (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse13 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (or .cse0 .cse2 .cse17 .cse15 .cse8 .cse9 .cse16 .cse11 .cse14)))) [2018-12-03 01:50:34,545 INFO L444 ceAbstractionStarter]: At program point L65(lines 39 78) the Hoare annotation is: (let ((.cse3 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse0 (= ~token~0 |old(~token~0)|)) (.cse2 (= |old(~E_1~0)| ~E_1~0)) (.cse4 (= ~m_st~0 |old(~m_st~0)|)) (.cse25 (not (= ~m_pc~0 1))) (.cse6 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse26 (not (= |old(~token~0)| 0))) (.cse13 (= ~T1_E~0 0)) (.cse23 (not (= 0 |old(~local~0)|))) (.cse15 (= 0 ~E_M~0)) (.cse16 (= 0 |old(~m_st~0)|)) (.cse17 (= ~T2_E~0 0)) (.cse18 (= 0 ~M_E~0)) (.cse24 (= ~t1_pc~0 1))) (let ((.cse7 (= ~t1_st~0 0)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse10 (< |old(~E_1~0)| 2)) (.cse12 (< |old(~t2_st~0)| 2)) (.cse19 (not .cse24)) (.cse29 (or .cse26 .cse13 .cse23 (= 0 |old(~E_1~0)|) .cse15 .cse16 .cse17 .cse18)) (.cse8 (= 1 ~E_M~0)) (.cse9 (not (= 1 ~t2_pc~0))) (.cse11 (< |old(~t1_st~0)| 2)) (.cse28 (and .cse3 .cse0 (<= ~token~0 ~local~0) (and .cse2 (not .cse17) .cse4 (not (= ~M_E~0 0)) (not (= ~E_M~0 0)) (not (= ~m_st~0 0)) .cse25 (not .cse13)) .cse6 (<= ~local~0 ~token~0))) (.cse20 (< ~E_2~0 2)) (.cse27 (not (= 0 |old(~m_pc~0)|)))) (and (let ((.cse22 (+ |old(~local~0)| 2))) (or (let ((.cse1 (+ ~local~0 2))) (and .cse0 (<= .cse1 ~token~0) (let ((.cse5 (= 1 ~m_pc~0))) (or (and .cse2 (<= 2 ~t1_st~0) .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse4 .cse7 .cse5 .cse6))) (<= ~token~0 .cse1))) (let ((.cse14 (not (= 1 |old(~m_pc~0)|)))) (and (or .cse8 .cse9 .cse10 .cse11 .cse12 (or .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse19 .cse20) (or .cse8 .cse9 .cse10 .cse12 .cse19 .cse20 (or .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse21)))) (< .cse22 |old(~token~0)|) (< |old(~token~0)| .cse22))) (or .cse10 .cse13 .cse12 .cse23 .cse24 (and (and (and .cse2 .cse25 .cse7) .cse4) .cse3) .cse17 .cse18 .cse21 .cse8 .cse9 .cse26 .cse20 .cse15 .cse16 .cse27) (or .cse10 (< 0 ~t2_pc~0) .cse19 .cse28 .cse8 .cse29 .cse11 .cse20 .cse27) (or (not (= 2 ~E_2~0)) .cse23 (not (= ~T1_E~0 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) .cse4 .cse7 (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0)) .cse21 .cse26 (not (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) .cse27 (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse16 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (or .cse10 .cse12 .cse19 .cse29 .cse8 .cse9 .cse11 .cse28 .cse20 .cse27)))) [2018-12-03 01:50:34,545 INFO L444 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse26 (not (= ~m_pc~0 1))) (.cse3 (= ~E_1~0 1)) (.cse0 (<= ~token~0 ~local~0)) (.cse1 (= ~m_st~0 |old(~m_st~0)|)) (.cse2 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse6 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse7 (<= ~local~0 ~token~0)) (.cse24 (not (= |old(~token~0)| 0))) (.cse13 (= ~T1_E~0 0)) (.cse23 (not (= 0 |old(~local~0)|))) (.cse15 (= 0 ~E_M~0)) (.cse16 (= 0 |old(~m_st~0)|)) (.cse17 (= ~T2_E~0 0)) (.cse18 (= 0 ~M_E~0)) (.cse27 (= ~t1_pc~0 1))) (let ((.cse4 (= ~t1_st~0 0)) (.cse21 (not (= |old(~t1_st~0)| 0))) (.cse12 (< |old(~t2_st~0)| 2)) (.cse9 (not (= 1 ~t2_pc~0))) (.cse10 (< |old(~E_1~0)| 2)) (.cse19 (not .cse27)) (.cse8 (= 1 ~E_M~0)) (.cse28 (or .cse24 .cse13 .cse23 (= 0 |old(~E_1~0)|) .cse15 .cse16 .cse17 .cse18)) (.cse11 (< |old(~t1_st~0)| 2)) (.cse29 (and .cse26 .cse3 .cse0 .cse1 .cse2 .cse6 .cse7)) (.cse20 (< ~E_2~0 2)) (.cse25 (not (= 0 |old(~m_pc~0)|)))) (and (let ((.cse22 (+ |old(~local~0)| 2))) (or (and .cse0 (let ((.cse5 (= 1 ~m_pc~0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 (<= 2 ~t1_st~0) .cse3 .cse5 .cse6))) .cse7) (let ((.cse14 (not (= 1 |old(~m_pc~0)|)))) (and (or .cse8 .cse9 .cse10 .cse11 .cse12 (or .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) .cse19 .cse20) (or .cse8 .cse9 .cse10 .cse12 .cse19 .cse20 (or .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse21)))) (< .cse22 |old(~token~0)|) (< |old(~token~0)| .cse22))) (or (not (= 2 ~E_2~0)) .cse23 (not (= ~T1_E~0 2)) .cse21 .cse24 (not (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) .cse25 (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (and (= ~m_pc~0 0) .cse3 .cse1 .cse4 (= ~t2_st~0 0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse16 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (or .cse10 .cse13 (and .cse1 .cse2 .cse26 .cse3 .cse4) .cse12 .cse23 .cse27 .cse17 .cse18 .cse21 .cse8 .cse9 .cse24 .cse20 .cse15 .cse16 .cse25) (or .cse10 .cse12 .cse19 .cse28 .cse8 .cse9 .cse11 .cse29 .cse20 .cse25) (or .cse10 (< 0 ~t2_pc~0) .cse19 .cse8 .cse28 .cse11 .cse29 .cse20 .cse25)))) [2018-12-03 01:50:34,546 INFO L448 ceAbstractionStarter]: For program point L57-1(line 57) no Hoare annotation was computed. [2018-12-03 01:50:34,546 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2018-12-03 01:50:34,546 INFO L444 ceAbstractionStarter]: At program point masterENTRY(lines 36 79) the Hoare annotation is: (let ((.cse17 (not (= |old(~token~0)| 0))) (.cse1 (= ~T1_E~0 0)) (.cse3 (not (= 0 |old(~local~0)|))) (.cse19 (= 0 ~E_M~0)) (.cse20 (= 0 |old(~m_st~0)|)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse4 (= ~t1_pc~0 1)) (.cse7 (= |old(~E_1~0)| ~E_1~0)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~m_st~0 |old(~m_st~0)|)) (.cse10 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse12 (= ~token~0 0)) (.cse13 (= ~local~0 0)) (.cse24 (<= |old(~t1_st~0)| ~t1_st~0))) (let ((.cse2 (< |old(~t2_st~0)| 2)) (.cse16 (not (= 1 ~t2_pc~0))) (.cse14 (not (= |old(~t1_st~0)| 0))) (.cse11 (= ~t1_st~0 0)) (.cse0 (< |old(~E_1~0)| 2)) (.cse29 (and .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse24)) (.cse27 (not .cse4)) (.cse15 (= 1 ~E_M~0)) (.cse30 (or .cse17 .cse1 .cse3 (= 0 |old(~E_1~0)|) .cse19 .cse20 .cse5 .cse6)) (.cse25 (< |old(~t1_st~0)| 2)) (.cse18 (< ~E_2~0 2)) (.cse21 (not (= 0 |old(~m_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (let ((.cse28 (+ |old(~local~0)| 2))) (or (let ((.cse22 (+ ~local~0 2))) (and (= ~token~0 |old(~token~0)|) (<= .cse22 ~token~0) (let ((.cse23 (= 1 ~m_pc~0))) (or (and .cse7 (<= 2 ~t1_st~0) .cse10 .cse9 .cse23 .cse24) (and .cse7 .cse10 .cse9 .cse11 .cse23 .cse24))) (<= ~token~0 .cse22))) (let ((.cse26 (not (= 1 |old(~m_pc~0)|)))) (and (or .cse15 .cse16 .cse0 .cse25 .cse2 (or .cse1 .cse26 .cse19 .cse20 .cse5 .cse6) .cse27 .cse18) (or .cse15 .cse16 .cse0 .cse2 .cse27 .cse18 (or .cse1 .cse26 .cse19 .cse20 .cse5 .cse6 .cse14)))) (< .cse28 |old(~token~0)|) (< |old(~token~0)| .cse28))) (or .cse29 .cse0 .cse2 .cse27 .cse30 .cse15 .cse16 .cse25 .cse18 .cse21) (or (not (= 2 ~E_2~0)) .cse3 (not (= ~T1_E~0 2)) .cse14 .cse17 (not (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) .cse21 (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (and .cse8 (= ~E_1~0 2) .cse9 .cse11 (= ~t2_st~0 0) .cse12 .cse13) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) .cse20 (not (= 0 ~t2_pc~0)) (not (= 2 ~M_E~0))) (or .cse0 .cse29 (< 0 ~t2_pc~0) .cse27 .cse15 .cse30 .cse25 .cse18 .cse21)))) [2018-12-03 01:50:34,547 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 451 459) no Hoare annotation was computed. [2018-12-03 01:50:34,547 INFO L444 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 451 459) the Hoare annotation is: (let ((.cse0 (< ~E_1~0 2)) (.cse1 (= ~T1_E~0 0)) (.cse2 (< ~t2_st~0 2)) (.cse14 (not (= 2 ~m_st~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 |old(~M_E~0)|)) (.cse7 (= 1 ~E_M~0)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse9 (< ~t1_st~0 2)) (.cse10 (not (= 1 ~m_pc~0))) (.cse13 (= |old(~M_E~0)| ~M_E~0)) (.cse11 (< ~E_2~0 2)) (.cse12 (= 0 ~E_M~0))) (and (let ((.cse3 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 (< .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 0 ~m_st~0)) .cse10 .cse11 .cse12 .cse13 (< ~token~0 .cse3))) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse1 .cse13 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< ~token~0 .cse15) .cse10 .cse11 (< .cse15 ~token~0) .cse12)) (or .cse0 .cse1 (< 0 ~t2_pc~0) .cse14 .cse4 .cse5 .cse6 .cse7 .cse9 .cse13 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse11 .cse12))) [2018-12-03 01:50:34,547 INFO L448 ceAbstractionStarter]: For program point fire_time_eventsFINAL(lines 451 459) no Hoare annotation was computed. [2018-12-03 01:50:34,547 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-03 01:50:34,547 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_1~0)| ~E_1~0) (= ~m_st~0 |old(~m_st~0)|) (<= |old(~t2_st~0)| ~t2_st~0) (= |old(~T1_E~0)| ~T1_E~0) (= ~token~0 |old(~token~0)|) (= |old(~E_2~0)| ~E_2~0) (= |old(~M_E~0)| ~M_E~0) (<= |old(~t1_st~0)| ~t1_st~0) (= |old(~E_M~0)| ~E_M~0)) [2018-12-03 01:50:34,549 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 01:50:34,549 INFO L451 ceAbstractionStarter]: At program point L524(lines 513 526) the Hoare annotation is: true [2018-12-03 01:50:34,549 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 509 527) no Hoare annotation was computed. [2018-12-03 01:50:34,549 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 522) no Hoare annotation was computed. [2018-12-03 01:50:34,549 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 509 527) the Hoare annotation is: true [2018-12-03 01:50:34,549 INFO L451 ceAbstractionStarter]: At program point L515(line 515) the Hoare annotation is: true [2018-12-03 01:50:34,550 INFO L448 ceAbstractionStarter]: For program point L515-1(line 515) no Hoare annotation was computed. [2018-12-03 01:50:34,550 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 509 527) no Hoare annotation was computed. [2018-12-03 01:50:34,550 INFO L444 ceAbstractionStarter]: At program point L287(line 287) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0))) (let ((.cse15 (<= 2 ~t1_st~0)) (.cse16 (<= 2 ~t2_st~0)) (.cse13 (= 1 ~t1_pc~0)) (.cse14 (= 1 ~t2_pc~0)) (.cse29 (not .cse1)) (.cse26 (= ~t1_st~0 0)) (.cse28 (not (= ~E_M~0 0))) (.cse25 (not (= ~m_st~0 0))) (.cse20 (<= 2 ~E_1~0)) (.cse21 (not (= ~E_M~0 1))) (.cse5 (= ~T2_E~0 0))) (let ((.cse3 (not (= 2 |old(~m_st~0)|))) (.cse0 (< |old(~E_1~0)| 2)) (.cse2 (< |old(~t2_st~0)| 2)) (.cse23 (let ((.cse36 (+ ~local~0 2))) (and (let ((.cse35 (<= 2 ~E_2~0)) (.cse32 (not .cse5)) (.cse33 (= 1 ~m_pc~0)) (.cse34 (not (= ~M_E~0 0)))) (or (and .cse16 .cse13 (and .cse29 .cse32 .cse33 .cse34 .cse28 .cse25) .cse14 .cse35 .cse15 .cse20 .cse21) (and .cse16 (and .cse13 .cse14 .cse35 (and .cse29 .cse26 .cse32 .cse33 .cse34 .cse28 .cse25) .cse20 .cse21)))) (<= .cse36 ~token~0) (<= ~token~0 .cse36)))) (.cse4 (not (= |old(~t1_pc~0)| 1))) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse8 (not (= 1 |old(~t2_pc~0)|))) (.cse9 (< |old(~t1_st~0)| 2)) (.cse27 (not (= 0 |old(~m_st~0)|))) (.cse10 (not (= 1 |old(~m_pc~0)|))) (.cse11 (< |old(~E_2~0)| 2)) (.cse12 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (let ((.cse24 (= ~m_pc~0 0))) (let ((.cse17 (and .cse29 .cse24 .cse28 .cse25)) (.cse18 (= ~token~0 0)) (.cse19 (= ~local~0 0)) (.cse22 (<= |old(~E_2~0)| ~E_2~0))) (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (not (= 1 ~t1_i~0)) (and .cse13 (<= |old(~t2_st~0)| ~t2_st~0) .cse15 (<= ~t2_pc~0 0) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (not (= ~T2_E~0 2)) .cse23 (not (= 2 |old(~E_M~0)|)) (and .cse24 .cse25 (= ~E_1~0 2) (= ~E_M~0 2) (= ~t2_pc~0 0) .cse26 (= ~t2_st~0 0) .cse18 .cse19 (= ~E_2~0 2) (= ~t1_pc~0 0)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse27 (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 ~M_E~0)) (and .cse14 (not .cse13) .cse24 .cse28 .cse25 .cse16 .cse26 .cse18 .cse19 .cse20 .cse21 .cse22)))) (or .cse0 .cse1 (< 0 |old(~t2_pc~0)|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (let ((.cse30 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse3 .cse4 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 (< |old(~token~0)| .cse30) .cse10 .cse11 (< .cse30 |old(~token~0)|) .cse12)) (let ((.cse31 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse2 .cse23 (< .cse31 |old(~token~0)|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse10 .cse11 .cse12 (< |old(~token~0)| .cse31))))))) [2018-12-03 01:50:34,553 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 319) no Hoare annotation was computed. [2018-12-03 01:50:34,553 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 265 329) no Hoare annotation was computed. [2018-12-03 01:50:34,553 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 291) no Hoare annotation was computed. [2018-12-03 01:50:34,553 INFO L444 ceAbstractionStarter]: At program point L309(lines 271 323) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0)) (.cse5 (= ~T2_E~0 0))) (let ((.cse34 (= ~t1_st~0 0)) (.cse53 (not .cse5)) (.cse54 (not (= ~M_E~0 0))) (.cse30 (= ~m_st~0 2)) (.cse31 (not (= ~E_M~0 0))) (.cse55 (not .cse1)) (.cse36 (= 1 ~m_pc~0)) (.cse57 (+ ~local~0 1))) (let ((.cse42 (= ~m_st~0 0)) (.cse47 (<= ~token~0 .cse57)) (.cse48 (<= .cse57 ~token~0)) (.cse38 (<= 2 ~t1_st~0)) (.cse40 (and .cse53 .cse54 .cse30 .cse31 .cse55 .cse36 (not (= ~E_1~0 0)) (not (= ~E_2~0 0)))) (.cse25 (<= 2 ~t2_st~0)) (.cse17 (= 1 ~t1_pc~0)) (.cse49 (and .cse53 .cse54 .cse30 .cse31 .cse55 .cse34 .cse36)) (.cse26 (= 1 ~t2_pc~0)) (.cse39 (<= 2 ~E_2~0)) (.cse21 (<= 2 ~E_1~0)) (.cse23 (not (= ~E_M~0 1))) (.cse50 (<= ~token~0 ~local~0)) (.cse51 (<= ~local~0 ~token~0))) (let ((.cse7 (and (and .cse25 (and .cse17 .cse49 .cse26 .cse39 .cse21 .cse23)) .cse50 .cse51)) (.cse15 (and .cse17 .cse47 .cse26 .cse39 .cse48 .cse38 .cse21 .cse40 .cse23)) (.cse16 (and .cse25 .cse17 .cse26 .cse39 .cse38 .cse21 .cse40 .cse23)) (.cse3 (let ((.cse56 (+ ~local~0 2))) (and .cse17 .cse26 .cse53 .cse42 .cse54 .cse31 .cse38 .cse25 .cse55 .cse39 .cse36 (<= .cse56 ~token~0) .cse21 .cse23 (<= ~token~0 .cse56)))) (.cse29 (not (= 0 |old(~m_st~0)|))) (.cse20 (<= ~t2_pc~0 0)) (.cse0 (< |old(~E_1~0)| 2)) (.cse27 (< |old(~t2_st~0)| 2)) (.cse18 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse19 (and (= ~m_st~0 |old(~m_st~0)|) .cse53 .cse54 .cse30 .cse31 .cse55 .cse36)) (.cse22 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse24 (<= |old(~E_2~0)| ~E_2~0)) (.cse2 (not (= 2 |old(~m_st~0)|))) (.cse4 (not (= |old(~t1_pc~0)| 1))) (.cse6 (= 0 ~M_E~0)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse9 (not (= 1 |old(~t2_pc~0)|))) (.cse10 (< |old(~t1_st~0)| 2)) (.cse12 (not (= 1 |old(~m_pc~0)|))) (.cse13 (< |old(~E_2~0)| 2)) (.cse14 (= 0 |old(~E_M~0)|))) (and (let ((.cse11 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< |old(~token~0)| .cse11) .cse12 .cse13 (< .cse11 |old(~token~0)|) .cse14 .cse15 .cse16)) (or .cse0 (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse1 (< 0 |old(~t2_pc~0)|) .cse2 .cse4 .cse5 .cse6 .cse8 .cse10 .cse12 (and .cse25 .cse17 .cse26 .cse19 .cse21 .cse22 .cse23 .cse24) .cse13 .cse14) (let ((.cse28 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse27 .cse3 (< .cse28 |old(~token~0)|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse29 .cse12 .cse13 .cse14 .cse15 .cse16 (< |old(~token~0)| .cse28))) (let ((.cse43 (= ~m_pc~0 0)) (.cse44 (= ~token~0 0)) (.cse45 (= ~local~0 0))) (let ((.cse32 (= ~E_1~0 2)) (.cse33 (= ~t2_pc~0 0)) (.cse35 (= ~t2_st~0 0)) (.cse37 (= ~t1_pc~0 0)) (.cse41 (let ((.cse52 (= eval_~tmp~0 1))) (or (and .cse42 .cse43 .cse44 .cse45 .cse52) (and (= ~m_pc~0 1) .cse30 .cse52)))) (.cse46 (not .cse17))) (or (and (and .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) .cse23 .cse24) (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) (and .cse38 (and .cse17 .cse39 .cse40 .cse20 .cse21 .cse23)) (not (= ~m_i~0 1)) (and .cse31 .cse32 .cse23 (and .cse33 .cse35 (= ~t1_pc~0 1) (= ~t1_st~0 2)) .cse41 .cse24) (not (= 2 ~M_E~0)) (and (and (= ~E_M~0 2) .cse42 .cse43) .cse32 .cse33 .cse34 .cse35 .cse44 .cse45 (= ~E_2~0 2) .cse37) (not (= 1 ~t1_i~0)) (and .cse26 .cse46 .cse31 .cse25 .cse34 .cse41 .cse21 .cse23 .cse24) (and .cse17 .cse26 .cse31 .cse38 .cse25 .cse41 .cse21 .cse23 .cse24) (and .cse17 .cse47 .cse26 .cse39 .cse48 .cse40 .cse38 .cse21 .cse23) (not (= ~T2_E~0 2)) .cse3 (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse29 (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (and .cse25 .cse17 .cse26 .cse39 .cse40 .cse38 .cse21 .cse23) (and (and .cse25 (and .cse49 .cse26 .cse39 .cse21 .cse23)) .cse50 .cse51) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (and (and .cse49 .cse17 .cse20 .cse21 .cse23 .cse24) .cse50 .cse51) (and .cse25 .cse49 .cse26 .cse46 .cse21 .cse23 .cse24)))) (or .cse0 .cse1 .cse27 (and .cse17 .cse26 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14)))))) [2018-12-03 01:50:34,555 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 280) no Hoare annotation was computed. [2018-12-03 01:50:34,557 INFO L448 ceAbstractionStarter]: For program point L276-1(lines 271 323) no Hoare annotation was computed. [2018-12-03 01:50:34,558 INFO L444 ceAbstractionStarter]: At program point L272(line 272) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0)) (.cse5 (= ~T2_E~0 0))) (let ((.cse34 (= ~t1_st~0 0)) (.cse53 (not .cse5)) (.cse54 (not (= ~M_E~0 0))) (.cse30 (= ~m_st~0 2)) (.cse31 (not (= ~E_M~0 0))) (.cse55 (not .cse1)) (.cse36 (= 1 ~m_pc~0)) (.cse57 (+ ~local~0 1))) (let ((.cse42 (= ~m_st~0 0)) (.cse47 (<= ~token~0 .cse57)) (.cse48 (<= .cse57 ~token~0)) (.cse38 (<= 2 ~t1_st~0)) (.cse40 (and .cse53 .cse54 .cse30 .cse31 .cse55 .cse36 (not (= ~E_1~0 0)) (not (= ~E_2~0 0)))) (.cse25 (<= 2 ~t2_st~0)) (.cse17 (= 1 ~t1_pc~0)) (.cse49 (and .cse53 .cse54 .cse30 .cse31 .cse55 .cse34 .cse36)) (.cse26 (= 1 ~t2_pc~0)) (.cse39 (<= 2 ~E_2~0)) (.cse21 (<= 2 ~E_1~0)) (.cse23 (not (= ~E_M~0 1))) (.cse50 (<= ~token~0 ~local~0)) (.cse51 (<= ~local~0 ~token~0))) (let ((.cse7 (and (and .cse25 (and .cse17 .cse49 .cse26 .cse39 .cse21 .cse23)) .cse50 .cse51)) (.cse15 (and .cse17 .cse47 .cse26 .cse39 .cse48 .cse38 .cse21 .cse40 .cse23)) (.cse16 (and .cse25 .cse17 .cse26 .cse39 .cse38 .cse21 .cse40 .cse23)) (.cse3 (let ((.cse56 (+ ~local~0 2))) (and .cse17 .cse26 .cse53 .cse42 .cse54 .cse31 .cse38 .cse25 .cse55 .cse39 .cse36 (<= .cse56 ~token~0) .cse21 .cse23 (<= ~token~0 .cse56)))) (.cse29 (not (= 0 |old(~m_st~0)|))) (.cse20 (<= ~t2_pc~0 0)) (.cse0 (< |old(~E_1~0)| 2)) (.cse27 (< |old(~t2_st~0)| 2)) (.cse18 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse19 (and (= ~m_st~0 |old(~m_st~0)|) .cse53 .cse54 .cse30 .cse31 .cse55 .cse36)) (.cse22 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse24 (<= |old(~E_2~0)| ~E_2~0)) (.cse2 (not (= 2 |old(~m_st~0)|))) (.cse4 (not (= |old(~t1_pc~0)| 1))) (.cse6 (= 0 ~M_E~0)) (.cse8 (= 1 |old(~E_M~0)|)) (.cse9 (not (= 1 |old(~t2_pc~0)|))) (.cse10 (< |old(~t1_st~0)| 2)) (.cse12 (not (= 1 |old(~m_pc~0)|))) (.cse13 (< |old(~E_2~0)| 2)) (.cse14 (= 0 |old(~E_M~0)|))) (and (let ((.cse11 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< |old(~token~0)| .cse11) .cse12 .cse13 (< .cse11 |old(~token~0)|) .cse14 .cse15 .cse16)) (or .cse0 (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse1 (< 0 |old(~t2_pc~0)|) .cse2 .cse4 .cse5 .cse6 .cse8 .cse10 .cse12 (and .cse25 .cse17 .cse26 .cse19 .cse21 .cse22 .cse23 .cse24) .cse13 .cse14) (let ((.cse28 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse27 .cse3 (< .cse28 |old(~token~0)|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse29 .cse12 .cse13 .cse14 .cse15 .cse16 (< |old(~token~0)| .cse28))) (let ((.cse43 (= ~m_pc~0 0)) (.cse44 (= ~token~0 0)) (.cse45 (= ~local~0 0))) (let ((.cse32 (= ~E_1~0 2)) (.cse33 (= ~t2_pc~0 0)) (.cse35 (= ~t2_st~0 0)) (.cse37 (= ~t1_pc~0 0)) (.cse41 (let ((.cse52 (= eval_~tmp~0 1))) (or (and .cse42 .cse43 .cse44 .cse45 .cse52) (and (= ~m_pc~0 1) .cse30 .cse52)))) (.cse46 (not .cse17))) (or (and (and .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) .cse23 .cse24) (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) (and .cse38 (and .cse17 .cse39 .cse40 .cse20 .cse21 .cse23)) (not (= ~m_i~0 1)) (and .cse31 .cse32 .cse23 (and .cse33 .cse35 (= ~t1_pc~0 1) (= ~t1_st~0 2)) .cse41 .cse24) (not (= 2 ~M_E~0)) (and (and (= ~E_M~0 2) .cse42 .cse43) .cse32 .cse33 .cse34 .cse35 .cse44 .cse45 (= ~E_2~0 2) .cse37) (not (= 1 ~t1_i~0)) (and .cse26 .cse46 .cse31 .cse25 .cse34 .cse41 .cse21 .cse23 .cse24) (and .cse17 .cse26 .cse31 .cse38 .cse25 .cse41 .cse21 .cse23 .cse24) (and .cse17 .cse47 .cse26 .cse39 .cse48 .cse40 .cse38 .cse21 .cse23) (not (= ~T2_E~0 2)) .cse3 (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse29 (not (= 0 |old(~t2_st~0)|)) (not (= 0 |old(~local~0)|)) (not (= 0 |old(~t2_pc~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (and .cse25 .cse17 .cse26 .cse39 .cse40 .cse38 .cse21 .cse23) (and (and .cse25 (and .cse49 .cse26 .cse39 .cse21 .cse23)) .cse50 .cse51) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (and (and .cse49 .cse17 .cse20 .cse21 .cse23 .cse24) .cse50 .cse51) (and .cse25 .cse49 .cse26 .cse46 .cse21 .cse23 .cse24)))) (or .cse0 .cse1 .cse27 (and .cse17 .cse26 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14)))))) [2018-12-03 01:50:34,559 INFO L444 ceAbstractionStarter]: At program point L301(line 301) the Hoare annotation is: (let ((.cse30 (= ~T2_E~0 0)) (.cse23 (= ~m_st~0 2)) (.cse12 (not (= ~E_M~0 0))) (.cse26 (= ~T1_E~0 0)) (.cse14 (= 1 ~m_pc~0))) (let ((.cse6 (<= ~token~0 ~local~0)) (.cse0 (<= 2 ~t2_st~0)) (.cse15 (= 1 ~t1_pc~0)) (.cse1 (= 1 ~t2_pc~0)) (.cse2 (<= 2 ~E_2~0)) (.cse4 (<= 2 ~E_1~0)) (.cse3 (and (not .cse30) (not (= ~M_E~0 0)) .cse23 .cse12 (not .cse26) .cse14 (not (= ~E_1~0 0)) (not (= ~E_2~0 0)))) (.cse5 (not (= ~E_M~0 1))) (.cse7 (<= ~local~0 ~token~0))) (let ((.cse27 (< |old(~t2_st~0)| 2)) (.cse16 (not (= 0 |old(~m_st~0)|))) (.cse38 (and .cse6 (and .cse0 (and .cse15 .cse1 .cse2 .cse4 .cse3 .cse5)) .cse7)) (.cse33 (not (= 1 |old(~t2_pc~0)|))) (.cse25 (< |old(~E_1~0)| 2)) (.cse28 (not (= 2 |old(~m_st~0)|))) (.cse29 (not (= |old(~t1_pc~0)| 1))) (.cse31 (= 0 ~M_E~0)) (.cse32 (= 1 |old(~E_M~0)|)) (.cse34 (< |old(~t1_st~0)| 2)) (.cse35 (not (= 1 |old(~m_pc~0)|))) (.cse36 (< |old(~E_2~0)| 2)) (.cse37 (= 0 |old(~E_M~0)|))) (and (let ((.cse19 (= ~m_st~0 0)) (.cse20 (= ~m_pc~0 0)) (.cse22 (= ~m_pc~0 1))) (let ((.cse10 (let ((.cse24 (= eval_~tmp~0 1))) (or (and .cse19 .cse20 (= ~token~0 0) (= ~local~0 0) .cse24) (and .cse22 .cse23 .cse24)))) (.cse9 (= ~E_1~0 2)) (.cse8 (let ((.cse17 (= ~t2_pc~0 0)) (.cse18 (= ~t2_st~0 0)) (.cse21 (= ~t1_pc~0 0))) (or (and .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse22 .cse17 .cse18 .cse23 .cse21)))) (.cse11 (not .cse15)) (.cse13 (<= |old(~E_2~0)| ~E_2~0))) (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) (and (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5)) .cse6 .cse7) (and .cse8 .cse9 (= ~E_M~0 2) (= ~E_2~0 2) .cse10) (and .cse1 .cse11 .cse12 .cse0 .cse10 .cse4 .cse5 .cse13) (not (= 1 ~t1_i~0)) (and (and .cse12 .cse9 .cse8 .cse14) .cse5 .cse13) (not (= ~T2_E~0 2)) (and .cse15 .cse2 .cse3 (<= ~t2_pc~0 0) .cse4 .cse5) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse5 .cse13) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse16 (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 ~M_E~0))))) (or .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) (let ((.cse39 (+ |old(~local~0)| 2))) (or .cse25 .cse26 .cse38 .cse27 (< .cse39 |old(~token~0)|) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse16 .cse35 .cse36 .cse37 (< |old(~token~0)| .cse39))) (let ((.cse40 (+ |old(~local~0)| 1))) (or .cse25 .cse26 .cse38 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (< |old(~token~0)| .cse40) .cse35 .cse36 (< .cse40 |old(~token~0)|) .cse37)) (or .cse25 .cse26 (< 0 |old(~t2_pc~0)|) .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37))))) [2018-12-03 01:50:34,560 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 265 329) the Hoare annotation is: (let ((.cse8 (= ~token~0 |old(~token~0)|)) (.cse24 (< |old(~t2_st~0)| 2)) (.cse18 (not (= 1 |old(~t2_pc~0)|))) (.cse6 (= 1 ~t2_pc~0)) (.cse28 (= ~m_st~0 |old(~m_st~0)|)) (.cse26 (not (= 0 |old(~m_st~0)|))) (.cse0 (< |old(~E_1~0)| 2)) (.cse1 (= ~T1_E~0 0)) (.cse13 (not (= 2 |old(~m_st~0)|))) (.cse14 (not (= |old(~t1_pc~0)| 1))) (.cse15 (= ~T2_E~0 0)) (.cse16 (= 0 ~M_E~0)) (.cse17 (= 1 |old(~E_M~0)|)) (.cse19 (< |old(~t1_st~0)| 2)) (.cse2 (= 1 ~t1_pc~0)) (.cse4 (= |old(~E_1~0)| ~E_1~0)) (.cse5 (= |old(~E_M~0)| ~E_M~0)) (.cse7 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse9 (= ~m_st~0 2)) (.cse10 (= |old(~E_2~0)| ~E_2~0)) (.cse11 (= 1 ~m_pc~0)) (.cse12 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse21 (not (= 1 |old(~m_pc~0)|))) (.cse22 (< |old(~E_2~0)| 2)) (.cse23 (= 0 |old(~E_M~0)|))) (and (let ((.cse20 (+ |old(~local~0)| 1))) (or .cse0 .cse1 (let ((.cse3 (+ ~local~0 1))) (and .cse2 (<= ~token~0 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse3 ~token~0) .cse11 .cse12)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (< |old(~token~0)| .cse20) .cse21 .cse22 (< .cse20 |old(~token~0)|) .cse23)) (let ((.cse25 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse24 (< .cse25 |old(~token~0)|) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse26 .cse21 .cse22 .cse23 (let ((.cse27 (+ ~local~0 2))) (and .cse2 .cse4 .cse5 (<= ~token~0 .cse27) .cse6 .cse28 .cse7 .cse8 .cse10 .cse11 (<= .cse27 ~token~0) .cse12)) (< |old(~token~0)| .cse25))) (or .cse0 .cse1 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 (and .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) .cse22 .cse23) (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) .cse28 (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= 1 ~t1_i~0)) (not (= ~T2_E~0 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse26 (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 ~M_E~0))) (or .cse0 .cse1 (< 0 |old(~t2_pc~0)|) .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 (and .cse2 .cse4 (<= ~t2_pc~0 0) .cse5 .cse7 .cse9 .cse10 .cse11 .cse12) .cse21 .cse22 .cse23))) [2018-12-03 01:50:34,561 INFO L448 ceAbstractionStarter]: For program point L281(lines 271 323) no Hoare annotation was computed. [2018-12-03 01:50:34,562 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 305) no Hoare annotation was computed. [2018-12-03 01:50:34,562 INFO L444 ceAbstractionStarter]: At program point L315(line 315) the Hoare annotation is: (let ((.cse26 (= ~T2_E~0 0)) (.cse17 (= ~m_st~0 2)) (.cse16 (not (= ~E_M~0 0))) (.cse22 (= ~T1_E~0 0)) (.cse15 (= 1 ~m_pc~0)) (.cse37 (+ ~local~0 1))) (let ((.cse5 (= 1 ~t1_pc~0)) (.cse6 (<= ~token~0 .cse37)) (.cse7 (= 1 ~t2_pc~0)) (.cse8 (<= 2 ~E_2~0)) (.cse9 (<= .cse37 ~token~0)) (.cse11 (<= 2 ~t1_st~0)) (.cse12 (<= 2 ~E_1~0)) (.cse10 (and (not .cse26) (not (= ~M_E~0 0)) .cse17 .cse16 (not .cse22) .cse15 (not (= ~E_1~0 0)) (not (= ~E_2~0 0)))) (.cse13 (not (= ~E_M~0 1)))) (let ((.cse23 (< |old(~t2_st~0)| 2)) (.cse19 (not (= 0 |old(~m_st~0)|))) (.cse14 (<= ~t2_pc~0 0)) (.cse18 (<= |old(~E_2~0)| ~E_2~0)) (.cse21 (< |old(~E_1~0)| 2)) (.cse24 (not (= 2 |old(~m_st~0)|))) (.cse25 (not (= |old(~t1_pc~0)| 1))) (.cse27 (= 0 ~M_E~0)) (.cse28 (= 1 |old(~E_M~0)|)) (.cse29 (not (= 1 |old(~t2_pc~0)|))) (.cse30 (< |old(~t1_st~0)| 2)) (.cse31 (not (= 1 |old(~m_pc~0)|))) (.cse32 (< |old(~E_2~0)| 2)) (.cse33 (= 0 |old(~E_M~0)|)) (.cse35 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse10 .cse13))) (and (let ((.cse3 (= ~t1_pc~0 0)) (.cse2 (= ~t1_st~0 0)) (.cse0 (= ~E_1~0 2)) (.cse1 (= ~t2_pc~0 0)) (.cse4 (let ((.cse20 (= eval_~tmp~0 1))) (or (and (= ~m_st~0 0) (= ~m_pc~0 0) (= ~token~0 0) (= ~local~0 0) .cse20) (and (= ~m_pc~0 1) .cse17 .cse20))))) (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) (and .cse0 (= ~E_M~0 2) .cse1 .cse2 (= ~E_2~0 2) .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse5 .cse8 .cse10 .cse11 .cse14 .cse12 .cse13) (not (= ~T2_E~0 2)) (and (and .cse0 .cse1 (and .cse15 .cse16) .cse2 .cse17 .cse3) .cse13 .cse18) (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse19 (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (and (and (and .cse17 .cse16 .cse2 .cse15) .cse5 .cse14 .cse12 .cse13 .cse18) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0)) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (and (= ~t1_pc~0 1) .cse16 .cse11 .cse0 .cse13 .cse1 .cse4 .cse18) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 ~M_E~0)))) (or .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) (let ((.cse34 (+ |old(~local~0)| 2))) (or .cse21 .cse22 .cse23 (< .cse34 |old(~token~0)|) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse19 .cse31 .cse32 .cse33 .cse35 (< |old(~token~0)| .cse34))) (or .cse21 .cse22 (< 0 |old(~t2_pc~0)|) .cse24 .cse25 .cse26 .cse27 (and .cse5 (and .cse17 .cse16 .cse15) .cse14 .cse12 (<= |old(~t1_st~0)| ~t1_st~0) .cse13 .cse18) .cse28 .cse30 .cse31 .cse32 .cse33) (let ((.cse36 (+ |old(~local~0)| 1))) (or .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (< |old(~token~0)| .cse36) .cse31 .cse32 (< .cse36 |old(~token~0)|) .cse33 .cse35)))))) [2018-12-03 01:50:34,565 INFO L448 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2018-12-03 01:50:34,565 INFO L448 ceAbstractionStarter]: For program point L295(lines 271 323) no Hoare annotation was computed. [2018-12-03 01:50:34,565 INFO L444 ceAbstractionStarter]: At program point L324(lines 265 329) the Hoare annotation is: (let ((.cse1 (= ~T1_E~0 0)) (.cse15 (= ~T2_E~0 0))) (let ((.cse31 (<= 2 ~t2_st~0)) (.cse5 (= 1 ~t1_pc~0)) (.cse6 (= 1 ~t2_pc~0)) (.cse33 (not .cse15)) (.cse34 (not (= ~M_E~0 0))) (.cse8 (= ~m_st~0 2)) (.cse9 (not (= ~E_M~0 0))) (.cse24 (<= 2 ~t1_st~0)) (.cse35 (not .cse1)) (.cse26 (<= 2 ~E_2~0)) (.cse10 (= 1 ~m_pc~0)) (.cse11 (<= 2 ~E_1~0)) (.cse13 (not (= ~E_M~0 1)))) (let ((.cse2 (< |old(~t2_st~0)| 2)) (.cse29 (not (= 0 |old(~m_st~0)|))) (.cse7 (<= |old(~t2_st~0)| ~t2_st~0)) (.cse25 (<= ~t2_pc~0 0)) (.cse12 (<= |old(~t1_st~0)| ~t1_st~0)) (.cse14 (<= |old(~E_2~0)| ~E_2~0)) (.cse0 (< |old(~E_1~0)| 2)) (.cse27 (let ((.cse37 (+ ~local~0 1))) (and .cse5 (<= ~token~0 .cse37) .cse6 .cse33 .cse34 .cse8 .cse9 .cse24 .cse35 .cse26 (<= .cse37 ~token~0) .cse10 .cse11 .cse13))) (.cse3 (not (= 2 |old(~m_st~0)|))) (.cse28 (let ((.cse36 (+ ~local~0 2))) (and .cse5 .cse6 .cse33 (= ~m_st~0 0) .cse34 .cse9 .cse24 .cse31 .cse35 .cse26 .cse10 (<= .cse36 ~token~0) .cse11 .cse13 (<= ~token~0 .cse36)))) (.cse4 (not (= |old(~t1_pc~0)| 1))) (.cse16 (= 0 ~M_E~0)) (.cse23 (and .cse5 .cse6 .cse33 .cse34 .cse8 .cse9 .cse24 .cse31 .cse35 .cse26 .cse10 .cse11 .cse13)) (.cse17 (= 1 |old(~E_M~0)|)) (.cse18 (not (= 1 |old(~t2_pc~0)|))) (.cse19 (< |old(~t1_st~0)| 2)) (.cse20 (not (= 1 |old(~m_pc~0)|))) (.cse21 (< |old(~E_2~0)| 2)) (.cse22 (= 0 |old(~E_M~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or (not (= 2 |old(~E_2~0)|)) (not (= ~T1_E~0 2)) .cse23 (not (= 1 ~t1_i~0)) (and .cse5 .cse8 .cse9 .cse24 .cse25 .cse26 .cse10 .cse11 .cse13) .cse27 (not (= ~T2_E~0 2)) .cse28 (not (= 2 |old(~E_M~0)|)) (or (not (= |old(~token~0)| 0)) (not (= |old(~t1_pc~0)| 0)) .cse29 (not (= 0 |old(~local~0)|)) (not (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 ~M_E~0))) (let ((.cse30 (+ |old(~local~0)| 2))) (or .cse0 .cse1 .cse27 .cse2 .cse28 (< .cse30 |old(~token~0)|) .cse4 .cse15 .cse23 .cse16 .cse17 .cse18 .cse19 .cse29 .cse20 .cse21 .cse22 (< |old(~token~0)| .cse30))) (or .cse0 .cse1 (< 0 |old(~t2_pc~0)|) .cse3 .cse4 .cse15 (and .cse5 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse13 .cse14) .cse16 (and .cse5 .cse6 .cse8 .cse9 .cse31 .cse10 .cse11 .cse12 .cse13 .cse14) .cse17 .cse19 .cse20 .cse21 .cse22) (let ((.cse32 (+ |old(~local~0)| 1))) (or .cse0 .cse1 .cse27 .cse3 .cse28 .cse4 .cse15 .cse16 .cse23 .cse17 .cse18 .cse19 (< |old(~token~0)| .cse32) .cse20 .cse21 (< .cse32 |old(~token~0)|) .cse22)))))) [2018-12-03 01:50:34,567 INFO L448 ceAbstractionStarter]: For program point L194-2(lines 194 203) no Hoare annotation was computed. [2018-12-03 01:50:34,567 INFO L448 ceAbstractionStarter]: For program point is_transmit2_triggeredFINAL(lines 190 208) no Hoare annotation was computed. [2018-12-03 01:50:34,568 INFO L444 ceAbstractionStarter]: At program point L205(lines 193 207) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1)) (.cse18 (= 1 ~m_pc~0)) (.cse17 (= 0 ~m_st~0)) (.cse31 (+ ~local~0 2)) (.cse8 (= 1 ~E_M~0))) (let ((.cse4 (not (= 2 ~m_st~0))) (.cse2 (< 0 ~t2_pc~0)) (.cse21 (not (= ~t1_pc~0 0))) (.cse24 (not (= 0 ~m_pc~0))) (.cse22 (not (= 0 ~t2_st~0))) (.cse23 (not (= 0 ~t2_pc~0))) (.cse0 (< ~E_1~0 2)) (.cse25 (not .cse8)) (.cse28 (< .cse31 ~token~0)) (.cse19 (< ~t1_st~0 2)) (.cse29 (not .cse17)) (.cse30 (< ~token~0 .cse31)) (.cse14 (not (= 1 ~t2_pc~0))) (.cse15 (not (= 1 ~E_1~0))) (.cse11 (< ~t2_st~0 2)) (.cse26 (< ~local~0 ~token~0)) (.cse1 (= ~T1_E~0 0)) (.cse9 (not .cse18)) (.cse10 (= 0 ~E_M~0)) (.cse6 (= ~T2_E~0 0)) (.cse7 (= 0 ~M_E~0)) (.cse13 (not (= ~t1_st~0 0))) (.cse5 (not .cse12)) (.cse27 (< ~token~0 ~local~0)) (.cse16 (< ~E_2~0 2)) (.cse3 (= 0 is_transmit2_triggered_~__retres1~2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 ~E_2~0)) (or .cse1 .cse11 .cse12 .cse6 .cse7 .cse13 .cse8 .cse14 .cse15 .cse3 .cse16 .cse10 .cse17 .cse18) (let ((.cse20 (+ ~local~0 1))) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse14 .cse19 (< ~token~0 .cse20) .cse9 .cse16 (< .cse20 ~token~0) .cse10 .cse3)) (or .cse1 .cse3 .cse6 .cse7 .cse13 .cse8 .cse21 .cse15 .cse22 .cse16 .cse10 .cse17 .cse23 .cse24) (or .cse0 .cse1 .cse11 .cse4 .cse5 .cse3 .cse6 .cse7 .cse14 .cse19 .cse9 .cse16 .cse10) (or .cse3 .cse0 .cse25 .cse1 .cse4 .cse5 .cse6 .cse7 .cse14 .cse19 .cse9 .cse16) (or .cse1 .cse11 .cse26 .cse5 .cse27 .cse3 .cse6 .cse7 .cse13 .cse8 .cse14 .cse15 .cse16 .cse10 .cse17) (or .cse1 .cse2 .cse26 .cse5 .cse27 .cse3 .cse6 .cse7 .cse13 .cse8 .cse15 .cse16 .cse10 .cse17 .cse18) (or .cse0 .cse1 .cse11 .cse3 .cse28 .cse5 .cse6 .cse7 .cse14 .cse19 .cse29 .cse9 .cse16 .cse10 .cse30) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) .cse3 (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (or (not (= ~token~0 0)) .cse21 .cse29 (not (= 0 ~local~0)) .cse24 .cse13) (not (= ~m_i~0 1)) .cse22 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) .cse23 (not (= 2 ~M_E~0))) (or .cse0 .cse25 .cse1 .cse3 .cse28 .cse5 .cse6 .cse7 .cse14 .cse19 .cse29 .cse9 .cse16 .cse30) (or .cse8 .cse14 .cse15 .cse11 .cse26 (or .cse1 .cse9 .cse10 .cse6 .cse7 .cse13) .cse5 .cse27 .cse16 .cse3)))) [2018-12-03 01:50:34,572 INFO L451 ceAbstractionStarter]: At program point is_transmit2_triggeredENTRY(lines 190 208) the Hoare annotation is: true [2018-12-03 01:50:34,572 INFO L448 ceAbstractionStarter]: For program point is_transmit2_triggeredEXIT(lines 190 208) no Hoare annotation was computed. [2018-12-03 01:50:34,572 INFO L448 ceAbstractionStarter]: For program point L195(lines 195 200) no Hoare annotation was computed. [2018-12-03 01:50:34,572 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 203) no Hoare annotation was computed. [2018-12-03 01:50:34,573 INFO L444 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 330 367) the Hoare annotation is: (let ((.cse15 (= |old(~T1_E~0)| ~T1_E~0)) (.cse16 (= |old(~M_E~0)| ~M_E~0))) (let ((.cse10 (not (= 0 ~m_st~0))) (.cse2 (< ~t2_st~0 2)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse0 (< |old(~E_1~0)| 2)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse17 (not (= 2 ~m_st~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= |old(~T2_E~0)| 0)) (.cse6 (= 0 |old(~M_E~0)|)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse9 (< ~t1_st~0 2)) (.cse14 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) .cse15 .cse16)) (.cse11 (not (= 1 ~m_pc~0))) (.cse12 (< |old(~E_2~0)| 2)) (.cse13 (= 0 |old(~E_M~0)|))) (and (let ((.cse3 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 (< .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~token~0 .cse3))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and (= ~E_1~0 2) (= ~E_M~0 2) (= ~T2_E~0 2) .cse15 (= ~E_2~0 2) .cse16) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~0)|)) (or (not (= ~token~0 0)) (not (= ~t1_pc~0 0)) .cse10 (not (= 0 ~local~0)) (not (= 0 ~m_pc~0)) (not (= ~t1_st~0 0))) (not (= ~m_i~0 1)) (not (= 0 ~t2_st~0)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 ~t2_pc~0)) (not (= 2 |old(~M_E~0)|))) (let ((.cse18 (+ ~local~0 1))) (or .cse0 .cse1 .cse14 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< ~token~0 .cse18) .cse11 .cse12 (< .cse18 ~token~0) .cse13)) (or .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse14 .cse12 .cse13) (or .cse0 .cse1 (< 0 ~t2_pc~0) .cse17 .cse4 .cse5 .cse6 .cse7 .cse9 .cse14 .cse11 .cse12 .cse13)))) [2018-12-03 01:50:34,578 INFO L448 ceAbstractionStarter]: For program point L349-1(lines 333 366) no Hoare annotation was computed. [2018-12-03 01:50:34,578 INFO L448 ceAbstractionStarter]: For program point L339-1(lines 333 366) no Hoare annotation was computed. [2018-12-03 01:50:34,578 INFO L448 ceAbstractionStarter]: For program point L354-1(lines 333 366) no Hoare annotation was computed. [2018-12-03 01:50:34,578 INFO L448 ceAbstractionStarter]: For program point L344-1(lines 333 366) no Hoare annotation was computed. [2018-12-03 01:50:34,578 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 330 367) no Hoare annotation was computed. [2018-12-03 01:50:34,578 INFO L448 ceAbstractionStarter]: For program point L334-1(lines 333 366) no Hoare annotation was computed. [2018-12-03 01:50:34,578 INFO L448 ceAbstractionStarter]: For program point L359-1(lines 330 367) no Hoare annotation was computed. [2018-12-03 01:50:34,578 INFO L444 ceAbstractionStarter]: At program point L543-1(lines 540 580) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0)) (.cse6 (= 1 ~t2_pc~0)) (.cse7 (= 1 ~m_pc~0)) (.cse8 (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_2~0 0)))) (.cse12 (= ~m_st~0 2)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (not (= ~E_M~0 1)))) (let ((.cse11 (<= |old(~E_2~0)| ~E_2~0)) (.cse3 (<= 2 ~t2_st~0)) (.cse1 (and .cse5 .cse6 (<= 2 ~E_2~0) .cse7 .cse8 .cse12 .cse9 .cse10)) (.cse2 (<= 2 ~t1_st~0))) (or (not (= 2 |old(~E_2~0)|)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) .cse1 (<= .cse0 ~token~0) .cse2)) (not (= |old(~T1_E~0)| 2)) (let ((.cse4 (+ ~local~0 2))) (and .cse3 .cse2 (<= .cse4 ~token~0) (and .cse5 .cse6 (and (= ~m_st~0 0) .cse7 .cse8) .cse9 .cse10 .cse11) (<= ~token~0 .cse4))) (not (= 1 ~t1_i~0)) (and (and .cse5 .cse7 .cse8 .cse12 (<= ~t2_pc~0 0) .cse9 .cse10 .cse11) .cse2) (and .cse3 .cse1 .cse2) (not (= |old(~T2_E~0)| 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~T1_E~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~M_E~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-03 01:50:34,582 INFO L444 ceAbstractionStarter]: At program point L539(line 539) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-03 01:50:34,582 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 528 586) no Hoare annotation was computed. [2018-12-03 01:50:34,582 INFO L444 ceAbstractionStarter]: At program point L537(line 537) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-03 01:50:34,582 INFO L444 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: (let ((.cse3 (= 1 ~t1_pc~0)) (.cse4 (= 1 ~t2_pc~0)) (.cse11 (<= 2 ~E_2~0)) (.cse5 (= 1 ~m_pc~0)) (.cse12 (= ~m_st~0 2)) (.cse7 (<= 2 ~E_1~0)) (.cse6 (and (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0)))) (.cse8 (not (= ~E_M~0 1)))) (let ((.cse0 (<= 2 ~t2_st~0)) (.cse2 (and .cse3 .cse4 .cse11 .cse5 .cse12 .cse7 .cse6 .cse8)) (.cse1 (<= 2 ~t1_st~0))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse1 .cse2) (not (= 1 ~t1_i~0)) (let ((.cse9 (+ ~local~0 2))) (and .cse0 (and .cse3 .cse4 (and (= ~m_st~0 0) .cse5 .cse6) .cse7 .cse8 (<= |old(~E_2~0)| ~E_2~0)) .cse1 (<= .cse9 ~token~0) (<= ~token~0 .cse9))) (let ((.cse10 (+ ~local~0 1))) (and (<= ~token~0 .cse10) (<= .cse10 ~token~0) .cse1 .cse2)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (and (and .cse3 .cse11 .cse5 .cse12 (<= ~t2_pc~0 0) .cse7 .cse6 .cse8) .cse1) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-03 01:50:34,584 INFO L448 ceAbstractionStarter]: For program point L562(lines 562 571) no Hoare annotation was computed. [2018-12-03 01:50:34,584 INFO L444 ceAbstractionStarter]: At program point L562-1(lines 562 571) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0)) (.cse6 (= 1 ~t2_pc~0)) (.cse7 (= 1 ~m_pc~0)) (.cse8 (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_2~0 0)))) (.cse12 (= ~m_st~0 2)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (not (= ~E_M~0 1)))) (let ((.cse11 (<= |old(~E_2~0)| ~E_2~0)) (.cse3 (<= 2 ~t2_st~0)) (.cse1 (and .cse5 .cse6 (<= 2 ~E_2~0) .cse7 .cse8 .cse12 .cse9 .cse10)) (.cse2 (<= 2 ~t1_st~0))) (or (not (= 2 |old(~E_2~0)|)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) .cse1 (<= .cse0 ~token~0) .cse2)) (not (= |old(~T1_E~0)| 2)) (let ((.cse4 (+ ~local~0 2))) (and .cse3 .cse2 (<= .cse4 ~token~0) (and .cse5 .cse6 (and (= ~m_st~0 0) .cse7 .cse8) .cse9 .cse10 .cse11) (<= ~token~0 .cse4))) (not (= 1 ~t1_i~0)) (and (and .cse5 .cse7 .cse8 .cse12 (<= ~t2_pc~0 0) .cse9 .cse10 .cse11) .cse2) (and .cse3 .cse1 .cse2) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-03 01:50:34,584 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-03 01:50:34,584 INFO L444 ceAbstractionStarter]: At program point L556(line 556) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0)) (.cse6 (= 1 ~t2_pc~0)) (.cse7 (= 1 ~m_pc~0)) (.cse8 (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_2~0 0)))) (.cse12 (= ~m_st~0 2)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (not (= ~E_M~0 1)))) (let ((.cse11 (<= |old(~E_2~0)| ~E_2~0)) (.cse3 (<= 2 ~t2_st~0)) (.cse1 (and .cse5 .cse6 (<= 2 ~E_2~0) .cse7 .cse8 .cse12 .cse9 .cse10)) (.cse2 (<= 2 ~t1_st~0))) (or (not (= 2 |old(~E_2~0)|)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) .cse1 (<= .cse0 ~token~0) .cse2)) (not (= |old(~T1_E~0)| 2)) (let ((.cse4 (+ ~local~0 2))) (and .cse3 .cse2 (<= .cse4 ~token~0) (and .cse5 .cse6 (and (= ~m_st~0 0) .cse7 .cse8) .cse9 .cse10 .cse11) (<= ~token~0 .cse4))) (not (= 1 ~t1_i~0)) (and (and .cse5 .cse7 .cse8 .cse12 (<= ~t2_pc~0 0) .cse9 .cse10 .cse11) .cse2) (and .cse3 .cse1 .cse2) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-03 01:50:34,585 INFO L444 ceAbstractionStarter]: At program point L581(lines 528 586) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= ~M_E~0 0)) (not (= |old(~T1_E~0)| 2)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-03 01:50:34,585 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 528 586) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-03 01:50:34,585 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-12-03 01:50:34,585 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 579) no Hoare annotation was computed. [2018-12-03 01:50:34,585 INFO L448 ceAbstractionStarter]: For program point L573(line 573) no Hoare annotation was computed. [2018-12-03 01:50:34,586 INFO L444 ceAbstractionStarter]: At program point L538(line 538) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-03 01:50:34,586 INFO L444 ceAbstractionStarter]: At program point L536(line 536) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-03 01:50:34,587 INFO L444 ceAbstractionStarter]: At program point L536-1(line 536) the Hoare annotation is: (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= |old(~T1_E~0)| ~T1_E~0) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0) (= |old(~M_E~0)| ~M_E~0)) (not (= 1 ~t1_i~0)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))) [2018-12-03 01:50:34,587 INFO L444 ceAbstractionStarter]: At program point L565(line 565) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0)) (.cse6 (= 1 ~t2_pc~0)) (.cse7 (= 1 ~m_pc~0)) (.cse8 (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_2~0 0)))) (.cse12 (= ~m_st~0 2)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (not (= ~E_M~0 1)))) (let ((.cse11 (<= |old(~E_2~0)| ~E_2~0)) (.cse3 (<= 2 ~t2_st~0)) (.cse1 (and .cse5 .cse6 (<= 2 ~E_2~0) .cse7 .cse8 .cse12 .cse9 .cse10)) (.cse2 (<= 2 ~t1_st~0))) (or (not (= 2 |old(~E_2~0)|)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) .cse1 (<= .cse0 ~token~0) .cse2)) (not (= |old(~T1_E~0)| 2)) (let ((.cse4 (+ ~local~0 2))) (and .cse3 .cse2 (<= .cse4 ~token~0) (and .cse5 .cse6 (and (= ~m_st~0 0) .cse7 .cse8) .cse9 .cse10 .cse11) (<= ~token~0 .cse4))) (not (= 1 ~t1_i~0)) (and (and .cse5 .cse7 .cse8 .cse12 (<= ~t2_pc~0 0) .cse9 .cse10 .cse11) .cse2) (and .cse3 .cse1 .cse2) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-03 01:50:34,587 INFO L444 ceAbstractionStarter]: At program point L565-1(line 565) the Hoare annotation is: (let ((.cse3 (= 1 ~t1_pc~0)) (.cse4 (= 1 ~t2_pc~0)) (.cse11 (<= 2 ~E_2~0)) (.cse5 (= 1 ~m_pc~0)) (.cse12 (= ~m_st~0 2)) (.cse7 (<= 2 ~E_1~0)) (.cse6 (and (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)) (not (= ~E_1~0 0)) (not (= ~E_M~0 0))) (not (= ~E_2~0 0)))) (.cse8 (not (= ~E_M~0 1)))) (let ((.cse0 (<= 2 ~t2_st~0)) (.cse2 (and .cse3 .cse4 .cse11 .cse5 .cse12 .cse7 .cse6 .cse8)) (.cse1 (<= 2 ~t1_st~0))) (or (not (= 2 |old(~E_2~0)|)) (not (= |old(~T1_E~0)| 2)) (and .cse0 .cse1 .cse2) (not (= 1 ~t1_i~0)) (let ((.cse9 (+ ~local~0 2))) (and .cse0 (and .cse3 .cse4 (and (= ~m_st~0 0) .cse5 .cse6) .cse7 .cse8 (<= |old(~E_2~0)| ~E_2~0)) .cse1 (<= .cse9 ~token~0) (<= ~token~0 .cse9))) (let ((.cse10 (+ ~local~0 1))) (and (<= ~token~0 .cse10) (<= .cse10 ~token~0) .cse1 .cse2)) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (and (and .cse3 .cse11 .cse5 .cse12 (<= ~t2_pc~0 0) .cse7 .cse6 .cse8) .cse1) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-03 01:50:34,591 INFO L444 ceAbstractionStarter]: At program point L557(line 557) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0)) (.cse6 (= 1 ~t2_pc~0)) (.cse7 (= 1 ~m_pc~0)) (.cse8 (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_2~0 0)))) (.cse12 (= ~m_st~0 2)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (not (= ~E_M~0 1)))) (let ((.cse11 (<= |old(~E_2~0)| ~E_2~0)) (.cse3 (<= 2 ~t2_st~0)) (.cse1 (and .cse5 .cse6 (<= 2 ~E_2~0) .cse7 .cse8 .cse12 .cse9 .cse10)) (.cse2 (<= 2 ~t1_st~0))) (or (not (= 2 |old(~E_2~0)|)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) .cse1 (<= .cse0 ~token~0) .cse2)) (not (= |old(~T1_E~0)| 2)) (let ((.cse4 (+ ~local~0 2))) (and .cse3 .cse2 (<= .cse4 ~token~0) (and .cse5 .cse6 (and (= ~m_st~0 0) .cse7 .cse8) .cse9 .cse10 .cse11) (<= ~token~0 .cse4))) (not (= 1 ~t1_i~0)) (and (and .cse5 .cse7 .cse8 .cse12 (<= ~t2_pc~0 0) .cse9 .cse10 .cse11) .cse2) (and .cse3 .cse1 .cse2) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-03 01:50:34,591 INFO L444 ceAbstractionStarter]: At program point L555(line 555) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0)) (.cse6 (= 1 ~t2_pc~0)) (.cse7 (= 1 ~m_pc~0)) (.cse8 (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_2~0 0)))) (.cse12 (= ~m_st~0 2)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (not (= ~E_M~0 1)))) (let ((.cse11 (<= |old(~E_2~0)| ~E_2~0)) (.cse3 (<= 2 ~t2_st~0)) (.cse1 (and .cse5 .cse6 (<= 2 ~E_2~0) .cse7 .cse8 .cse12 .cse9 .cse10)) (.cse2 (<= 2 ~t1_st~0))) (or (not (= 2 |old(~E_2~0)|)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) .cse1 (<= .cse0 ~token~0) .cse2)) (not (= |old(~T1_E~0)| 2)) (let ((.cse4 (+ ~local~0 2))) (and .cse3 .cse2 (<= .cse4 ~token~0) (and .cse5 .cse6 (and (= ~m_st~0 0) .cse7 .cse8) .cse9 .cse10 .cse11) (<= ~token~0 .cse4))) (not (= 1 ~t1_i~0)) (and (and .cse5 .cse7 .cse8 .cse12 (<= ~t2_pc~0 0) .cse9 .cse10 .cse11) .cse2) (and .cse3 .cse1 .cse2) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-03 01:50:34,591 INFO L444 ceAbstractionStarter]: At program point L555-1(line 555) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0)) (.cse6 (= 1 ~t2_pc~0)) (.cse7 (= 1 ~m_pc~0)) (.cse8 (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_2~0 0)))) (.cse12 (= ~m_st~0 2)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (not (= ~E_M~0 1)))) (let ((.cse11 (<= |old(~E_2~0)| ~E_2~0)) (.cse3 (<= 2 ~t2_st~0)) (.cse1 (and .cse5 .cse6 (<= 2 ~E_2~0) .cse7 .cse8 .cse12 .cse9 .cse10)) (.cse2 (<= 2 ~t1_st~0))) (or (not (= 2 |old(~E_2~0)|)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) .cse1 (<= .cse0 ~token~0) .cse2)) (not (= |old(~T1_E~0)| 2)) (let ((.cse4 (+ ~local~0 2))) (and .cse3 .cse2 (<= .cse4 ~token~0) (and .cse5 .cse6 (and (= ~m_st~0 0) .cse7 .cse8) .cse9 .cse10 .cse11) (<= ~token~0 .cse4))) (not (= 1 ~t1_i~0)) (and (and .cse5 .cse7 .cse8 .cse12 (<= ~t2_pc~0 0) .cse9 .cse10 .cse11) .cse2) (and .cse3 .cse1 .cse2) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-03 01:50:34,594 INFO L444 ceAbstractionStarter]: At program point L551(line 551) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0)) (.cse6 (= 1 ~t2_pc~0)) (.cse7 (= 1 ~m_pc~0)) (.cse8 (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_2~0 0)))) (.cse12 (= ~m_st~0 2)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (not (= ~E_M~0 1)))) (let ((.cse11 (<= |old(~E_2~0)| ~E_2~0)) (.cse3 (<= 2 ~t2_st~0)) (.cse1 (and .cse5 .cse6 (<= 2 ~E_2~0) .cse7 .cse8 .cse12 .cse9 .cse10)) (.cse2 (<= 2 ~t1_st~0))) (or (not (= 2 |old(~E_2~0)|)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) .cse1 (<= .cse0 ~token~0) .cse2)) (not (= |old(~T1_E~0)| 2)) (let ((.cse4 (+ ~local~0 2))) (and .cse3 .cse2 (<= .cse4 ~token~0) (and .cse5 .cse6 (and (= ~m_st~0 0) .cse7 .cse8) .cse9 .cse10 .cse11) (<= ~token~0 .cse4))) (not (= 1 ~t1_i~0)) (and (and .cse5 .cse7 .cse8 .cse12 (<= ~t2_pc~0 0) .cse9 .cse10 .cse11) .cse2) (and .cse3 .cse1 .cse2) (not (= |old(~T2_E~0)| 2)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-03 01:50:34,594 INFO L448 ceAbstractionStarter]: For program point L551-1(line 551) no Hoare annotation was computed. [2018-12-03 01:50:34,594 INFO L444 ceAbstractionStarter]: At program point L547(line 547) the Hoare annotation is: (let ((.cse5 (= 1 ~t1_pc~0)) (.cse6 (= 1 ~t2_pc~0)) (.cse7 (= 1 ~m_pc~0)) (.cse8 (and (and (not (= ~E_M~0 0)) (and (not (= ~T1_E~0 0)) (not (= ~T2_E~0 0)) (not (= ~M_E~0 0)))) (not (= ~E_2~0 0)))) (.cse12 (= ~m_st~0 2)) (.cse9 (<= 2 ~E_1~0)) (.cse10 (not (= ~E_M~0 1)))) (let ((.cse11 (<= |old(~E_2~0)| ~E_2~0)) (.cse3 (<= 2 ~t2_st~0)) (.cse1 (and .cse5 .cse6 (<= 2 ~E_2~0) .cse7 .cse8 .cse12 .cse9 .cse10)) (.cse2 (<= 2 ~t1_st~0))) (or (not (= 2 |old(~E_2~0)|)) (let ((.cse0 (+ ~local~0 1))) (and (<= ~token~0 .cse0) .cse1 (<= .cse0 ~token~0) .cse2)) (not (= |old(~T1_E~0)| 2)) (let ((.cse4 (+ ~local~0 2))) (and .cse3 .cse2 (<= .cse4 ~token~0) (and .cse5 .cse6 (and (= ~m_st~0 0) .cse7 .cse8) .cse9 .cse10 .cse11) (<= ~token~0 .cse4))) (not (= 1 ~t1_i~0)) (and (and .cse5 .cse7 .cse8 .cse12 (<= ~t2_pc~0 0) .cse9 .cse10 .cse11) .cse2) (and .cse3 .cse1 .cse2) (not (= |old(~T2_E~0)| 2)) (and (= ~m_pc~0 0) (= ~E_1~0 2) (= ~T1_E~0 2) (= ~m_st~0 |old(~m_st~0)|) (= ~E_M~0 2) (= ~M_E~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) (not (= 2 |old(~E_M~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 (= 0 |old(~m_pc~0)|)) (not (= |old(~t1_st~0)| 0))) (not (= ~m_i~0 1)) (not (= 0 |old(~t2_st~0)|)) (not (= 2 |old(~E_1~0)|)) (not (= 1 ~t2_i~0)) (not (= 0 |old(~t2_pc~0)|)) (not (= 2 |old(~M_E~0)|))))) [2018-12-03 01:50:34,597 INFO L448 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2018-12-03 01:50:34,597 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 209 216) no Hoare annotation was computed. [2018-12-03 01:50:34,597 INFO L451 ceAbstractionStarter]: At program point update_channelsFINAL(lines 209 216) the Hoare annotation is: true [2018-12-03 01:50:34,597 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 162) no Hoare annotation was computed. [2018-12-03 01:50:34,597 INFO L448 ceAbstractionStarter]: For program point L156(lines 156 165) no Hoare annotation was computed. [2018-12-03 01:50:34,597 INFO L448 ceAbstractionStarter]: For program point L156-2(lines 156 165) no Hoare annotation was computed. [2018-12-03 01:50:34,597 INFO L448 ceAbstractionStarter]: For program point is_master_triggeredFINAL(lines 152 170) no Hoare annotation was computed. [2018-12-03 01:50:34,597 INFO L448 ceAbstractionStarter]: For program point is_master_triggeredEXIT(lines 152 170) no Hoare annotation was computed. [2018-12-03 01:50:34,598 INFO L444 ceAbstractionStarter]: At program point L167(lines 155 169) the Hoare annotation is: (let ((.cse25 (= 1 ~m_pc~0)) (.cse32 (+ ~local~0 1)) (.cse26 (= ~t1_pc~0 1)) (.cse24 (= 0 ~m_st~0))) (let ((.cse15 (< 0 ~t2_pc~0)) (.cse19 (not .cse24)) (.cse22 (not (= ~t1_st~0 0))) (.cse28 (not (= ~t1_pc~0 0))) (.cse30 (not (= 0 ~t2_st~0))) (.cse31 (not (= 0 ~t2_pc~0))) (.cse29 (not (= 0 ~m_pc~0))) (.cse27 (= is_master_triggered_~__retres1~0 0)) (.cse20 (< ~local~0 ~token~0)) (.cse21 (< ~token~0 ~local~0)) (.cse9 (< ~t1_st~0 2)) (.cse23 (not (= 1 ~E_1~0))) (.cse12 (< ~E_2~0 2)) (.cse0 (< ~E_1~0 2)) (.cse4 (= 0 is_master_triggered_~__retres1~0)) (.cse1 (= ~T1_E~0 0)) (.cse17 (< ~t2_st~0 2)) (.cse2 (not (= 2 ~m_st~0))) (.cse3 (not .cse26)) (.cse5 (= ~T2_E~0 0)) (.cse6 (= 0 ~M_E~0)) (.cse7 (= 1 ~E_M~0)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse10 (< ~token~0 .cse32)) (.cse11 (not .cse25)) (.cse13 (< .cse32 ~token~0)) (.cse14 (= 0 ~E_M~0)) (.cse16 (= 0 ~E_2~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse15 .cse2 .cse3 .cse5 .cse6 .cse7 .cse11 .cse14 .cse16 .cse4) (let ((.cse18 (+ ~local~0 2))) (or .cse0 .cse1 .cse17 (< .cse18 ~token~0) .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse4 .cse11 .cse12 .cse14 (< ~token~0 .cse18))) (or .cse20 .cse21 (or .cse1 .cse17 .cse3 .cse5 .cse6 .cse22 .cse7 .cse8 .cse23 .cse11 .cse12 .cse14 .cse24) .cse4) (or .cse1 .cse15 .cse20 .cse3 .cse21 .cse5 .cse6 .cse7 .cse9 .cse23 .cse4 .cse12 .cse14 .cse24 .cse25) (or .cse4 .cse1 .cse17 .cse26 .cse5 .cse6 .cse22 .cse7 .cse8 .cse23 .cse12 .cse14 .cse24 .cse25) (or (not (= 2 ~E_2~0)) (not (= ~T1_E~0 2)) (not (= 1 ~t1_i~0)) .cse27 (not (= ~T2_E~0 2)) (not (= 2 ~E_M~0)) (or (not (= ~token~0 0)) .cse28 .cse19 (not (= 0 ~local~0)) .cse29 .cse22) (not (= ~m_i~0 1)) .cse30 (not (= 2 ~E_1~0)) (not (= 1 ~t2_i~0)) .cse31 (not (= 2 ~M_E~0))) (or .cse1 .cse5 .cse6 .cse22 .cse7 .cse28 .cse23 .cse30 .cse12 .cse14 .cse24 .cse31 .cse29 .cse27) (or .cse0 .cse1 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14) (or .cse1 .cse17 .cse20 .cse3 .cse21 .cse5 .cse6 .cse4 .cse7 .cse8 .cse9 .cse23 .cse12 .cse14 .cse24) (or .cse0 .cse4 .cse1 .cse17 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse16)))) [2018-12-03 01:50:34,599 INFO L451 ceAbstractionStarter]: At program point is_master_triggeredENTRY(lines 152 170) the Hoare annotation is: true [2018-12-03 01:50:34,599 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 01:50:34,599 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~T1_E~0 2) (= ~E_M~0 2) (= ~m_st~0 0) (= ~m_pc~0 0) (= ~M_E~0 2) (= ~E_1~0 2) (= ~t2_pc~0 0) (= ~t1_st~0 0) (= ~T2_E~0 2) (= ~t2_st~0 0) (= ~token~0 0) (= ~local~0 0) (= ~E_2~0 2) (= ~t1_pc~0 0)) [2018-12-03 01:50:34,599 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 01:50:34,599 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 01:50:34,599 INFO L448 ceAbstractionStarter]: For program point L479-1(lines 463 496) no Hoare annotation was computed. [2018-12-03 01:50:34,599 INFO L448 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 460 497) no Hoare annotation was computed. [2018-12-03 01:50:34,599 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 463 496) no Hoare annotation was computed. [2018-12-03 01:50:34,599 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 463 496) no Hoare annotation was computed. [2018-12-03 01:50:34,599 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 463 496) no Hoare annotation was computed. [2018-12-03 01:50:34,599 INFO L444 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 460 497) the Hoare annotation is: (let ((.cse2 (< ~t2_st~0 2)) (.cse8 (not (= 1 ~t2_pc~0))) (.cse0 (< |old(~E_1~0)| 2)) (.cse1 (= |old(~T1_E~0)| 0)) (.cse14 (not (= 2 ~m_st~0))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (= |old(~T2_E~0)| 0)) (.cse6 (= 0 |old(~M_E~0)|)) (.cse7 (= 1 |old(~E_M~0)|)) (.cse9 (< ~t1_st~0 2)) (.cse13 (and (= |old(~E_1~0)| ~E_1~0) (= |old(~T2_E~0)| ~T2_E~0) (= |old(~E_M~0)| ~E_M~0) (= |old(~E_2~0)| ~E_2~0) (= |old(~T1_E~0)| ~T1_E~0) (= |old(~M_E~0)| ~M_E~0))) (.cse10 (not (= 1 ~m_pc~0))) (.cse11 (< |old(~E_2~0)| 2)) (.cse12 (= 0 |old(~E_M~0)|))) (and (let ((.cse3 (+ ~local~0 2))) (or .cse0 .cse1 .cse2 (< .cse3 ~token~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 0 ~m_st~0)) .cse10 .cse11 .cse12 .cse13 (< ~token~0 .cse3))) (let ((.cse15 (+ ~local~0 1))) (or .cse0 .cse1 .cse13 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< ~token~0 .cse15) .cse10 .cse11 (< .cse15 ~token~0) .cse12)) (or .cse0 .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse11 .cse12) (or .cse0 .cse1 (< 0 ~t2_pc~0) .cse14 .cse4 .cse5 .cse6 .cse7 .cse9 .cse13 .cse10 .cse11 .cse12))) [2018-12-03 01:50:34,600 INFO L448 ceAbstractionStarter]: For program point L464-1(lines 463 496) no Hoare annotation was computed. [2018-12-03 01:50:34,600 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 460 497) no Hoare annotation was computed. [2018-12-03 01:50:34,600 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 498 508) no Hoare annotation was computed. [2018-12-03 01:50:34,600 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 498 508) no Hoare annotation was computed. [2018-12-03 01:50:34,600 INFO L451 ceAbstractionStarter]: At program point init_modelENTRY(lines 498 508) the Hoare annotation is: true [2018-12-03 01:50:34,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 01:50:34 BoogieIcfgContainer [2018-12-03 01:50:34,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 01:50:34,649 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 01:50:34,649 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 01:50:34,649 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 01:50:34,649 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:48:46" (3/4) ... [2018-12-03 01:50:34,652 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 01:50:34,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit1 [2018-12-03 01:50:34,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-12-03 01:50:34,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2018-12-03 01:50:34,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure transmit2 [2018-12-03 01:50:34,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-12-03 01:50:34,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-12-03 01:50:34,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit1_triggered [2018-12-03 01:50:34,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-12-03 01:50:34,657 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 01:50:34,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-12-03 01:50:34,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure master [2018-12-03 01:50:34,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_time_events [2018-12-03 01:50:34,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 01:50:34,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-12-03 01:50:34,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-12-03 01:50:34,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_transmit2_triggered [2018-12-03 01:50:34,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-12-03 01:50:34,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-12-03 01:50:34,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-12-03 01:50:34,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_master_triggered [2018-12-03 01:50:34,658 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_time_events [2018-12-03 01:50:34,659 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-12-03 01:50:34,665 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-03 01:50:34,665 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-03 01:50:34,689 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(2 == \old(E_2)) || (((token <= local + 1 && ((((((1 == t1_pc && 1 == t2_pc) && 2 <= E_2) && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && m_st == 2) && 2 <= E_1) && !(E_M == 1)) && local + 1 <= token) && 2 <= t1_st)) || !(\old(T1_E) == 2)) || ((((2 <= t2_st && 2 <= t1_st) && local + 2 <= token) && ((((1 == t1_pc && 1 == t2_pc) && (m_st == 0 && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2) && token <= local + 2)) || !(1 == t1_i)) || ((((((((1 == t1_pc && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && m_st == 2) && t2_pc <= 0) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2) && 2 <= t1_st)) || ((2 <= t2_st && ((((((1 == t1_pc && 1 == t2_pc) && 2 <= E_2) && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && m_st == 2) && 2 <= E_1) && !(E_M == 1)) && 2 <= t1_st)) || !(\old(T2_E) == 2)) || (((((((((((((m_pc == 0 && E_1 == 2) && T1_E == 2) && m_st == \old(m_st)) && E_M == 2) && M_E == 2) && t2_pc == 0) && t1_st == 0) && T2_E == 2) && t2_st == 0) && token == 0) && local == 0) && E_2 == 2) && t1_pc == 0)) || !(2 == \old(E_M))) || ((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == \old(M_E)) [2018-12-03 01:50:34,690 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(2 == \old(E_2)) || !(M_E == 0)) || !(\old(T1_E) == 2)) || !(1 == t1_i)) || !(\old(T2_E) == 2)) || !(2 == \old(E_M))) || ((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == \old(M_E)) [2018-12-03 01:50:34,690 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || !(2 == \old(m_st))) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || (((2 <= t2_st && ((((1 == t1_pc && (((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t2_pc) && 2 <= E_2) && 2 <= E_1) && !(E_M == 1)) && token <= local) && local <= token)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < \old(local) + 1) || !(1 == \old(m_pc))) || \old(E_2) < 2) || \old(local) + 1 < \old(token)) || 0 == \old(E_M)) || ((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && 2 <= E_1) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || (((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && 2 <= E_1) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) && (((((((((((((\old(E_1) < 2 || (((((((1 == t1_pc && \old(t2_st) <= t2_st) && (((((m_st == \old(m_st) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && t2_pc <= 0) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2)) || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || (((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && (((((m_st == \old(m_st) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2)) || \old(E_2) < 2) || 0 == \old(E_M))) && ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || (((2 <= t2_st && ((((1 == t1_pc && (((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t2_pc) && 2 <= E_2) && 2 <= E_1) && !(E_M == 1)) && token <= local) && local <= token)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(0 == \old(m_st))) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && 2 <= E_1) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || (((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && 2 <= E_1) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((((((((((((m_st == 2 && !(E_M == 0)) && E_1 == 2) && t2_pc == 0) && t1_st == 0) && t2_st == 0) && 1 == m_pc) && t1_pc == 0) && !(E_M == 1)) && \old(E_2) <= E_2) || !(2 == \old(E_2))) || !(T1_E == 2)) || (2 <= t1_st && ((((1 == t1_pc && 2 <= E_2) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && t2_pc <= 0) && 2 <= E_1) && !(E_M == 1))) || !(m_i == 1)) || (((((!(E_M == 0) && E_1 == 2) && !(E_M == 1)) && ((t2_pc == 0 && t2_st == 0) && t1_pc == 1) && t1_st == 2) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_2) <= E_2)) || !(2 == M_E)) || ((((((((((E_M == 2 && m_st == 0) && m_pc == 0) && E_1 == 2) && t2_pc == 0) && t1_st == 0) && t2_st == 0) && token == 0) && local == 0) && E_2 == 2) && t1_pc == 0)) || !(1 == t1_i)) || ((((((((1 == t2_pc && !(1 == t1_pc)) && !(E_M == 0)) && 2 <= t2_st) && t1_st == 0) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2)) || ((((((((1 == t1_pc && 1 == t2_pc) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2)) || ((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && 2 <= t1_st) && 2 <= E_1) && !(E_M == 1))) || !(T2_E == 2)) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || !(2 == \old(E_M))) || ((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || !(0 == \old(local))) || !(0 == \old(t2_pc))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || (((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && 2 <= t1_st) && 2 <= E_1) && !(E_M == 1))) || (((2 <= t2_st && (((((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t2_pc) && 2 <= E_2) && 2 <= E_1) && !(E_M == 1)) && token <= local) && local <= token)) || !(2 == \old(E_1))) || !(1 == t2_i)) || (((((((((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t1_pc) && t2_pc <= 0) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2) && token <= local) && local <= token)) || ((((((2 <= t2_st && (((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t2_pc) && !(1 == t1_pc)) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2))) && (((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || (((((((1 == t1_pc && 1 == t2_pc) && \old(t2_st) <= t2_st) && (((((m_st == \old(m_st) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) [2018-12-03 01:50:34,690 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || (((((((((1 == t1_pc && 1 == t2_pc) && \old(t2_st) <= t2_st) && m_st == 2) && !(E_M == 0)) && 1 == m_pc) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) && (((((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || ((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || !(1 == t1_i)) || ((((((((1 == t1_pc && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_2) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || (((((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && !(T1_E == 0)) && 2 <= E_2) && local + 1 <= token) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || !(T2_E == 2)) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || !(2 == \old(E_M))) || ((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && (((((((((((((((((\old(E_1) < 2 || T1_E == 0) || (((((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && !(T1_E == 0)) && 2 <= E_2) && local + 1 <= token) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || \old(t2_st) < 2) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || T2_E == 0) || ((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(0 == \old(m_st))) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) || \old(token) < \old(local) + 2)) && (((((((((((((\old(E_1) < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || (((((((((1 == t1_pc && \old(t2_st) <= t2_st) && m_st == 2) && !(E_M == 0)) && t2_pc <= 0) && 1 == m_pc) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2)) || 0 == M_E) || (((((((((1 == t1_pc && 1 == t2_pc) && m_st == 2) && !(E_M == 0)) && 2 <= t2_st) && 1 == m_pc) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2)) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M))) && ((((((((((((((((\old(E_1) < 2 || T1_E == 0) || (((((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && !(T1_E == 0)) && 2 <= E_2) && local + 1 <= token) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || !(2 == \old(m_st))) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || ((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < \old(local) + 1) || !(1 == \old(m_pc))) || \old(E_2) < 2) || \old(local) + 1 < \old(token)) || 0 == \old(E_M)) [2018-12-03 01:50:34,692 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((token == \old(token) && local + 2 <= token) && ((((((\old(E_1) == E_1 && 2 <= t1_st) && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && 1 == m_pc) && \old(t1_st) <= t1_st) || (((((\old(E_1) == E_1 && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && t1_st == 0) && 1 == m_pc) && \old(t1_st) <= t1_st))) && token <= local + 2) || ((((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t1_st) < 2) || \old(t2_st) < 2) || ((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(t1_pc == 1)) || E_2 < 2) && ((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || E_2 < 2) || (((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)))) || \old(local) + 2 < \old(token)) || \old(token) < \old(local) + 2) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || t1_pc == 1) || ((((\old(E_1) == E_1 && !(m_pc == 1)) && t1_st == 0) && m_st == \old(m_st)) && \old(t2_st) <= t2_st)) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((\old(E_1) < 2 || 0 < t2_pc) || !(t1_pc == 1)) || (((((\old(t2_st) <= t2_st && token == \old(token)) && token <= local) && ((((((\old(E_1) == E_1 && !(T2_E == 0)) && m_st == \old(m_st)) && !(M_E == 0)) && !(E_M == 0)) && !(m_st == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && \old(t1_st) <= t1_st) && local <= token)) || 1 == E_M) || ((((((!(\old(token) == 0) || T1_E == 0) || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || \old(t1_st) < 2) || E_2 < 2) || !(0 == \old(m_pc)))) && (((((((((((((((((!(2 == E_2) || !(0 == \old(local))) || !(T1_E == 2)) || ((((((m_pc == 0 && E_1 == 2) && m_st == \old(m_st)) && t1_st == 0) && t2_st == 0) && token == 0) && local == 0)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(T2_E == 2)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((\old(E_1) < 2 || \old(t2_st) < 2) || !(t1_pc == 1)) || ((((((!(\old(token) == 0) || T1_E == 0) || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || (((((\old(t2_st) <= t2_st && token == \old(token)) && token <= local) && ((((((\old(E_1) == E_1 && !(T2_E == 0)) && m_st == \old(m_st)) && !(M_E == 0)) && !(E_M == 0)) && !(m_st == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && \old(t1_st) <= t1_st) && local <= token)) || E_2 < 2) || !(0 == \old(m_pc))) [2018-12-03 01:50:34,692 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((\old(E_1) < 2 || 0 < t2_pc) || !(t1_pc == 1)) || 1 == E_M) || ((((((!(\old(token) == 0) || T1_E == 0) || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || \old(t1_st) < 2) || E_2 < 2) || ((((((token <= local && 2 <= E_1) && \old(t2_st) <= t2_st) && m_st == 2) && t1_st == 0) && 1 == m_pc) && local <= token)) || !(0 == \old(m_pc))) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || ((((\old(t2_st) <= t2_st && m_st == 2) && t1_st == 0) && 1 == m_pc) && 2 <= E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && (((((((((\old(E_1) < 2 || \old(t2_st) < 2) || !(t1_pc == 1)) || ((((((!(\old(token) == 0) || T1_E == 0) || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || (((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t2_st) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && local <= token)) || E_2 < 2) || !(0 == \old(m_pc)))) && (((((((((((((((((!(2 == E_2) || !(0 == \old(local))) || ((((E_1 == 2 && m_st == 2) && t1_st == 0) && t2_st == 0) && 1 == m_pc)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(T2_E == 2)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t1_st) < 2) || \old(t2_st) < 2) || ((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(t1_pc == 1)) || E_2 < 2) && ((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || E_2 < 2) || (((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0))) || (((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t2_st) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && local <= token)) || \old(local) + 2 < \old(token)) || \old(token) < \old(local) + 2) [2018-12-03 01:50:34,692 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((token == \old(token) && local + 2 <= token) && ((((((\old(E_1) == E_1 && 2 <= t1_st) && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && 1 == m_pc) && \old(t1_st) <= t1_st) || (((((\old(E_1) == E_1 && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && t1_st == 0) && 1 == m_pc) && \old(t1_st) <= t1_st))) && token <= local + 2) || ((((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t1_st) < 2) || \old(t2_st) < 2) || ((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(t1_pc == 1)) || E_2 < 2) && ((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || E_2 < 2) || (((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)))) || \old(local) + 2 < \old(token)) || \old(token) < \old(local) + 2) && ((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && (((((((1 == E_M || \old(E_1) < 2) || ((((((!(\old(token) == 0) || T1_E == 0) || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || \old(t1_st) < 2) || 0 < t2_pc) || !(t1_pc == 1)) || E_2 < 2) || !(0 == \old(m_pc)))) && ((((((((((((((((!(2 == E_2) || !(0 == \old(local))) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(T2_E == 2)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((\old(E_1) < 2 || \old(t2_st) < 2) || !(t1_pc == 1)) || ((((((!(\old(token) == 0) || T1_E == 0) || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || E_2 < 2) || !(0 == \old(m_pc))) [2018-12-03 01:50:34,692 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((T1_E == 0 || (((t1_pc == 0 && \old(t1_st) <= t1_st) && m_st == \old(m_st) && t2_st == 0) && \old(E_2) <= E_2)) || T2_E == 0) || 0 == M_E) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || 1 == E_M) || !(\old(t1_pc) == 0)) || !(2 == E_1)) || \old(E_2) < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == t2_pc)) && ((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || T2_E == 0) || 0 == M_E) || ((((1 == t2_pc && (m_st == \old(m_st) && m_st == 2) && ((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 2 <= E_1) && \old(t2_st) <= t2_st) && 2 <= E_2)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) || ((token <= \old(token) + 1 && local + 1 <= token) && ((1 == t2_pc && (m_st == \old(m_st) && m_st == 2) && ((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 2 <= E_1) && 2 <= E_2))) && (((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || ((1 == t1_pc && (m_st == \old(m_st) && m_st == 2) && ((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 2 <= E_2)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || !(\old(t1_pc) == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || (((((m_st == \old(m_st) && t2_st == 0) && token == 0) && E_2 == 2) && t1_pc == 0) && \old(t1_st) <= t1_st)) || !(2 == E_M)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == local)) || \old(t1_pc) == 1) || T2_E == 0) || (((((!(1 == t1_pc) && \old(t2_st) <= t2_st) && token == 0) && m_st == 0) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(0 == \old(m_st))) || \old(E_2) < 2) || 0 == E_M) || !(0 == m_pc))) && ((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || (((((1 == t2_pc && (m_st == \old(m_st) && m_st == 2) && ((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 2 <= E_1) && \old(t2_st) <= t2_st) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) [2018-12-03 01:50:34,692 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || (((((1 == t1_pc && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && m_st == 2) && local + 1 <= token)) || T2_E == 0) || 0 == M_E) || ((((1 == t1_pc && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t1_st) && 2 <= E_2)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) && ((((((((((((E_1 < 2 || T1_E == 0) || ((((1 == t1_pc && 2 <= t1_st) && \old(t2_st) <= t2_st) && m_st == 2) && \old(E_2) <= E_2)) || \old(t2_st) < 2) || !(2 == \old(m_st))) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || (((1 == t1_pc && m_st == 2) && 2 <= t1_st) && 2 <= E_2)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M)) && ((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == local)) || \old(t1_pc) == 1) || (((((1 == t1_pc && 2 <= t1_st) && m_st == \old(m_st)) && \old(t2_st) <= t2_st) && token == 0) && \old(E_2) <= E_2)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(0 == \old(m_st))) || \old(E_2) < 2) || 0 == E_M) || !(0 == m_pc))) && (((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || !(\old(t1_pc) == 0)) || (((((t1_pc == 1 && m_st == \old(m_st)) && t1_st == 2) && t2_st == 0) && token == 0) && \old(E_2) <= E_2)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == E_M)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((T1_E == 0 || T2_E == 0) || 0 == M_E) || ((((t1_pc == 1 && m_st == 2) && t1_st == 2) && t2_st == 0) && \old(E_2) <= E_2)) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || 1 == E_M) || !(\old(t1_pc) == 0)) || !(2 == E_1)) || \old(E_2) < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == t2_pc)) [2018-12-03 01:50:34,692 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || !(\old(t1_pc) == 0)) || !(1 == t1_i)) || !(\old(token) == 0) || !(0 == local)) || !(T2_E == 2)) || !(2 == E_M)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E)) && (((((((((((E_1 < 2 || T1_E == 0) || ((((1 == t1_pc && \old(t2_st) <= t2_st) && m_st == 2) && \old(E_2) == E_2) && \old(t1_st) <= t1_st)) || 0 < t2_pc) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M)) && ((((((((((T1_E == 0 || T2_E == 0) || 0 == M_E) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || 1 == E_M) || !(\old(t1_pc) == 0)) || !(2 == E_1)) || \old(E_2) < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == t2_pc))) && (((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || (((((1 == t1_pc && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(E_2) == E_2) && \old(t1_st) <= t1_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == local)) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(0 == \old(m_st))) || \old(E_2) < 2) || 0 == E_M) || !(0 == m_pc))) && (((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) [2018-12-03 01:50:34,692 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M)) || ((2 <= t1_st && (2 <= E_2 && (((((((1 == t1_pc && !(T2_E == 0)) && m_st == \old(m_st)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && \old(t1_st) <= t1_st)) && ((((((((((((((!(E_M == 0) && !(E_M == 1)) && \old(t2_st) <= t2_st) && m_st == 2) && t2_pc == 0) && t1_st == 0) || ((T1_E == 0 || 0 == \old(E_M)) || T2_E == 0) || 0 == M_E) || !(2 == \old(m_st))) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(t1_pc == 0)) || !(1 == m_pc)) || !(2 == E_1)) || E_2 < 2) || !(0 == \old(t2_pc)))) && (((((((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || ((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && local + 2 <= token) && \old(t1_st) <= t1_st)) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M)) || ((2 <= t1_st && (2 <= E_2 && (((((((1 == t1_pc && !(T2_E == 0)) && m_st == \old(m_st)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && \old(t1_st) <= t1_st))) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || ((((\old(t2_st) <= t2_st && token <= local) && (m_st == \old(m_st) && !(E_M == 0)) && t1_st == 0) && local <= token) && !(E_M == 1))) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && (((((((((((((((((\old(t2_st) <= t2_st && t2_pc <= 0) && (t1_st == 0 && !(T1_E == 0) && !(E_M == 0)) && m_st == 0 && token == 0) && !(E_M == 1)) || !(2 == E_2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && (((((((((((T1_E == 0 || ((!(0 == local) || !(2 == E_1)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || (((((\old(t2_st) <= t2_st && t2_pc <= 0) && m_st == 0 && !(T1_E == 0) && !(E_M == 0)) && token == 0) && \old(t1_st) <= t1_st) && !(E_M == 1))) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || E_2 < 2) || 0 == \old(E_M)) || !(0 == m_pc)) [2018-12-03 01:50:34,692 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((T1_E == 0 || 0 == \old(E_M)) || T2_E == 0) || 0 == M_E) || !(2 == \old(m_st))) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(t1_pc == 0)) || (((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && m_st == 2) && t2_st == 2) && t1_st == 0)) || !(1 == m_pc)) || !(2 == E_1)) || E_2 < 2) || !(0 == \old(t2_pc))) && ((((((((((((E_1 < 2 || T1_E == 0) || (((((((!(E_M == 0) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && !(T1_E == 0)) && \old(t1_st) <= t1_st)) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((((((E_1 < 2 || T1_E == 0) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && m_st == 2) && 2 <= t2_st) && t1_st == 0)) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && (((((((((((T1_E == 0 || ((!(0 == local) || !(2 == E_1)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= t2_st) && token == 0) && \old(t1_st) <= t1_st)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || E_2 < 2) || 0 == \old(E_M)) || !(0 == m_pc))) && ((((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == \old(E_M))) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= t2_st) && t1_st == 0) && token == 0)) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && (((((((((((((((E_1 < 2 || T1_E == 0) || (((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && 2 <= t2_st) && local + 2 <= token) && \old(t1_st) <= t1_st)) || (((((((!(E_M == 0) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && !(T1_E == 0)) && \old(t1_st) <= t1_st)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M)) [2018-12-03 01:50:34,693 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M)) && (((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && ((((((((1 == \old(E_M) || !(t1_pc == 0)) || ((T1_E == 0 || 0 == \old(E_M)) || T2_E == 0) || 0 == M_E) || !(1 == m_pc)) || !(2 == \old(m_st))) || !(2 == E_1)) || E_2 < 2) || !(0 == \old(t2_pc))) || !(\old(t1_st) == 0))) && ((((((((((((((E_1 < 2 || T1_E == 0) || (((((\old(E_M) == E_M && 1 == t2_pc) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(t1_st) <= t1_st)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((T1_E == 0 || ((!(0 == local) || !(2 == E_1)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || E_2 < 2) || 0 == \old(E_M)) || !(0 == m_pc)) [2018-12-03 01:50:34,727 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c4fe49f9-cb54-49b0-9a21-60da664afe6b/bin-2019/utaipan/witness.graphml [2018-12-03 01:50:34,727 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 01:50:34,727 INFO L168 Benchmark]: Toolchain (without parser) took 109012.75 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 952.2 MB in the beginning and 1.9 GB in the end (delta: -923.0 MB). Peak memory consumption was 323.8 MB. Max. memory is 11.5 GB. [2018-12-03 01:50:34,728 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:50:34,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 183.73 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 936.0 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-12-03 01:50:34,728 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 936.0 MB in the beginning and 1.1 GB in the end (delta: -198.8 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-03 01:50:34,728 INFO L168 Benchmark]: Boogie Preprocessor took 20.08 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-03 01:50:34,729 INFO L168 Benchmark]: RCFGBuilder took 299.67 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: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2018-12-03 01:50:34,729 INFO L168 Benchmark]: TraceAbstraction took 108384.28 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -782.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-03 01:50:34,729 INFO L168 Benchmark]: Witness Printer took 78.05 ms. Allocated memory is still 2.3 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:50:34,730 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 183.73 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 936.0 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 936.0 MB in the beginning and 1.1 GB in the end (delta: -198.8 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.08 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 299.67 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: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 108384.28 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: -782.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 78.05 ms. Allocated memory is still 2.3 GB. Free memory is still 1.9 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: 119]: Loop Invariant Derived loop invariant: ((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M)) || ((2 <= t1_st && (2 <= E_2 && (((((((1 == t1_pc && !(T2_E == 0)) && m_st == \old(m_st)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && \old(t1_st) <= t1_st)) && ((((((((((((((!(E_M == 0) && !(E_M == 1)) && \old(t2_st) <= t2_st) && m_st == 2) && t2_pc == 0) && t1_st == 0) || ((T1_E == 0 || 0 == \old(E_M)) || T2_E == 0) || 0 == M_E) || !(2 == \old(m_st))) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(t1_pc == 0)) || !(1 == m_pc)) || !(2 == E_1)) || E_2 < 2) || !(0 == \old(t2_pc)))) && (((((((((((((((E_1 < 2 || T1_E == 0) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || ((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && local + 2 <= token) && \old(t1_st) <= t1_st)) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M)) || ((2 <= t1_st && (2 <= E_2 && (((((((1 == t1_pc && !(T2_E == 0)) && m_st == \old(m_st)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1)) && \old(t1_st) <= t1_st))) && ((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || ((((\old(t2_st) <= t2_st && token <= local) && (m_st == \old(m_st) && !(E_M == 0)) && t1_st == 0) && local <= token) && !(E_M == 1))) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && (((((((((((((((((\old(t2_st) <= t2_st && t2_pc <= 0) && (t1_st == 0 && !(T1_E == 0) && !(E_M == 0)) && m_st == 0 && token == 0) && !(E_M == 1)) || !(2 == E_2)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && (((((((((((T1_E == 0 || ((!(0 == local) || !(2 == E_1)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || (((((\old(t2_st) <= t2_st && t2_pc <= 0) && m_st == 0 && !(T1_E == 0) && !(E_M == 0)) && token == 0) && \old(t1_st) <= t1_st) && !(E_M == 1))) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || E_2 < 2) || 0 == \old(E_M)) || !(0 == m_pc)) - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: (((((((((((((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || 0 == __retres1) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == m_pc)) || 0 == E_M) || 0 == E_2) && (((((((((((((T1_E == 0 || t2_st < 2) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == E_1)) || 0 == __retres1) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 1 == m_pc)) && (((((((((((((E_1 < 2 || T1_E == 0) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || token < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < token) || 0 == E_M) || 0 == __retres1)) && (((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(t1_pc == 0)) || !(1 == E_1)) || !(0 == t2_st)) || E_2 < 2) || 0 == E_M) || 0 == m_st) || !(0 == t2_pc)) || !(0 == m_pc))) && ((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M)) && (((((((((((0 == __retres1 || E_1 < 2) || !(1 == E_M)) || T1_E == 0) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(1 == m_pc)) || E_2 < 2)) && ((((((((((((((T1_E == 0 || t2_st < 2) || local < token) || !(t1_pc == 1)) || token < local) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == E_1)) || E_2 < 2) || 0 == E_M) || 0 == m_st)) && ((((((((((((((T1_E == 0 || 0 < t2_pc) || local < token) || !(t1_pc == 1)) || token < local) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == E_1)) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 1 == m_pc)) && ((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || 0 == __retres1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) || token < local + 2)) && ((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(1 == t1_i)) || 0 == __retres1) || !(T2_E == 2)) || !(2 == E_M)) || ((((!(token == 0) || !(t1_pc == 0)) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)) || !(t1_st == 0)) || !(m_i == 1)) || !(0 == t2_st)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((((E_1 < 2 || !(1 == E_M)) || T1_E == 0) || 0 == __retres1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || !(1 == m_pc)) || E_2 < 2) || token < local + 2)) && (((((((((1 == E_M || !(1 == t2_pc)) || !(1 == E_1)) || t2_st < 2) || local < token) || ((((T1_E == 0 || !(1 == m_pc)) || 0 == E_M) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || !(t1_pc == 1)) || token < local) || E_2 < 2) || 0 == __retres1) - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: ((((((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || (((((1 == t1_pc && 2 <= t1_st) && token <= \old(token) + 1) && 2 <= E_2) && m_st == 2) && local + 1 <= token)) || T2_E == 0) || 0 == M_E) || ((((1 == t1_pc && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t1_st) && 2 <= E_2)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) && ((((((((((((E_1 < 2 || T1_E == 0) || ((((1 == t1_pc && 2 <= t1_st) && \old(t2_st) <= t2_st) && m_st == 2) && \old(E_2) <= E_2)) || \old(t2_st) < 2) || !(2 == \old(m_st))) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || (((1 == t1_pc && m_st == 2) && 2 <= t1_st) && 2 <= E_2)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M)) && ((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == local)) || \old(t1_pc) == 1) || (((((1 == t1_pc && 2 <= t1_st) && m_st == \old(m_st)) && \old(t2_st) <= t2_st) && token == 0) && \old(E_2) <= E_2)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(0 == \old(m_st))) || \old(E_2) < 2) || 0 == E_M) || !(0 == m_pc))) && (((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || !(\old(t1_pc) == 0)) || (((((t1_pc == 1 && m_st == \old(m_st)) && t1_st == 2) && t2_st == 0) && token == 0) && \old(E_2) <= E_2)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == E_M)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((T1_E == 0 || T2_E == 0) || 0 == M_E) || ((((t1_pc == 1 && m_st == 2) && t1_st == 2) && t2_st == 0) && \old(E_2) <= E_2)) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || 1 == E_M) || !(\old(t1_pc) == 0)) || !(2 == E_1)) || \old(E_2) < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == t2_pc)) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || !(\old(t1_pc) == 0)) || !(1 == t1_i)) || !(\old(token) == 0) || !(0 == local)) || !(T2_E == 2)) || !(2 == E_M)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E)) && (((((((((((E_1 < 2 || T1_E == 0) || ((((1 == t1_pc && \old(t2_st) <= t2_st) && m_st == 2) && \old(E_2) == E_2) && \old(t1_st) <= t1_st)) || 0 < t2_pc) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M)) && ((((((((((T1_E == 0 || T2_E == 0) || 0 == M_E) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || 1 == E_M) || !(\old(t1_pc) == 0)) || !(2 == E_1)) || \old(E_2) < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == t2_pc))) && (((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || (((((1 == t1_pc && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(E_2) == E_2) && \old(t1_st) <= t1_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == local)) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(0 == \old(m_st))) || \old(E_2) < 2) || 0 == E_M) || !(0 == m_pc))) && (((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((token == \old(token) && local + 2 <= token) && ((((((\old(E_1) == E_1 && 2 <= t1_st) && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && 1 == m_pc) && \old(t1_st) <= t1_st) || (((((\old(E_1) == E_1 && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && t1_st == 0) && 1 == m_pc) && \old(t1_st) <= t1_st))) && token <= local + 2) || ((((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t1_st) < 2) || \old(t2_st) < 2) || ((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(t1_pc == 1)) || E_2 < 2) && ((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || E_2 < 2) || (((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)))) || \old(local) + 2 < \old(token)) || \old(token) < \old(local) + 2) && ((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && (((((((1 == E_M || \old(E_1) < 2) || ((((((!(\old(token) == 0) || T1_E == 0) || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || \old(t1_st) < 2) || 0 < t2_pc) || !(t1_pc == 1)) || E_2 < 2) || !(0 == \old(m_pc)))) && ((((((((((((((((!(2 == E_2) || !(0 == \old(local))) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(T2_E == 2)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((\old(E_1) < 2 || \old(t2_st) < 2) || !(t1_pc == 1)) || ((((((!(\old(token) == 0) || T1_E == 0) || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || E_2 < 2) || !(0 == \old(m_pc))) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: (((((((((((((((T1_E == 0 || (((t1_pc == 0 && \old(t1_st) <= t1_st) && m_st == \old(m_st) && t2_st == 0) && \old(E_2) <= E_2)) || T2_E == 0) || 0 == M_E) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || 1 == E_M) || !(\old(t1_pc) == 0)) || !(2 == E_1)) || \old(E_2) < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == t2_pc)) && ((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || local < \old(token)) || !(2 == \old(m_st))) || \old(token) < local) || T2_E == 0) || 0 == M_E) || ((((1 == t2_pc && (m_st == \old(m_st) && m_st == 2) && ((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 2 <= E_1) && \old(t2_st) <= t2_st) && 2 <= E_2)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) || ((token <= \old(token) + 1 && local + 1 <= token) && ((1 == t2_pc && (m_st == \old(m_st) && m_st == 2) && ((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 2 <= E_1) && 2 <= E_2))) && (((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || ((1 == t1_pc && (m_st == \old(m_st) && m_st == 2) && ((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 2 <= E_2)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M)) && (((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || (((!(0 == \old(t2_st)) || !(1 == m_pc)) || !(2 == \old(m_st))) && ((!(0 == \old(m_st)) || !(0 == \old(t2_st))) || !(0 == m_pc)))) || !(\old(t1_pc) == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || (((((m_st == \old(m_st) && t2_st == 0) && token == 0) && E_2 == 2) && t1_pc == 0) && \old(t1_st) <= t1_st)) || !(2 == E_M)) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && ((((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == local)) || \old(t1_pc) == 1) || T2_E == 0) || (((((!(1 == t1_pc) && \old(t2_st) <= t2_st) && token == 0) && m_st == 0) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || !(0 == \old(m_st))) || \old(E_2) < 2) || 0 == E_M) || !(0 == m_pc))) && ((((((((((((E_1 < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || \old(t1_pc) == 1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || (((((1 == t2_pc && (m_st == \old(m_st) && m_st == 2) && ((((!(T1_E == 0) && !(T2_E == 0)) && 1 == m_pc) && !(M_E == 0)) && !(E_M == 0)) && !(E_2 == 0)) && 2 <= E_1) && \old(t2_st) <= t2_st) && \old(t1_st) <= t1_st) && \old(E_2) <= E_2)) || !(1 == m_pc)) || \old(E_2) < 2) || 0 == E_M) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((((((!(2 == \old(E_2)) || !(M_E == 0)) || !(\old(T1_E) == 2)) || !(1 == t1_i)) || !(\old(T2_E) == 2)) || !(2 == \old(E_M))) || ((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == \old(M_E)) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((E_1 < 2 || T1_E == 0) || !(2 == m_st)) || !(t1_pc == 1)) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || token < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < token) || 0 == E_M) && (((((((((((E_1 < 2 || T1_E == 0) || 0 < t2_pc) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == m_pc)) || 0 == E_M) || 0 == E_2) || 0 == __retres1)) && (((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || 0 == __retres1) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) || token < local + 2)) && (((local < token || token < local) || (((((((((((T1_E == 0 || t2_st < 2) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == E_1)) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 0 == __retres1)) && ((((((((((((((T1_E == 0 || 0 < t2_pc) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || t1_st < 2) || !(1 == E_1)) || 0 == __retres1) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 1 == m_pc)) && (((((((((((((0 == __retres1 || T1_E == 0) || t2_st < 2) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == E_1)) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 1 == m_pc)) && ((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(1 == t1_i)) || __retres1 == 0) || !(T2_E == 2)) || !(2 == E_M)) || ((((!(token == 0) || !(t1_pc == 0)) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)) || !(t1_st == 0)) || !(m_i == 1)) || !(0 == t2_st)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((((T1_E == 0 || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(t1_pc == 0)) || !(1 == E_1)) || !(0 == t2_st)) || E_2 < 2) || 0 == E_M) || 0 == m_st) || !(0 == t2_pc)) || !(0 == m_pc)) || __retres1 == 0)) && (((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || 0 == __retres1) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M)) && ((((((((((((((T1_E == 0 || t2_st < 2) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 0 == __retres1) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || !(1 == E_1)) || E_2 < 2) || 0 == E_M) || 0 == m_st)) && ((((((((((((((E_1 < 2 || 0 == __retres1) || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || token < local + 1) || !(1 == m_pc)) || local + 1 < token) || 0 == E_M) || 0 == E_2) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((token == \old(token) && local + 2 <= token) && ((((((\old(E_1) == E_1 && 2 <= t1_st) && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && 1 == m_pc) && \old(t1_st) <= t1_st) || (((((\old(E_1) == E_1 && \old(t2_st) <= t2_st) && m_st == \old(m_st)) && t1_st == 0) && 1 == m_pc) && \old(t1_st) <= t1_st))) && token <= local + 2) || ((((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t1_st) < 2) || \old(t2_st) < 2) || ((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(t1_pc == 1)) || E_2 < 2) && ((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || E_2 < 2) || (((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)))) || \old(local) + 2 < \old(token)) || \old(token) < \old(local) + 2) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || t1_pc == 1) || ((((\old(E_1) == E_1 && !(m_pc == 1)) && t1_st == 0) && m_st == \old(m_st)) && \old(t2_st) <= t2_st)) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && ((((((((\old(E_1) < 2 || 0 < t2_pc) || !(t1_pc == 1)) || (((((\old(t2_st) <= t2_st && token == \old(token)) && token <= local) && ((((((\old(E_1) == E_1 && !(T2_E == 0)) && m_st == \old(m_st)) && !(M_E == 0)) && !(E_M == 0)) && !(m_st == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && \old(t1_st) <= t1_st) && local <= token)) || 1 == E_M) || ((((((!(\old(token) == 0) || T1_E == 0) || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || \old(t1_st) < 2) || E_2 < 2) || !(0 == \old(m_pc)))) && (((((((((((((((((!(2 == E_2) || !(0 == \old(local))) || !(T1_E == 2)) || ((((((m_pc == 0 && E_1 == 2) && m_st == \old(m_st)) && t1_st == 0) && t2_st == 0) && token == 0) && local == 0)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(T2_E == 2)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((\old(E_1) < 2 || \old(t2_st) < 2) || !(t1_pc == 1)) || ((((((!(\old(token) == 0) || T1_E == 0) || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || (((((\old(t2_st) <= t2_st && token == \old(token)) && token <= local) && ((((((\old(E_1) == E_1 && !(T2_E == 0)) && m_st == \old(m_st)) && !(M_E == 0)) && !(E_M == 0)) && !(m_st == 0)) && !(m_pc == 1)) && !(T1_E == 0)) && \old(t1_st) <= t1_st) && local <= token)) || E_2 < 2) || !(0 == \old(m_pc))) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || (((((((((1 == t1_pc && 1 == t2_pc) && \old(t2_st) <= t2_st) && m_st == 2) && !(E_M == 0)) && 1 == m_pc) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) && (((((((((((((((!(2 == \old(E_2)) || !(T1_E == 2)) || ((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || !(1 == t1_i)) || ((((((((1 == t1_pc && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && t2_pc <= 0) && 2 <= E_2) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || (((((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && !(T1_E == 0)) && 2 <= E_2) && local + 1 <= token) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || !(T2_E == 2)) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || !(2 == \old(E_M))) || ((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && (((((((((((((((((\old(E_1) < 2 || T1_E == 0) || (((((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && !(T1_E == 0)) && 2 <= E_2) && local + 1 <= token) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || \old(t2_st) < 2) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || T2_E == 0) || ((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(0 == \old(m_st))) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) || \old(token) < \old(local) + 2)) && (((((((((((((\old(E_1) < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || (((((((((1 == t1_pc && \old(t2_st) <= t2_st) && m_st == 2) && !(E_M == 0)) && t2_pc <= 0) && 1 == m_pc) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2)) || 0 == M_E) || (((((((((1 == t1_pc && 1 == t2_pc) && m_st == 2) && !(E_M == 0)) && 2 <= t2_st) && 1 == m_pc) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2)) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M))) && ((((((((((((((((\old(E_1) < 2 || T1_E == 0) || (((((((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && !(T1_E == 0)) && 2 <= E_2) && local + 1 <= token) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || !(2 == \old(m_st))) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || ((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && 2 <= E_1) && !(E_M == 1))) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < \old(local) + 1) || !(1 == \old(m_pc))) || \old(E_2) < 2) || \old(local) + 1 < \old(token)) || 0 == \old(E_M)) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((((((((((\old(E_1) < 2 || 0 < t2_pc) || !(t1_pc == 1)) || 1 == E_M) || ((((((!(\old(token) == 0) || T1_E == 0) || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || \old(t1_st) < 2) || E_2 < 2) || ((((((token <= local && 2 <= E_1) && \old(t2_st) <= t2_st) && m_st == 2) && t1_st == 0) && 1 == m_pc) && local <= token)) || !(0 == \old(m_pc))) && (((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || !(0 == \old(local))) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(\old(token) == 0)) || ((((\old(t2_st) <= t2_st && m_st == 2) && t1_st == 0) && 1 == m_pc) && 2 <= E_1)) || E_2 < 2) || 0 == E_M) || 0 == \old(m_st)) || !(0 == \old(m_pc)))) && (((((((((\old(E_1) < 2 || \old(t2_st) < 2) || !(t1_pc == 1)) || ((((((!(\old(token) == 0) || T1_E == 0) || !(0 == \old(local))) || 0 == \old(E_1)) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || \old(t1_st) < 2) || (((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t2_st) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && local <= token)) || E_2 < 2) || !(0 == \old(m_pc)))) && (((((((((((((((((!(2 == E_2) || !(0 == \old(local))) || ((((E_1 == 2 && m_st == 2) && t1_st == 0) && t2_st == 0) && 1 == m_pc)) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(\old(token) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || !(0 == \old(m_pc))) || !(T2_E == 2)) || !(2 == E_M)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || 0 == \old(m_st)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t1_st) < 2) || \old(t2_st) < 2) || ((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(t1_pc == 1)) || E_2 < 2) && ((((((1 == E_M || !(1 == t2_pc)) || \old(E_1) < 2) || \old(t2_st) < 2) || !(t1_pc == 1)) || E_2 < 2) || (((((T1_E == 0 || !(1 == \old(m_pc))) || 0 == E_M) || 0 == \old(m_st)) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0))) || (((((((((((((((1 == t1_pc && !(T2_E == 0)) && !(M_E == 0)) && !(E_M == 0)) && 2 <= E_2) && token <= local) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && \old(t2_st) <= t2_st) && m_st == 2) && 2 <= t2_st) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && local <= token)) || \old(local) + 2 < \old(token)) || \old(token) < \old(local) + 2) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((T1_E == 0 || t2_st < 2) || 0 == __retres1) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == E_1)) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 1 == m_pc) && ((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || 0 == __retres1) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) || token < local + 2)) && (((((((((((((E_1 < 2 || !(1 == E_M)) || T1_E == 0) || local + 2 < token) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(0 == m_st)) || !(1 == m_pc)) || E_2 < 2) || token < local + 2) || 0 == __retres1)) && (((local < token || ((((((((1 == E_M || !(1 == t2_pc)) || !(1 == E_1)) || t1_st < 2) || t2_st < 2) || (((T1_E == 0 || !(1 == m_pc)) || 0 == E_M) || T2_E == 0) || 0 == M_E) || !(t1_pc == 1)) || E_2 < 2) && ((((((1 == E_M || !(1 == t2_pc)) || !(1 == E_1)) || t2_st < 2) || ((((T1_E == 0 || !(1 == m_pc)) || 0 == E_M) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || !(t1_pc == 1)) || E_2 < 2))) || 1 <= __retres1) || token < local)) && (((((((((((((T1_E == 0 || 0 == __retres1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(t1_pc == 0)) || !(1 == E_1)) || !(0 == t2_st)) || E_2 < 2) || 0 == E_M) || 0 == m_st) || !(0 == t2_pc)) || !(0 == m_pc))) && (((((((((((((E_1 < 2 || T1_E == 0) || 0 == __retres1) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || token < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < token) || 0 == E_M)) && ((((((((((((((T1_E == 0 || 0 < t2_pc) || 1 <= __retres1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || t1_st < 2) || !(1 == E_1)) || E_2 < 2) || 0 == E_M) || 0 == m_st) || 1 == m_pc)) && (((((((((((E_1 < 2 || !(1 == E_M)) || T1_E == 0) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == __retres1)) && ((((((((((((((E_1 < 2 || 0 == __retres1) || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || token < local + 1) || !(1 == m_pc)) || local + 1 < token) || 0 == E_M) || 0 == E_2)) && ((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || !(1 == t2_pc)) || t1_st < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) || 0 == __retres1)) && (((((((((((E_1 < 2 || 0 == __retres1) || T1_E == 0) || 0 < t2_pc) || !(2 == m_st)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == m_pc)) || 0 == E_M) || 0 == E_2)) && ((((((((((((((T1_E == 0 || t2_st < 2) || 1 <= __retres1) || local < token) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || t1_st < 2) || !(1 == E_1)) || E_2 < 2) || 0 == E_M) || 0 == m_st)) && ((((((((((((!(2 == E_2) || !(T1_E == 2)) || 0 == __retres1) || !(1 == t1_i)) || !(T2_E == 2)) || !(2 == E_M)) || ((((!(token == 0) || !(t1_pc == 0)) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)) || !(t1_st == 0)) || !(m_i == 1)) || !(0 == t2_st)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E)) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: (((((((((((((((((((((E_1 < 2 || T1_E == 0) || __retres1 == 1) || 0 < t2_pc) || local < token) || !(2 == m_st)) || !(t1_pc == 1)) || token < local) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M) && (((((((((((((((!(0 == m_st) || !(t1_st == 2)) || !(0 == t2_st)) || !(0 == t2_pc)) || !(0 == m_pc)) && ((((!(t1_st == 2) || !(0 == t2_st)) || !(1 == m_pc)) || !(2 == m_st)) || !(0 == t2_pc))) || T1_E == 0) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || __retres1 == 1) || 1 == E_M) || !(2 == E_1)) || E_2 < 2) || 0 == E_M) || 0 == m_st)) && (((((((((((((((E_1 < 2 || __retres1 == 1) || T1_E == 0) || t2_st < 2) || !(0 == local)) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == E_M) || !(1 == t2_pc)) || !(token == 0)) || t1_st < 2) || !(0 == m_st)) || E_2 < 2) || 0 == E_M) || !(0 == m_pc))) && ((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || local < token) || !(2 == m_st)) || token < local) || __retres1 == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M)) && ((((((((((((!(2 == E_2) || !(T1_E == 2)) || __retres1 == 1) || !(1 == t1_i)) || !(T2_E == 2)) || !(2 == E_M)) || ((((!(token == 0) || !(t1_pc == 0)) || !(0 == m_st)) || !(0 == local)) || !(0 == m_pc)) || !(t1_st == 0)) || !(m_i == 1)) || !(0 == t2_st)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == t2_pc)) || !(2 == M_E))) && (((((((((T1_E == 0 || T2_E == 0) || 0 == M_E) || 1 == E_M) || (((!(t1_pc == 0) || !(0 == t2_st)) || !(1 == m_pc)) || !(2 == m_st)) || !(t1_st == 0)) || !(2 == E_1)) || E_2 < 2) || 0 == E_M) || !(0 == t2_pc)) || __retres1 == 1)) && (((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || !(2 == m_st)) || t1_pc == 1) || T2_E == 0) || __retres1 == 1) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(1 == m_pc)) || E_2 < 2) || 0 == E_M)) && (((((((((((((((E_1 < 2 || T1_E == 0) || t2_st < 2) || __retres1 == 1) || !(0 == local)) || t1_pc == 1) || T2_E == 0) || 0 == M_E) || !(t1_st == 0)) || 1 == E_M) || !(1 == t2_pc)) || !(token == 0)) || !(0 == m_st)) || E_2 < 2) || 0 == E_M) || !(0 == m_pc))) && ((((((((__retres1 == 1 || (((((!(0 == m_st) || !(t1_st == 2)) || !(0 == t2_st)) || !(0 == t2_pc)) || !(0 == m_pc)) && ((((!(t1_st == 2) || !(0 == t2_st)) || !(1 == m_pc)) || !(2 == m_st)) || !(0 == t2_pc)))) || T1_E == 0) || T2_E == 0) || 0 == M_E) || 1 == E_M) || E_2 < 2) || 0 == E_M) || ((!(token == 0) || !(0 == local)) || !(2 == E_1)) || !(t1_pc == 1)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: ((((((((((((((((T1_E == 0 || 0 == \old(E_M)) || T2_E == 0) || 0 == M_E) || !(2 == \old(m_st))) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(t1_pc == 0)) || (((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && m_st == 2) && t2_st == 2) && t1_st == 0)) || !(1 == m_pc)) || !(2 == E_1)) || E_2 < 2) || !(0 == \old(t2_pc))) && ((((((((((((E_1 < 2 || T1_E == 0) || (((((((!(E_M == 0) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && !(T1_E == 0)) && \old(t1_st) <= t1_st)) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((((((E_1 < 2 || T1_E == 0) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && token == \old(token)) && m_st == 2) && 2 <= t2_st) && t1_st == 0)) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && (((((((((((T1_E == 0 || ((!(0 == local) || !(2 == E_1)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= t2_st) && token == 0) && \old(t1_st) <= t1_st)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || E_2 < 2) || 0 == \old(E_M)) || !(0 == m_pc))) && ((((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == \old(E_M))) || ((((((!(E_M == 0) && !(E_M == 1)) && 1 == t2_pc) && m_st == \old(m_st)) && 2 <= t2_st) && t1_st == 0) && token == 0)) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && (((((((((((((((E_1 < 2 || T1_E == 0) || (((((((m_st == 0 && !(E_M == 0)) && !(E_M == 1)) && token <= local + 2) && 1 == t2_pc) && 2 <= t2_st) && local + 2 <= token) && \old(t1_st) <= t1_st)) || (((((((!(E_M == 0) && 2 <= E_1) && !(E_M == 1)) && 1 == t2_pc) && m_st == 2) && 2 <= t2_st) && !(T1_E == 0)) && \old(t1_st) <= t1_st)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M)) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M)) && (((((((((((((!(2 == E_2) || !(T1_E == 2)) || !(\old(t1_st) == 0)) || !(t1_pc == 0)) || !(1 == t1_i)) || (!(\old(token) == 0) || !(0 == local)) || !(0 == m_pc)) || !(T2_E == 2)) || !(2 == \old(E_M))) || !(0 == \old(m_st))) || !(m_i == 1)) || !(2 == E_1)) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == M_E))) && ((((((((1 == \old(E_M) || !(t1_pc == 0)) || ((T1_E == 0 || 0 == \old(E_M)) || T2_E == 0) || 0 == M_E) || !(1 == m_pc)) || !(2 == \old(m_st))) || !(2 == E_1)) || E_2 < 2) || !(0 == \old(t2_pc))) || !(\old(t1_st) == 0))) && ((((((((((((((E_1 < 2 || T1_E == 0) || (((((\old(E_M) == E_M && 1 == t2_pc) && \old(t2_st) <= t2_st) && token == \old(token)) && m_st == 2) && \old(t1_st) <= t1_st)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < local + 1) || !(1 == m_pc)) || E_2 < 2) || local + 1 < \old(token)) || 0 == \old(E_M))) && (((((((((((((E_1 < 2 || T1_E == 0) || 0 < \old(t2_pc)) || local < \old(token)) || !(2 == \old(m_st))) || !(t1_pc == 1)) || \old(token) < local) || T2_E == 0) || 0 == M_E) || !(\old(t1_st) == 0)) || 1 == \old(E_M)) || !(1 == m_pc)) || E_2 < 2) || 0 == \old(E_M))) && ((((((((((T1_E == 0 || ((!(0 == local) || !(2 == E_1)) || !(t1_pc == 1)) || !(0 == \old(t2_pc))) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(\old(token) == 0)) || \old(t1_st) < 2) || !(0 == \old(m_st))) || E_2 < 2) || 0 == \old(E_M)) || !(0 == m_pc)) - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || !(2 == \old(m_st))) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || (((2 <= t2_st && ((((1 == t1_pc && (((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t2_pc) && 2 <= E_2) && 2 <= E_1) && !(E_M == 1)) && token <= local) && local <= token)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || \old(token) < \old(local) + 1) || !(1 == \old(m_pc))) || \old(E_2) < 2) || \old(local) + 1 < \old(token)) || 0 == \old(E_M)) || ((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && 2 <= E_1) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || (((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && 2 <= E_1) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) && (((((((((((((\old(E_1) < 2 || (((((((1 == t1_pc && \old(t2_st) <= t2_st) && (((((m_st == \old(m_st) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && t2_pc <= 0) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2)) || T1_E == 0) || 0 < \old(t2_pc)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || (((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && (((((m_st == \old(m_st) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2)) || \old(E_2) < 2) || 0 == \old(E_M))) && ((((((((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || \old(local) + 2 < \old(token)) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || (((2 <= t2_st && ((((1 == t1_pc && (((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t2_pc) && 2 <= E_2) && 2 <= E_1) && !(E_M == 1)) && token <= local) && local <= token)) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(0 == \old(m_st))) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) || ((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && 2 <= t1_st) && 2 <= E_1) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || (((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && 2 <= t1_st) && 2 <= E_1) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && !(E_M == 1))) || \old(token) < \old(local) + 2)) && ((((((((((((((((((((((((((((((m_st == 2 && !(E_M == 0)) && E_1 == 2) && t2_pc == 0) && t1_st == 0) && t2_st == 0) && 1 == m_pc) && t1_pc == 0) && !(E_M == 1)) && \old(E_2) <= E_2) || !(2 == \old(E_2))) || !(T1_E == 2)) || (2 <= t1_st && ((((1 == t1_pc && 2 <= E_2) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && t2_pc <= 0) && 2 <= E_1) && !(E_M == 1))) || !(m_i == 1)) || (((((!(E_M == 0) && E_1 == 2) && !(E_M == 1)) && ((t2_pc == 0 && t2_st == 0) && t1_pc == 1) && t1_st == 2) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && \old(E_2) <= E_2)) || !(2 == M_E)) || ((((((((((E_M == 2 && m_st == 0) && m_pc == 0) && E_1 == 2) && t2_pc == 0) && t1_st == 0) && t2_st == 0) && token == 0) && local == 0) && E_2 == 2) && t1_pc == 0)) || !(1 == t1_i)) || ((((((((1 == t2_pc && !(1 == t1_pc)) && !(E_M == 0)) && 2 <= t2_st) && t1_st == 0) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2)) || ((((((((1 == t1_pc && 1 == t2_pc) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && (((((m_st == 0 && m_pc == 0) && token == 0) && local == 0) && tmp == 1) || ((m_pc == 1 && m_st == 2) && tmp == 1))) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2)) || ((((((((1 == t1_pc && token <= local + 1) && 1 == t2_pc) && 2 <= E_2) && local + 1 <= token) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && 2 <= t1_st) && 2 <= E_1) && !(E_M == 1))) || !(T2_E == 2)) || ((((((((((((((1 == t1_pc && 1 == t2_pc) && !(T2_E == 0)) && m_st == 0) && !(M_E == 0)) && !(E_M == 0)) && 2 <= t1_st) && 2 <= t2_st) && !(T1_E == 0)) && 2 <= E_2) && 1 == m_pc) && local + 2 <= token) && 2 <= E_1) && !(E_M == 1)) && token <= local + 2)) || !(2 == \old(E_M))) || ((((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(t2_st))) || !(0 == \old(local))) || !(0 == \old(t2_pc))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || (((((((2 <= t2_st && 1 == t1_pc) && 1 == t2_pc) && 2 <= E_2) && ((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && !(E_1 == 0)) && !(E_2 == 0)) && 2 <= t1_st) && 2 <= E_1) && !(E_M == 1))) || (((2 <= t2_st && (((((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t2_pc) && 2 <= E_2) && 2 <= E_1) && !(E_M == 1)) && token <= local) && local <= token)) || !(2 == \old(E_1))) || !(1 == t2_i)) || (((((((((((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t1_pc) && t2_pc <= 0) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2) && token <= local) && local <= token)) || ((((((2 <= t2_st && (((((!(T2_E == 0) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && t1_st == 0) && 1 == m_pc) && 1 == t2_pc) && !(1 == t1_pc)) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2))) && (((((((((((((\old(E_1) < 2 || T1_E == 0) || \old(t2_st) < 2) || (((((((1 == t1_pc && 1 == t2_pc) && \old(t2_st) <= t2_st) && (((((m_st == \old(m_st) && !(T2_E == 0)) && !(M_E == 0)) && m_st == 2) && !(E_M == 0)) && !(T1_E == 0)) && 1 == m_pc) && 2 <= E_1) && \old(t1_st) <= t1_st) && !(E_M == 1)) && \old(E_2) <= E_2)) || !(2 == \old(m_st))) || !(\old(t1_pc) == 1)) || T2_E == 0) || 0 == M_E) || 1 == \old(E_M)) || !(1 == \old(t2_pc))) || \old(t1_st) < 2) || !(1 == \old(m_pc))) || \old(E_2) < 2) || 0 == \old(E_M)) - InvariantResult [Line: 540]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 == \old(E_2)) || (((token <= local + 1 && ((((((1 == t1_pc && 1 == t2_pc) && 2 <= E_2) && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && m_st == 2) && 2 <= E_1) && !(E_M == 1)) && local + 1 <= token) && 2 <= t1_st)) || !(\old(T1_E) == 2)) || ((((2 <= t2_st && 2 <= t1_st) && local + 2 <= token) && ((((1 == t1_pc && 1 == t2_pc) && (m_st == 0 && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2) && token <= local + 2)) || !(1 == t1_i)) || ((((((((1 == t1_pc && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && m_st == 2) && t2_pc <= 0) && 2 <= E_1) && !(E_M == 1)) && \old(E_2) <= E_2) && 2 <= t1_st)) || ((2 <= t2_st && ((((((1 == t1_pc && 1 == t2_pc) && 2 <= E_2) && 1 == m_pc) && (!(E_M == 0) && (!(T1_E == 0) && !(T2_E == 0)) && !(M_E == 0)) && !(E_2 == 0)) && m_st == 2) && 2 <= E_1) && !(E_M == 1)) && 2 <= t1_st)) || !(\old(T2_E) == 2)) || (((((((((((((m_pc == 0 && E_1 == 2) && T1_E == 2) && m_st == \old(m_st)) && E_M == 2) && M_E == 2) && t2_pc == 0) && t1_st == 0) && T2_E == 2) && t2_st == 0) && token == 0) && local == 0) && E_2 == 2) && t1_pc == 0)) || !(2 == \old(E_M))) || ((((!(\old(token) == 0) || !(\old(t1_pc) == 0)) || !(0 == \old(m_st))) || !(0 == \old(local))) || !(0 == \old(m_pc))) || !(\old(t1_st) == 0)) || !(m_i == 1)) || !(0 == \old(t2_st))) || !(2 == \old(E_1))) || !(1 == t2_i)) || !(0 == \old(t2_pc))) || !(2 == \old(M_E)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 174 locations, 1 error locations. SAFE Result, 108.3s OverallTime, 30 OverallIterations, 4 TraceHistogramMax, 51.7s AutomataDifference, 0.0s DeadEndRemovalTime, 43.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 8478 SDtfs, 11113 SDslu, 36069 SDs, 0 SdLazy, 17991 SolverSat, 3498 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.9s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 6644 GetRequests, 5885 SyntacticMatches, 49 SemanticMatches, 710 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23571 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3800occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.7s AbstIntTime, 18 AbstIntIterations, 7 AbstIntStrong, 0.9908442588497224 AbsIntWeakeningRatio, 0.5985342019543974 AbsIntAvgWeakeningVarsNumRemoved, 14.430781758957655 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 30 MinimizatonAttempts, 1461 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 14419 PreInvPairs, 14762 NumberOfFragments, 25816 HoareAnnotationTreeSize, 14419 FomulaSimplifications, 254517 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 71 FomulaSimplificationsInter, 127320 FormulaSimplificationTreeSizeReductionInter, 41.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 7852 NumberOfCodeBlocks, 7852 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 10261 ConstructedInterpolants, 0 QuantifiedInterpolants, 2903538 SizeOfPredicates, 11 NumberOfNonLiveVariables, 10700 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 52 InterpolantComputations, 25 PerfectInterpolantSequences, 6039/6403 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...