./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/bist_cell_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_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb52621d262b2a79ebd79f9601fb8103d2f4f11e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 09:45:37,273 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 09:45:37,274 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 09:45:37,280 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 09:45:37,280 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 09:45:37,281 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 09:45:37,281 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 09:45:37,282 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 09:45:37,283 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 09:45:37,283 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 09:45:37,284 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 09:45:37,284 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 09:45:37,284 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 09:45:37,285 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 09:45:37,286 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 09:45:37,286 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 09:45:37,286 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 09:45:37,287 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 09:45:37,288 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 09:45:37,289 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 09:45:37,289 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 09:45:37,290 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 09:45:37,291 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 09:45:37,291 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 09:45:37,291 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 09:45:37,292 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 09:45:37,292 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 09:45:37,293 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 09:45:37,293 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 09:45:37,294 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 09:45:37,294 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 09:45:37,294 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 09:45:37,294 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 09:45:37,295 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 09:45:37,295 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 09:45:37,295 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 09:45:37,296 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 09:45:37,303 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 09:45:37,303 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 09:45:37,303 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 09:45:37,303 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 09:45:37,304 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 09:45:37,304 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 09:45:37,304 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 09:45:37,304 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 09:45:37,304 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 09:45:37,304 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 09:45:37,304 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 09:45:37,304 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 09:45:37,304 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 09:45:37,305 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 09:45:37,305 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 09:45:37,305 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 09:45:37,305 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 09:45:37,305 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 09:45:37,305 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 09:45:37,305 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 09:45:37,305 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 09:45:37,305 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 09:45:37,305 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 09:45:37,305 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 09:45:37,305 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 09:45:37,306 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 09:45:37,306 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 09:45:37,306 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 09:45:37,306 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 09:45:37,306 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 09:45:37,306 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb52621d262b2a79ebd79f9601fb8103d2f4f11e [2018-12-08 09:45:37,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 09:45:37,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 09:45:37,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 09:45:37,332 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 09:45:37,333 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 09:45:37,333 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c [2018-12-08 09:45:37,367 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/data/1af3435fe/422bfa376a36427db2c12cedd4d9b123/FLAG45c457ab7 [2018-12-08 09:45:37,828 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 09:45:37,828 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/sv-benchmarks/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c [2018-12-08 09:45:37,834 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/data/1af3435fe/422bfa376a36427db2c12cedd4d9b123/FLAG45c457ab7 [2018-12-08 09:45:37,843 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/data/1af3435fe/422bfa376a36427db2c12cedd4d9b123 [2018-12-08 09:45:37,845 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 09:45:37,846 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 09:45:37,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 09:45:37,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 09:45:37,849 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 09:45:37,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:45:37" (1/1) ... [2018-12-08 09:45:37,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22096c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:45:37, skipping insertion in model container [2018-12-08 09:45:37,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:45:37" (1/1) ... [2018-12-08 09:45:37,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 09:45:37,874 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 09:45:37,983 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:45:37,986 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 09:45:38,008 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:45:38,020 INFO L195 MainTranslator]: Completed translation [2018-12-08 09:45:38,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:45:38 WrapperNode [2018-12-08 09:45:38,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 09:45:38,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 09:45:38,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 09:45:38,021 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 09:45:38,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:45:38" (1/1) ... [2018-12-08 09:45:38,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:45:38" (1/1) ... [2018-12-08 09:45:38,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 09:45:38,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 09:45:38,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 09:45:38,036 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 09:45:38,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:45:38" (1/1) ... [2018-12-08 09:45:38,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:45:38" (1/1) ... [2018-12-08 09:45:38,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:45:38" (1/1) ... [2018-12-08 09:45:38,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:45:38" (1/1) ... [2018-12-08 09:45:38,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:45:38" (1/1) ... [2018-12-08 09:45:38,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:45:38" (1/1) ... [2018-12-08 09:45:38,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:45:38" (1/1) ... [2018-12-08 09:45:38,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 09:45:38,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 09:45:38,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 09:45:38,090 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 09:45:38,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:45:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 09:45:38,126 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-12-08 09:45:38,126 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-12-08 09:45:38,126 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-12-08 09:45:38,127 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-12-08 09:45:38,127 INFO L130 BoogieDeclarations]: Found specification of procedure method1 [2018-12-08 09:45:38,127 INFO L138 BoogieDeclarations]: Found implementation of procedure method1 [2018-12-08 09:45:38,127 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-12-08 09:45:38,127 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-12-08 09:45:38,127 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-12-08 09:45:38,127 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-12-08 09:45:38,127 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 09:45:38,127 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 09:45:38,128 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-12-08 09:45:38,128 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-12-08 09:45:38,128 INFO L130 BoogieDeclarations]: Found specification of procedure update_z [2018-12-08 09:45:38,128 INFO L138 BoogieDeclarations]: Found implementation of procedure update_z [2018-12-08 09:45:38,128 INFO L130 BoogieDeclarations]: Found specification of procedure update_d1 [2018-12-08 09:45:38,128 INFO L138 BoogieDeclarations]: Found implementation of procedure update_d1 [2018-12-08 09:45:38,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 09:45:38,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 09:45:38,128 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-12-08 09:45:38,129 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-12-08 09:45:38,129 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-12-08 09:45:38,129 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-12-08 09:45:38,129 INFO L130 BoogieDeclarations]: Found specification of procedure update_d0 [2018-12-08 09:45:38,129 INFO L138 BoogieDeclarations]: Found implementation of procedure update_d0 [2018-12-08 09:45:38,129 INFO L130 BoogieDeclarations]: Found specification of procedure update_b1 [2018-12-08 09:45:38,129 INFO L138 BoogieDeclarations]: Found implementation of procedure update_b1 [2018-12-08 09:45:38,129 INFO L130 BoogieDeclarations]: Found specification of procedure update_b0 [2018-12-08 09:45:38,129 INFO L138 BoogieDeclarations]: Found implementation of procedure update_b0 [2018-12-08 09:45:38,129 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-12-08 09:45:38,130 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-12-08 09:45:38,130 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-12-08 09:45:38,130 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-12-08 09:45:38,130 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-12-08 09:45:38,130 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-12-08 09:45:38,130 INFO L130 BoogieDeclarations]: Found specification of procedure is_method1_triggered [2018-12-08 09:45:38,130 INFO L138 BoogieDeclarations]: Found implementation of procedure is_method1_triggered [2018-12-08 09:45:38,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 09:45:38,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 09:45:38,130 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-12-08 09:45:38,130 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-12-08 09:45:38,363 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 09:45:38,363 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-08 09:45:38,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:45:38 BoogieIcfgContainer [2018-12-08 09:45:38,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 09:45:38,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 09:45:38,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 09:45:38,367 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 09:45:38,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 09:45:37" (1/3) ... [2018-12-08 09:45:38,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ae9fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 09:45:38, skipping insertion in model container [2018-12-08 09:45:38,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:45:38" (2/3) ... [2018-12-08 09:45:38,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ae9fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 09:45:38, skipping insertion in model container [2018-12-08 09:45:38,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:45:38" (3/3) ... [2018-12-08 09:45:38,369 INFO L112 eAbstractionObserver]: Analyzing ICFG bist_cell_true-unreach-call_false-termination.cil.c [2018-12-08 09:45:38,375 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 09:45:38,380 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 09:45:38,390 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 09:45:38,413 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 09:45:38,414 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 09:45:38,414 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 09:45:38,414 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 09:45:38,414 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 09:45:38,414 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 09:45:38,414 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 09:45:38,414 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 09:45:38,414 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 09:45:38,429 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-12-08 09:45:38,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 09:45:38,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:38,435 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] [2018-12-08 09:45:38,437 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:38,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:38,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1449059025, now seen corresponding path program 1 times [2018-12-08 09:45:38,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:38,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:38,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:38,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:38,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:38,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:38,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:45:38,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:45:38,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:45:38,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:45:38,639 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 4 states. [2018-12-08 09:45:38,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:38,744 INFO L93 Difference]: Finished difference Result 265 states and 367 transitions. [2018-12-08 09:45:38,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:45:38,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-08 09:45:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:38,752 INFO L225 Difference]: With dead ends: 265 [2018-12-08 09:45:38,752 INFO L226 Difference]: Without dead ends: 134 [2018-12-08 09:45:38,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-08 09:45:38,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-08 09:45:38,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-12-08 09:45:38,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-08 09:45:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 179 transitions. [2018-12-08 09:45:38,788 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 179 transitions. Word has length 58 [2018-12-08 09:45:38,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:38,789 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 179 transitions. [2018-12-08 09:45:38,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:45:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 179 transitions. [2018-12-08 09:45:38,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-08 09:45:38,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:38,792 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:45:38,792 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:38,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:38,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1447129993, now seen corresponding path program 1 times [2018-12-08 09:45:38,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:38,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:38,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:38,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:38,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:38,882 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-08 09:45:38,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:45:38,882 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:45:38,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:38,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:45:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-08 09:45:39,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:45:39,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-08 09:45:39,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 09:45:39,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 09:45:39,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:45:39,082 INFO L87 Difference]: Start difference. First operand 134 states and 179 transitions. Second operand 8 states. [2018-12-08 09:45:39,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:39,582 INFO L93 Difference]: Finished difference Result 429 states and 603 transitions. [2018-12-08 09:45:39,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 09:45:39,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 125 [2018-12-08 09:45:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:39,585 INFO L225 Difference]: With dead ends: 429 [2018-12-08 09:45:39,585 INFO L226 Difference]: Without dead ends: 313 [2018-12-08 09:45:39,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-08 09:45:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-12-08 09:45:39,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 293. [2018-12-08 09:45:39,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-12-08 09:45:39,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 402 transitions. [2018-12-08 09:45:39,609 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 402 transitions. Word has length 125 [2018-12-08 09:45:39,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:39,609 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 402 transitions. [2018-12-08 09:45:39,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 09:45:39,609 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 402 transitions. [2018-12-08 09:45:39,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 09:45:39,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:39,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:45:39,612 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:39,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:39,612 INFO L82 PathProgramCache]: Analyzing trace with hash -375876485, now seen corresponding path program 1 times [2018-12-08 09:45:39,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:39,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:39,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:39,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:39,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 09:45:39,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:45:39,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:45:39,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:39,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:45:39,788 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 09:45:39,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:45:39,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-08 09:45:39,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 09:45:39,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 09:45:39,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:45:39,803 INFO L87 Difference]: Start difference. First operand 293 states and 402 transitions. Second operand 8 states. [2018-12-08 09:45:40,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:40,501 INFO L93 Difference]: Finished difference Result 1253 states and 1967 transitions. [2018-12-08 09:45:40,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 09:45:40,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-12-08 09:45:40,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:40,509 INFO L225 Difference]: With dead ends: 1253 [2018-12-08 09:45:40,509 INFO L226 Difference]: Without dead ends: 983 [2018-12-08 09:45:40,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-12-08 09:45:40,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2018-12-08 09:45:40,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 809. [2018-12-08 09:45:40,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-12-08 09:45:40,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1125 transitions. [2018-12-08 09:45:40,578 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1125 transitions. Word has length 127 [2018-12-08 09:45:40,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:40,578 INFO L480 AbstractCegarLoop]: Abstraction has 809 states and 1125 transitions. [2018-12-08 09:45:40,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 09:45:40,578 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1125 transitions. [2018-12-08 09:45:40,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-08 09:45:40,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:40,583 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:45:40,583 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:40,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:40,583 INFO L82 PathProgramCache]: Analyzing trace with hash 819663487, now seen corresponding path program 1 times [2018-12-08 09:45:40,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:40,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:40,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:40,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:40,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 09:45:40,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:45:40,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:45:40,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:40,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:45:40,776 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-08 09:45:40,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:45:40,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-12-08 09:45:40,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 09:45:40,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 09:45:40,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 09:45:40,802 INFO L87 Difference]: Start difference. First operand 809 states and 1125 transitions. Second operand 9 states. [2018-12-08 09:45:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:41,771 INFO L93 Difference]: Finished difference Result 3001 states and 4899 transitions. [2018-12-08 09:45:41,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-08 09:45:41,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2018-12-08 09:45:41,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:41,779 INFO L225 Difference]: With dead ends: 3001 [2018-12-08 09:45:41,780 INFO L226 Difference]: Without dead ends: 2245 [2018-12-08 09:45:41,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2018-12-08 09:45:41,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2018-12-08 09:45:41,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 1929. [2018-12-08 09:45:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1929 states. [2018-12-08 09:45:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2749 transitions. [2018-12-08 09:45:41,859 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2749 transitions. Word has length 127 [2018-12-08 09:45:41,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:41,860 INFO L480 AbstractCegarLoop]: Abstraction has 1929 states and 2749 transitions. [2018-12-08 09:45:41,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 09:45:41,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2749 transitions. [2018-12-08 09:45:41,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-08 09:45:41,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:41,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:45:41,864 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:41,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:41,865 INFO L82 PathProgramCache]: Analyzing trace with hash -928735401, now seen corresponding path program 1 times [2018-12-08 09:45:41,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:41,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:41,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:41,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:41,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:41,921 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 09:45:41,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:45:41,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/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-08 09:45:41,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:41,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:45:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 09:45:42,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:45:42,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-12-08 09:45:42,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 09:45:42,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 09:45:42,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-08 09:45:42,042 INFO L87 Difference]: Start difference. First operand 1929 states and 2749 transitions. Second operand 10 states. [2018-12-08 09:45:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:42,794 INFO L93 Difference]: Finished difference Result 6909 states and 11054 transitions. [2018-12-08 09:45:42,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 09:45:42,794 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2018-12-08 09:45:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:42,816 INFO L225 Difference]: With dead ends: 6909 [2018-12-08 09:45:42,816 INFO L226 Difference]: Without dead ends: 5073 [2018-12-08 09:45:42,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-12-08 09:45:42,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5073 states. [2018-12-08 09:45:42,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5073 to 4571. [2018-12-08 09:45:42,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4571 states. [2018-12-08 09:45:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4571 states to 4571 states and 6649 transitions. [2018-12-08 09:45:43,003 INFO L78 Accepts]: Start accepts. Automaton has 4571 states and 6649 transitions. Word has length 129 [2018-12-08 09:45:43,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:43,004 INFO L480 AbstractCegarLoop]: Abstraction has 4571 states and 6649 transitions. [2018-12-08 09:45:43,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 09:45:43,004 INFO L276 IsEmpty]: Start isEmpty. Operand 4571 states and 6649 transitions. [2018-12-08 09:45:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-08 09:45:43,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:43,013 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-08 09:45:43,013 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:43,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:43,013 INFO L82 PathProgramCache]: Analyzing trace with hash -536671115, now seen corresponding path program 1 times [2018-12-08 09:45:43,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:43,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:43,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:43,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:43,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:43,056 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 09:45:43,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:45:43,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/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-08 09:45:43,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:43,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:45:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 09:45:43,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:45:43,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-12-08 09:45:43,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 09:45:43,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 09:45:43,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-08 09:45:43,194 INFO L87 Difference]: Start difference. First operand 4571 states and 6649 transitions. Second operand 10 states. [2018-12-08 09:45:44,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:44,065 INFO L93 Difference]: Finished difference Result 13745 states and 20964 transitions. [2018-12-08 09:45:44,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 09:45:44,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2018-12-08 09:45:44,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:44,101 INFO L225 Difference]: With dead ends: 13745 [2018-12-08 09:45:44,101 INFO L226 Difference]: Without dead ends: 9379 [2018-12-08 09:45:44,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-12-08 09:45:44,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9379 states. [2018-12-08 09:45:44,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9379 to 9123. [2018-12-08 09:45:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9123 states. [2018-12-08 09:45:44,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9123 states to 9123 states and 12940 transitions. [2018-12-08 09:45:44,491 INFO L78 Accepts]: Start accepts. Automaton has 9123 states and 12940 transitions. Word has length 131 [2018-12-08 09:45:44,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:44,492 INFO L480 AbstractCegarLoop]: Abstraction has 9123 states and 12940 transitions. [2018-12-08 09:45:44,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 09:45:44,492 INFO L276 IsEmpty]: Start isEmpty. Operand 9123 states and 12940 transitions. [2018-12-08 09:45:44,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-08 09:45:44,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:44,509 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:45:44,510 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:44,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:44,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2058913133, now seen corresponding path program 1 times [2018-12-08 09:45:44,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:44,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:44,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:44,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:44,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:44,557 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-08 09:45:44,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:45:44,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/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-08 09:45:44,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:44,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:45:44,651 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:45:44,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 09:45:44,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-12-08 09:45:44,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 09:45:44,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 09:45:44,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-08 09:45:44,676 INFO L87 Difference]: Start difference. First operand 9123 states and 12940 transitions. Second operand 10 states. [2018-12-08 09:45:44,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:44,982 INFO L93 Difference]: Finished difference Result 18593 states and 26234 transitions. [2018-12-08 09:45:44,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 09:45:44,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2018-12-08 09:45:44,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:45,007 INFO L225 Difference]: With dead ends: 18593 [2018-12-08 09:45:45,008 INFO L226 Difference]: Without dead ends: 9755 [2018-12-08 09:45:45,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-12-08 09:45:45,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9755 states. [2018-12-08 09:45:45,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9755 to 9403. [2018-12-08 09:45:45,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9403 states. [2018-12-08 09:45:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9403 states to 9403 states and 13244 transitions. [2018-12-08 09:45:45,361 INFO L78 Accepts]: Start accepts. Automaton has 9403 states and 13244 transitions. Word has length 131 [2018-12-08 09:45:45,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:45,361 INFO L480 AbstractCegarLoop]: Abstraction has 9403 states and 13244 transitions. [2018-12-08 09:45:45,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 09:45:45,361 INFO L276 IsEmpty]: Start isEmpty. Operand 9403 states and 13244 transitions. [2018-12-08 09:45:45,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-08 09:45:45,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:45,379 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:45:45,380 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:45,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:45,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1681610611, now seen corresponding path program 1 times [2018-12-08 09:45:45,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:45,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:45,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:45,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:45,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-08 09:45:45,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:45:45,435 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/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-08 09:45:45,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:45,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:45:45,538 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 09:45:45,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 09:45:45,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-12-08 09:45:45,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:45:45,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:45:45,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:45:45,565 INFO L87 Difference]: Start difference. First operand 9403 states and 13244 transitions. Second operand 7 states. [2018-12-08 09:45:46,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:46,294 INFO L93 Difference]: Finished difference Result 21478 states and 31422 transitions. [2018-12-08 09:45:46,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 09:45:46,294 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2018-12-08 09:45:46,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:46,328 INFO L225 Difference]: With dead ends: 21478 [2018-12-08 09:45:46,328 INFO L226 Difference]: Without dead ends: 12392 [2018-12-08 09:45:46,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-08 09:45:46,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12392 states. [2018-12-08 09:45:46,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12392 to 11768. [2018-12-08 09:45:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11768 states. [2018-12-08 09:45:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11768 states to 11768 states and 16242 transitions. [2018-12-08 09:45:46,868 INFO L78 Accepts]: Start accepts. Automaton has 11768 states and 16242 transitions. Word has length 131 [2018-12-08 09:45:46,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:46,869 INFO L480 AbstractCegarLoop]: Abstraction has 11768 states and 16242 transitions. [2018-12-08 09:45:46,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:45:46,869 INFO L276 IsEmpty]: Start isEmpty. Operand 11768 states and 16242 transitions. [2018-12-08 09:45:46,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-08 09:45:46,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:46,885 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:45:46,885 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:46,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:46,885 INFO L82 PathProgramCache]: Analyzing trace with hash 660542257, now seen corresponding path program 1 times [2018-12-08 09:45:46,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:46,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:46,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:46,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:46,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:46,937 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-08 09:45:46,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:45:46,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:45:46,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:45:46,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:45:46,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:45:46,938 INFO L87 Difference]: Start difference. First operand 11768 states and 16242 transitions. Second operand 6 states. [2018-12-08 09:45:47,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:47,243 INFO L93 Difference]: Finished difference Result 22908 states and 31054 transitions. [2018-12-08 09:45:47,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:45:47,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-12-08 09:45:47,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:47,268 INFO L225 Difference]: With dead ends: 22908 [2018-12-08 09:45:47,268 INFO L226 Difference]: Without dead ends: 11864 [2018-12-08 09:45:47,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:45:47,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11864 states. [2018-12-08 09:45:47,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11864 to 11768. [2018-12-08 09:45:47,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11768 states. [2018-12-08 09:45:47,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11768 states to 11768 states and 16210 transitions. [2018-12-08 09:45:47,711 INFO L78 Accepts]: Start accepts. Automaton has 11768 states and 16210 transitions. Word has length 131 [2018-12-08 09:45:47,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:47,711 INFO L480 AbstractCegarLoop]: Abstraction has 11768 states and 16210 transitions. [2018-12-08 09:45:47,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:45:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 11768 states and 16210 transitions. [2018-12-08 09:45:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-08 09:45:47,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:47,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:45:47,724 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:47,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:47,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1361606835, now seen corresponding path program 1 times [2018-12-08 09:45:47,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:47,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:47,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:47,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:47,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-08 09:45:47,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:45:47,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/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-08 09:45:47,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:47,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:45:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-08 09:45:47,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:45:47,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-12-08 09:45:47,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 09:45:47,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 09:45:47,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-08 09:45:47,906 INFO L87 Difference]: Start difference. First operand 11768 states and 16210 transitions. Second operand 9 states. [2018-12-08 09:45:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:48,700 INFO L93 Difference]: Finished difference Result 27480 states and 37877 transitions. [2018-12-08 09:45:48,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 09:45:48,700 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2018-12-08 09:45:48,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:48,736 INFO L225 Difference]: With dead ends: 27480 [2018-12-08 09:45:48,736 INFO L226 Difference]: Without dead ends: 16010 [2018-12-08 09:45:48,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2018-12-08 09:45:48,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16010 states. [2018-12-08 09:45:49,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16010 to 12605. [2018-12-08 09:45:49,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12605 states. [2018-12-08 09:45:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12605 states to 12605 states and 17404 transitions. [2018-12-08 09:45:49,285 INFO L78 Accepts]: Start accepts. Automaton has 12605 states and 17404 transitions. Word has length 131 [2018-12-08 09:45:49,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:49,285 INFO L480 AbstractCegarLoop]: Abstraction has 12605 states and 17404 transitions. [2018-12-08 09:45:49,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 09:45:49,285 INFO L276 IsEmpty]: Start isEmpty. Operand 12605 states and 17404 transitions. [2018-12-08 09:45:49,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-08 09:45:49,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:49,300 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:45:49,301 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:49,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:49,301 INFO L82 PathProgramCache]: Analyzing trace with hash 602442252, now seen corresponding path program 1 times [2018-12-08 09:45:49,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:49,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:49,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:49,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:49,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-08 09:45:49,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:45:49,367 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/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-08 09:45:49,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:49,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:45:49,516 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-08 09:45:49,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:45:49,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-12-08 09:45:49,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 09:45:49,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 09:45:49,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-08 09:45:49,533 INFO L87 Difference]: Start difference. First operand 12605 states and 17404 transitions. Second operand 10 states. [2018-12-08 09:45:50,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:50,837 INFO L93 Difference]: Finished difference Result 34512 states and 47809 transitions. [2018-12-08 09:45:50,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:45:50,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2018-12-08 09:45:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:50,885 INFO L225 Difference]: With dead ends: 34512 [2018-12-08 09:45:50,885 INFO L226 Difference]: Without dead ends: 22355 [2018-12-08 09:45:50,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-08 09:45:50,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22355 states. [2018-12-08 09:45:51,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22355 to 20939. [2018-12-08 09:45:51,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20939 states. [2018-12-08 09:45:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20939 states to 20939 states and 28608 transitions. [2018-12-08 09:45:51,620 INFO L78 Accepts]: Start accepts. Automaton has 20939 states and 28608 transitions. Word has length 140 [2018-12-08 09:45:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:51,620 INFO L480 AbstractCegarLoop]: Abstraction has 20939 states and 28608 transitions. [2018-12-08 09:45:51,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 09:45:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 20939 states and 28608 transitions. [2018-12-08 09:45:51,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-08 09:45:51,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:51,642 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:45:51,642 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:51,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:51,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1970522358, now seen corresponding path program 1 times [2018-12-08 09:45:51,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:51,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:51,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:51,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:51,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:51,727 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 09:45:51,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:45:51,727 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/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-08 09:45:51,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:51,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:45:51,831 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 09:45:51,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 09:45:51,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2018-12-08 09:45:51,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-08 09:45:51,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-08 09:45:51,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-12-08 09:45:51,848 INFO L87 Difference]: Start difference. First operand 20939 states and 28608 transitions. Second operand 18 states. [2018-12-08 09:45:53,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:53,674 INFO L93 Difference]: Finished difference Result 43716 states and 62996 transitions. [2018-12-08 09:45:53,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-08 09:45:53,674 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 140 [2018-12-08 09:45:53,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:53,729 INFO L225 Difference]: With dead ends: 43716 [2018-12-08 09:45:53,730 INFO L226 Difference]: Without dead ends: 23181 [2018-12-08 09:45:53,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2018-12-08 09:45:53,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23181 states. [2018-12-08 09:45:54,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23181 to 19969. [2018-12-08 09:45:54,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19969 states. [2018-12-08 09:45:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19969 states to 19969 states and 27198 transitions. [2018-12-08 09:45:54,589 INFO L78 Accepts]: Start accepts. Automaton has 19969 states and 27198 transitions. Word has length 140 [2018-12-08 09:45:54,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:54,589 INFO L480 AbstractCegarLoop]: Abstraction has 19969 states and 27198 transitions. [2018-12-08 09:45:54,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-08 09:45:54,589 INFO L276 IsEmpty]: Start isEmpty. Operand 19969 states and 27198 transitions. [2018-12-08 09:45:54,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-08 09:45:54,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:54,607 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:45:54,607 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:54,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:54,608 INFO L82 PathProgramCache]: Analyzing trace with hash 2053428502, now seen corresponding path program 1 times [2018-12-08 09:45:54,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:54,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:54,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:54,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:54,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-08 09:45:54,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:45:54,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/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-08 09:45:54,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:54,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:45:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-08 09:45:54,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:45:54,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-12-08 09:45:54,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 09:45:54,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 09:45:54,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-08 09:45:54,812 INFO L87 Difference]: Start difference. First operand 19969 states and 27198 transitions. Second operand 11 states. [2018-12-08 09:45:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:55,808 INFO L93 Difference]: Finished difference Result 35999 states and 49733 transitions. [2018-12-08 09:45:55,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 09:45:55,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 141 [2018-12-08 09:45:55,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:55,836 INFO L225 Difference]: With dead ends: 35999 [2018-12-08 09:45:55,837 INFO L226 Difference]: Without dead ends: 16260 [2018-12-08 09:45:55,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2018-12-08 09:45:55,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16260 states. [2018-12-08 09:45:56,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16260 to 15806. [2018-12-08 09:45:56,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15806 states. [2018-12-08 09:45:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15806 states to 15806 states and 20555 transitions. [2018-12-08 09:45:56,597 INFO L78 Accepts]: Start accepts. Automaton has 15806 states and 20555 transitions. Word has length 141 [2018-12-08 09:45:56,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:56,597 INFO L480 AbstractCegarLoop]: Abstraction has 15806 states and 20555 transitions. [2018-12-08 09:45:56,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 09:45:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 15806 states and 20555 transitions. [2018-12-08 09:45:56,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 09:45:56,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:56,609 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:45:56,609 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:56,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:56,609 INFO L82 PathProgramCache]: Analyzing trace with hash 684967753, now seen corresponding path program 1 times [2018-12-08 09:45:56,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:56,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:56,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:56,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:56,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-08 09:45:56,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:45:56,651 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:45:56,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:56,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:45:56,730 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 09:45:56,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 09:45:56,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-12-08 09:45:56,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:45:56,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:45:56,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:45:56,746 INFO L87 Difference]: Start difference. First operand 15806 states and 20555 transitions. Second operand 4 states. [2018-12-08 09:45:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:57,384 INFO L93 Difference]: Finished difference Result 30758 states and 40353 transitions. [2018-12-08 09:45:57,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 09:45:57,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-12-08 09:45:57,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:57,409 INFO L225 Difference]: With dead ends: 30758 [2018-12-08 09:45:57,409 INFO L226 Difference]: Without dead ends: 15448 [2018-12-08 09:45:57,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 147 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-08 09:45:57,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15448 states. [2018-12-08 09:45:58,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15448 to 15448. [2018-12-08 09:45:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15448 states. [2018-12-08 09:45:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15448 states to 15448 states and 19823 transitions. [2018-12-08 09:45:58,028 INFO L78 Accepts]: Start accepts. Automaton has 15448 states and 19823 transitions. Word has length 146 [2018-12-08 09:45:58,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:58,029 INFO L480 AbstractCegarLoop]: Abstraction has 15448 states and 19823 transitions. [2018-12-08 09:45:58,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:45:58,029 INFO L276 IsEmpty]: Start isEmpty. Operand 15448 states and 19823 transitions. [2018-12-08 09:45:58,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-08 09:45:58,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:58,040 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:45:58,040 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:58,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:58,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1924800119, now seen corresponding path program 1 times [2018-12-08 09:45:58,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:58,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:58,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:58,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:58,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-08 09:45:58,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:45:58,163 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:45:58,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:58,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:45:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-08 09:45:58,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:45:58,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-12-08 09:45:58,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 09:45:58,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 09:45:58,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-08 09:45:58,265 INFO L87 Difference]: Start difference. First operand 15448 states and 19823 transitions. Second operand 11 states. [2018-12-08 09:45:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:45:59,159 INFO L93 Difference]: Finished difference Result 28479 states and 36942 transitions. [2018-12-08 09:45:59,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 09:45:59,160 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 146 [2018-12-08 09:45:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:45:59,180 INFO L225 Difference]: With dead ends: 28479 [2018-12-08 09:45:59,181 INFO L226 Difference]: Without dead ends: 13634 [2018-12-08 09:45:59,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2018-12-08 09:45:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13634 states. [2018-12-08 09:45:59,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13634 to 13362. [2018-12-08 09:45:59,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13362 states. [2018-12-08 09:45:59,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13362 states to 13362 states and 16664 transitions. [2018-12-08 09:45:59,756 INFO L78 Accepts]: Start accepts. Automaton has 13362 states and 16664 transitions. Word has length 146 [2018-12-08 09:45:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:45:59,756 INFO L480 AbstractCegarLoop]: Abstraction has 13362 states and 16664 transitions. [2018-12-08 09:45:59,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 09:45:59,756 INFO L276 IsEmpty]: Start isEmpty. Operand 13362 states and 16664 transitions. [2018-12-08 09:45:59,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-08 09:45:59,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:45:59,765 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:45:59,765 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:45:59,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:45:59,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1441746548, now seen corresponding path program 1 times [2018-12-08 09:45:59,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:45:59,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:45:59,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:59,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:59,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:45:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:59,797 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 09:45:59,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:45:59,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:45:59,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:45:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:45:59,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:45:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 09:45:59,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 09:45:59,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-12-08 09:45:59,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:45:59,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:45:59,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:45:59,910 INFO L87 Difference]: Start difference. First operand 13362 states and 16664 transitions. Second operand 4 states. [2018-12-08 09:46:00,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:46:00,570 INFO L93 Difference]: Finished difference Result 24820 states and 31263 transitions. [2018-12-08 09:46:00,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 09:46:00,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-12-08 09:46:00,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:46:00,600 INFO L225 Difference]: With dead ends: 24820 [2018-12-08 09:46:00,600 INFO L226 Difference]: Without dead ends: 12362 [2018-12-08 09:46:00,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 152 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-08 09:46:00,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12362 states. [2018-12-08 09:46:01,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12362 to 12362. [2018-12-08 09:46:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12362 states. [2018-12-08 09:46:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12362 states to 12362 states and 15136 transitions. [2018-12-08 09:46:01,173 INFO L78 Accepts]: Start accepts. Automaton has 12362 states and 15136 transitions. Word has length 151 [2018-12-08 09:46:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:46:01,173 INFO L480 AbstractCegarLoop]: Abstraction has 12362 states and 15136 transitions. [2018-12-08 09:46:01,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:46:01,173 INFO L276 IsEmpty]: Start isEmpty. Operand 12362 states and 15136 transitions. [2018-12-08 09:46:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-08 09:46:01,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:46:01,182 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:46:01,182 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:46:01,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:46:01,182 INFO L82 PathProgramCache]: Analyzing trace with hash 2143321140, now seen corresponding path program 1 times [2018-12-08 09:46:01,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:46:01,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:46:01,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:46:01,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:46:01,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:46:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:46:01,238 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-08 09:46:01,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:46:01,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:46:01,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:46:01,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:46:01,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:46:01,239 INFO L87 Difference]: Start difference. First operand 12362 states and 15136 transitions. Second operand 5 states. [2018-12-08 09:46:02,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:46:02,987 INFO L93 Difference]: Finished difference Result 42715 states and 52598 transitions. [2018-12-08 09:46:02,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:46:02,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2018-12-08 09:46:02,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:46:03,041 INFO L225 Difference]: With dead ends: 42715 [2018-12-08 09:46:03,042 INFO L226 Difference]: Without dead ends: 32489 [2018-12-08 09:46:03,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-08 09:46:03,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32489 states. [2018-12-08 09:46:04,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32489 to 32483. [2018-12-08 09:46:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32483 states. [2018-12-08 09:46:04,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32483 states to 32483 states and 39667 transitions. [2018-12-08 09:46:04,532 INFO L78 Accepts]: Start accepts. Automaton has 32483 states and 39667 transitions. Word has length 151 [2018-12-08 09:46:04,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:46:04,533 INFO L480 AbstractCegarLoop]: Abstraction has 32483 states and 39667 transitions. [2018-12-08 09:46:04,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:46:04,533 INFO L276 IsEmpty]: Start isEmpty. Operand 32483 states and 39667 transitions. [2018-12-08 09:46:04,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-08 09:46:04,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:46:04,552 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:46:04,552 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:46:04,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:46:04,553 INFO L82 PathProgramCache]: Analyzing trace with hash -91788150, now seen corresponding path program 1 times [2018-12-08 09:46:04,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:46:04,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:46:04,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:46:04,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:46:04,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:46:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:46:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-08 09:46:04,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:46:04,603 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:46:04,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:46:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:46:04,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:46:04,707 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-08 09:46:04,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:46:04,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-08 09:46:04,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 09:46:04,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 09:46:04,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:46:04,723 INFO L87 Difference]: Start difference. First operand 32483 states and 39667 transitions. Second operand 8 states. [2018-12-08 09:46:07,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:46:07,872 INFO L93 Difference]: Finished difference Result 94322 states and 117314 transitions. [2018-12-08 09:46:07,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 09:46:07,873 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 156 [2018-12-08 09:46:07,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:46:07,981 INFO L225 Difference]: With dead ends: 94322 [2018-12-08 09:46:07,982 INFO L226 Difference]: Without dead ends: 61971 [2018-12-08 09:46:08,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-08 09:46:08,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61971 states. [2018-12-08 09:46:10,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61971 to 53451. [2018-12-08 09:46:10,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53451 states. [2018-12-08 09:46:10,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53451 states to 53451 states and 63425 transitions. [2018-12-08 09:46:10,646 INFO L78 Accepts]: Start accepts. Automaton has 53451 states and 63425 transitions. Word has length 156 [2018-12-08 09:46:10,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:46:10,646 INFO L480 AbstractCegarLoop]: Abstraction has 53451 states and 63425 transitions. [2018-12-08 09:46:10,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 09:46:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand 53451 states and 63425 transitions. [2018-12-08 09:46:10,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 09:46:10,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:46:10,663 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:46:10,663 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:46:10,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:46:10,663 INFO L82 PathProgramCache]: Analyzing trace with hash -450674886, now seen corresponding path program 1 times [2018-12-08 09:46:10,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:46:10,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:46:10,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:46:10,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:46:10,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:46:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:46:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-08 09:46:10,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:46:10,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:46:10,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:46:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:46:10,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:46:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 09:46:10,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 09:46:10,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-12-08 09:46:10,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:46:10,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:46:10,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:46:10,804 INFO L87 Difference]: Start difference. First operand 53451 states and 63425 transitions. Second operand 6 states. [2018-12-08 09:46:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:46:13,651 INFO L93 Difference]: Finished difference Result 106813 states and 127696 transitions. [2018-12-08 09:46:13,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:46:13,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 174 [2018-12-08 09:46:13,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:46:13,748 INFO L225 Difference]: With dead ends: 106813 [2018-12-08 09:46:13,748 INFO L226 Difference]: Without dead ends: 54157 [2018-12-08 09:46:13,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:46:13,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54157 states. [2018-12-08 09:46:16,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54157 to 40111. [2018-12-08 09:46:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40111 states. [2018-12-08 09:46:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40111 states to 40111 states and 47549 transitions. [2018-12-08 09:46:16,108 INFO L78 Accepts]: Start accepts. Automaton has 40111 states and 47549 transitions. Word has length 174 [2018-12-08 09:46:16,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:46:16,108 INFO L480 AbstractCegarLoop]: Abstraction has 40111 states and 47549 transitions. [2018-12-08 09:46:16,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:46:16,108 INFO L276 IsEmpty]: Start isEmpty. Operand 40111 states and 47549 transitions. [2018-12-08 09:46:16,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-08 09:46:16,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:46:16,120 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:46:16,120 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:46:16,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:46:16,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1412757603, now seen corresponding path program 1 times [2018-12-08 09:46:16,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:46:16,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:46:16,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:46:16,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:46:16,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:46:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:46:16,160 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-08 09:46:16,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:46:16,160 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:46:16,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:46:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:46:16,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:46:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 09:46:16,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 09:46:16,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-12-08 09:46:16,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:46:16,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:46:16,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:46:16,253 INFO L87 Difference]: Start difference. First operand 40111 states and 47549 transitions. Second operand 7 states. [2018-12-08 09:46:17,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:46:17,543 INFO L93 Difference]: Finished difference Result 60409 states and 71923 transitions. [2018-12-08 09:46:17,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:46:17,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 174 [2018-12-08 09:46:17,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:46:17,578 INFO L225 Difference]: With dead ends: 60409 [2018-12-08 09:46:17,578 INFO L226 Difference]: Without dead ends: 20954 [2018-12-08 09:46:17,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-08 09:46:17,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20954 states. [2018-12-08 09:46:19,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20954 to 20780. [2018-12-08 09:46:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20780 states. [2018-12-08 09:46:19,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20780 states to 20780 states and 24468 transitions. [2018-12-08 09:46:19,364 INFO L78 Accepts]: Start accepts. Automaton has 20780 states and 24468 transitions. Word has length 174 [2018-12-08 09:46:19,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:46:19,364 INFO L480 AbstractCegarLoop]: Abstraction has 20780 states and 24468 transitions. [2018-12-08 09:46:19,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:46:19,364 INFO L276 IsEmpty]: Start isEmpty. Operand 20780 states and 24468 transitions. [2018-12-08 09:46:19,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-08 09:46:19,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:46:19,371 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:46:19,371 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:46:19,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:46:19,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1491892827, now seen corresponding path program 1 times [2018-12-08 09:46:19,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:46:19,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:46:19,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:46:19,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:46:19,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:46:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:46:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-08 09:46:19,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:46:19,464 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:46:19,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:46:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:46:19,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:46:19,550 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 09:46:19,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 09:46:19,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2018-12-08 09:46:19,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 09:46:19,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 09:46:19,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-08 09:46:19,575 INFO L87 Difference]: Start difference. First operand 20780 states and 24468 transitions. Second operand 12 states. [2018-12-08 09:46:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:46:21,255 INFO L93 Difference]: Finished difference Result 38969 states and 46566 transitions. [2018-12-08 09:46:21,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 09:46:21,256 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 175 [2018-12-08 09:46:21,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:46:21,285 INFO L225 Difference]: With dead ends: 38969 [2018-12-08 09:46:21,285 INFO L226 Difference]: Without dead ends: 18638 [2018-12-08 09:46:21,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2018-12-08 09:46:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18638 states. [2018-12-08 09:46:22,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18638 to 11137. [2018-12-08 09:46:22,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11137 states. [2018-12-08 09:46:22,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11137 states to 11137 states and 12634 transitions. [2018-12-08 09:46:22,171 INFO L78 Accepts]: Start accepts. Automaton has 11137 states and 12634 transitions. Word has length 175 [2018-12-08 09:46:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:46:22,171 INFO L480 AbstractCegarLoop]: Abstraction has 11137 states and 12634 transitions. [2018-12-08 09:46:22,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 09:46:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 11137 states and 12634 transitions. [2018-12-08 09:46:22,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-08 09:46:22,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:46:22,175 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:46:22,175 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:46:22,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:46:22,175 INFO L82 PathProgramCache]: Analyzing trace with hash -599778512, now seen corresponding path program 1 times [2018-12-08 09:46:22,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:46:22,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:46:22,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:46:22,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:46:22,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:46:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:46:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-08 09:46:22,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:46:22,209 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:46:22,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:46:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:46:22,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:46:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 09:46:22,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 09:46:22,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-12-08 09:46:22,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 09:46:22,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 09:46:22,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:46:22,339 INFO L87 Difference]: Start difference. First operand 11137 states and 12634 transitions. Second operand 8 states. [2018-12-08 09:46:22,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:46:22,980 INFO L93 Difference]: Finished difference Result 17599 states and 19975 transitions. [2018-12-08 09:46:22,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:46:22,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 176 [2018-12-08 09:46:22,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:46:22,989 INFO L225 Difference]: With dead ends: 17599 [2018-12-08 09:46:22,989 INFO L226 Difference]: Without dead ends: 6901 [2018-12-08 09:46:22,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-08 09:46:23,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6901 states. [2018-12-08 09:46:23,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6901 to 6258. [2018-12-08 09:46:23,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6258 states. [2018-12-08 09:46:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6258 states to 6258 states and 6989 transitions. [2018-12-08 09:46:23,495 INFO L78 Accepts]: Start accepts. Automaton has 6258 states and 6989 transitions. Word has length 176 [2018-12-08 09:46:23,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:46:23,495 INFO L480 AbstractCegarLoop]: Abstraction has 6258 states and 6989 transitions. [2018-12-08 09:46:23,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 09:46:23,495 INFO L276 IsEmpty]: Start isEmpty. Operand 6258 states and 6989 transitions. [2018-12-08 09:46:23,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-08 09:46:23,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:46:23,498 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:46:23,498 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:46:23,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:46:23,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1061132729, now seen corresponding path program 1 times [2018-12-08 09:46:23,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:46:23,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:46:23,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:46:23,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:46:23,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:46:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:46:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-08 09:46:23,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:46:23,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:46:23,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:46:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:46:23,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:46:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:46:23,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:46:23,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-08 09:46:23,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 09:46:23,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 09:46:23,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:46:23,662 INFO L87 Difference]: Start difference. First operand 6258 states and 6989 transitions. Second operand 8 states. [2018-12-08 09:46:25,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:46:25,167 INFO L93 Difference]: Finished difference Result 18802 states and 21448 transitions. [2018-12-08 09:46:25,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 09:46:25,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 177 [2018-12-08 09:46:25,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:46:25,187 INFO L225 Difference]: With dead ends: 18802 [2018-12-08 09:46:25,187 INFO L226 Difference]: Without dead ends: 14494 [2018-12-08 09:46:25,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-12-08 09:46:25,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14494 states. [2018-12-08 09:46:25,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14494 to 8604. [2018-12-08 09:46:25,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8604 states. [2018-12-08 09:46:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8604 states to 8604 states and 9633 transitions. [2018-12-08 09:46:26,005 INFO L78 Accepts]: Start accepts. Automaton has 8604 states and 9633 transitions. Word has length 177 [2018-12-08 09:46:26,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:46:26,005 INFO L480 AbstractCegarLoop]: Abstraction has 8604 states and 9633 transitions. [2018-12-08 09:46:26,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 09:46:26,006 INFO L276 IsEmpty]: Start isEmpty. Operand 8604 states and 9633 transitions. [2018-12-08 09:46:26,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-08 09:46:26,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:46:26,008 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:46:26,008 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:46:26,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:46:26,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1306155177, now seen corresponding path program 1 times [2018-12-08 09:46:26,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:46:26,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:46:26,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:46:26,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:46:26,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:46:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:46:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-08 09:46:26,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:46:26,047 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:46:26,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:46:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:46:26,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:46:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 09:46:26,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 09:46:26,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-12-08 09:46:26,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 09:46:26,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 09:46:26,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:46:26,137 INFO L87 Difference]: Start difference. First operand 8604 states and 9633 transitions. Second operand 8 states. [2018-12-08 09:46:26,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:46:26,343 INFO L93 Difference]: Finished difference Result 10041 states and 11178 transitions. [2018-12-08 09:46:26,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:46:26,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2018-12-08 09:46:26,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:46:26,345 INFO L225 Difference]: With dead ends: 10041 [2018-12-08 09:46:26,345 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 09:46:26,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-08 09:46:26,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 09:46:26,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 09:46:26,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 09:46:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 09:46:26,354 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2018-12-08 09:46:26,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:46:26,354 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:46:26,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 09:46:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 09:46:26,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 09:46:26,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 09:46:26,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,711 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 394 DAG size of output: 288 [2018-12-08 09:46:26,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:26,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,075 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 374 DAG size of output: 310 [2018-12-08 09:46:27,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,461 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 326 DAG size of output: 244 [2018-12-08 09:46:27,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:27,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:28,048 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 393 DAG size of output: 325 [2018-12-08 09:46:28,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:28,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:28,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:28,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:28,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:28,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:28,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:28,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:28,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:28,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:28,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:28,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:28,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:28,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:28,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:28,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:28,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:28,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:28,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:29,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:29,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:29,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:29,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:29,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:29,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:29,181 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 393 DAG size of output: 325 [2018-12-08 09:46:30,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:30,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:31,080 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 350 DAG size of output: 292 [2018-12-08 09:46:31,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:32,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:32,324 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 320 DAG size of output: 292 [2018-12-08 09:46:32,454 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 319 DAG size of output: 291 [2018-12-08 09:46:32,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:32,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:32,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:32,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:32,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:32,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:32,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:32,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:32,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:32,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:32,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:32,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:32,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:32,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:32,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:32,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:32,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:32,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:32,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 09:46:33,108 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 351 DAG size of output: 292 [2018-12-08 09:46:35,922 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 114 [2018-12-08 09:46:37,139 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 315 DAG size of output: 137 [2018-12-08 09:46:38,030 WARN L180 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 147 [2018-12-08 09:46:40,462 WARN L180 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 341 DAG size of output: 143 [2018-12-08 09:46:43,042 WARN L180 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 324 DAG size of output: 127 [2018-12-08 09:46:45,064 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 281 DAG size of output: 142 [2018-12-08 09:46:45,181 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2018-12-08 09:46:49,384 WARN L180 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 381 DAG size of output: 111 [2018-12-08 09:46:49,715 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 112 [2018-12-08 09:46:54,548 WARN L180 SmtUtils]: Spent 4.83 s on a formula simplification. DAG size of input: 360 DAG size of output: 170 [2018-12-08 09:46:54,895 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 115 [2018-12-08 09:46:59,639 WARN L180 SmtUtils]: Spent 4.72 s on a formula simplification. DAG size of input: 447 DAG size of output: 122 [2018-12-08 09:47:04,182 WARN L180 SmtUtils]: Spent 4.49 s on a formula simplification. DAG size of input: 386 DAG size of output: 112 [2018-12-08 09:47:10,758 WARN L180 SmtUtils]: Spent 6.57 s on a formula simplification. DAG size of input: 360 DAG size of output: 170 [2018-12-08 09:47:11,241 WARN L180 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 330 DAG size of output: 1 [2018-12-08 09:47:12,806 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 332 DAG size of output: 92 [2018-12-08 09:47:12,946 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 75 [2018-12-08 09:47:17,181 WARN L180 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 381 DAG size of output: 111 [2018-12-08 09:47:17,326 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 66 [2018-12-08 09:47:19,683 WARN L180 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 475 DAG size of output: 91 [2018-12-08 09:47:21,028 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 331 DAG size of output: 103 [2018-12-08 09:47:22,217 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 194 DAG size of output: 142 [2018-12-08 09:47:26,598 WARN L180 SmtUtils]: Spent 4.37 s on a formula simplification. DAG size of input: 420 DAG size of output: 133 [2018-12-08 09:47:30,847 WARN L180 SmtUtils]: Spent 4.24 s on a formula simplification. DAG size of input: 329 DAG size of output: 155 [2018-12-08 09:47:32,938 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 264 DAG size of output: 110 [2018-12-08 09:47:33,567 WARN L180 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 379 DAG size of output: 1 [2018-12-08 09:47:38,311 WARN L180 SmtUtils]: Spent 4.73 s on a formula simplification. DAG size of input: 350 DAG size of output: 132 [2018-12-08 09:47:38,466 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 112 [2018-12-08 09:47:38,612 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 83 [2018-12-08 09:47:41,249 WARN L180 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 419 DAG size of output: 115 [2018-12-08 09:47:41,401 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 113 [2018-12-08 09:47:51,262 WARN L180 SmtUtils]: Spent 9.85 s on a formula simplification. DAG size of input: 702 DAG size of output: 321 [2018-12-08 09:47:51,400 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 114 [2018-12-08 09:47:52,133 WARN L180 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 133 [2018-12-08 09:47:52,298 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 113 [2018-12-08 09:47:57,077 WARN L180 SmtUtils]: Spent 4.77 s on a formula simplification. DAG size of input: 400 DAG size of output: 126 [2018-12-08 09:47:59,165 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 327 DAG size of output: 153 [2018-12-08 09:47:59,675 WARN L180 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 330 DAG size of output: 1 [2018-12-08 09:48:00,269 WARN L180 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 444 DAG size of output: 1 [2018-12-08 09:48:04,949 WARN L180 SmtUtils]: Spent 4.66 s on a formula simplification. DAG size of input: 549 DAG size of output: 195 [2018-12-08 09:48:08,615 WARN L180 SmtUtils]: Spent 3.66 s on a formula simplification. DAG size of input: 391 DAG size of output: 129 [2018-12-08 09:48:10,742 WARN L180 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 382 DAG size of output: 168 [2018-12-08 09:48:10,886 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 109 [2018-12-08 09:48:11,715 WARN L180 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 262 DAG size of output: 145 [2018-12-08 09:48:14,158 WARN L180 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 329 DAG size of output: 118 [2018-12-08 09:48:16,237 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 389 DAG size of output: 163 [2018-12-08 09:48:16,604 WARN L180 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 115 [2018-12-08 09:48:22,690 WARN L180 SmtUtils]: Spent 6.08 s on a formula simplification. DAG size of input: 420 DAG size of output: 133 [2018-12-08 09:48:22,693 INFO L444 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 373 388) the Hoare annotation is: (let ((.cse21 (= 1 ~b0_ev~0))) (let ((.cse8 (not (= 1 ~d1_ev~0))) (.cse30 (not (= 1 ~d0_ev~0))) (.cse24 (< ~d0_ev~0 2)) (.cse28 (< 0 ~b0_ev~0)) (.cse18 (= ~b1_ev~0 1)) (.cse27 (< 0 ~z_req_up~0)) (.cse26 (< 1 ~d1_ev~0)) (.cse2 (= ~b1_ev~0 0)) (.cse31 (not .cse21)) (.cse25 (not (= ~z_val~0 ~z_val_t~0))) (.cse0 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse1 (= ~z_req_up~0 1)) (.cse3 (= ~b0_req_up~0 1)) (.cse4 (< 0 ~comp_m1_i~0)) (.cse5 (< ~b1_val_t~0 1)) (.cse6 (< 0 ~d0_ev~0)) (.cse7 (= 0 ~d0_ev~0)) (.cse9 (= ~b1_req_up~0 1)) (.cse10 (< ~b1_val~0 ~b1_val_t~0)) (.cse11 (= 0 ~b0_ev~0)) (.cse12 (< ~d0_val_t~0 1)) (.cse13 (< ~b0_val~0 ~b0_val_t~0)) (.cse29 (= 0 ~d1_ev~0)) (.cse14 (< |old(~comp_m1_st~0)| 2)) (.cse15 (< ~b0_val_t~0 1)) (.cse16 (< ~d1_val_t~0 1)) (.cse17 (< ~z_ev~0 2)) (.cse19 (< 0 ~z_val~0)) (.cse32 (not (= 0 ~z_val_t~0))) (.cse20 (< ~d1_val~0 ~d1_val_t~0)) (.cse22 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse23 (< ~z_val~0 0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)) (or (or .cse20 .cse10 .cse5 (or .cse9 .cse11 .cse12 .cse1 .cse13 .cse2 .cse14 .cse15 .cse16 .cse18 .cse17 .cse19 .cse24 .cse3 .cse4 .cse21 .cse22 .cse23 .cse8)) .cse0) (or .cse25 (or .cse26 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse28 .cse29 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse30 .cse22 .cse23) .cse0) (or .cse10 .cse0 .cse12 .cse13 (or .cse9 .cse27 .cse26 .cse2 .cse29 .cse14 .cse17 .cse3 .cse4 .cse30 .cse31) .cse15 .cse16 .cse32 .cse20 .cse22 .cse5 .cse25) (or .cse1 .cse2 .cse3 .cse4 .cse5 (< ~d1_ev~0 2) .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse32 .cse20 .cse22 .cse23 .cse0) (or .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse28 .cse29 .cse14 .cse15 .cse16 .cse0 .cse17 .cse19 .cse32 (not .cse18) .cse20 .cse22 .cse23) (or .cse0 (and (or .cse20 .cse10 .cse22 .cse5 .cse12 .cse13 .cse7 .cse25 (or .cse9 (< ~b0_ev~0 2) .cse1 .cse2 .cse29 .cse14 .cse16 .cse18 .cse17 .cse19 .cse3 .cse4 .cse23 .cse6) .cse15) (or .cse20 .cse10 .cse5 .cse25 (or .cse9 .cse11 .cse12 .cse1 .cse13 .cse2 .cse29 .cse14 .cse15 .cse16 .cse18 .cse17 .cse19 .cse24 .cse3 .cse4 .cse21 .cse22 .cse23)))) (or (or .cse1 .cse26 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< 1 ~b1_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse28 .cse29 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23) .cse0) (or .cse0 .cse10 .cse12 .cse13 .cse15 .cse20 .cse22 .cse5 .cse7 (or .cse9 .cse27 .cse26 .cse2 .cse29 .cse14 .cse16 .cse17 .cse19 .cse3 .cse4 .cse23 .cse31 .cse6) .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (< ~b1_ev~0 2) .cse9 .cse10 .cse11 .cse12 .cse13 .cse29 .cse14 .cse15 .cse16 .cse17 .cse19 .cse32 .cse20 .cse21 .cse22 .cse23)))) [2018-12-08 09:48:22,693 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 384) no Hoare annotation was computed. [2018-12-08 09:48:22,693 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 373 388) no Hoare annotation was computed. [2018-12-08 09:48:22,693 INFO L444 ceAbstractionStarter]: At program point L378(line 378) the Hoare annotation is: (let ((.cse21 (= 1 ~b0_ev~0))) (let ((.cse8 (not (= 1 ~d1_ev~0))) (.cse30 (not (= 1 ~d0_ev~0))) (.cse24 (< ~d0_ev~0 2)) (.cse28 (< 0 ~b0_ev~0)) (.cse18 (= ~b1_ev~0 1)) (.cse27 (< 0 ~z_req_up~0)) (.cse26 (< 1 ~d1_ev~0)) (.cse2 (= ~b1_ev~0 0)) (.cse31 (not .cse21)) (.cse25 (not (= ~z_val~0 ~z_val_t~0))) (.cse0 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse1 (= ~z_req_up~0 1)) (.cse3 (= ~b0_req_up~0 1)) (.cse4 (< 0 ~comp_m1_i~0)) (.cse5 (< ~b1_val_t~0 1)) (.cse6 (< 0 ~d0_ev~0)) (.cse7 (= 0 ~d0_ev~0)) (.cse9 (= ~b1_req_up~0 1)) (.cse10 (< ~b1_val~0 ~b1_val_t~0)) (.cse11 (= 0 ~b0_ev~0)) (.cse12 (< ~d0_val_t~0 1)) (.cse13 (< ~b0_val~0 ~b0_val_t~0)) (.cse29 (= 0 ~d1_ev~0)) (.cse14 (< |old(~comp_m1_st~0)| 2)) (.cse15 (< ~b0_val_t~0 1)) (.cse16 (< ~d1_val_t~0 1)) (.cse17 (< ~z_ev~0 2)) (.cse19 (< 0 ~z_val~0)) (.cse32 (not (= 0 ~z_val_t~0))) (.cse20 (< ~d1_val~0 ~d1_val_t~0)) (.cse22 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse23 (< ~z_val~0 0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)) (or (or .cse20 .cse10 .cse5 (or .cse9 .cse11 .cse12 .cse1 .cse13 .cse2 .cse14 .cse15 .cse16 .cse18 .cse17 .cse19 .cse24 .cse3 .cse4 .cse21 .cse22 .cse23 .cse8)) .cse0) (or .cse25 (or .cse26 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse28 .cse29 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse30 .cse22 .cse23) .cse0) (or .cse10 .cse0 .cse12 .cse13 (or .cse9 .cse27 .cse26 .cse2 .cse29 .cse14 .cse17 .cse3 .cse4 .cse30 .cse31) .cse15 .cse16 .cse32 .cse20 .cse22 .cse5 .cse25) (or .cse1 .cse2 .cse3 .cse4 .cse5 (< ~d1_ev~0 2) .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse32 .cse20 .cse22 .cse23 .cse0) (or .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse27 .cse13 .cse28 .cse29 .cse14 .cse15 .cse16 .cse0 .cse17 .cse19 .cse32 (not .cse18) .cse20 .cse22 .cse23) (or .cse0 (and (or .cse20 .cse10 .cse22 .cse5 .cse12 .cse13 .cse7 .cse25 (or .cse9 (< ~b0_ev~0 2) .cse1 .cse2 .cse29 .cse14 .cse16 .cse18 .cse17 .cse19 .cse3 .cse4 .cse23 .cse6) .cse15) (or .cse20 .cse10 .cse5 .cse25 (or .cse9 .cse11 .cse12 .cse1 .cse13 .cse2 .cse29 .cse14 .cse15 .cse16 .cse18 .cse17 .cse19 .cse24 .cse3 .cse4 .cse21 .cse22 .cse23)))) (or (or .cse1 .cse26 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< 1 ~b1_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse28 .cse29 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23) .cse0) (or .cse0 .cse10 .cse12 .cse13 .cse15 .cse20 .cse22 .cse5 .cse7 (or .cse9 .cse27 .cse26 .cse2 .cse29 .cse14 .cse16 .cse17 .cse19 .cse3 .cse4 .cse23 .cse31 .cse6) .cse25) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (< ~b1_ev~0 2) .cse9 .cse10 .cse11 .cse12 .cse13 .cse29 .cse14 .cse15 .cse16 .cse17 .cse19 .cse32 .cse20 .cse21 .cse22 .cse23)))) [2018-12-08 09:48:22,693 INFO L448 ceAbstractionStarter]: For program point L380-2(lines 373 388) no Hoare annotation was computed. [2018-12-08 09:48:22,693 INFO L448 ceAbstractionStarter]: For program point L378-1(line 378) no Hoare annotation was computed. [2018-12-08 09:48:22,694 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 254 268) no Hoare annotation was computed. [2018-12-08 09:48:22,694 INFO L444 ceAbstractionStarter]: At program point L265(lines 257 267) the Hoare annotation is: (let ((.cse17 (< ~d1_ev~0 2)) (.cse29 (< ~b1_ev~0 2)) (.cse32 (= 1 ~b0_ev~0)) (.cse26 (< ~comp_m1_st~0 2)) (.cse27 (not (= 0 ~z_val_t~0))) (.cse28 (= 0 exists_runnable_thread_~__retres1~1)) (.cse0 (<= 1 exists_runnable_thread_~__retres1~1)) (.cse25 (= 0 ~d0_ev~0)) (.cse30 (< 0 ~z_req_up~0)) (.cse24 (< 0 ~d0_ev~0)) (.cse19 (= 0 ~b0_ev~0)) (.cse20 (< 0 ~b0_ev~0)) (.cse21 (< ~d1_val~0 ~d1_val_t~0)) (.cse22 (< ~b1_val~0 ~b1_val_t~0)) (.cse23 (< ~b1_val_t~0 1)) (.cse4 (= ~b1_req_up~0 1)) (.cse5 (< ~b0_ev~0 2)) (.cse6 (= ~z_req_up~0 1)) (.cse7 (= ~b1_ev~0 0)) (.cse31 (= 0 ~d1_ev~0)) (.cse8 (< ~d1_val_t~0 1)) (.cse9 (= ~b1_ev~0 1)) (.cse10 (< ~z_ev~0 2)) (.cse11 (< 0 ~z_val~0)) (.cse12 (< ~d0_ev~0 2)) (.cse13 (= ~b0_req_up~0 1)) (.cse14 (< 0 ~comp_m1_i~0)) (.cse15 (< ~z_val~0 0)) (.cse16 (not (= 0 ~comp_m1_st~0))) (.cse33 (= 1 ~d1_ev~0)) (.cse1 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse2 (< ~d0_val_t~0 1)) (.cse3 (< ~b0_val~0 ~b0_val_t~0)) (.cse18 (< ~b0_val_t~0 1)) (.cse34 (not (= ~z_val~0 ~z_val_t~0)))) (and (or .cse0 (and (or (and (or .cse1 .cse2 .cse3 (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18) (or (or .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse1 .cse2 .cse3 .cse20 .cse18)) .cse21 .cse22 .cse23) (or .cse21 .cse22 .cse1 .cse23 (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse24) .cse2 .cse3 .cse25 .cse18))) (or (or .cse21 .cse22 .cse1 .cse23 .cse2 .cse3 .cse25 (or .cse4 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse24) .cse20 .cse18) .cse0) (or .cse7 .cse13 .cse14 .cse23 .cse17 .cse24 .cse25 .cse4 .cse22 .cse19 .cse2 .cse3 .cse20 .cse26 .cse18 .cse8 .cse10 .cse9 .cse11 .cse27 .cse21 .cse1 .cse15 .cse28) (or .cse0 .cse13 .cse14 .cse16 .cse23 .cse24 .cse25 .cse29 .cse4 .cse22 .cse19 .cse2 .cse30 .cse3 .cse31 .cse18 .cse8 .cse10 .cse11 .cse27 .cse21 .cse32 .cse1 .cse15 .cse33) (or .cse28 .cse13 .cse14 .cse23 .cse24 .cse25 .cse29 .cse4 .cse22 .cse19 .cse2 .cse3 .cse31 .cse26 .cse18 .cse8 .cse10 .cse11 .cse27 .cse21 .cse32 .cse1 .cse15 .cse33) (or .cse28 (or .cse6 (< 1 ~d1_ev~0) .cse7 .cse13 .cse14 .cse23 .cse24 .cse25 (< 1 ~b1_ev~0) .cse4 .cse22 .cse19 .cse2 .cse3 .cse20 .cse31 .cse26 .cse18 .cse8 .cse10 .cse9 .cse11 .cse21 .cse1 .cse15 .cse33)) (or (and (or (or .cse7 .cse12 .cse13 .cse14 .cse23 .cse4 .cse22 .cse19 .cse2 .cse3 .cse31 .cse26 .cse18 .cse8 .cse10 .cse9 .cse11 .cse21 .cse32 .cse1 .cse15 .cse33) .cse34) (or (or .cse4 .cse5 .cse7 .cse31 .cse26 .cse9 .cse10 .cse13 .cse14 .cse24 .cse33) .cse8 .cse27 .cse21 .cse22 .cse1 .cse23 .cse2 .cse3 .cse25 .cse34 .cse18)) .cse28) (or .cse0 (and (or .cse21 .cse22 .cse1 .cse23 .cse2 .cse3 .cse25 (or .cse4 .cse5 .cse30 .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse24 .cse33) .cse34 .cse18) (or (and (or .cse21 .cse22 (or .cse4 .cse19 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse33) .cse1 .cse23 .cse2 .cse3 .cse20 .cse18) (or .cse21 .cse22 .cse23 (or (or .cse4 .cse5 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse33) .cse1 .cse2 .cse3 .cse18))) .cse34))))) [2018-12-08 09:48:22,694 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 254 268) the Hoare annotation is: true [2018-12-08 09:48:22,694 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 263) no Hoare annotation was computed. [2018-12-08 09:48:22,694 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 254 268) no Hoare annotation was computed. [2018-12-08 09:48:22,694 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2018-12-08 09:48:22,694 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2018-12-08 09:48:22,694 INFO L448 ceAbstractionStarter]: For program point L81-2(lines 78 86) no Hoare annotation was computed. [2018-12-08 09:48:22,694 INFO L448 ceAbstractionStarter]: For program point L69(lines 41 91) no Hoare annotation was computed. [2018-12-08 09:48:22,694 INFO L444 ceAbstractionStarter]: At program point method1ENTRY(lines 36 92) the Hoare annotation is: (let ((.cse23 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse24 (= ~z_req_up~0 |old(~z_req_up~0)|))) (let ((.cse30 (< ~d1_ev~0 2)) (.cse22 (= ~z_val~0 ~z_val_t~0)) (.cse32 (and .cse23 .cse24)) (.cse6 (= 0 ~d0_ev~0)) (.cse11 (< 0 |old(~z_req_up~0)|)) (.cse5 (< 0 ~d0_ev~0)) (.cse9 (= 0 ~b0_ev~0)) (.cse13 (< 0 ~b0_ev~0)) (.cse19 (< ~d1_val~0 ~d1_val_t~0)) (.cse8 (< ~b1_val~0 ~b1_val_t~0)) (.cse4 (< ~b1_val_t~0 1)) (.cse0 (= 0 |old(~comp_m1_st~0)|)) (.cse7 (= ~b1_req_up~0 1)) (.cse31 (< ~b0_ev~0 2)) (.cse26 (= |old(~z_req_up~0)| 1)) (.cse1 (< 1 ~d1_ev~0)) (.cse27 (= ~b1_ev~0 0)) (.cse14 (= 0 ~d1_ev~0)) (.cse16 (< ~d1_val_t~0 1)) (.cse28 (= ~b1_ev~0 1)) (.cse17 (< ~z_ev~0 2)) (.cse18 (< 0 ~z_val~0)) (.cse29 (< ~d0_ev~0 2)) (.cse2 (= ~b0_req_up~0 1)) (.cse3 (< 0 ~comp_m1_i~0)) (.cse21 (< ~z_val~0 0)) (.cse25 (= 1 ~d1_ev~0)) (.cse20 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse10 (< ~d0_val_t~0 1)) (.cse12 (< ~b0_val~0 ~b0_val_t~0)) (.cse15 (< ~b0_val_t~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< ~b1_ev~0 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (not (= 0 |old(~z_val_t~0)|)) .cse19 .cse20 .cse21 (and .cse22 .cse23 .cse24) .cse25) (or (and (or (or .cse20 .cse10 .cse12 (or .cse0 .cse7 .cse9 .cse26 .cse27 .cse16 .cse28 .cse17 .cse18 .cse29 .cse2 .cse3 (= 1 ~b0_ev~0) .cse21 .cse30) .cse15) .cse19 .cse8 .cse4) (or (or .cse0 .cse7 .cse31 .cse26 .cse27 .cse16 .cse28 .cse17 .cse18 .cse2 .cse3 .cse21 .cse30 .cse5) .cse19 .cse8 .cse20 .cse4 .cse10 .cse12 .cse6 .cse15)) .cse32) (or (or .cse19 .cse8 (or .cse0 .cse7 .cse9 .cse26 .cse27 .cse16 .cse28 .cse17 .cse18 .cse2 .cse3 .cse21 .cse30 .cse5) .cse20 .cse4 .cse10 .cse12 .cse6 .cse13 .cse15) .cse32) (or (and .cse22 .cse32) (let ((.cse33 (not (= ~z_val~0 |old(~z_val_t~0)|)))) (and (or .cse19 .cse8 .cse20 .cse4 .cse10 .cse12 .cse6 (or .cse0 .cse7 .cse31 .cse11 .cse1 .cse27 .cse14 .cse16 .cse28 .cse17 .cse18 .cse2 .cse3 .cse21 .cse5 .cse25) .cse33 .cse15) (or (and (or (or .cse0 .cse7 .cse9 .cse26 .cse1 .cse27 .cse14 .cse16 .cse28 .cse17 .cse18 .cse29 .cse2 .cse3 .cse21 .cse25) .cse19 .cse8 .cse20 .cse4 .cse10 .cse12 .cse13 .cse15) (or .cse19 .cse8 .cse4 (or (or .cse0 .cse7 .cse31 .cse26 .cse1 .cse27 .cse14 .cse16 .cse28 .cse17 .cse18 .cse29 .cse2 .cse3 .cse21 .cse25) .cse20 .cse10 .cse12 .cse15))) .cse33))))))) [2018-12-08 09:48:22,694 INFO L448 ceAbstractionStarter]: For program point method1FINAL(lines 36 92) no Hoare annotation was computed. [2018-12-08 09:48:22,694 INFO L448 ceAbstractionStarter]: For program point L70(lines 70 74) no Hoare annotation was computed. [2018-12-08 09:48:22,695 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2018-12-08 09:48:22,695 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 41 91) no Hoare annotation was computed. [2018-12-08 09:48:22,695 INFO L448 ceAbstractionStarter]: For program point method1EXIT(lines 36 92) no Hoare annotation was computed. [2018-12-08 09:48:22,695 INFO L448 ceAbstractionStarter]: For program point L63(lines 63 67) no Hoare annotation was computed. [2018-12-08 09:48:22,695 INFO L448 ceAbstractionStarter]: For program point L63-2(lines 41 91) no Hoare annotation was computed. [2018-12-08 09:48:22,695 INFO L448 ceAbstractionStarter]: For program point L51(lines 41 91) no Hoare annotation was computed. [2018-12-08 09:48:22,695 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2018-12-08 09:48:22,695 INFO L448 ceAbstractionStarter]: For program point L349-1(lines 343 371) no Hoare annotation was computed. [2018-12-08 09:48:22,695 INFO L444 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 340 372) the Hoare annotation is: (let ((.cse34 (= 1 |old(~d1_ev~0)|)) (.cse36 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse40 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse35 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse37 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse38 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse28 (= 1 |old(~b0_ev~0)|))) (let ((.cse27 (< |old(~d0_ev~0)| 2)) (.cse14 (< 0 |old(~b0_ev~0)|)) (.cse33 (< ~comp_m1_st~0 2)) (.cse12 (< 0 ~z_req_up~0)) (.cse0 (< 1 |old(~d1_ev~0)|)) (.cse15 (= 0 |old(~d1_ev~0)|)) (.cse32 (not (= 1 |old(~d0_ev~0)|))) (.cse39 (not .cse28)) (.cse30 (and .cse40 .cse35 (= 1 ~d0_ev~0) .cse37 .cse38)) (.cse20 (not (= 0 ~z_val_t~0))) (.cse31 (not (= ~z_val~0 ~z_val_t~0))) (.cse5 (and .cse40 .cse35 .cse36 .cse37 .cse38)) (.cse25 (= ~z_req_up~0 1)) (.cse26 (= |old(~b1_ev~0)| 0)) (.cse1 (= ~b0_req_up~0 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse3 (not (= 0 ~comp_m1_st~0))) (.cse4 (< ~b1_val_t~0 1)) (.cse6 (< 0 |old(~d0_ev~0)|)) (.cse7 (= 0 |old(~d0_ev~0)|)) (.cse29 (not .cse34)) (.cse8 (= ~b1_req_up~0 1)) (.cse9 (< ~b1_val~0 ~b1_val_t~0)) (.cse10 (= 0 |old(~b0_ev~0)|)) (.cse11 (< ~d0_val_t~0 1)) (.cse13 (< ~b0_val~0 ~b0_val_t~0)) (.cse16 (< ~b0_val_t~0 1)) (.cse17 (< ~d1_val_t~0 1)) (.cse18 (< |old(~z_ev~0)| 2)) (.cse21 (= |old(~b1_ev~0)| 1)) (.cse19 (< 0 ~z_val~0)) (.cse22 (< ~d1_val~0 ~d1_val_t~0)) (.cse23 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse24 (< ~z_val~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (not .cse21) .cse22 .cse23 .cse24) (or (or .cse22 .cse9 .cse4 (or .cse8 .cse10 .cse11 .cse25 .cse13 .cse26 .cse16 .cse17 .cse21 .cse18 .cse19 .cse27 .cse1 .cse2 .cse28 .cse23 .cse24 .cse3 .cse29)) .cse5) (or .cse30 .cse31 (or .cse0 .cse26 .cse1 .cse2 .cse3 .cse4 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22 .cse32 .cse23 .cse24)) (or .cse5 (and (or .cse22 .cse9 .cse23 .cse4 .cse11 .cse13 .cse7 .cse31 (or .cse8 (< |old(~b0_ev~0)| 2) .cse25 .cse26 .cse15 .cse33 .cse17 .cse21 .cse18 .cse19 .cse1 .cse2 .cse24 .cse6 .cse34) .cse16) (or .cse22 .cse9 .cse4 .cse31 (or .cse8 .cse10 .cse11 .cse25 .cse13 .cse26 .cse15 .cse33 .cse16 .cse17 .cse21 .cse18 .cse19 .cse27 .cse1 .cse2 .cse28 .cse23 .cse24 .cse34)))) (or .cse25 .cse26 .cse1 .cse2 .cse4 (< |old(~d1_ev~0)| 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse33 .cse16 .cse17 .cse18 .cse21 .cse19 .cse20 .cse22 .cse23 .cse24 .cse5) (or (or .cse25 .cse0 .cse26 .cse1 .cse2 .cse4 .cse6 .cse7 (< 1 |old(~b1_ev~0)|) .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse33 .cse16 .cse17 .cse18 .cse21 .cse19 .cse22 .cse23 .cse24 .cse34) .cse5) (or .cse5 .cse25 .cse1 .cse2 .cse4 .cse6 .cse7 (< |old(~b1_ev~0)| 2) .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse33 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse28 .cse23 .cse24 .cse34) (or .cse9 (and (= ~b0_ev~0 1) .cse35 .cse36 .cse37 .cse38) .cse11 .cse13 (or .cse8 .cse12 .cse0 .cse26 .cse15 .cse18 .cse1 .cse2 .cse3 .cse39 .cse6) .cse16 .cse17 .cse20 .cse22 .cse23 .cse4 .cse7 .cse31) (or (or .cse8 .cse12 .cse0 .cse26 .cse15 .cse18 .cse1 .cse2 .cse32 .cse3 .cse39) .cse30 .cse9 .cse11 .cse13 .cse16 .cse17 .cse20 .cse22 .cse23 .cse4 .cse31) (or .cse5 (or .cse25 .cse26 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse13 .cse16 .cse17 .cse18 .cse21 .cse19 .cse22 .cse28 .cse23 .cse24))))) [2018-12-08 09:48:22,695 INFO L448 ceAbstractionStarter]: For program point L364-1(lines 340 372) no Hoare annotation was computed. [2018-12-08 09:48:22,695 INFO L448 ceAbstractionStarter]: For program point L354-1(lines 343 371) no Hoare annotation was computed. [2018-12-08 09:48:22,695 INFO L448 ceAbstractionStarter]: For program point L344-1(lines 343 371) no Hoare annotation was computed. [2018-12-08 09:48:22,695 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 340 372) no Hoare annotation was computed. [2018-12-08 09:48:22,695 INFO L448 ceAbstractionStarter]: For program point L359-1(lines 343 371) no Hoare annotation was computed. [2018-12-08 09:48:22,695 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 241 253) no Hoare annotation was computed. [2018-12-08 09:48:22,695 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 241 253) the Hoare annotation is: (or (< 1 ~d1_ev~0) (= |old(~comp_m1_st~0)| ~comp_m1_st~0) (= ~b0_req_up~0 1) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 ~d0_ev~0) (= ~b1_req_up~0 1) (< ~b1_val~0 ~b1_val_t~0) (< ~d0_val_t~0 1) (< 0 ~z_req_up~0) (< ~b0_val~0 ~b0_val_t~0) (< 0 ~b0_ev~0) (< ~b0_val_t~0 1) (< ~d1_val_t~0 1) (< ~z_ev~0 2) (= ~b1_ev~0 1) (< 0 ~z_val~0) (not (= 0 ~z_val_t~0)) (< ~d1_val~0 ~d1_val_t~0) (not (= ~d0_val_t~0 ~d0_val~0)) (< ~z_val~0 0) (= 1 ~d1_ev~0)) [2018-12-08 09:48:22,695 INFO L448 ceAbstractionStarter]: For program point L245-1(lines 241 253) no Hoare annotation was computed. [2018-12-08 09:48:22,696 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 483 501) the Hoare annotation is: (or (< 1 |old(~d1_ev~0)|) (< 0 |old(~comp_m1_i~0)|) (not (= 0 |old(~comp_m1_st~0)|)) (< 0 |old(~b0_val~0)|) (< 0 |old(~d0_ev~0)|) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< 1 |old(~b1_ev~0)|) (< 0 |old(~d1_val~0)|) (and (= ~d0_val_t~0 ~d0_val~0) (<= ~b0_val_t~0 ~b0_val~0) (= 0 ~z_val_t~0) (= |old(~b0_ev~0)| ~b0_ev~0) (= |old(~b1_req_up~0)| ~b1_req_up~0) (= ~z_val~0 ~z_val_t~0) (<= ~d1_val_t~0 ~d1_val~0) (= |old(~d0_req_up~0)| ~d0_req_up~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (= |old(~comp_m1_st~0)| ~comp_m1_st~0) (<= 0 ~b0_val~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= |old(~d0_ev~0)| ~d0_ev~0) (<= ~b0_val~0 0) (<= ~comp_m1_i~0 0) (= ~d1_req_up~0 |old(~d1_req_up~0)|) (= |old(~b1_ev~0)| ~b1_ev~0) (<= ~d1_req_up~0 ~b0_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (= ~z_req_up~0 |old(~z_req_up~0)|) (<= |old(~z_ev~0)| ~z_ev~0)) (< |old(~b0_val~0)| 0) (= |old(~b1_req_up~0)| 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_val~0)| |old(~b0_val_t~0)|) (< 0 |old(~b0_ev~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (= |old(~b1_ev~0)| 1) (< 0 |old(~z_val~0)|) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~d1_val~0)| |old(~d1_val_t~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val_t~0)| |old(~d0_val~0)|)) (< |old(~z_val~0)| 0) (= 1 |old(~d1_ev~0)|)) [2018-12-08 09:48:22,696 INFO L444 ceAbstractionStarter]: At program point L493(line 493) the Hoare annotation is: (or (< 1 |old(~d1_ev~0)|) (< 0 |old(~comp_m1_i~0)|) (not (= 0 |old(~comp_m1_st~0)|)) (< 0 |old(~b0_val~0)|) (< 0 |old(~d0_ev~0)|) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< 1 |old(~b1_ev~0)|) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (= |old(~b1_req_up~0)| 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_val~0)| |old(~b0_val_t~0)|) (< 0 |old(~b0_ev~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (= |old(~b1_ev~0)| 1) (< 0 |old(~z_val~0)|) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~d1_val~0)| |old(~d1_val_t~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val_t~0)| |old(~d0_val~0)|)) (< |old(~z_val~0)| 0) (= 1 |old(~d1_ev~0)|)) [2018-12-08 09:48:22,696 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 483 501) no Hoare annotation was computed. [2018-12-08 09:48:22,696 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 497) no Hoare annotation was computed. [2018-12-08 09:48:22,696 INFO L448 ceAbstractionStarter]: For program point L489(lines 486 500) no Hoare annotation was computed. [2018-12-08 09:48:22,696 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 483 501) no Hoare annotation was computed. [2018-12-08 09:48:22,696 INFO L444 ceAbstractionStarter]: At program point L488(line 488) the Hoare annotation is: (or (< 1 |old(~d1_ev~0)|) (< 0 |old(~comp_m1_i~0)|) (not (= 0 |old(~comp_m1_st~0)|)) (< 0 |old(~b0_val~0)|) (< 0 |old(~d0_ev~0)|) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< 1 |old(~b1_ev~0)|) (< 0 |old(~d1_val~0)|) (and (= ~d0_val_t~0 ~d0_val~0) (<= ~b0_val_t~0 ~b0_val~0) (= 0 ~z_val_t~0) (= |old(~b0_ev~0)| ~b0_ev~0) (= |old(~b1_req_up~0)| ~b1_req_up~0) (= ~z_val~0 ~z_val_t~0) (<= ~d1_val_t~0 ~d1_val~0) (= |old(~d0_req_up~0)| ~d0_req_up~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (= |old(~comp_m1_st~0)| ~comp_m1_st~0) (<= 0 ~b0_val~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= |old(~d0_ev~0)| ~d0_ev~0) (<= ~b0_val~0 0) (<= ~comp_m1_i~0 0) (= ~d1_req_up~0 |old(~d1_req_up~0)|) (= |old(~b1_ev~0)| ~b1_ev~0) (<= ~d1_req_up~0 ~b0_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (= ~z_req_up~0 |old(~z_req_up~0)|) (<= |old(~z_ev~0)| ~z_ev~0)) (< |old(~b0_val~0)| 0) (= |old(~b1_req_up~0)| 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_val~0)| |old(~b0_val_t~0)|) (< 0 |old(~b0_ev~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (= |old(~b1_ev~0)| 1) (< 0 |old(~z_val~0)|) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~d1_val~0)| |old(~d1_val_t~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val_t~0)| |old(~d0_val~0)|)) (< |old(~z_val~0)| 0) (= 1 |old(~d1_ev~0)|)) [2018-12-08 09:48:22,696 INFO L444 ceAbstractionStarter]: At program point L488-1(line 488) the Hoare annotation is: (or (< 1 |old(~d1_ev~0)|) (< 0 |old(~comp_m1_i~0)|) (not (= 0 |old(~comp_m1_st~0)|)) (< 0 |old(~b0_val~0)|) (< 0 |old(~d0_ev~0)|) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< 1 |old(~b1_ev~0)|) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (= |old(~b1_req_up~0)| 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_val~0)| |old(~b0_val_t~0)|) (< 0 |old(~b0_ev~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (= |old(~b1_ev~0)| 1) (< 0 |old(~z_val~0)|) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~d1_val~0)| |old(~d1_val_t~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val_t~0)| |old(~d0_val~0)|)) (< |old(~z_val~0)| 0) (and (<= 2 ~d0_ev~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (= 0 ~z_val_t~0) (= ~z_val~0 ~z_val_t~0) (= 1 ~b1_req_up~0) (= 0 ~d0_val~0) (<= 1 ~b0_val_t~0) (= |old(~comp_m1_st~0)| ~comp_m1_st~0) (<= 2 ~d1_ev~0) (<= 0 ~b0_val~0) (<= ~d1_val~0 0) (<= ~b0_val~0 0) (<= ~z_req_up~0 0) (<= 2 ~b1_ev~0) (<= ~comp_m1_i~0 0) (= ~d1_req_up~0 1) (<= 1 ~d0_val_t~0) (<= ~d1_req_up~0 ~b0_req_up~0) (<= 2 ~z_ev~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (= ~d0_req_up~0 1)) (= 1 |old(~d1_ev~0)|)) [2018-12-08 09:48:22,696 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2018-12-08 09:48:22,696 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2018-12-08 09:48:22,696 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2018-12-08 09:48:22,696 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2018-12-08 09:48:22,696 INFO L448 ceAbstractionStarter]: For program point L187-1(lines 187 192) no Hoare annotation was computed. [2018-12-08 09:48:22,696 INFO L448 ceAbstractionStarter]: For program point update_zEXIT(lines 183 197) no Hoare annotation was computed. [2018-12-08 09:48:22,697 INFO L444 ceAbstractionStarter]: At program point update_zENTRY(lines 183 197) the Hoare annotation is: (let ((.cse22 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse21 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse13 (< 0 ~d0_ev~0)) (.cse19 (= 0 ~d0_ev~0)) (.cse0 (= ~b1_req_up~0 1)) (.cse2 (< ~d0_val_t~0 1)) (.cse3 (< ~b0_val~0 ~b0_val_t~0)) (.cse6 (< ~b0_val_t~0 1)) (.cse9 (< |old(~z_ev~0)| 2)) (.cse11 (< 0 ~comp_m1_i~0)) (.cse1 (= 0 ~b0_ev~0)) (.cse4 (= ~b1_ev~0 0)) (.cse5 (< ~comp_m1_st~0 2)) (.cse15 (= 1 ~d1_ev~0)) (.cse7 (< ~d1_val_t~0 1)) (.cse8 (= ~b1_ev~0 1)) (.cse10 (= ~b0_req_up~0 1)) (.cse12 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse14 (not (= 1 |old(~z_req_up~0)|))) (.cse16 (< ~d1_val~0 ~d1_val_t~0)) (.cse17 (< ~b1_val~0 ~b1_val_t~0)) (.cse18 (< ~b1_val_t~0 1)) (.cse20 (not (= |old(~z_val~0)| ~z_val_t~0)))) (and (or (or .cse0 .cse1 .cse2 .cse3 (< 0 ~b0_ev~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (= 0 ~z_val_t~0)) .cse16 .cse17 .cse18 .cse19 .cse20 (and (= ~z_val~0 ~z_val_t~0) .cse21 .cse22)) (or (and (= ~z_val~0 |old(~z_val~0)|) .cse22 .cse21) (let ((.cse23 (< 0 |old(~z_val~0)|)) (.cse24 (< |old(~z_val~0)| 0))) (and (or .cse16 .cse17 .cse18 (or (or .cse0 (< ~b0_ev~0 2) .cse4 .cse5 .cse7 .cse8 .cse9 .cse23 .cse10 .cse11 .cse24 .cse13 .cse14 .cse15) .cse12 .cse2 .cse3 .cse6) .cse19 .cse20) (or (or .cse0 .cse2 .cse3 .cse6 (or .cse9 (< ~d0_ev~0 2) .cse11 .cse1 .cse4 .cse5 .cse15) .cse7 .cse8 .cse23 .cse10 (= 1 ~b0_ev~0) .cse12 .cse24 .cse14) .cse16 .cse17 .cse18 .cse20)))))) [2018-12-08 09:48:22,697 INFO L448 ceAbstractionStarter]: For program point update_zFINAL(lines 183 197) no Hoare annotation was computed. [2018-12-08 09:48:22,697 INFO L444 ceAbstractionStarter]: At program point update_d1ENTRY(lines 168 182) the Hoare annotation is: (let ((.cse32 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse30 (= |old(~d1_val~0)| ~d1_val~0)) (.cse31 (= |old(~d1_ev~0)| ~d1_ev~0))) (let ((.cse23 (not (= ~z_val~0 ~z_val_t~0))) (.cse25 (= 1 ~b0_ev~0)) (.cse28 (and .cse32 .cse30 .cse31)) (.cse1 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse5 (= ~b1_ev~0 0)) (.cse24 (= 0 ~b0_ev~0)) (.cse4 (= ~b1_req_up~0 |old(~d1_req_up~0)|)) (.cse6 (= 0 |old(~d1_ev~0)|)) (.cse7 (< ~comp_m1_st~0 2)) (.cse27 (= ~b0_req_up~0 |old(~d1_req_up~0)|)) (.cse17 (= 1 |old(~d1_ev~0)|)) (.cse22 (= 0 ~d0_ev~0)) (.cse12 (= ~b0_req_up~0 1)) (.cse13 (< 0 ~comp_m1_i~0)) (.cse0 (and .cse30 .cse31 .cse32)) (.cse3 (< ~b1_val_t~0 1)) (.cse29 (< |old(~d1_ev~0)| 2)) (.cse15 (< 0 ~d0_ev~0)) (.cse2 (< ~b1_val~0 ~b1_val_t~0)) (.cse19 (< ~d0_val_t~0 1)) (.cse20 (< ~b0_val~0 ~b0_val_t~0)) (.cse26 (< 0 ~b0_ev~0)) (.cse21 (< ~b0_val_t~0 1)) (.cse8 (< ~d1_val_t~0 1)) (.cse10 (< ~z_ev~0 2)) (.cse9 (= ~b1_ev~0 1)) (.cse11 (< 0 ~z_val~0)) (.cse18 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse14 (< ~z_val~0 0)) (.cse16 (not (= 1 |old(~d1_req_up~0)|)))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 (or (or (< ~b0_ev~0 2) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 .cse19 .cse20 .cse21) .cse22 .cse23) (or .cse1 .cse2 .cse3 (or (or .cse10 (< ~d0_ev~0 2) .cse13 .cse24 .cse16 .cse5 .cse6 .cse7 .cse17) .cse19 .cse4 .cse20 .cse21 .cse8 .cse9 .cse11 .cse12 .cse25 .cse18 .cse14) .cse23))) (or .cse1 .cse2 .cse3 .cse22 (or .cse13 .cse15 (< ~b1_ev~0 2) .cse24 .cse19 .cse4 .cse20 .cse26 .cse6 .cse7 .cse21 .cse8 .cse10 .cse27 .cse11 .cse18 .cse14 .cse16 .cse17) .cse23 .cse28) (or .cse1 .cse2 .cse3 .cse22 .cse0 .cse23 (or .cse5 .cse13 .cse29 .cse15 .cse24 .cse19 .cse4 .cse20 .cse7 .cse21 .cse8 .cse10 .cse9 .cse27 .cse11 .cse25 .cse18 .cse14 .cse16)) (or .cse28 (or .cse1 .cse2 (or (= ~z_req_up~0 1) (< 1 |old(~d1_ev~0)|) .cse5 .cse13 .cse15 (< 1 ~b1_ev~0) .cse24 .cse19 .cse4 .cse20 .cse26 .cse6 .cse7 .cse21 .cse8 .cse10 .cse9 .cse27 .cse11 .cse18 .cse14 .cse16 .cse17) .cse3 .cse22)) (or .cse12 .cse13 .cse0 (not (= 0 ~comp_m1_st~0)) .cse3 .cse29 .cse15 (< 0 |old(~d1_val~0)|) (= ~b1_req_up~0 1) .cse2 .cse19 (< 0 ~z_req_up~0) .cse20 .cse26 .cse21 .cse8 .cse10 .cse9 .cse11 (not (= 0 ~z_val_t~0)) .cse18 .cse14 .cse16)))) [2018-12-08 09:48:22,697 INFO L448 ceAbstractionStarter]: For program point L172-1(lines 172 177) no Hoare annotation was computed. [2018-12-08 09:48:22,697 INFO L448 ceAbstractionStarter]: For program point update_d1FINAL(lines 168 182) no Hoare annotation was computed. [2018-12-08 09:48:22,697 INFO L448 ceAbstractionStarter]: For program point update_d1EXIT(lines 168 182) no Hoare annotation was computed. [2018-12-08 09:48:22,697 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-08 09:48:22,697 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~d0_req_up~0)| ~d0_req_up~0) (= |old(~d1_val~0)| ~d1_val~0) (= |old(~b0_val~0)| ~b0_val~0) (= |old(~comp_m1_st~0)| ~comp_m1_st~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= |old(~d0_ev~0)| ~d0_ev~0) (= ~z_val~0 |old(~z_val~0)|) (= |old(~b0_req_up~0)| ~b0_req_up~0) (= |old(~b0_ev~0)| ~b0_ev~0) (= |old(~b1_req_up~0)| ~b1_req_up~0) (= ~d1_req_up~0 |old(~d1_req_up~0)|) (= |old(~b1_ev~0)| ~b1_ev~0) (= ~z_req_up~0 |old(~z_req_up~0)|) (<= |old(~z_ev~0)| ~z_ev~0)) [2018-12-08 09:48:22,697 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 09:48:22,697 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 402) no Hoare annotation was computed. [2018-12-08 09:48:22,697 INFO L451 ceAbstractionStarter]: At program point L395(line 395) the Hoare annotation is: true [2018-12-08 09:48:22,697 INFO L448 ceAbstractionStarter]: For program point L395-1(line 395) no Hoare annotation was computed. [2018-12-08 09:48:22,697 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 389 407) no Hoare annotation was computed. [2018-12-08 09:48:22,698 INFO L444 ceAbstractionStarter]: At program point L404(lines 393 406) the Hoare annotation is: (let ((.cse25 (< 0 ~b0_ev~0)) (.cse18 (not (= 0 ~z_val_t~0))) (.cse0 (= 0 stop_simulation_~tmp~2)) (.cse6 (= 0 ~d0_ev~0)) (.cse5 (< 0 ~d0_ev~0)) (.cse19 (< ~d1_val~0 ~d1_val_t~0)) (.cse8 (< ~b1_val~0 ~b1_val_t~0)) (.cse4 (< ~b1_val_t~0 1)) (.cse7 (= ~b1_req_up~0 1)) (.cse9 (= 0 ~b0_ev~0)) (.cse10 (< ~d0_val_t~0 1)) (.cse1 (= ~z_req_up~0 1)) (.cse11 (< ~b0_val~0 ~b0_val_t~0)) (.cse24 (= ~b1_ev~0 0)) (.cse12 (= 0 ~d1_ev~0)) (.cse13 (< ~comp_m1_st~0 2)) (.cse14 (< ~b0_val_t~0 1)) (.cse15 (< ~d1_val_t~0 1)) (.cse26 (= ~b1_ev~0 1)) (.cse16 (< ~z_ev~0 2)) (.cse17 (< 0 ~z_val~0)) (.cse2 (= ~b0_req_up~0 1)) (.cse3 (< 0 ~comp_m1_i~0)) (.cse20 (= 1 ~b0_ev~0)) (.cse21 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse22 (< ~z_val~0 0)) (.cse23 (= 1 ~d1_ev~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< ~b1_ev~0 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 (or .cse1 (< 1 ~d1_ev~0) .cse24 .cse2 .cse3 .cse4 .cse5 .cse6 (< 1 ~b1_ev~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse17 .cse19 .cse21 .cse22 .cse23)) (or .cse1 .cse24 .cse2 .cse3 .cse4 (< ~d1_ev~0 2) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse13 .cse14 .cse0 .cse15 .cse16 .cse26 .cse17 .cse18 .cse19 .cse21 .cse22) (or .cse0 (let ((.cse27 (not (= ~z_val~0 ~z_val_t~0)))) (and (or .cse19 .cse8 .cse21 .cse4 .cse10 .cse11 .cse6 .cse27 (or .cse7 (< ~b0_ev~0 2) .cse1 .cse24 .cse12 .cse13 .cse15 .cse26 .cse16 .cse17 .cse2 .cse3 .cse22 .cse5 .cse23) .cse14) (or .cse19 .cse8 .cse4 .cse27 (or .cse7 .cse9 .cse10 .cse1 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 (< ~d0_ev~0 2) .cse2 .cse3 .cse20 .cse21 .cse22 .cse23))))))) [2018-12-08 09:48:22,698 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 389 407) the Hoare annotation is: true [2018-12-08 09:48:22,698 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 389 407) no Hoare annotation was computed. [2018-12-08 09:48:22,698 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 269 306) the Hoare annotation is: (let ((.cse38 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse39 (= ~z_req_up~0 |old(~z_req_up~0)|))) (let ((.cse30 (and .cse38 .cse39)) (.cse37 (= ~z_val~0 ~z_val_t~0))) (let ((.cse5 (< ~d1_ev~0 2)) (.cse29 (not (= 0 |old(~comp_m1_st~0)|))) (.cse25 (< ~b1_ev~0 2)) (.cse24 (and .cse37 .cse38 .cse39)) (.cse34 (< 1 ~d1_ev~0)) (.cse33 (< 0 |old(~z_req_up~0)|)) (.cse13 (< 0 ~b0_ev~0)) (.cse20 (not (= 0 |old(~z_val_t~0)|))) (.cse31 (and .cse30 .cse37)) (.cse7 (= 0 ~d0_ev~0)) (.cse32 (< ~b0_ev~0 2)) (.cse6 (< 0 ~d0_ev~0)) (.cse21 (< ~d1_val~0 ~d1_val_t~0)) (.cse9 (< ~b1_val~0 ~b1_val_t~0)) (.cse4 (< ~b1_val_t~0 1)) (.cse35 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse8 (= ~b1_req_up~0 1)) (.cse10 (= 0 ~b0_ev~0)) (.cse11 (< ~d0_val_t~0 1)) (.cse0 (= |old(~z_req_up~0)| 1)) (.cse12 (< ~b0_val~0 ~b0_val_t~0)) (.cse1 (= ~b1_ev~0 0)) (.cse26 (= 0 ~d1_ev~0)) (.cse14 (< |old(~comp_m1_st~0)| 2)) (.cse15 (< ~b0_val_t~0 1)) (.cse16 (< ~d1_val_t~0 1)) (.cse18 (= ~b1_ev~0 1)) (.cse17 (< ~z_ev~0 2)) (.cse19 (< 0 ~z_val~0)) (.cse36 (< ~d0_ev~0 2)) (.cse2 (= ~b0_req_up~0 1)) (.cse3 (< 0 ~comp_m1_i~0)) (.cse27 (= 1 ~b0_ev~0)) (.cse22 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse23 (< ~z_val~0 0)) (.cse28 (= 1 ~d1_ev~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse24 .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse25 .cse8 .cse9 .cse10 .cse11 .cse12 .cse26 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse27 .cse22 .cse23 .cse28) (or (or .cse21 .cse9 .cse22 .cse4 .cse11 .cse12 .cse7 (or .cse8 .cse10 .cse0 .cse1 .cse16 .cse18 .cse17 .cse19 .cse2 .cse3 .cse23 .cse29 .cse5 .cse6) .cse13 .cse15) .cse30) (or .cse31 (and (or .cse21 .cse9 .cse22 .cse4 .cse11 .cse12 .cse7 (or .cse8 .cse32 .cse33 .cse34 .cse1 .cse26 .cse16 .cse18 .cse17 .cse19 .cse2 .cse3 .cse23 .cse29 .cse6 .cse28) .cse35 .cse15) (or (and (or .cse21 .cse9 (or .cse8 .cse10 .cse0 .cse34 .cse1 .cse26 .cse16 .cse18 .cse17 .cse19 .cse36 .cse2 .cse3 .cse23 .cse29 .cse28) .cse22 .cse4 .cse11 .cse12 .cse13 .cse15) (or .cse21 .cse9 .cse4 (or (or .cse8 .cse32 .cse0 .cse34 .cse1 .cse26 .cse16 .cse18 .cse17 .cse19 .cse36 .cse2 .cse3 .cse23 .cse29 .cse28) .cse22 .cse11 .cse12 .cse15))) .cse35))) (or (and (or (and (or .cse22 .cse11 .cse12 (or .cse8 .cse32 .cse0 .cse1 .cse16 .cse18 .cse17 .cse19 .cse36 .cse2 .cse3 .cse23 .cse29 .cse5) .cse15) (or (or .cse8 .cse10 .cse0 .cse1 .cse16 .cse18 .cse17 .cse19 .cse36 .cse2 .cse3 .cse23 .cse29 .cse5) .cse22 .cse11 .cse12 .cse13 .cse15)) .cse21 .cse9 .cse4) (or .cse21 .cse9 .cse22 .cse4 (or .cse8 .cse32 .cse0 .cse1 .cse16 .cse18 .cse17 .cse19 .cse2 .cse3 .cse23 .cse29 .cse5 .cse6) .cse11 .cse12 .cse7 .cse15)) .cse30) (or .cse34 .cse2 .cse3 .cse29 .cse4 .cse6 .cse7 .cse25 .cse24 .cse8 .cse9 .cse10 .cse11 .cse33 .cse12 .cse26 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse27 .cse22 .cse23 .cse28) (or (or .cse0 .cse34 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (< 1 ~b1_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse28) .cse30) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse33 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse37 .cse21 .cse22 .cse23 .cse28) (or .cse31 (and (or .cse21 .cse9 .cse22 .cse4 .cse11 .cse12 .cse7 .cse35 (or .cse8 .cse32 .cse0 .cse1 .cse26 .cse14 .cse16 .cse18 .cse17 .cse19 .cse2 .cse3 .cse23 .cse6 .cse28) .cse15) (or .cse21 .cse9 .cse4 .cse35 (or .cse8 .cse10 .cse11 .cse0 .cse12 .cse1 .cse26 .cse14 .cse15 .cse16 .cse18 .cse17 .cse19 .cse36 .cse2 .cse3 .cse27 .cse22 .cse23 .cse28)))))))) [2018-12-08 09:48:22,698 INFO L448 ceAbstractionStarter]: For program point L289(lines 289 296) no Hoare annotation was computed. [2018-12-08 09:48:22,699 INFO L444 ceAbstractionStarter]: At program point L285(lines 275 300) the Hoare annotation is: (let ((.cse39 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse40 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse2 (<= 2 ~comp_m1_st~0)) (.cse0 (= ~z_val~0 ~z_val_t~0))) (let ((.cse23 (not (= 0 |old(~comp_m1_st~0)|))) (.cse34 (< ~b1_ev~0 2)) (.cse32 (and .cse2 .cse0)) (.cse13 (< 1 ~d1_ev~0)) (.cse12 (< 0 |old(~z_req_up~0)|)) (.cse31 (< 0 ~b0_ev~0)) (.cse37 (and .cse0 .cse39 .cse40)) (.cse33 (< ~d1_ev~0 2)) (.cse36 (not (= 0 |old(~z_val_t~0)|))) (.cse1 (and .cse39 .cse40)) (.cse9 (= 0 ~d0_ev~0)) (.cse11 (< ~b0_ev~0 2)) (.cse24 (< 0 ~d0_ev~0)) (.cse3 (< ~d1_val~0 ~d1_val_t~0)) (.cse4 (< ~b1_val~0 ~b1_val_t~0)) (.cse6 (< ~b1_val_t~0 1)) (.cse26 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse10 (= ~b1_req_up~0 1)) (.cse28 (= 0 ~b0_ev~0)) (.cse7 (< ~d0_val_t~0 1)) (.cse29 (= |old(~z_req_up~0)| 1)) (.cse8 (< ~b0_val~0 ~b0_val_t~0)) (.cse14 (= ~b1_ev~0 0)) (.cse15 (= 0 ~d1_ev~0)) (.cse35 (< |old(~comp_m1_st~0)| 2)) (.cse27 (< ~b0_val_t~0 1)) (.cse16 (< ~d1_val_t~0 1)) (.cse17 (= ~b1_ev~0 1)) (.cse18 (< ~z_ev~0 2)) (.cse19 (< 0 ~z_val~0)) (.cse30 (< ~d0_ev~0 2)) (.cse20 (= ~b0_req_up~0 1)) (.cse21 (< 0 ~comp_m1_i~0)) (.cse38 (= 1 ~b0_ev~0)) (.cse5 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse22 (< ~z_val~0 0)) (.cse25 (= 1 ~d1_ev~0))) (and (or (and .cse0 .cse1) (and .cse0 .cse2) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (or .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) .cse26 .cse27) (or (and (or .cse3 .cse4 (or .cse10 .cse28 .cse29 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 .cse21 .cse22 .cse23 .cse25) .cse5 .cse6 .cse7 .cse8 .cse31 .cse27) (or .cse3 .cse4 .cse6 (or (or .cse10 .cse11 .cse29 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 .cse21 .cse22 .cse23 .cse25) .cse5 .cse7 .cse8 .cse27))) .cse26))) (or .cse1 .cse32 (and (or (and (or .cse5 .cse7 .cse8 (or .cse10 .cse11 .cse29 .cse14 .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 .cse21 .cse22 .cse23 .cse33) .cse27) (or (or .cse10 .cse28 .cse29 .cse14 .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 .cse21 .cse22 .cse23 .cse33) .cse5 .cse7 .cse8 .cse31 .cse27)) .cse3 .cse4 .cse6) (or .cse3 .cse4 .cse5 .cse6 (or .cse10 .cse11 .cse29 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse33 .cse24) .cse7 .cse8 .cse9 .cse27))) (or (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (or .cse10 .cse28 .cse29 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse33 .cse24) .cse31 .cse27) .cse32 .cse1) (or .cse29 .cse20 .cse21 .cse6 .cse24 .cse9 .cse34 .cse10 .cse4 .cse28 .cse7 .cse8 .cse31 .cse15 .cse35 .cse27 .cse16 .cse18 .cse19 .cse36 .cse3 .cse5 .cse22 .cse37 .cse25) (or .cse13 .cse37 .cse20 .cse21 .cse23 .cse6 .cse24 .cse9 .cse34 .cse10 .cse32 .cse4 .cse28 .cse7 .cse12 .cse8 .cse15 .cse27 .cse16 .cse18 .cse19 .cse36 .cse3 .cse38 .cse5 .cse22 .cse25) (or (or .cse29 .cse13 .cse14 .cse20 .cse21 .cse6 .cse24 .cse9 (< 1 ~b1_ev~0) .cse10 .cse4 .cse28 .cse7 .cse8 .cse31 .cse15 .cse35 .cse27 .cse16 .cse18 .cse17 .cse19 .cse3 .cse5 .cse22 .cse25) .cse1) (or .cse14 .cse20 .cse21 .cse6 .cse24 .cse9 .cse10 .cse4 .cse28 .cse7 .cse12 .cse8 .cse31 .cse15 .cse35 .cse27 .cse16 .cse18 .cse17 .cse19 .cse36 .cse0 .cse3 .cse5 .cse22 .cse25) (or .cse29 .cse14 .cse37 .cse20 .cse21 .cse6 .cse33 .cse24 .cse9 .cse10 .cse4 .cse28 .cse7 .cse8 .cse35 .cse27 .cse16 .cse18 .cse17 .cse19 .cse36 .cse3 .cse38 .cse5 .cse22) (or (and .cse1 .cse0) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 (or .cse10 .cse11 .cse29 .cse14 .cse15 .cse35 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25) .cse27) (or .cse3 .cse4 .cse6 .cse26 (or .cse10 .cse28 .cse7 .cse29 .cse8 .cse14 .cse15 .cse35 .cse27 .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 .cse21 .cse38 .cse5 .cse22 .cse25))))))) [2018-12-08 09:48:22,699 INFO L444 ceAbstractionStarter]: At program point L292(line 292) the Hoare annotation is: (let ((.cse35 (not (= 0 ~comp_m1_st~0))) (.cse36 (<= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse37 (= ~z_req_up~0 |old(~z_req_up~0)|))) (let ((.cse25 (= ~z_val~0 ~z_val_t~0)) (.cse27 (< 0 |old(~z_req_up~0)|)) (.cse38 (< ~b1_ev~0 2)) (.cse19 (not (= 0 |old(~z_val_t~0)|))) (.cse21 (= 1 ~b0_ev~0)) (.cse32 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse24 (and .cse35 .cse36 .cse37)) (.cse33 (< ~d0_ev~0 2)) (.cse26 (< ~b0_ev~0 2)) (.cse30 (not (= 0 |old(~comp_m1_st~0)|))) (.cse5 (< ~d1_ev~0 2)) (.cse0 (= |old(~z_req_up~0)| 1)) (.cse28 (< 1 ~d1_ev~0)) (.cse1 (= ~b1_ev~0 0)) (.cse2 (= ~b0_req_up~0 1)) (.cse3 (< 0 ~comp_m1_i~0)) (.cse4 (< ~b1_val_t~0 1)) (.cse6 (< 0 ~d0_ev~0)) (.cse7 (= 0 ~d0_ev~0)) (.cse8 (= ~b1_req_up~0 1)) (.cse9 (< ~b1_val~0 ~b1_val_t~0)) (.cse10 (= 0 ~b0_ev~0)) (.cse11 (< ~d0_val_t~0 1)) (.cse12 (< ~b0_val~0 ~b0_val_t~0)) (.cse34 (< 0 ~b0_ev~0)) (.cse29 (= 0 ~d1_ev~0)) (.cse13 (< |old(~comp_m1_st~0)| 2)) (.cse14 (< ~b0_val_t~0 1)) (.cse15 (< ~d1_val_t~0 1)) (.cse16 (< ~z_ev~0 2)) (.cse17 (= ~b1_ev~0 1)) (.cse18 (< 0 ~z_val~0)) (.cse20 (< ~d1_val~0 ~d1_val_t~0)) (.cse22 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse23 (< ~z_val~0 0)) (.cse31 (= 1 ~d1_ev~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or (and .cse24 .cse25) (and (or .cse20 .cse9 .cse22 .cse4 .cse11 .cse12 .cse7 (or .cse8 .cse26 .cse27 .cse28 .cse1 .cse29 .cse15 .cse17 .cse16 .cse18 .cse2 .cse3 .cse23 .cse30 .cse6 .cse31) .cse32 .cse14) (or (and (or .cse20 .cse9 (or .cse8 .cse10 .cse0 .cse28 .cse1 .cse29 .cse15 .cse17 .cse16 .cse18 .cse33 .cse2 .cse3 .cse23 .cse30 .cse31) .cse22 .cse4 .cse11 .cse12 .cse34 .cse14) (or .cse20 .cse9 .cse4 (or (or .cse8 .cse26 .cse0 .cse28 .cse1 .cse29 .cse15 .cse17 .cse16 .cse18 .cse33 .cse2 .cse3 .cse23 .cse30 .cse31) .cse22 .cse11 .cse12 .cse14))) .cse32))) (or .cse20 .cse9 .cse4 .cse32 (or .cse8 .cse10 .cse11 .cse0 .cse12 .cse1 .cse29 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse33 .cse2 .cse3 .cse21 .cse22 .cse23 .cse31)) (or .cse28 .cse2 .cse3 .cse30 .cse4 .cse6 .cse7 (and .cse35 .cse25 .cse36 .cse37) .cse38 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse29 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse31) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse38 .cse8 .cse9 .cse10 .cse11 .cse12 .cse29 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse31) (or .cse20 .cse9 .cse22 .cse4 .cse11 .cse12 .cse7 .cse32 (or .cse8 .cse26 .cse0 .cse1 .cse29 .cse13 .cse15 .cse17 .cse16 .cse18 .cse2 .cse3 .cse23 .cse6 .cse31) .cse14) (or (or .cse20 .cse9 .cse22 .cse4 .cse11 .cse12 .cse7 (or .cse8 .cse10 .cse0 .cse1 .cse15 .cse17 .cse16 .cse18 .cse2 .cse3 .cse23 .cse30 .cse5 .cse6) .cse34 .cse14) .cse24) (or .cse24 (and (or (and (or .cse22 .cse11 .cse12 (or .cse8 .cse26 .cse0 .cse1 .cse15 .cse17 .cse16 .cse18 .cse33 .cse2 .cse3 .cse23 .cse30 .cse5) .cse14) (or (or .cse8 .cse10 .cse0 .cse1 .cse15 .cse17 .cse16 .cse18 .cse33 .cse2 .cse3 .cse23 .cse30 .cse5) .cse22 .cse11 .cse12 .cse34 .cse14)) .cse20 .cse9 .cse4) (or .cse20 .cse9 .cse22 .cse4 (or .cse8 .cse26 .cse0 .cse1 .cse15 .cse17 .cse16 .cse18 .cse2 .cse3 .cse23 .cse30 .cse5 .cse6) .cse11 .cse12 .cse7 .cse14))) (or .cse0 .cse28 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (< 1 ~b1_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse34 .cse29 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse23 .cse31)))) [2018-12-08 09:48:22,699 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 269 306) no Hoare annotation was computed. [2018-12-08 09:48:22,699 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 284) no Hoare annotation was computed. [2018-12-08 09:48:22,700 INFO L448 ceAbstractionStarter]: For program point L280-1(lines 275 300) no Hoare annotation was computed. [2018-12-08 09:48:22,700 INFO L448 ceAbstractionStarter]: For program point L278(line 278) no Hoare annotation was computed. [2018-12-08 09:48:22,700 INFO L444 ceAbstractionStarter]: At program point L276(line 276) the Hoare annotation is: (let ((.cse39 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse40 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse2 (<= 2 ~comp_m1_st~0)) (.cse0 (= ~z_val~0 ~z_val_t~0))) (let ((.cse23 (not (= 0 |old(~comp_m1_st~0)|))) (.cse34 (< ~b1_ev~0 2)) (.cse32 (and .cse2 .cse0)) (.cse13 (< 1 ~d1_ev~0)) (.cse12 (< 0 |old(~z_req_up~0)|)) (.cse31 (< 0 ~b0_ev~0)) (.cse37 (and .cse0 .cse39 .cse40)) (.cse33 (< ~d1_ev~0 2)) (.cse36 (not (= 0 |old(~z_val_t~0)|))) (.cse1 (and .cse39 .cse40)) (.cse9 (= 0 ~d0_ev~0)) (.cse11 (< ~b0_ev~0 2)) (.cse24 (< 0 ~d0_ev~0)) (.cse3 (< ~d1_val~0 ~d1_val_t~0)) (.cse4 (< ~b1_val~0 ~b1_val_t~0)) (.cse6 (< ~b1_val_t~0 1)) (.cse26 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse10 (= ~b1_req_up~0 1)) (.cse28 (= 0 ~b0_ev~0)) (.cse7 (< ~d0_val_t~0 1)) (.cse29 (= |old(~z_req_up~0)| 1)) (.cse8 (< ~b0_val~0 ~b0_val_t~0)) (.cse14 (= ~b1_ev~0 0)) (.cse15 (= 0 ~d1_ev~0)) (.cse35 (< |old(~comp_m1_st~0)| 2)) (.cse27 (< ~b0_val_t~0 1)) (.cse16 (< ~d1_val_t~0 1)) (.cse17 (= ~b1_ev~0 1)) (.cse18 (< ~z_ev~0 2)) (.cse19 (< 0 ~z_val~0)) (.cse30 (< ~d0_ev~0 2)) (.cse20 (= ~b0_req_up~0 1)) (.cse21 (< 0 ~comp_m1_i~0)) (.cse38 (= 1 ~b0_ev~0)) (.cse5 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse22 (< ~z_val~0 0)) (.cse25 (= 1 ~d1_ev~0))) (and (or (and .cse0 .cse1) (and .cse0 .cse2) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (or .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) .cse26 .cse27) (or (and (or .cse3 .cse4 (or .cse10 .cse28 .cse29 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 .cse21 .cse22 .cse23 .cse25) .cse5 .cse6 .cse7 .cse8 .cse31 .cse27) (or .cse3 .cse4 .cse6 (or (or .cse10 .cse11 .cse29 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 .cse21 .cse22 .cse23 .cse25) .cse5 .cse7 .cse8 .cse27))) .cse26))) (or .cse1 .cse32 (and (or (and (or .cse5 .cse7 .cse8 (or .cse10 .cse11 .cse29 .cse14 .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 .cse21 .cse22 .cse23 .cse33) .cse27) (or (or .cse10 .cse28 .cse29 .cse14 .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 .cse21 .cse22 .cse23 .cse33) .cse5 .cse7 .cse8 .cse31 .cse27)) .cse3 .cse4 .cse6) (or .cse3 .cse4 .cse5 .cse6 (or .cse10 .cse11 .cse29 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse33 .cse24) .cse7 .cse8 .cse9 .cse27))) (or (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (or .cse10 .cse28 .cse29 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse33 .cse24) .cse31 .cse27) .cse32 .cse1) (or .cse29 .cse20 .cse21 .cse6 .cse24 .cse9 .cse34 .cse10 .cse4 .cse28 .cse7 .cse8 .cse31 .cse15 .cse35 .cse27 .cse16 .cse18 .cse19 .cse36 .cse3 .cse5 .cse22 .cse37 .cse25) (or .cse13 .cse37 .cse20 .cse21 .cse23 .cse6 .cse24 .cse9 .cse34 .cse10 .cse32 .cse4 .cse28 .cse7 .cse12 .cse8 .cse15 .cse27 .cse16 .cse18 .cse19 .cse36 .cse3 .cse38 .cse5 .cse22 .cse25) (or (or .cse29 .cse13 .cse14 .cse20 .cse21 .cse6 .cse24 .cse9 (< 1 ~b1_ev~0) .cse10 .cse4 .cse28 .cse7 .cse8 .cse31 .cse15 .cse35 .cse27 .cse16 .cse18 .cse17 .cse19 .cse3 .cse5 .cse22 .cse25) .cse1) (or .cse14 .cse20 .cse21 .cse6 .cse24 .cse9 .cse10 .cse4 .cse28 .cse7 .cse12 .cse8 .cse31 .cse15 .cse35 .cse27 .cse16 .cse18 .cse17 .cse19 .cse36 .cse0 .cse3 .cse5 .cse22 .cse25) (or .cse29 .cse14 .cse37 .cse20 .cse21 .cse6 .cse33 .cse24 .cse9 .cse10 .cse4 .cse28 .cse7 .cse8 .cse35 .cse27 .cse16 .cse18 .cse17 .cse19 .cse36 .cse3 .cse38 .cse5 .cse22) (or (and .cse1 .cse0) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse26 (or .cse10 .cse11 .cse29 .cse14 .cse15 .cse35 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25) .cse27) (or .cse3 .cse4 .cse6 .cse26 (or .cse10 .cse28 .cse7 .cse29 .cse8 .cse14 .cse15 .cse35 .cse27 .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 .cse21 .cse38 .cse5 .cse22 .cse25))))))) [2018-12-08 09:48:22,701 INFO L444 ceAbstractionStarter]: At program point L301(lines 269 306) the Hoare annotation is: (let ((.cse36 (<= 2 ~comp_m1_st~0)) (.cse35 (= ~z_val~0 ~z_val_t~0)) (.cse38 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse39 (= ~z_req_up~0 |old(~z_req_up~0)|))) (let ((.cse32 (and .cse35 .cse38 .cse39)) (.cse29 (< ~d1_ev~0 2)) (.cse28 (< 0 ~b0_ev~0)) (.cse37 (and .cse38 .cse39)) (.cse9 (< ~b0_ev~0 2)) (.cse23 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse26 (= |old(~z_req_up~0)| 1)) (.cse11 (= ~b1_ev~0 0)) (.cse30 (< |old(~comp_m1_st~0)| 2)) (.cse14 (= ~b1_ev~0 1)) (.cse27 (< ~d0_ev~0 2)) (.cse0 (and .cse36 .cse35)) (.cse17 (= ~b0_req_up~0 1)) (.cse18 (< 0 ~comp_m1_i~0)) (.cse20 (not (= 0 |old(~comp_m1_st~0)|))) (.cse4 (< ~b1_val_t~0 1)) (.cse21 (< 0 ~d0_ev~0)) (.cse7 (= 0 ~d0_ev~0)) (.cse33 (< ~b1_ev~0 2)) (.cse8 (= ~b1_req_up~0 1)) (.cse2 (< ~b1_val~0 ~b1_val_t~0)) (.cse25 (= 0 ~b0_ev~0)) (.cse5 (< ~d0_val_t~0 1)) (.cse10 (< 0 |old(~z_req_up~0)|)) (.cse6 (< ~b0_val~0 ~b0_val_t~0)) (.cse12 (= 0 ~d1_ev~0)) (.cse24 (< ~b0_val_t~0 1)) (.cse13 (< ~d1_val_t~0 1)) (.cse15 (< ~z_ev~0 2)) (.cse16 (< 0 ~z_val~0)) (.cse31 (not (= 0 |old(~z_val_t~0)|))) (.cse1 (< ~d1_val~0 ~d1_val_t~0)) (.cse34 (= 1 ~b0_ev~0)) (.cse3 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse19 (< ~z_val~0 0)) (.cse22 (= 1 ~d1_ev~0))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (or .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse23 .cse24) (or (and (or .cse1 .cse2 (or .cse8 .cse25 .cse26 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse17 .cse18 .cse19 .cse20 .cse22) .cse3 .cse4 .cse5 .cse6 .cse28 .cse24) (or .cse1 .cse2 .cse4 (or (or .cse8 .cse9 .cse26 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse27 .cse17 .cse18 .cse19 .cse20 .cse22) .cse3 .cse5 .cse6 .cse24))) .cse23))) (or .cse26 .cse11 .cse17 .cse18 .cse4 .cse29 .cse21 .cse7 .cse8 .cse2 .cse25 .cse5 .cse6 .cse28 .cse30 .cse24 .cse13 .cse15 .cse14 .cse16 .cse31 .cse1 .cse3 .cse19 .cse32) (or .cse32 .cse26 .cse17 .cse18 .cse4 .cse21 .cse7 .cse33 .cse8 .cse2 .cse25 .cse5 .cse6 .cse12 .cse30 .cse24 .cse13 .cse15 .cse16 .cse31 .cse1 .cse34 .cse3 .cse19 .cse22) (or (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (or .cse8 .cse25 .cse26 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) .cse28 .cse24) .cse0) (or (and .cse35 .cse36) (and (or (and (or .cse3 .cse5 .cse6 (or .cse8 .cse9 .cse26 .cse11 .cse13 .cse14 .cse15 .cse16 .cse27 .cse17 .cse18 .cse19 .cse20 .cse29) .cse24) (or (or .cse8 .cse25 .cse26 .cse11 .cse13 .cse14 .cse15 .cse16 .cse27 .cse17 .cse18 .cse19 .cse20 .cse29) .cse3 .cse5 .cse6 .cse28 .cse24)) .cse1 .cse2 .cse4) (or .cse1 .cse2 .cse3 .cse4 (or .cse8 .cse9 .cse26 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse29 .cse21) .cse5 .cse6 .cse7 .cse24))) (or (or .cse26 (< 1 ~d1_ev~0) .cse11 .cse17 .cse18 .cse4 .cse21 .cse7 (< 1 ~b1_ev~0) .cse8 .cse2 .cse25 .cse5 .cse6 .cse28 .cse12 .cse30 .cse24 .cse13 .cse15 .cse14 .cse16 .cse1 .cse3 .cse19 .cse22) .cse37) (or .cse11 .cse17 .cse18 .cse4 .cse21 .cse7 .cse8 .cse2 .cse25 .cse5 .cse10 .cse6 .cse28 .cse12 .cse30 .cse24 .cse13 .cse15 .cse14 .cse16 .cse31 .cse35 .cse1 .cse3 .cse19 .cse22) (or (and .cse37 .cse35) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse23 (or .cse8 .cse9 .cse26 .cse11 .cse12 .cse30 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) .cse24) (or .cse1 .cse2 .cse4 .cse23 (or .cse8 .cse25 .cse5 .cse26 .cse6 .cse11 .cse12 .cse30 .cse24 .cse13 .cse14 .cse15 .cse16 .cse27 .cse17 .cse18 .cse34 .cse3 .cse19 .cse22)))) (or .cse0 .cse17 .cse18 .cse20 .cse4 .cse21 .cse7 .cse33 .cse8 .cse2 .cse25 .cse5 .cse10 .cse6 .cse12 .cse24 .cse13 .cse15 .cse16 .cse31 .cse1 .cse34 .cse3 .cse19 .cse22)))) [2018-12-08 09:48:22,701 INFO L444 ceAbstractionStarter]: At program point update_d0ENTRY(lines 153 167) the Hoare annotation is: (let ((.cse1 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse2 (= ~d0_req_up~0 1))) (let ((.cse7 (< ~d1_ev~0 2)) (.cse20 (= ~b1_ev~0 0)) (.cse16 (= ~b1_ev~0 1)) (.cse3 (< |old(~d0_ev~0)| 2)) (.cse0 (not (= |old(~d0_req_up~0)| 1))) (.cse4 (= ~b0_req_up~0 1)) (.cse5 (< 0 ~comp_m1_i~0)) (.cse6 (< ~b1_val_t~0 1)) (.cse21 (< 0 |old(~d0_ev~0)|)) (.cse22 (= 0 |old(~d0_ev~0)|)) (.cse8 (= ~b1_req_up~0 1)) (.cse9 (< ~b1_val~0 ~b1_val_t~0)) (.cse23 (= 0 ~b0_ev~0)) (.cse10 (< ~d0_val_t~0 1)) (.cse11 (< ~b0_val~0 ~b0_val_t~0)) (.cse12 (< 0 ~b0_ev~0)) (.cse26 (and (= ~d0_val~0 ~d0_val_t~0) .cse1 .cse2)) (.cse28 (= 0 ~d1_ev~0)) (.cse24 (< ~comp_m1_st~0 2)) (.cse13 (< ~b0_val_t~0 1)) (.cse14 (< ~d1_val_t~0 1)) (.cse15 (< ~z_ev~0 2)) (.cse17 (< 0 ~z_val~0)) (.cse18 (not (= 0 ~z_val_t~0))) (.cse25 (< ~d1_val~0 ~d1_val_t~0)) (.cse27 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse19 (< ~z_val~0 0)) (.cse29 (= 1 ~d1_ev~0))) (and (or .cse0 (and (= 0 ~d0_val~0) .cse1 .cse2) .cse3 .cse4 .cse5 (not (= 0 ~comp_m1_st~0)) .cse6 .cse7 (< 0 ~d1_val~0) .cse8 .cse9 .cse10 (< 0 ~z_req_up~0) .cse11 .cse12 .cse13 (not (= |old(~d0_val~0)| 0)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (not (= 1 ~d1_req_up~0))) (or .cse0 .cse20 .cse4 .cse5 .cse6 .cse7 .cse21 .cse22 .cse8 .cse9 .cse23 .cse10 .cse11 .cse12 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse26 .cse27 .cse19) (or (or .cse0 (= ~z_req_up~0 1) (< 1 ~d1_ev~0) .cse20 .cse4 .cse5 .cse6 .cse21 .cse22 (< 1 ~b1_ev~0) .cse8 .cse9 .cse23 .cse10 .cse11 .cse12 .cse28 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse27 .cse19 .cse29) .cse26) (or (and (and .cse2 (= ~d0_val_t~0 ~d0_val~0)) (= ~d0_ev~0 |old(~d0_ev~0)|)) (let ((.cse30 (not (= ~z_val~0 ~z_val_t~0)))) (and (or .cse25 .cse9 .cse27 .cse6 .cse10 .cse11 .cse22 (or .cse0 .cse8 (< ~b0_ev~0 2) .cse20 .cse28 .cse24 .cse14 .cse16 .cse15 .cse17 .cse4 .cse5 .cse19 .cse21 .cse29) .cse30 .cse13) (or .cse25 .cse9 .cse6 .cse30 (or .cse0 .cse8 .cse23 .cse10 .cse11 .cse20 .cse28 .cse24 .cse13 .cse14 .cse16 .cse15 .cse17 .cse3 .cse4 .cse5 (= 1 ~b0_ev~0) .cse27 .cse19 .cse29))))) (or .cse0 .cse4 .cse5 .cse6 .cse21 .cse22 (< ~b1_ev~0 2) .cse8 .cse9 .cse23 .cse10 .cse11 .cse12 .cse26 .cse28 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse25 .cse27 .cse19 .cse29)))) [2018-12-08 09:48:22,701 INFO L448 ceAbstractionStarter]: For program point L157-1(lines 157 162) no Hoare annotation was computed. [2018-12-08 09:48:22,701 INFO L448 ceAbstractionStarter]: For program point update_d0FINAL(lines 153 167) no Hoare annotation was computed. [2018-12-08 09:48:22,701 INFO L448 ceAbstractionStarter]: For program point update_d0EXIT(lines 153 167) no Hoare annotation was computed. [2018-12-08 09:48:22,701 INFO L448 ceAbstractionStarter]: For program point L142-1(lines 142 147) no Hoare annotation was computed. [2018-12-08 09:48:22,701 INFO L448 ceAbstractionStarter]: For program point update_b1EXIT(lines 138 152) no Hoare annotation was computed. [2018-12-08 09:48:22,701 INFO L444 ceAbstractionStarter]: At program point update_b1ENTRY(lines 138 152) the Hoare annotation is: (or (not (= ~d0_req_up~0 1)) (< ~d0_ev~0 2) (= ~b0_req_up~0 1) (< 0 ~comp_m1_i~0) (not (= 0 ~comp_m1_st~0)) (< ~b1_val_t~0 1) (< ~d1_ev~0 2) (< ~d1_req_up~0 |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (< 0 ~d1_val~0) (< ~d0_val_t~0 1) (< 0 ~z_req_up~0) (< ~b0_val~0 ~b0_val_t~0) (< 0 ~b0_ev~0) (< ~b0_val_t~0 1) (not (= ~d0_val~0 0)) (< ~d1_val_t~0 1) (< ~z_ev~0 2) (< 0 ~z_val~0) (not (= 0 ~z_val_t~0)) (< |old(~b1_req_up~0)| ~d1_req_up~0) (< ~z_val~0 0) (not (= 1 ~d1_req_up~0)) (and (= 1 ~b1_req_up~0) (= |old(~b1_ev~0)| ~b1_ev~0))) [2018-12-08 09:48:22,701 INFO L448 ceAbstractionStarter]: For program point update_b1FINAL(lines 138 152) no Hoare annotation was computed. [2018-12-08 09:48:22,702 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 127 132) no Hoare annotation was computed. [2018-12-08 09:48:22,702 INFO L448 ceAbstractionStarter]: For program point update_b0EXIT(lines 123 137) no Hoare annotation was computed. [2018-12-08 09:48:22,702 INFO L444 ceAbstractionStarter]: At program point update_b0ENTRY(lines 123 137) the Hoare annotation is: (or (not (= ~d0_req_up~0 1)) (< ~d0_ev~0 2) (< 0 ~comp_m1_i~0) (not (= 0 ~comp_m1_st~0)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (< ~d1_ev~0 2) (< ~d1_req_up~0 ~b1_req_up~0) (< ~b1_ev~0 2) (< 0 ~d1_val~0) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 ~z_req_up~0) (< |old(~b0_req_up~0)| ~d1_req_up~0) (< ~b0_val_t~0 1) (not (= ~d0_val~0 0)) (and (= ~b0_req_up~0 1) (= |old(~b0_ev~0)| ~b0_ev~0) (= |old(~b0_val~0)| ~b0_val~0)) (< ~d1_val_t~0 1) (< ~z_ev~0 2) (< 0 ~z_val~0) (not (= 0 ~z_val_t~0)) (<= (+ ~d1_req_up~0 1) |old(~b0_req_up~0)|) (< ~b1_req_up~0 ~d1_req_up~0) (< ~z_val~0 0) (not (= 1 ~d1_req_up~0))) [2018-12-08 09:48:22,702 INFO L448 ceAbstractionStarter]: For program point update_b0FINAL(lines 123 137) no Hoare annotation was computed. [2018-12-08 09:48:22,702 INFO L444 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (let ((.cse20 (not (= ~b0_ev~0 0))) (.cse21 (not (= ~d1_ev~0 0))) (.cse22 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse9 (= ~z_val~0 |old(~z_val~0)|)) (.cse11 (and (not (= ~b1_ev~0 0)) .cse20 (<= ~b1_ev~0 1) .cse21 .cse22)) (.cse4 (<= 2 ~comp_m1_st~0)) (.cse5 (not (= 1 ~b1_req_up~0))) (.cse6 (not (= ~b0_req_up~0 1))) (.cse7 (<= ~d1_ev~0 1)) (.cse13 (and (<= |old(~b1_ev~0)| ~b1_ev~0) .cse20 .cse21 (<= 2 ~b1_ev~0) .cse22)) (.cse1 (<= ~b0_val_t~0 ~b0_val~0)) (.cse18 (= 0 ~z_val_t~0)) (.cse2 (= ~z_val~0 ~z_val_t~0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse15 (= ~d0_val~0 ~d0_val_t~0)) (.cse19 (<= ~d0_ev~0 0)) (.cse0 (not (= ~d0_ev~0 0))) (.cse17 (<= ~b0_ev~0 0)) (.cse3 (<= ~b1_val_t~0 ~b1_val~0)) (.cse12 (= ~z_req_up~0 |old(~z_req_up~0)|))) (or (and .cse0 (= ~d0_val_t~0 ~d0_val~0) .cse1 .cse2 .cse3 (let ((.cse8 (= ~b0_ev~0 1)) (.cse10 (<= ~d0_ev~0 1))) (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse4 .cse5 .cse6 .cse7 .cse13 .cse8 .cse9 .cse10 .cse12))) .cse14) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (and .cse2 (let ((.cse16 (= 1 ~d0_ev~0))) (or (and .cse4 .cse5 .cse6 .cse7 .cse1 .cse9 .cse14 .cse15 .cse16 .cse17 .cse3 .cse11 .cse12) (and .cse4 .cse5 .cse6 .cse7 .cse13 .cse1 .cse9 .cse14 .cse15 .cse16 .cse17 .cse3 .cse12)))) (< ~b0_val_t~0 1) (and .cse4 .cse5 .cse6 .cse7 .cse1 .cse18 .cse2 .cse14 .cse15 .cse19 .cse0 .cse17 .cse3 .cse11 .cse12) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (and .cse4 .cse5 .cse6 .cse7 .cse13 .cse1 .cse18 .cse2 .cse14 .cse15 .cse19 .cse0 .cse17 .cse3 .cse12) (not (= 1 |old(~d1_req_up~0)|)) (not (= |old(~d0_req_up~0)| 1)) (< |old(~d0_ev~0)| 2) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|)))) [2018-12-08 09:48:22,702 INFO L444 ceAbstractionStarter]: At program point L415(line 415) the Hoare annotation is: (or (not (= |old(~d0_req_up~0)| 1)) (< |old(~d0_ev~0)| 2) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (< ~b0_val_t~0 1) (not (= |old(~d0_val~0)| 0)) (and (= ~z_val~0 ~z_val_t~0) (= |old(~d0_ev~0)| ~d0_ev~0) (= |old(~b1_ev~0)| ~b1_ev~0) (<= ~d1_req_up~0 ~b1_req_up~0) (<= ~d1_req_up~0 ~b0_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (= ~z_req_up~0 |old(~z_req_up~0)|) (<= ~b1_req_up~0 ~d1_req_up~0) (= 0 ~comp_m1_st~0) (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (= |old(~b0_ev~0)| ~b0_ev~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (= |old(~b0_val~0)| ~b0_val~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= ~d0_req_up~0 1) (<= |old(~z_ev~0)| ~z_ev~0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (< 0 |old(~z_val~0)|) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (< |old(~z_val~0)| 0) (not (= 1 |old(~d1_req_up~0)|))) [2018-12-08 09:48:22,703 INFO L444 ceAbstractionStarter]: At program point L415-1(line 415) the Hoare annotation is: (let ((.cse0 (not (= 1 ~b1_req_up~0))) (.cse1 (not (= ~d1_ev~0 1))) (.cse2 (not (= ~b0_req_up~0 1))) (.cse3 (<= ~d1_ev~0 1)) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse5 (= 0 ~z_val_t~0)) (.cse6 (= ~z_val~0 ~z_val_t~0)) (.cse7 (<= ~d1_val_t~0 ~d1_val~0)) (.cse8 (= ~d0_val~0 ~d0_val_t~0)) (.cse9 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse10 (<= ~d0_ev~0 0)) (.cse11 (<= ~b0_ev~0 0)) (.cse12 (<= ~b1_val_t~0 ~b1_val~0)) (.cse13 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse14 (<= |old(~z_ev~0)| ~z_ev~0))) (or (not (= |old(~d0_req_up~0)| 1)) (< |old(~d0_ev~0)| 2) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |old(~b1_ev~0)| ~b1_ev~0) .cse13 .cse14) (< 0 |old(~b0_val~0)|) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (< 0 |old(~d1_val~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~b1_ev~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~b1_ev~0 1) .cse13 .cse14) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (< ~b0_val_t~0 1) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (< 0 |old(~z_val~0)|) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (< |old(~z_val~0)| 0) (not (= 1 |old(~d1_req_up~0)|)))) [2018-12-08 09:48:22,703 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 408 450) no Hoare annotation was computed. [2018-12-08 09:48:22,703 INFO L444 ceAbstractionStarter]: At program point L436(line 436) the Hoare annotation is: (let ((.cse10 (<= ~d0_ev~0 1)) (.cse14 (not (= ~d0_ev~0 1))) (.cse27 (<= 2 ~d1_ev~0)) (.cse12 (not (= ~b1_ev~0 0))) (.cse13 (not (= ~b0_ev~0 0))) (.cse15 (<= ~b1_ev~0 1)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (not (= ~d1_ev~0 0)))) (let ((.cse21 (and .cse12 (<= 2 ~d0_ev~0) .cse13 .cse15 .cse16 .cse17)) (.cse25 (<= 2 ~b1_ev~0)) (.cse7 (<= ~b0_ev~0 0)) (.cse11 (not (= ~d1_ev~0 1))) (.cse1 (= ~d0_val~0 ~d0_val_t~0)) (.cse26 (= 0 ~z_val_t~0)) (.cse20 (= ~z_val~0 ~z_val_t~0)) (.cse22 (not (= ~b0_ev~0 1))) (.cse9 (<= 2 ~comp_m1_st~0)) (.cse23 (and .cse10 .cse12 .cse13 .cse14 .cse27 .cse15 .cse16)) (.cse6 (not (= ~d0_ev~0 0))) (.cse28 (= ~d0_val_t~0 ~d0_val~0)) (.cse0 (not (= 1 ~b1_req_up~0))) (.cse2 (not (= ~b0_req_up~0 1))) (.cse3 (not (= ~z_req_up~0 1))) (.cse29 (<= 2 ~b0_ev~0)) (.cse24 (= 0 ~comp_m1_st~0)) (.cse5 (= ~z_val~0 |old(~z_val~0)|)) (.cse18 (not (= ~b1_ev~0 1))) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse19 (<= ~d1_val_t~0 ~d1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 (<= ~d1_ev~0 1) .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 .cse19) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (and .cse20 .cse8 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse9 .cse11 .cse21) .cse22 .cse18) .cse19) (< ~b0_val_t~0 1) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (and .cse6 .cse1 .cse4 .cse8 .cse19 (and .cse23 .cse0 .cse2 .cse3 .cse24 .cse5 .cse22 .cse18)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse9 .cse11 .cse13 .cse14 .cse16 .cse17 .cse25) .cse6 .cse26 .cse20 .cse22 .cse8 .cse19) (not (= 1 |old(~d1_req_up~0)|)) (and .cse8 (and .cse1 .cse4 (and .cse0 .cse2 (and (and .cse27 .cse21) .cse24) .cse3 .cse22 .cse18 .cse5)) .cse19) (not (= |old(~d0_req_up~0)| 1)) (and (and (and .cse13 .cse14 .cse27 .cse16 .cse25) .cse0 .cse2 .cse3 .cse24 .cse5) .cse6 .cse1 .cse7 .cse4 .cse8 .cse19) (and .cse6 .cse28 .cse4 .cse20 .cse8 (and .cse9 .cse0 .cse11 .cse2 .cse3 .cse29 .cse5 .cse12 .cse14 .cse18 .cse16 .cse17) .cse19) (< |old(~d0_ev~0)| 2) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse26 .cse20 .cse22 .cse8 (and .cse9 .cse23) .cse18 .cse19) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (and .cse6 .cse28 (and .cse0 .cse2 .cse3 .cse29 .cse27 .cse24 .cse5 .cse12 .cse14 .cse18 .cse16) .cse4 .cse8 .cse19) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|)))) [2018-12-08 09:48:22,703 INFO L444 ceAbstractionStarter]: At program point L434(line 434) the Hoare annotation is: (let ((.cse11 (= 0 ~z_val_t~0)) (.cse12 (= ~z_val~0 ~z_val_t~0)) (.cse13 (not (= ~b0_ev~0 1))) (.cse4 (not (= ~d0_ev~0 1))) (.cse1 (<= 2 ~comp_m1_st~0)) (.cse0 (not (= 1 ~b1_req_up~0))) (.cse2 (not (= ~d1_ev~0 1))) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~z_req_up~0 1))) (.cse9 (<= ~b0_val_t~0 ~b0_val~0)) (.cse16 (= ~z_val~0 |old(~z_val~0)|)) (.cse3 (not (= ~b0_ev~0 0))) (.cse18 (not (= ~b1_ev~0 1))) (.cse15 (<= ~d1_val_t~0 ~d1_val~0)) (.cse6 (= ~d0_val~0 ~d0_val_t~0)) (.cse10 (not (= ~d0_ev~0 0))) (.cse17 (not (= ~b1_ev~0 0))) (.cse14 (<= ~b1_val_t~0 ~b1_val~0)) (.cse5 (<= 2 ~z_ev~0))) (or (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~b1_ev~0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (< ~b0_val_t~0 1) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (not (= 1 |old(~d1_req_up~0)|)) (and (and .cse1 .cse0 .cse2 .cse6 .cse7 (<= 2 ~d0_ev~0) .cse8 .cse9 .cse16 .cse17 .cse3 .cse13 .cse18 .cse5) .cse12 .cse14 .cse15) (not (= |old(~d0_req_up~0)| 1)) (< |old(~d0_ev~0)| 2) (and .cse10 (= ~d0_val_t~0 ~d0_val~0) (and .cse1 .cse0 .cse2 .cse7 .cse8 (<= 2 ~b0_ev~0) .cse16 .cse17 .cse4 .cse18 .cse5) .cse9 .cse12 .cse14 .cse15) (and .cse0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse1 (and .cse17 .cse3 .cse4 (<= 2 ~d1_ev~0) .cse5)) .cse18 .cse15) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (and .cse1 .cse0 .cse2 .cse7 (<= ~d1_ev~0 1) .cse8 .cse9 .cse16 .cse3 .cse18 .cse15 .cse6 (<= ~d0_ev~0 0) .cse10 .cse17 (<= ~b0_ev~0 0) .cse14 (<= ~b1_ev~0 1) .cse5))) [2018-12-08 09:48:22,705 INFO L444 ceAbstractionStarter]: At program point L434-1(line 434) the Hoare annotation is: (let ((.cse5 (= ~z_val~0 |old(~z_val~0)|)) (.cse13 (not (= ~d1_ev~0 0))) (.cse0 (not (= 1 ~b1_req_up~0))) (.cse1 (= ~d0_val~0 ~d0_val_t~0)) (.cse2 (not (= ~b0_req_up~0 1))) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse6 (not (= ~d0_ev~0 0))) (.cse18 (= 0 ~z_val_t~0)) (.cse17 (= ~z_val~0 ~z_val_t~0)) (.cse16 (not (= ~b0_ev~0 1))) (.cse7 (<= ~b1_val_t~0 ~b1_val~0)) (.cse8 (<= 2 ~comp_m1_st~0)) (.cse9 (not (= ~b1_ev~0 0))) (.cse10 (not (= ~b0_ev~0 0))) (.cse11 (not (= ~d0_ev~0 1))) (.cse12 (<= 2 ~z_ev~0)) (.cse14 (not (= ~b1_ev~0 1))) (.cse15 (<= ~d1_val_t~0 ~d1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~b0_ev~0 0) .cse7 (and .cse8 (<= ~d0_ev~0 1) .cse9 (<= ~d1_ev~0 1) .cse10 .cse11 (<= ~b1_ev~0 1) .cse12 .cse13) .cse14 .cse15) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (and .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse8 (= 1 ~d1_ev~0) .cse9 .cse10 .cse11 .cse12) .cse5 .cse6 .cse16 .cse7 .cse14 .cse15) (and .cse17 .cse7 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse8 (and .cse9 (<= 2 ~d0_ev~0) .cse10 .cse12 .cse13)) .cse16 .cse14) .cse15) (< ~b0_val_t~0 1) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse8 .cse10 .cse11 .cse12 .cse13 (<= 2 ~b1_ev~0)) .cse6 .cse18 .cse17 .cse16 .cse7 .cse15) (not (= 1 |old(~d1_req_up~0)|)) (not (= |old(~d0_req_up~0)| 1)) (and .cse6 (= ~d0_val_t~0 ~d0_val~0) .cse4 .cse17 .cse7 (and .cse8 .cse0 .cse2 .cse3 (<= 2 ~b0_ev~0) .cse5 .cse9 .cse11 .cse14 .cse12 .cse13) .cse15) (< |old(~d0_ev~0)| 2) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse18 .cse17 .cse16 .cse7 (and .cse8 (and .cse9 .cse10 .cse11 (<= 2 ~d1_ev~0) .cse12)) .cse14 .cse15) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|))) [2018-12-08 09:48:22,708 INFO L444 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (let ((.cse4 (= ~z_val~0 |old(~z_val~0)|)) (.cse9 (not (= ~b1_ev~0 0))) (.cse14 (not (= ~b1_ev~0 1))) (.cse0 (not (= 1 ~b1_req_up~0))) (.cse1 (= ~d0_val~0 ~d0_val_t~0)) (.cse2 (not (= ~b0_req_up~0 1))) (.cse3 (<= ~b0_val_t~0 ~b0_val~0)) (.cse7 (<= 2 ~comp_m1_st~0)) (.cse8 (not (= ~d1_ev~0 1))) (.cse10 (not (= ~b0_ev~0 0))) (.cse11 (not (= ~d0_ev~0 1))) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (not (= ~d1_ev~0 0))) (.cse5 (not (= ~d0_ev~0 0))) (.cse16 (= 0 ~z_val_t~0)) (.cse17 (= ~z_val~0 ~z_val_t~0)) (.cse18 (not (= ~b0_ev~0 1))) (.cse6 (<= ~b1_val_t~0 ~b1_val~0)) (.cse15 (<= ~d1_val_t~0 ~d1_val~0))) (or (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 (<= ~b0_ev~0 0) .cse6 (and .cse7 (<= ~d0_ev~0 1) .cse8 .cse9 (<= ~d1_ev~0 1) .cse10 .cse11 (<= ~b1_ev~0 1) .cse12 .cse13) .cse14 .cse15) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse16 .cse17 .cse18 .cse6 (and .cse7 (and .cse9 .cse10 .cse11 (<= 2 ~d1_ev~0) .cse12)) .cse14 .cse15) (< ~b0_val_t~0 1) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (not (= 1 |old(~d1_req_up~0)|)) (not (= |old(~d0_req_up~0)| 1)) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse7 .cse8 (and .cse9 (<= 2 ~d0_ev~0) .cse10 .cse12 .cse13)) .cse18 .cse14) .cse17 .cse6 .cse15) (and .cse5 (= ~d0_val_t~0 ~d0_val~0) .cse3 .cse17 (and .cse7 .cse0 .cse8 .cse2 (<= 2 ~b0_ev~0) .cse4 .cse9 .cse11 .cse14 .cse12 .cse13) .cse6 .cse15) (< |old(~d0_ev~0)| 2) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (and .cse0 .cse1 .cse2 .cse3 (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 (<= 2 ~b1_ev~0)) .cse5 .cse16 .cse17 .cse18 .cse6 .cse15))) [2018-12-08 09:48:22,712 INFO L448 ceAbstractionStarter]: For program point L430-1(line 430) no Hoare annotation was computed. [2018-12-08 09:48:22,712 INFO L444 ceAbstractionStarter]: At program point L426(line 426) the Hoare annotation is: (let ((.cse27 (<= 2 ~d0_ev~0)) (.cse17 (not (= ~d1_ev~0 0))) (.cse10 (<= ~d0_ev~0 1)) (.cse12 (not (= ~b1_ev~0 0))) (.cse13 (not (= ~b0_ev~0 0))) (.cse14 (not (= ~d0_ev~0 1))) (.cse22 (<= 2 ~d1_ev~0)) (.cse15 (<= ~b1_ev~0 1)) (.cse16 (<= 2 ~z_ev~0))) (let ((.cse7 (<= ~b0_ev~0 0)) (.cse9 (<= 2 ~comp_m1_st~0)) (.cse29 (and .cse10 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16)) (.cse25 (and .cse12 .cse27 .cse13 .cse15 .cse16 .cse17 (<= ~comp_m1_i~0 0))) (.cse3 (not (= ~z_req_up~0 1))) (.cse20 (= ~d0_val_t~0 ~d0_val~0)) (.cse21 (<= 2 ~b0_ev~0)) (.cse5 (= ~z_val~0 |old(~z_val~0)|)) (.cse18 (not (= ~b1_ev~0 1))) (.cse0 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_ev~0 1))) (.cse2 (not (= ~b0_req_up~0 1))) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse23 (= 0 ~comp_m1_st~0)) (.cse30 (= 0 ~z_val_t~0)) (.cse24 (= ~z_val~0 ~z_val_t~0)) (.cse19 (<= ~d1_val_t~0 ~d1_val~0)) (.cse1 (= ~d0_val~0 ~d0_val_t~0)) (.cse28 (<= 2 ~b1_ev~0)) (.cse6 (not (= ~d0_ev~0 0))) (.cse26 (not (= ~b0_ev~0 1))) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse31 (= ~z_req_up~0 |old(~z_req_up~0)|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 (<= ~d1_ev~0 1) .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 .cse19) (and .cse6 .cse20 .cse4 .cse8 (and .cse0 .cse2 .cse3 .cse21 .cse22 .cse23 .cse5 .cse12 .cse14 .cse18 .cse16) .cse19) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (and .cse24 .cse8 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse9 .cse11 .cse25) .cse26 .cse18) .cse19) (< ~b0_val_t~0 1) (and .cse24 (or (and (and .cse1 .cse4 (and (and .cse11 .cse23 (and .cse27 .cse13 .cse16 .cse17 .cse28)) .cse0 .cse2 .cse3 .cse26 .cse5)) .cse8 .cse19) (and .cse1 .cse4 .cse8 (and (and .cse11 .cse23 .cse25) .cse0 .cse2 .cse3 .cse26 .cse18 .cse5) .cse19))) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (and .cse6 .cse1 .cse4 .cse8 .cse19 (and .cse29 .cse0 .cse2 .cse3 .cse23 .cse5 .cse26 .cse18)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse9 .cse11 .cse13 .cse14 .cse16 .cse17 .cse28) .cse6 .cse30 .cse24 .cse26 .cse8 .cse19) (not (= 1 |old(~d1_req_up~0)|)) (not (= |old(~d0_req_up~0)| 1)) (and (and (and .cse13 .cse14 .cse22 .cse16 .cse28) .cse0 .cse2 .cse3 .cse23 .cse5) .cse6 .cse1 .cse7 .cse4 .cse8 .cse19) (and .cse6 .cse20 .cse4 .cse24 .cse8 (and .cse9 .cse0 .cse11 .cse2 .cse3 .cse21 .cse5 .cse12 .cse14 .cse18 .cse16 .cse17) .cse19) (< |old(~d0_ev~0)| 2) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse30 .cse24 .cse26 .cse8 (and .cse9 .cse29) .cse18 .cse19) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (and (and .cse1 .cse4 (and (and (and .cse22 .cse25) .cse23) .cse0 .cse2 .cse3 .cse26 .cse18 .cse5)) .cse8 .cse19) (and .cse6 .cse20 (and .cse0 .cse11 .cse2 .cse21 .cse23 .cse5 .cse12 .cse14 .cse18 .cse16 .cse17 .cse31) .cse4 .cse24 .cse8 .cse19) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (and .cse0 .cse11 .cse2 .cse4 .cse23 .cse30 .cse24 .cse13 .cse17 .cse19 .cse1 .cse28 (<= ~d0_ev~0 0) .cse6 .cse26 .cse8 .cse16 .cse31)))) [2018-12-08 09:48:22,714 INFO L448 ceAbstractionStarter]: For program point L426-1(line 426) no Hoare annotation was computed. [2018-12-08 09:48:22,715 INFO L444 ceAbstractionStarter]: At program point L422-1(lines 419 444) the Hoare annotation is: (let ((.cse27 (<= 2 ~d0_ev~0)) (.cse17 (not (= ~d1_ev~0 0))) (.cse10 (<= ~d0_ev~0 1)) (.cse12 (not (= ~b1_ev~0 0))) (.cse13 (not (= ~b0_ev~0 0))) (.cse14 (not (= ~d0_ev~0 1))) (.cse22 (<= 2 ~d1_ev~0)) (.cse15 (<= ~b1_ev~0 1)) (.cse16 (<= 2 ~z_ev~0))) (let ((.cse7 (<= ~b0_ev~0 0)) (.cse9 (<= 2 ~comp_m1_st~0)) (.cse29 (and .cse10 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16)) (.cse25 (and .cse12 .cse27 .cse13 .cse15 .cse16 .cse17 (<= ~comp_m1_i~0 0))) (.cse3 (not (= ~z_req_up~0 1))) (.cse20 (= ~d0_val_t~0 ~d0_val~0)) (.cse21 (<= 2 ~b0_ev~0)) (.cse5 (= ~z_val~0 |old(~z_val~0)|)) (.cse18 (not (= ~b1_ev~0 1))) (.cse0 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_ev~0 1))) (.cse2 (not (= ~b0_req_up~0 1))) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse23 (= 0 ~comp_m1_st~0)) (.cse30 (= 0 ~z_val_t~0)) (.cse24 (= ~z_val~0 ~z_val_t~0)) (.cse19 (<= ~d1_val_t~0 ~d1_val~0)) (.cse1 (= ~d0_val~0 ~d0_val_t~0)) (.cse28 (<= 2 ~b1_ev~0)) (.cse6 (not (= ~d0_ev~0 0))) (.cse26 (not (= ~b0_ev~0 1))) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse31 (= ~z_req_up~0 |old(~z_req_up~0)|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 (<= ~d1_ev~0 1) .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 .cse19) (and .cse6 .cse20 .cse4 .cse8 (and .cse0 .cse2 .cse3 .cse21 .cse22 .cse23 .cse5 .cse12 .cse14 .cse18 .cse16) .cse19) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (and .cse24 .cse8 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse9 .cse11 .cse25) .cse26 .cse18) .cse19) (< ~b0_val_t~0 1) (and .cse24 (or (and (and .cse1 .cse4 (and (and .cse11 .cse23 (and .cse27 .cse13 .cse16 .cse17 .cse28)) .cse0 .cse2 .cse3 .cse26 .cse5)) .cse8 .cse19) (and .cse1 .cse4 .cse8 (and (and .cse11 .cse23 .cse25) .cse0 .cse2 .cse3 .cse26 .cse18 .cse5) .cse19))) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (and .cse6 .cse1 .cse4 .cse8 .cse19 (and .cse29 .cse0 .cse2 .cse3 .cse23 .cse5 .cse26 .cse18)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse9 .cse11 .cse13 .cse14 .cse16 .cse17 .cse28) .cse6 .cse30 .cse24 .cse26 .cse8 .cse19) (not (= 1 |old(~d1_req_up~0)|)) (not (= |old(~d0_req_up~0)| 1)) (and (and (and .cse13 .cse14 .cse22 .cse16 .cse28) .cse0 .cse2 .cse3 .cse23 .cse5) .cse6 .cse1 .cse7 .cse4 .cse8 .cse19) (and .cse6 .cse20 .cse4 .cse24 .cse8 (and .cse9 .cse0 .cse11 .cse2 .cse3 .cse21 .cse5 .cse12 .cse14 .cse18 .cse16 .cse17) .cse19) (< |old(~d0_ev~0)| 2) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse30 .cse24 .cse26 .cse8 (and .cse9 .cse29) .cse18 .cse19) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (and (and .cse1 .cse4 (and (and (and .cse22 .cse25) .cse23) .cse0 .cse2 .cse3 .cse26 .cse18 .cse5)) .cse8 .cse19) (and .cse6 .cse20 (and .cse0 .cse11 .cse2 .cse21 .cse23 .cse5 .cse12 .cse14 .cse18 .cse16 .cse17 .cse31) .cse4 .cse24 .cse8 .cse19) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (and .cse0 .cse11 .cse2 .cse4 .cse23 .cse30 .cse24 .cse13 .cse17 .cse19 .cse1 .cse28 (<= ~d0_ev~0 0) .cse6 .cse26 .cse8 .cse16 .cse31)))) [2018-12-08 09:48:22,716 INFO L444 ceAbstractionStarter]: At program point L418(line 418) the Hoare annotation is: (let ((.cse24 (not (= ~b0_ev~0 0))) (.cse25 (not (= ~d1_ev~0 0))) (.cse26 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse7 (= 1 ~d0_ev~0)) (.cse20 (<= 2 ~comp_m1_st~0)) (.cse21 (not (= ~d1_ev~0 1))) (.cse15 (= ~d0_val_t~0 ~d0_val~0)) (.cse16 (= ~b0_ev~0 1)) (.cse8 (= ~z_val~0 |old(~z_val~0)|)) (.cse14 (and (<= |old(~b1_ev~0)| ~b1_ev~0) .cse24 .cse25 (<= 2 ~b1_ev~0) .cse26)) (.cse23 (= 1 ~d1_ev~0)) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse3 (not (= ~b0_req_up~0 1))) (.cse4 (<= ~d1_ev~0 1)) (.cse22 (= ~b1_ev~0 1)) (.cse5 (<= ~b0_val_t~0 ~b0_val~0)) (.cse6 (= 0 ~comp_m1_st~0)) (.cse17 (= 0 ~z_val_t~0)) (.cse0 (= ~z_val~0 ~z_val_t~0)) (.cse12 (<= ~d1_val_t~0 ~d1_val~0)) (.cse2 (= ~d0_val~0 ~d0_val_t~0)) (.cse18 (<= ~d0_ev~0 0)) (.cse19 (not (= ~d0_ev~0 0))) (.cse9 (<= ~b0_ev~0 0)) (.cse10 (<= ~b1_val_t~0 ~b1_val~0)) (.cse11 (and (not (= ~b1_ev~0 0)) .cse24 (<= ~b1_ev~0 1) .cse25 .cse26)) (.cse13 (= ~z_req_up~0 |old(~z_req_up~0)|))) (or (and .cse0 (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13))) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (< ~b0_val_t~0 1) (and .cse15 .cse1 .cse3 .cse4 .cse5 .cse16 .cse6 .cse17 .cse0 .cse12 .cse7 .cse10 .cse11 .cse13) (and .cse15 .cse1 .cse3 .cse4 .cse5 .cse16 .cse6 .cse17 .cse0 .cse12 .cse18 .cse19 .cse10 .cse11 .cse13) (and .cse20 .cse1 .cse21 .cse3 .cse4 .cse5 .cse17 .cse0 (not .cse22) .cse12 .cse2 .cse18 .cse19 .cse9 .cse10 .cse11 .cse13) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (and .cse20 .cse1 .cse21 .cse3 .cse4 .cse14 .cse5 .cse17 .cse0 .cse12 .cse2 .cse18 .cse19 .cse9 .cse10 .cse13) (not (= 1 |old(~d1_req_up~0)|)) (and .cse1 .cse3 .cse5 .cse6 .cse17 .cse0 .cse12 .cse23 .cse2 .cse18 .cse19 .cse9 .cse10 .cse11 .cse13) (not (= |old(~d0_req_up~0)| 1)) (and .cse19 .cse15 .cse5 .cse0 .cse10 (and .cse1 .cse3 .cse4 .cse14 .cse16 .cse6 .cse8 (<= ~d0_ev~0 1) .cse13) .cse12) (and .cse1 .cse3 .cse14 .cse5 .cse6 .cse17 .cse0 .cse12 .cse23 .cse2 .cse18 .cse19 .cse9 .cse10 .cse13) (< |old(~d0_ev~0)| 2) (and .cse1 .cse3 .cse4 .cse22 .cse5 .cse6 .cse17 .cse0 .cse12 .cse2 .cse18 .cse19 .cse9 .cse10 .cse11 .cse13) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|)))) [2018-12-08 09:48:22,719 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 408 450) the Hoare annotation is: (or (not (= |old(~d0_req_up~0)| 1)) (< |old(~d0_ev~0)| 2) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (< ~b0_val_t~0 1) (not (= |old(~d0_val~0)| 0)) (and (= ~z_val~0 ~z_val_t~0) (= |old(~d0_ev~0)| ~d0_ev~0) (= |old(~b1_ev~0)| ~b1_ev~0) (<= ~d1_req_up~0 ~b1_req_up~0) (<= ~d1_req_up~0 ~b0_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (= ~z_req_up~0 |old(~z_req_up~0)|) (<= ~b1_req_up~0 ~d1_req_up~0) (= 0 ~comp_m1_st~0) (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (= |old(~b0_ev~0)| ~b0_ev~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (= |old(~b0_val~0)| ~b0_val~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= ~d0_req_up~0 1) (<= |old(~z_ev~0)| ~z_ev~0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (< 0 |old(~z_val~0)|) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (< |old(~z_val~0)| 0) (not (= 1 |old(~d1_req_up~0)|))) [2018-12-08 09:48:22,721 INFO L444 ceAbstractionStarter]: At program point L416(line 416) the Hoare annotation is: (let ((.cse0 (<= 2 ~comp_m1_st~0)) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse2 (not (= ~d1_ev~0 1))) (.cse3 (not (= ~b0_req_up~0 1))) (.cse4 (<= ~d1_ev~0 1)) (.cse5 (<= ~b0_val_t~0 ~b0_val~0)) (.cse6 (= 0 ~z_val_t~0)) (.cse7 (= ~z_val~0 ~z_val_t~0)) (.cse8 (<= ~d1_val_t~0 ~d1_val~0)) (.cse9 (= ~d0_val~0 ~d0_val_t~0)) (.cse10 (<= ~d0_ev~0 0)) (.cse11 (<= ~b0_ev~0 0)) (.cse12 (<= ~b1_val_t~0 ~b1_val~0)) (.cse13 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse14 (<= |old(~z_ev~0)| ~z_ev~0))) (or (not (= |old(~d0_req_up~0)| 1)) (< |old(~d0_ev~0)| 2) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (< 0 |old(~d1_val~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~b1_ev~0 1)) .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~b1_ev~0 1) .cse13 .cse14) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |old(~b1_ev~0)| ~b1_ev~0) .cse13 .cse14) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (< ~b0_val_t~0 1) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (< 0 |old(~z_val~0)|) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (< |old(~z_val~0)| 0) (not (= 1 |old(~d1_req_up~0)|)))) [2018-12-08 09:48:22,721 INFO L444 ceAbstractionStarter]: At program point L445(lines 408 450) the Hoare annotation is: (or (not (= |old(~d0_req_up~0)| 1)) (< |old(~d0_ev~0)| 2) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (< ~b0_val_t~0 1) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (and (let ((.cse0 (and (not (= ~d1_ev~0 1)) (and (not (= ~d0_ev~0 1)) (and (and (and (not (= ~b0_ev~0 0)) (<= ~comp_m1_i~0 0)) (not (= ~b1_ev~0 0))) (not (= ~d1_ev~0 0))))))) (or (and .cse0 (= 0 ~comp_m1_st~0)) (and (<= 2 ~comp_m1_st~0) .cse0))) (not (= 1 ~b1_req_up~0)) (not (= ~b0_req_up~0 1)) (not (= ~b0_ev~0 1)) (not (= ~b1_ev~0 1)) (= ~z_val~0 |old(~z_val~0)|)) (< 0 |old(~z_val~0)|) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (< |old(~z_val~0)| 0) (not (= 1 |old(~d1_req_up~0)|))) [2018-12-08 09:48:22,721 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 443) no Hoare annotation was computed. [2018-12-08 09:48:22,723 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-12-08 09:48:22,723 INFO L444 ceAbstractionStarter]: At program point L435(line 435) the Hoare annotation is: (let ((.cse10 (not (= ~b1_ev~0 0))) (.cse25 (<= 2 ~d0_ev~0)) (.cse11 (not (= ~b0_ev~0 0))) (.cse13 (<= ~b1_ev~0 1)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (not (= ~d1_ev~0 0)))) (let ((.cse9 (not (= ~d1_ev~0 1))) (.cse22 (= 0 ~z_val_t~0)) (.cse18 (= ~z_val~0 ~z_val_t~0)) (.cse8 (<= 2 ~comp_m1_st~0)) (.cse12 (not (= ~d0_ev~0 1))) (.cse19 (and .cse10 .cse25 .cse11 .cse13 .cse14 .cse15 (<= ~comp_m1_i~0 0))) (.cse21 (<= 2 ~b1_ev~0)) (.cse0 (not (= 1 ~b1_req_up~0))) (.cse2 (not (= ~b0_req_up~0 1))) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse24 (= 0 ~comp_m1_st~0)) (.cse5 (= ~z_val~0 |old(~z_val~0)|)) (.cse16 (not (= ~b1_ev~0 1))) (.cse17 (<= ~d1_val_t~0 ~d1_val~0)) (.cse23 (= 1 ~d1_ev~0)) (.cse1 (= ~d0_val~0 ~d0_val_t~0)) (.cse6 (not (= ~d0_ev~0 0))) (.cse20 (not (= ~b0_ev~0 1))) (.cse7 (<= ~b1_val_t~0 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~b0_ev~0 0) .cse7 (and .cse8 (<= ~d0_ev~0 1) .cse9 .cse10 (<= ~d1_ev~0 1) .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (and .cse18 .cse7 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse8 .cse9 .cse19) .cse20 .cse16) .cse17) (< ~b0_val_t~0 1) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse21) .cse6 .cse22 .cse18 .cse20 .cse7 .cse17) (not (= 1 |old(~d1_req_up~0)|)) (not (= |old(~d0_req_up~0)| 1)) (and .cse6 (= ~d0_val_t~0 ~d0_val~0) .cse4 .cse18 .cse7 (and .cse8 .cse0 .cse9 .cse2 .cse3 (<= 2 ~b0_ev~0) .cse5 .cse10 .cse12 .cse16 .cse14 .cse15) .cse17) (< |old(~d0_ev~0)| 2) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse22 .cse18 .cse20 .cse7 (and .cse8 (and .cse10 .cse11 .cse12 (<= 2 ~d1_ev~0) .cse14)) .cse16 .cse17) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (and .cse7 (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse23 .cse24 .cse19) .cse20 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse23 .cse24 (and .cse25 .cse11 .cse14 .cse21)) .cse20)) .cse17) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (and .cse0 .cse2 .cse3 .cse4 .cse24 .cse5 .cse11 .cse16 .cse17 .cse23 .cse1 (<= ~d0_ev~0 0) .cse6 .cse10 .cse20 .cse7 .cse14) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|)))) [2018-12-08 09:48:22,723 INFO L448 ceAbstractionStarter]: For program point L423(line 423) no Hoare annotation was computed. [2018-12-08 09:48:22,723 INFO L444 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 307 339) the Hoare annotation is: (let ((.cse5 (= 0 |old(~d0_ev~0)|)) (.cse8 (= 0 |old(~b0_ev~0)|)) (.cse0 (= ~z_req_up~0 1)) (.cse24 (= |old(~b1_ev~0)| 0)) (.cse19 (= 1 |old(~b0_ev~0)|)) (.cse23 (< 1 |old(~d1_ev~0)|)) (.cse1 (= ~b0_req_up~0 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse3 (< ~b1_val_t~0 1)) (.cse4 (< 0 |old(~d0_ev~0)|)) (.cse6 (= ~b1_req_up~0 1)) (.cse7 (< ~b1_val~0 ~b1_val_t~0)) (.cse9 (< ~d0_val_t~0 1)) (.cse11 (< ~b0_val~0 ~b0_val_t~0)) (.cse25 (< 0 |old(~b0_ev~0)|)) (.cse12 (< ~comp_m1_st~0 2)) (.cse13 (< ~b0_val_t~0 1)) (.cse14 (< ~d1_val_t~0 1)) (.cse15 (< |old(~z_ev~0)| 2)) (.cse26 (= |old(~b1_ev~0)| 1)) (.cse16 (< 0 ~z_val~0)) (.cse17 (not (= 0 ~z_val_t~0))) (.cse18 (< ~d1_val~0 ~d1_val_t~0)) (.cse20 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse21 (< ~z_val~0 0)) (.cse10 (and (= |old(~b0_ev~0)| ~b0_ev~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= |old(~d0_ev~0)| ~d0_ev~0) (= |old(~b1_ev~0)| ~b1_ev~0) (<= |old(~z_ev~0)| ~z_ev~0))) (.cse22 (= 1 |old(~d1_ev~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< |old(~b1_ev~0)| 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse10 (or .cse0 .cse23 .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 (< 1 |old(~b1_ev~0)|) .cse6 .cse7 .cse8 .cse9 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse18 .cse20 .cse21 .cse22)) (or .cse0 .cse24 .cse1 .cse2 .cse3 (< |old(~d1_ev~0)| 2) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse20 .cse21 .cse10) (or .cse10 (let ((.cse27 (not (= ~z_val~0 ~z_val_t~0)))) (and (or (or .cse6 (< |old(~b0_ev~0)| 2) .cse0 .cse24 .cse12 .cse26 .cse15 .cse1 .cse2 .cse4 .cse22) .cse14 .cse17 .cse18 .cse7 .cse20 .cse3 .cse9 .cse11 .cse5 .cse27 .cse13) (or .cse18 .cse7 .cse3 .cse27 (or .cse6 .cse8 .cse9 .cse0 .cse11 .cse24 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 (< |old(~d0_ev~0)| 2) .cse1 .cse2 .cse19 .cse20 .cse21 .cse22))))) (or .cse23 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 (< 0 ~z_req_up~0) .cse11 .cse25 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse20 .cse21 .cse10 .cse22))) [2018-12-08 09:48:22,725 INFO L448 ceAbstractionStarter]: For program point L316-1(lines 310 338) no Hoare annotation was computed. [2018-12-08 09:48:22,725 INFO L448 ceAbstractionStarter]: For program point L331-1(lines 307 339) no Hoare annotation was computed. [2018-12-08 09:48:22,725 INFO L448 ceAbstractionStarter]: For program point L321-1(lines 310 338) no Hoare annotation was computed. [2018-12-08 09:48:22,725 INFO L448 ceAbstractionStarter]: For program point L311-1(lines 310 338) no Hoare annotation was computed. [2018-12-08 09:48:22,725 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 307 339) no Hoare annotation was computed. [2018-12-08 09:48:22,725 INFO L448 ceAbstractionStarter]: For program point L326-1(lines 310 338) no Hoare annotation was computed. [2018-12-08 09:48:22,725 INFO L444 ceAbstractionStarter]: At program point L225(line 225) the Hoare annotation is: (let ((.cse51 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse57 (<= ~d0_ev~0 1)) (.cse58 (not (= ~b0_ev~0 0))) (.cse59 (not (= ~d0_ev~0 1))) (.cse17 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse28 (<= ~b1_ev~0 1)) (.cse60 (not (= ~d1_ev~0 0))) (.cse19 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse4 (< |old(~d1_ev~0)| 2)) (.cse9 (= ~z_val~0 ~z_val_t~0)) (.cse20 (< |old(~b0_ev~0)| 2)) (.cse1 (< |old(~d0_ev~0)| 2)) (.cse34 (and (<= ~comp_m1_i~0 0) .cse51 .cse57 (not (= ~b1_ev~0 0)) .cse58 .cse59 .cse17 .cse28 (<= 2 ~z_ev~0) .cse60 .cse19)) (.cse29 (= |old(~b1_ev~0)| 0)) (.cse40 (< 1 |old(~b1_ev~0)|)) (.cse46 (= |old(~b1_ev~0)| 1)) (.cse36 (= ~d0_ev~0 |old(~d0_ev~0)|)) (.cse0 (= |old(~d0_req_up~0)| 1)) (.cse55 (= ~z_val~0 |old(~z_val~0)|)) (.cse30 (= |old(~b0_req_up~0)| ~b0_req_up~0)) (.cse31 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse32 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse10 (= |old(~d1_val~0)| ~d1_val~0)) (.cse11 (= ~d0_val~0 ~d0_val_t~0)) (.cse33 (= |old(~b0_val~0)| ~b0_val~0)) (.cse12 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse35 (= ~d1_req_up~0 1)) (.cse15 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse18 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse16 (<= ~b1_val_t~0 ~b1_val~0)) (.cse37 (= |old(~b0_req_up~0)| 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse3 (< ~b1_val_t~0 1)) (.cse38 (< 0 |old(~d0_ev~0)|)) (.cse39 (= 0 |old(~d0_ev~0)|)) (.cse5 (< |old(~b1_ev~0)| 2)) (.cse41 (= |old(~b1_req_up~0)| 1)) (.cse42 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse43 (= 0 |old(~b0_ev~0)|)) (.cse21 (< ~d0_val_t~0 1)) (.cse44 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse52 (= 0 |old(~d1_ev~0)|)) (.cse45 (< ~comp_m1_st~0 2)) (.cse22 (< ~b0_val_t~0 1)) (.cse23 (< ~d1_val_t~0 1)) (.cse24 (< |old(~z_ev~0)| 2)) (.cse25 (< 0 |old(~z_val~0)|)) (.cse26 (not (= 0 ~z_val_t~0))) (.cse47 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse48 (= 1 |old(~b0_ev~0)|)) (.cse49 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse27 (< |old(~z_val~0)| 0)) (.cse53 (= 1 |old(~d1_ev~0)|))) (and (let ((.cse6 (not (= 1 ~b1_req_up~0))) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (<= ~b0_val_t~0 ~b0_val~0)) (.cse13 (<= ~d0_ev~0 0)) (.cse14 (<= ~b0_ev~0 0))) (or (not .cse0) .cse1 .cse2 (not (= 0 ~comp_m1_st~0)) .cse3 (< 0 |old(~b0_val~0)|) .cse4 (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) .cse5 (< 0 |old(~d1_val~0)|) (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (< |old(~b0_val~0)| 0) .cse20 .cse21 (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) .cse22 (not (= |old(~d0_val~0)| 0)) .cse23 .cse24 .cse25 .cse26 (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) .cse27 (and .cse6 .cse7 .cse8 .cse9 (not (= ~b1_ev~0 1)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse28 .cse18 .cse19) (not (= 1 |old(~d1_req_up~0)|)))) (or .cse29 (and (or (and .cse30 .cse31 .cse32 .cse10 .cse11 .cse33 .cse12 .cse34 .cse35 .cse15 .cse18) (and .cse30 .cse31 .cse10 .cse11 .cse33 .cse12 .cse34 .cse0 .cse35 .cse15 .cse18)) .cse36 .cse9 .cse16) .cse37 .cse2 .cse3 .cse4 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse21 .cse44 .cse45 .cse22 .cse23 .cse24 .cse46 .cse25 .cse26 .cse47 .cse48 .cse49 .cse27) (or (and (and .cse11 .cse33 (let ((.cse50 (= |old(~d0_ev~0)| ~d0_ev~0))) (or (and .cse32 .cse10 .cse12 .cse50 .cse35 .cse51 .cse15 .cse17 .cse19) (and .cse10 .cse12 .cse50 .cse0 .cse35 .cse51 .cse15 .cse17 .cse19))) .cse30 .cse31 .cse18) .cse9 .cse16) (let ((.cse54 (not (= |old(~z_val~0)| ~z_val_t~0)))) (and (or (or .cse41 .cse20 .cse29 .cse52 .cse45 .cse46 .cse24 .cse37 .cse2 .cse38 .cse53) .cse23 .cse26 .cse47 .cse42 .cse49 .cse3 .cse21 .cse44 .cse39 .cse54 .cse22) (or (or .cse41 .cse43 .cse21 .cse44 .cse29 .cse52 .cse45 .cse22 .cse23 .cse46 .cse24 .cse1 .cse37 .cse2 .cse48 .cse49 .cse53) .cse26 .cse47 .cse42 .cse3 .cse54)))) (or (and (or (and .cse11 .cse33 (and .cse10 .cse15 .cse12 .cse34 .cse0 .cse35) .cse55 .cse30 .cse31 .cse18) (and .cse55 .cse30 .cse31 .cse32 .cse10 .cse11 .cse33 .cse12 .cse34 .cse35 .cse15 .cse18)) .cse36 .cse16) (or (= |old(~z_req_up~0)| 1) (< 1 |old(~d1_ev~0)|) .cse29 .cse37 .cse2 .cse3 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse21 .cse44 (< 0 |old(~b0_ev~0)|) .cse52 .cse45 .cse22 .cse23 .cse24 .cse46 .cse25 .cse47 .cse49 .cse27 .cse53)) (or (and .cse36 (let ((.cse56 (and .cse57 (<= |old(~d0_ev~0)| ~d0_ev~0) .cse58 .cse59 .cse17 .cse60 .cse19))) (or (and .cse11 .cse33 .cse55 .cse30 .cse51 .cse31 .cse15 (and .cse10 .cse56 .cse12 .cse0 .cse35) .cse18) (and .cse55 .cse30 .cse51 .cse31 .cse32 .cse10 .cse11 .cse33 .cse12 .cse35 .cse15 .cse56 .cse18))) .cse16) .cse37 .cse2 .cse3 .cse38 .cse39 .cse5 .cse41 .cse42 .cse43 .cse21 .cse44 .cse52 .cse45 .cse22 .cse23 .cse24 .cse25 .cse26 .cse47 .cse48 .cse49 .cse27 .cse53)))) [2018-12-08 09:48:22,727 INFO L448 ceAbstractionStarter]: For program point L223(lines 201 239) no Hoare annotation was computed. [2018-12-08 09:48:22,729 INFO L444 ceAbstractionStarter]: At program point L211(line 211) the Hoare annotation is: (let ((.cse3 (< 0 |old(~d0_ev~0)|)) (.cse4 (= 0 |old(~d0_ev~0)|)) (.cse27 (< |old(~d1_ev~0)| 2)) (.cse5 (< |old(~b1_ev~0)| 2)) (.cse23 (< |old(~b0_ev~0)| 2)) (.cse16 (< 0 |old(~z_val~0)|)) (.cse21 (< |old(~z_val~0)| 0)) (.cse6 (= |old(~b1_req_up~0)| 1)) (.cse8 (= 0 |old(~b0_ev~0)|)) (.cse9 (< ~d0_val_t~0 1)) (.cse10 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse24 (= |old(~b1_ev~0)| 0)) (.cse11 (= 0 |old(~d1_ev~0)|)) (.cse12 (< ~comp_m1_st~0 2)) (.cse13 (< ~b0_val_t~0 1)) (.cse14 (< ~d1_val_t~0 1)) (.cse25 (= |old(~b1_ev~0)| 1)) (.cse15 (< |old(~z_ev~0)| 2)) (.cse28 (< |old(~d0_ev~0)| 2)) (.cse0 (= |old(~b0_req_up~0)| 1)) (.cse1 (< 0 ~comp_m1_i~0)) (.cse19 (= 1 |old(~b0_ev~0)|)) (.cse20 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse22 (= 1 |old(~d1_ev~0)|)) (.cse17 (not (= 0 ~z_val_t~0))) (.cse18 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse7 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse2 (< ~b1_val_t~0 1)) (.cse26 (not (= |old(~z_val~0)| ~z_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or (or .cse6 .cse23 .cse24 .cse11 .cse12 .cse25 .cse15 .cse0 .cse1 .cse3 .cse22) .cse14 .cse17 .cse18 .cse7 .cse20 .cse2 .cse9 .cse10 .cse4 .cse26 .cse13) (or .cse24 .cse0 .cse1 .cse2 .cse27 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or (= |old(~z_req_up~0)| 1) (< 1 |old(~d1_ev~0)|) .cse24 .cse0 .cse1 .cse2 .cse3 .cse4 (< 1 |old(~b1_ev~0)|) .cse6 .cse7 .cse8 .cse9 .cse10 (< 0 |old(~b0_ev~0)|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse18 .cse20 .cse21 .cse22) (or (not (= |old(~d0_req_up~0)| 1)) .cse28 .cse1 (not (= 0 ~comp_m1_st~0)) .cse2 (< 0 |old(~b0_val~0)|) .cse27 (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) .cse5 (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (and (not (= ~b0_req_up~0 1)) (<= ~b0_val_t~0 ~b0_val~0) (= ~z_val~0 ~z_val_t~0) (= 1 ~b1_req_up~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= |old(~d0_ev~0)| ~d0_ev~0) (<= ~b0_ev~0 0) (= ~d1_req_up~0 |old(~d1_req_up~0)|) (= |old(~b1_ev~0)| ~b1_ev~0) (= ~d0_req_up~0 1) (= ~z_req_up~0 |old(~z_req_up~0)|) (<= |old(~z_ev~0)| ~z_ev~0)) .cse23 .cse9 (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) .cse13 (not (= |old(~d0_val~0)| 0)) .cse14 .cse15 .cse16 .cse17 (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) .cse21 (not (= 1 |old(~d1_req_up~0)|))) (or (or .cse6 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse28 .cse0 .cse1 .cse19 .cse20 .cse22) .cse17 .cse18 .cse7 .cse2 .cse26))) [2018-12-08 09:48:22,729 INFO L448 ceAbstractionStarter]: For program point L209(lines 201 239) no Hoare annotation was computed. [2018-12-08 09:48:22,730 INFO L444 ceAbstractionStarter]: At program point L232(line 232) the Hoare annotation is: (let ((.cse73 (<= 2 ~b1_ev~0)) (.cse61 (<= ~comp_m1_i~0 0)) (.cse86 (<= ~d0_ev~0 1)) (.cse64 (not (= ~b0_ev~0 0))) (.cse95 (not (= ~d0_ev~0 1))) (.cse62 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse65 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse68 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse27 (<= 2 ~d1_ev~0)) (.cse5 (and .cse62 .cse65 .cse68)) (.cse22 (< |old(~b1_ev~0)| 2)) (.cse80 (< 0 |old(~b0_ev~0)|)) (.cse28 (and .cse73 .cse61 .cse62 .cse86 .cse64 .cse95 .cse65 (not (= ~d1_ev~0 0)) .cse68)) (.cse59 (<= 2 ~d0_ev~0)) (.cse60 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse81 (<= |old(~d1_ev~0)| ~d1_ev~0)) (.cse13 (= ~z_val~0 ~z_val_t~0)) (.cse77 (< |old(~b0_ev~0)| 2)) (.cse78 (< 1 |old(~d1_ev~0)|)) (.cse33 (not (= ~d0_req_up~0 1))) (.cse25 (= |old(~b0_req_up~0)| ~b0_req_up~0)) (.cse23 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse30 (= |old(~d1_val~0)| ~d1_val~0)) (.cse29 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse19 (< |old(~d1_ev~0)| 2)) (.cse20 (< 0 |old(~d0_ev~0)|)) (.cse21 (= 0 |old(~d0_ev~0)|)) (.cse79 (< 1 |old(~b1_ev~0)|)) (.cse12 (= ~d0_ev~0 |old(~d0_ev~0)|)) (.cse14 (<= ~b1_val_t~0 ~b1_val~0)) (.cse11 (= |old(~d0_req_up~0)| 1)) (.cse0 (not (= ~d1_ev~0 1))) (.cse1 (<= ~d1_ev~0 1)) (.cse2 (= ~b0_req_up~0 |old(~b0_req_up~0)|)) (.cse3 (not (= |old(~b0_req_up~0)| |old(~d1_req_up~0)|))) (.cse69 (= ~z_val~0 |old(~z_val~0)|)) (.cse4 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse85 (= 1 |old(~z_req_up~0)|)) (.cse6 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse7 (= ~d0_val~0 ~d0_val_t~0)) (.cse8 (= |old(~b0_val~0)| ~b0_val~0)) (.cse9 (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|))) (.cse10 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse63 (not (= ~b1_ev~0 0))) (.cse66 (<= ~b1_ev~0 1)) (.cse15 (<= ~d1_val_t~0 ~d1_val~0)) (.cse44 (not (= 0 ~z_val_t~0))) (.cse45 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse35 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse18 (< ~b1_val_t~0 1)) (.cse52 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse34 (= |old(~b1_req_up~0)| 1)) (.cse36 (= 0 |old(~b0_ev~0)|)) (.cse37 (< ~d0_val_t~0 1)) (.cse74 (= |old(~z_req_up~0)| 1)) (.cse38 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse49 (= |old(~b1_ev~0)| 0)) (.cse75 (= 0 |old(~d1_ev~0)|)) (.cse39 (< ~comp_m1_st~0 2)) (.cse40 (< ~b0_val_t~0 1)) (.cse41 (< ~d1_val_t~0 1)) (.cse50 (= |old(~b1_ev~0)| 1)) (.cse42 (< |old(~z_ev~0)| 2)) (.cse43 (< 0 |old(~z_val~0)|)) (.cse51 (< |old(~d0_ev~0)| 2)) (.cse16 (= |old(~b0_req_up~0)| 1)) (.cse17 (< 0 ~comp_m1_i~0)) (.cse46 (= 1 |old(~b0_ev~0)|)) (.cse47 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse48 (< |old(~z_val~0)| 0)) (.cse76 (= 1 |old(~d1_ev~0)|))) (and (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse11 .cse9 .cse10)) .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (and (or (and .cse7 .cse8 (let ((.cse24 (let ((.cse26 (and (and .cse27 .cse28 .cse29) .cse30))) (or (and .cse4 .cse9 .cse26 .cse11) (and .cse4 .cse23 .cse26 .cse11))))) (or (and .cse23 .cse24 .cse25) (and .cse2 .cse3 .cse24))) .cse10) (and .cse7 .cse8 (let ((.cse31 (let ((.cse32 (and .cse30 (and .cse6 .cse27 .cse33 .cse28 .cse29)))) (or (and .cse32 .cse4 .cse23) (and .cse32 .cse4 .cse9))))) (or (and .cse31 .cse23 .cse25) (and .cse2 .cse31 .cse3))) .cse10)) .cse12 .cse13 .cse14) .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (or (or .cse45 .cse35 (or .cse34 .cse36 .cse37 .cse38 .cse49 .cse39 .cse40 .cse41 .cse50 .cse42 .cse43 .cse51 .cse16 .cse17 .cse46 .cse47 .cse48 .cse19) .cse18 .cse52) (and .cse14 (let ((.cse56 (not (= 1 ~b1_req_up~0))) (.cse55 (not .cse34)) (.cse58 (<= 2 ~comp_m1_st~0)) (.cse67 (<= 2 ~z_ev~0))) (or (and .cse7 .cse8 (let ((.cse53 (let ((.cse54 (let ((.cse57 (and .cse58 .cse30 .cse59 .cse27 .cse29 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 .cse67 .cse68))) (or (and .cse57 .cse6) (and .cse57 .cse11))))) (or (and .cse54 .cse4 .cse23 .cse55) (and .cse56 .cse54 .cse4 .cse9))))) (or (and .cse53 .cse23 .cse25) (and .cse53 .cse2 .cse3))) .cse69 .cse10) (and .cse7 .cse8 .cse69 (let ((.cse70 (let ((.cse71 (let ((.cse72 (and .cse58 .cse30 .cse59 .cse27 .cse29 .cse60 .cse73 .cse61 .cse62 .cse64 .cse65 .cse67 .cse68))) (or (and .cse72 .cse11) (and .cse6 .cse72))))) (or (and .cse56 .cse4 .cse9 .cse71) (and .cse4 .cse23 .cse55 .cse71))))) (or (and .cse23 .cse70 .cse25) (and .cse2 .cse3 .cse70))) .cse10)))) (and .cse14 (and .cse7 .cse8 .cse2 .cse3 .cse69 .cse4 .cse9 (or (and .cse0 .cse1 .cse60 .cse11 .cse62 .cse65 .cse68) (and .cse6 .cse0 .cse1 .cse60 .cse62 .cse65 .cse68)) .cse10) .cse15)) (or .cse74 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse34 .cse35 .cse36 .cse37 .cse38 .cse75 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse76) (or (not .cse11) .cse51 .cse17 (not (= 0 ~comp_m1_st~0)) .cse18 (< 0 |old(~b0_val~0)|) .cse19 (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) .cse22 (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) .cse77 .cse37 (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) .cse40 (not (= |old(~d0_val~0)| 0)) .cse41 .cse42 .cse43 .cse44 (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) .cse48 (not (= 1 |old(~d1_req_up~0)|))) (or .cse74 .cse78 .cse49 .cse16 .cse17 .cse18 .cse20 .cse21 .cse79 .cse34 .cse35 .cse36 .cse37 .cse38 .cse80 .cse75 .cse39 .cse40 .cse41 .cse42 .cse50 .cse43 .cse45 .cse47 .cse48 .cse76) (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse81 .cse4 .cse5 .cse7 .cse8 .cse11 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse81 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)) .cse12 .cse13 .cse14 .cse15) .cse78 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse34 .cse35 .cse36 .cse37 .cse38 .cse80 .cse75 .cse39 .cse40 (and (let ((.cse82 (and .cse30 (and .cse28 .cse29)))) (or (and .cse7 .cse8 (and (and .cse4 (and .cse82 .cse11)) .cse23 .cse25) .cse10) (and (and .cse23 (and .cse6 .cse4 .cse82) .cse25) .cse7 .cse8 .cse10))) .cse12 .cse13 .cse14) .cse41 .cse42 .cse43 .cse44 .cse45 .cse47 .cse48 .cse76) (let ((.cse83 (= ~d0_val_t~0 ~d0_val~0))) (or (and (let ((.cse84 (and .cse62 .cse86 .cse65 .cse66 .cse68))) (or (and .cse83 (and .cse8 (and (and .cse4 (and .cse30 (and .cse84 .cse29)) .cse11) .cse23 .cse25) .cse85 .cse10)) (and .cse83 (and .cse8 (and (and .cse4 (and .cse30 (and .cse6 .cse84 .cse29))) .cse23 .cse25) .cse85 .cse10)))) .cse12 .cse13 .cse14) (and .cse14 (or (and .cse7 .cse8 (and (and .cse4 (let ((.cse87 (and .cse30 .cse29 .cse60 .cse73 .cse65 .cse68))) (or (and .cse87 .cse11) (and .cse87 .cse6)))) .cse23 .cse25) .cse69 .cse62 .cse10) (and .cse7 .cse8 .cse69 .cse62 (and (and .cse4 (let ((.cse88 (and .cse30 .cse59 .cse29 .cse60 .cse64 .cse65 .cse66 .cse68))) (or (and .cse88 .cse11) (and .cse88 .cse6)))) .cse23 .cse25) .cse10))) (and (and (and .cse8 .cse2 (or (and .cse6 .cse0 .cse1 .cse60 .cse81 .cse62 .cse65 .cse68) (and .cse0 .cse1 .cse60 .cse11 .cse81 .cse62 .cse65 .cse68)) .cse3 .cse4 .cse9 .cse85 .cse10) .cse83) .cse13 .cse14 .cse15) (and (or (or .cse34 .cse77 .cse78 .cse49 .cse75 .cse39 .cse50 .cse42 .cse16 .cse17 .cse20 .cse76) .cse41 .cse44 .cse45 .cse35 .cse47 .cse18 .cse37 .cse38 .cse21 .cse52 .cse40) (or (or .cse34 .cse36 .cse37 .cse38 .cse78 .cse49 .cse75 .cse39 .cse40 .cse41 .cse50 .cse42 .cse51 .cse16 .cse17 .cse46 .cse47 .cse76) .cse44 .cse45 .cse35 .cse18 .cse52)))) (let ((.cse94 (<= |old(~d0_ev~0)| ~d0_ev~0))) (or .cse49 (and .cse12 .cse14 (let ((.cse91 (and .cse86 .cse63 .cse94 .cse64 .cse95 .cse65 .cse68))) (or (and .cse7 .cse8 (let ((.cse89 (let ((.cse90 (and .cse30 (and .cse6 .cse91 .cse33 .cse29)))) (or (and .cse4 .cse90 .cse9) (and .cse4 .cse90 .cse23))))) (or (and .cse89 .cse2 .cse3) (and .cse89 .cse23 .cse25))) .cse69 .cse62 .cse85 .cse10) (and .cse7 .cse8 .cse69 .cse62 .cse85 (let ((.cse92 (let ((.cse93 (and .cse30 (and .cse91 .cse29)))) (or (and .cse4 .cse93 .cse9 .cse11) (and .cse4 .cse93 .cse23 .cse11))))) (or (and .cse2 .cse3 .cse92) (and .cse23 .cse92 .cse25))) .cse10)))) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse79 (and .cse12 .cse14 (let ((.cse96 (and .cse62 .cse63 .cse94 .cse65 .cse66 .cse61 .cse68))) (or (and .cse0 .cse1 .cse2 .cse3 .cse96 .cse69 .cse4 .cse85 .cse7 .cse8 .cse11 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse96 .cse69 .cse4 .cse85 .cse6 .cse7 .cse8 .cse9 .cse10))) .cse15) .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse50 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48)) (or .cse45 .cse35 .cse18 .cse52 (or .cse34 .cse36 .cse37 .cse74 .cse38 .cse49 .cse75 .cse39 .cse40 .cse41 .cse50 .cse42 .cse43 .cse51 .cse16 .cse17 .cse46 .cse47 .cse48 .cse76))))) [2018-12-08 09:48:22,737 INFO L448 ceAbstractionStarter]: For program point L230(lines 198 240) no Hoare annotation was computed. [2018-12-08 09:48:22,737 INFO L444 ceAbstractionStarter]: At program point L218(line 218) the Hoare annotation is: (let ((.cse0 (= |old(~b0_req_up~0)| ~b0_req_up~0)) (.cse1 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse2 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse12 (= ~z_val~0 ~z_val_t~0)) (.cse3 (= |old(~d1_val~0)| ~d1_val~0)) (.cse50 (= ~d0_val~0 ~d0_val_t~0)) (.cse4 (= |old(~b0_val~0)| ~b0_val~0)) (.cse5 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse44 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse6 (= |old(~d0_req_up~0)| 1)) (.cse7 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse13 (<= ~b1_val_t~0 ~b1_val~0)) (.cse8 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse9 (= ~d0_req_up~0 1)) (.cse10 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse11 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse37 (< |old(~d0_ev~0)| 2)) (.cse15 (< |old(~b0_ev~0)| 2)) (.cse38 (< |old(~d1_ev~0)| 2)) (.cse16 (= |old(~b1_ev~0)| 0)) (.cse19 (= |old(~b1_ev~0)| 1)) (.cse21 (= |old(~b0_req_up~0)| 1)) (.cse22 (< 0 ~comp_m1_i~0)) (.cse30 (< ~b1_val_t~0 1)) (.cse23 (< 0 |old(~d0_ev~0)|)) (.cse33 (= 0 |old(~d0_ev~0)|)) (.cse39 (< |old(~b1_ev~0)| 2)) (.cse14 (= |old(~b1_req_up~0)| 1)) (.cse28 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse36 (= 0 |old(~b0_ev~0)|)) (.cse31 (< ~d0_val_t~0 1)) (.cse32 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse48 (< 0 |old(~b0_ev~0)|)) (.cse49 (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse50 .cse4 .cse5 .cse44 .cse6 .cse7 .cse13 .cse8 .cse9 .cse10 .cse11)) (.cse17 (= 0 |old(~d1_ev~0)|)) (.cse18 (< ~comp_m1_st~0 2)) (.cse35 (< ~b0_val_t~0 1)) (.cse25 (< ~d1_val_t~0 1)) (.cse20 (< |old(~z_ev~0)| 2)) (.cse46 (< 0 |old(~z_val~0)|)) (.cse26 (not (= 0 ~z_val_t~0))) (.cse27 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse29 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse47 (< |old(~z_val~0)| 0)) (.cse24 (= 1 |old(~d1_ev~0)|))) (and (or (and (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (= ~d0_val_t~0 ~d0_val~0)) (= ~d0_ev~0 |old(~d0_ev~0)|) .cse12 .cse13) (let ((.cse34 (not (= |old(~z_val~0)| ~z_val_t~0)))) (and (or (or .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (or (or .cse14 .cse36 .cse31 .cse32 .cse16 .cse17 .cse18 .cse35 .cse25 .cse19 .cse20 .cse37 .cse21 .cse22 (= 1 |old(~b0_ev~0)|) .cse29 .cse24) .cse26 .cse27 .cse28 .cse30 .cse34)))) (let ((.cse40 (not (= 1 ~b1_req_up~0))) (.cse41 (not (= ~b0_req_up~0 1))) (.cse42 (<= ~b0_val_t~0 ~b0_val~0)) (.cse43 (= 0 ~d0_val~0)) (.cse45 (<= ~b0_ev~0 0))) (or (not .cse6) .cse37 .cse22 (not (= 0 ~comp_m1_st~0)) .cse30 (< 0 |old(~b0_val~0)|) .cse38 (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) .cse39 (< 0 |old(~d1_val~0)|) (and .cse40 .cse41 .cse42 .cse12 .cse43 .cse3 .cse5 .cse44 .cse45 .cse7 .cse13 .cse8 .cse9 .cse10 .cse11) (< |old(~b0_val~0)| 0) .cse15 .cse31 (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) .cse35 (not (= |old(~d0_val~0)| 0)) .cse25 .cse20 .cse46 .cse26 (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) .cse47 (and .cse40 .cse41 .cse42 .cse12 (not (= ~b1_ev~0 1)) .cse43 .cse3 .cse5 .cse44 .cse45 .cse7 .cse13 (<= ~b1_ev~0 1) .cse9 .cse10 .cse11) (not (= 1 |old(~d1_req_up~0)|)))) (or .cse16 .cse21 .cse22 .cse30 .cse38 .cse23 .cse33 .cse14 .cse28 .cse36 .cse31 .cse32 .cse48 .cse18 .cse35 .cse25 .cse20 .cse19 .cse46 .cse26 .cse49 .cse27 .cse29 .cse47) (or (or (= |old(~z_req_up~0)| 1) (< 1 |old(~d1_ev~0)|) .cse16 .cse21 .cse22 .cse30 .cse23 .cse33 (< 1 |old(~b1_ev~0)|) .cse14 .cse28 .cse36 .cse31 .cse32 .cse48 .cse17 .cse18 .cse35 .cse25 .cse20 .cse19 .cse46 .cse27 .cse29 .cse47 .cse24) (and (= ~z_val~0 |old(~z_val~0)|) .cse0 .cse1 .cse2 .cse3 .cse50 .cse4 .cse5 .cse44 .cse6 .cse7 .cse13 .cse8 .cse9 .cse10 .cse11)) (or .cse21 .cse22 .cse30 .cse23 .cse33 .cse39 .cse14 .cse28 .cse36 .cse31 .cse32 .cse48 .cse49 .cse17 .cse18 .cse35 .cse25 .cse20 .cse46 .cse26 .cse27 .cse29 .cse47 .cse24)))) [2018-12-08 09:48:22,739 INFO L448 ceAbstractionStarter]: For program point L216(lines 201 239) no Hoare annotation was computed. [2018-12-08 09:48:22,740 INFO L444 ceAbstractionStarter]: At program point update_channelsENTRY(lines 198 240) the Hoare annotation is: (let ((.cse1 (= |old(~b0_req_up~0)| ~b0_req_up~0)) (.cse0 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse2 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse12 (= ~z_val~0 ~z_val_t~0)) (.cse3 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse4 (= |old(~d1_val~0)| ~d1_val~0)) (.cse44 (= ~d0_val~0 ~d0_val_t~0)) (.cse5 (= |old(~b0_val~0)| ~b0_val~0)) (.cse6 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse7 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse8 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse13 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse10 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse11 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse37 (< |old(~d0_ev~0)| 2)) (.cse15 (< |old(~b0_ev~0)| 2)) (.cse40 (< |old(~b1_ev~0)| 2)) (.cse17 (= 0 |old(~d1_ev~0)|)) (.cse24 (= 1 |old(~d1_ev~0)|)) (.cse16 (= |old(~b1_ev~0)| 0)) (.cse21 (= |old(~b0_req_up~0)| 1)) (.cse22 (< 0 ~comp_m1_i~0)) (.cse30 (< ~b1_val_t~0 1)) (.cse39 (< |old(~d1_ev~0)| 2)) (.cse23 (< 0 |old(~d0_ev~0)|)) (.cse33 (= 0 |old(~d0_ev~0)|)) (.cse43 (and .cse1 .cse0 .cse2 .cse12 .cse3 .cse4 .cse44 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse11)) (.cse14 (= |old(~b1_req_up~0)| 1)) (.cse28 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse36 (= 0 |old(~b0_ev~0)|)) (.cse31 (< ~d0_val_t~0 1)) (.cse32 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse18 (< ~comp_m1_st~0 2)) (.cse35 (< ~b0_val_t~0 1)) (.cse25 (< ~d1_val_t~0 1)) (.cse20 (< |old(~z_ev~0)| 2)) (.cse19 (= |old(~b1_ev~0)| 1)) (.cse41 (< 0 |old(~z_val~0)|)) (.cse26 (not (= 0 ~z_val_t~0))) (.cse27 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse38 (= 1 |old(~b0_ev~0)|)) (.cse29 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse42 (< |old(~z_val~0)| 0))) (and (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (= ~d0_val_t~0 ~d0_val~0) .cse12 .cse13) (let ((.cse34 (not (= |old(~z_val~0)| ~z_val_t~0)))) (and (or (or .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (or (or .cse14 .cse36 .cse31 .cse32 .cse16 .cse17 .cse18 .cse35 .cse25 .cse19 .cse20 .cse37 .cse21 .cse22 .cse38 .cse29 .cse24) .cse26 .cse27 .cse28 .cse30 .cse34)))) (or (not (= |old(~d0_req_up~0)| 1)) .cse37 .cse22 (not (= 0 ~comp_m1_st~0)) .cse30 (< 0 |old(~b0_val~0)|) .cse39 (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) .cse40 (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) .cse15 .cse31 (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) .cse35 (not (= |old(~d0_val~0)| 0)) (and .cse12 .cse7 .cse9 (<= ~d1_req_up~0 ~b1_req_up~0) (<= ~d1_req_up~0 ~b0_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) .cse10 (<= ~b1_req_up~0 ~d1_req_up~0) (= ~b0_req_up~0 1) .cse0 (= 0 ~d0_val~0) .cse4 .cse5 .cse6 (= ~d0_req_up~0 1) .cse11) .cse25 .cse20 .cse41 .cse26 (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) .cse42 (not (= 1 |old(~d1_req_up~0)|))) (or .cse43 .cse21 .cse22 .cse30 .cse23 .cse33 .cse40 .cse14 .cse28 .cse36 .cse31 .cse32 .cse17 .cse18 .cse35 .cse25 .cse20 .cse41 .cse26 .cse27 .cse38 .cse29 .cse42 .cse24) (or (or (= |old(~z_req_up~0)| 1) (< 1 |old(~d1_ev~0)|) .cse16 .cse21 .cse22 .cse30 .cse23 .cse33 (< 1 |old(~b1_ev~0)|) .cse14 .cse28 .cse36 .cse31 .cse32 (< 0 |old(~b0_ev~0)|) .cse17 .cse18 .cse35 .cse25 .cse20 .cse19 .cse41 .cse27 .cse29 .cse42 .cse24) (and (= ~z_val~0 |old(~z_val~0)|) .cse1 .cse0 .cse2 .cse3 .cse4 .cse44 .cse5 .cse6 .cse7 .cse8 .cse13 .cse9 .cse10 .cse11)) (or .cse16 .cse21 .cse22 .cse30 .cse39 .cse23 .cse33 .cse43 .cse14 .cse28 .cse36 .cse31 .cse32 .cse18 .cse35 .cse25 .cse20 .cse19 .cse41 .cse26 .cse27 .cse38 .cse29 .cse42)))) [2018-12-08 09:48:22,741 INFO L444 ceAbstractionStarter]: At program point L204(line 204) the Hoare annotation is: (let ((.cse3 (< 0 |old(~d0_ev~0)|)) (.cse4 (= 0 |old(~d0_ev~0)|)) (.cse27 (< |old(~d1_ev~0)| 2)) (.cse5 (< |old(~b1_ev~0)| 2)) (.cse23 (< |old(~b0_ev~0)| 2)) (.cse16 (< 0 |old(~z_val~0)|)) (.cse21 (< |old(~z_val~0)| 0)) (.cse6 (= |old(~b1_req_up~0)| 1)) (.cse8 (= 0 |old(~b0_ev~0)|)) (.cse9 (< ~d0_val_t~0 1)) (.cse10 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse24 (= |old(~b1_ev~0)| 0)) (.cse11 (= 0 |old(~d1_ev~0)|)) (.cse12 (< ~comp_m1_st~0 2)) (.cse13 (< ~b0_val_t~0 1)) (.cse14 (< ~d1_val_t~0 1)) (.cse25 (= |old(~b1_ev~0)| 1)) (.cse15 (< |old(~z_ev~0)| 2)) (.cse28 (< |old(~d0_ev~0)| 2)) (.cse0 (= |old(~b0_req_up~0)| 1)) (.cse1 (< 0 ~comp_m1_i~0)) (.cse19 (= 1 |old(~b0_ev~0)|)) (.cse20 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse22 (= 1 |old(~d1_ev~0)|)) (.cse17 (not (= 0 ~z_val_t~0))) (.cse18 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse7 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse2 (< ~b1_val_t~0 1)) (.cse26 (not (= |old(~z_val~0)| ~z_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or (or .cse6 .cse23 .cse24 .cse11 .cse12 .cse25 .cse15 .cse0 .cse1 .cse3 .cse22) .cse14 .cse17 .cse18 .cse7 .cse20 .cse2 .cse9 .cse10 .cse4 .cse26 .cse13) (or .cse24 .cse0 .cse1 .cse2 .cse27 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or (= |old(~z_req_up~0)| 1) (< 1 |old(~d1_ev~0)|) .cse24 .cse0 .cse1 .cse2 .cse3 .cse4 (< 1 |old(~b1_ev~0)|) .cse6 .cse7 .cse8 .cse9 .cse10 (< 0 |old(~b0_ev~0)|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse18 .cse20 .cse21 .cse22) (or (not (= |old(~d0_req_up~0)| 1)) .cse28 .cse1 (not (= 0 ~comp_m1_st~0)) .cse2 (< 0 |old(~b0_val~0)|) .cse27 (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) .cse5 (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) .cse23 .cse9 (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) .cse13 (not (= |old(~d0_val~0)| 0)) (and (= ~z_val~0 ~z_val_t~0) (= |old(~d0_ev~0)| ~d0_ev~0) (= |old(~b1_ev~0)| ~b1_ev~0) (<= ~d1_req_up~0 ~b1_req_up~0) (<= ~d1_req_up~0 ~b0_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (= ~z_req_up~0 |old(~z_req_up~0)|) (<= ~b1_req_up~0 ~d1_req_up~0) (= ~b0_req_up~0 1) (= |old(~b0_ev~0)| ~b0_ev~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (= |old(~b0_val~0)| ~b0_val~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= ~d0_req_up~0 1) (<= |old(~z_ev~0)| ~z_ev~0)) .cse14 .cse15 .cse16 .cse17 (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) .cse21 (not (= 1 |old(~d1_req_up~0)|))) (or (or .cse6 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse28 .cse0 .cse1 .cse19 .cse20 .cse22) .cse17 .cse18 .cse7 .cse2 .cse26))) [2018-12-08 09:48:22,742 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 198 240) no Hoare annotation was computed. [2018-12-08 09:48:22,742 INFO L448 ceAbstractionStarter]: For program point L202(lines 201 239) no Hoare annotation was computed. [2018-12-08 09:48:22,742 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 117) no Hoare annotation was computed. [2018-12-08 09:48:22,742 INFO L448 ceAbstractionStarter]: For program point is_method1_triggeredFINAL(lines 93 122) no Hoare annotation was computed. [2018-12-08 09:48:22,742 INFO L444 ceAbstractionStarter]: At program point L119(lines 96 121) the Hoare annotation is: (let ((.cse27 (= 1 ~b0_ev~0)) (.cse24 (= 1 ~d1_ev~0))) (let ((.cse32 (< ~d0_ev~0 2)) (.cse33 (not .cse24)) (.cse0 (= ~z_req_up~0 1)) (.cse25 (= 0 is_method1_triggered_~__retres1~0)) (.cse6 (< 0 ~d0_ev~0)) (.cse7 (= 0 ~d0_ev~0)) (.cse10 (= 0 ~b0_ev~0)) (.cse13 (< 0 ~b0_ev~0)) (.cse20 (< 0 ~z_val~0)) (.cse19 (= ~b1_ev~0 1)) (.cse23 (< ~z_val~0 0)) (.cse28 (= 1 is_method1_triggered_~__retres1~0)) (.cse9 (< ~b1_val~0 ~b1_val_t~0)) (.cse11 (< ~d0_val_t~0 1)) (.cse12 (< ~b0_val~0 ~b0_val_t~0)) (.cse8 (= ~b1_req_up~0 1)) (.cse30 (< 0 ~z_req_up~0)) (.cse1 (< 1 ~d1_ev~0)) (.cse2 (= ~b1_ev~0 0)) (.cse14 (= 0 ~d1_ev~0)) (.cse15 (< ~comp_m1_st~0 2)) (.cse18 (< ~z_ev~0 2)) (.cse3 (= ~b0_req_up~0 1)) (.cse4 (< 0 ~comp_m1_i~0)) (.cse31 (not (= 1 ~d0_ev~0))) (.cse34 (not .cse27)) (.cse16 (< ~b0_val_t~0 1)) (.cse17 (< ~d1_val_t~0 1)) (.cse26 (not (= 0 ~z_val_t~0))) (.cse21 (< ~d1_val~0 ~d1_val_t~0)) (.cse22 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse5 (< ~b1_val_t~0 1)) (.cse29 (not (= ~z_val~0 ~z_val_t~0)))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< 1 ~b1_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25) (or .cse25 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 (< ~b1_ev~0 2) .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse26 .cse21 .cse27 .cse22 .cse23 .cse24) (or .cse28 .cse29 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse31 .cse22 .cse23)) (or (and (or .cse21 .cse9 .cse22 .cse5 .cse11 .cse12 .cse7 .cse29 (or .cse8 (< ~b0_ev~0 2) .cse0 .cse2 .cse14 .cse15 .cse17 .cse19 .cse18 .cse20 .cse3 .cse4 .cse23 .cse6 .cse24) .cse16) (or .cse21 .cse9 .cse5 .cse29 (or .cse8 .cse10 .cse11 .cse0 .cse12 .cse2 .cse14 .cse15 .cse16 .cse17 .cse19 .cse18 .cse20 .cse32 .cse3 .cse4 .cse27 .cse22 .cse23 .cse24))) .cse25) (or .cse28 (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse33 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse27 .cse22 .cse23)) (or .cse9 .cse28 .cse11 .cse12 .cse16 .cse21 .cse22 .cse5 .cse7 (or .cse8 .cse30 .cse1 .cse2 .cse14 .cse15 .cse17 .cse18 .cse20 .cse3 .cse4 .cse23 .cse34 .cse6) .cse29) (or .cse28 (or .cse21 .cse9 .cse5 (or .cse8 .cse10 .cse11 .cse0 .cse12 .cse2 .cse15 .cse16 .cse17 .cse19 .cse18 .cse20 .cse32 .cse3 .cse4 .cse27 .cse22 .cse23 .cse33))) (or .cse0 .cse2 .cse25 .cse3 .cse4 .cse5 (< ~d1_ev~0 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse27 .cse22 .cse23) (or .cse1 .cse28 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse26 (not .cse19) .cse21 .cse22 .cse23) (or .cse28 .cse9 .cse11 .cse12 (or .cse8 .cse30 .cse1 .cse2 .cse14 .cse15 .cse18 .cse3 .cse4 .cse31 .cse34) .cse16 .cse17 .cse26 .cse21 .cse22 .cse5 .cse29)))) [2018-12-08 09:48:22,743 INFO L448 ceAbstractionStarter]: For program point is_method1_triggeredEXIT(lines 93 122) no Hoare annotation was computed. [2018-12-08 09:48:22,743 INFO L448 ceAbstractionStarter]: For program point L109(lines 109 114) no Hoare annotation was computed. [2018-12-08 09:48:22,743 INFO L451 ceAbstractionStarter]: At program point is_method1_triggeredENTRY(lines 93 122) the Hoare annotation is: true [2018-12-08 09:48:22,743 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 115) no Hoare annotation was computed. [2018-12-08 09:48:22,744 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 116) no Hoare annotation was computed. [2018-12-08 09:48:22,744 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 09:48:22,744 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~d0_val~0) (= ~d0_val_t~0 ~d0_val~0) (not (= ~d1_ev~0 1)) (<= ~b1_req_up~0 ~d1_req_up~0) (not (= ~b0_req_up~0 1)) (<= ~d1_ev~0 1) (<= ~b0_val_t~0 ~b0_val~0) (<= 0 ~b0_val~0) (= 0 ~comp_m1_st~0) (<= ~d1_val~0 0) (<= ~b0_val~0 0) (<= ~z_req_up~0 0) (<= ~comp_m1_i~0 0) (<= ~d0_ev~0 0) (= 0 ~z_val_t~0) (<= ~b0_ev~0 0) (= ~z_val~0 ~z_val_t~0) (<= ~b1_ev~0 1) (not (= ~b1_ev~0 1)) (<= ~d1_req_up~0 ~b1_req_up~0) (<= ~d1_req_up~0 ~b0_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (<= ~d1_val_t~0 ~d1_val~0)) [2018-12-08 09:48:22,745 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 09:48:22,745 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 09:48:22,745 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 451 482) no Hoare annotation was computed. [2018-12-08 09:48:22,745 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 451 482) no Hoare annotation was computed. [2018-12-08 09:48:22,745 INFO L444 ceAbstractionStarter]: At program point init_modelENTRY(lines 451 482) the Hoare annotation is: (or (< 1 |old(~d1_ev~0)|) (< 0 |old(~comp_m1_i~0)|) (not (= 0 ~comp_m1_st~0)) (< 0 |old(~b0_val~0)|) (< 0 |old(~d0_ev~0)|) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< 1 |old(~b1_ev~0)|) (< 0 |old(~d1_val~0)|) (and (= ~d0_val_t~0 ~d0_val~0) (<= ~b0_val_t~0 ~b0_val~0) (= |old(~b0_ev~0)| ~b0_ev~0) (= |old(~b1_req_up~0)| ~b1_req_up~0) (= ~z_val~0 ~z_val_t~0) (<= ~d1_val_t~0 ~d1_val~0) (= |old(~d0_req_up~0)| ~d0_req_up~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (<= 0 ~b0_val~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= |old(~d0_ev~0)| ~d0_ev~0) (<= ~b0_val~0 0) (<= ~comp_m1_i~0 0) (= ~d1_req_up~0 |old(~d1_req_up~0)|) (= |old(~b1_ev~0)| ~b1_ev~0) (<= ~d1_req_up~0 ~b0_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (= ~z_req_up~0 |old(~z_req_up~0)|) (<= |old(~z_ev~0)| ~z_ev~0)) (< |old(~b0_val~0)| 0) (= |old(~b1_req_up~0)| 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_val~0)| |old(~b0_val_t~0)|) (< 0 |old(~b0_ev~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (= |old(~b1_ev~0)| 1) (< 0 |old(~z_val~0)|) (not (= 0 ~z_val_t~0)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~d1_val~0)| |old(~d1_val_t~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val_t~0)| |old(~d0_val~0)|)) (< |old(~z_val~0)| 0) (= 1 |old(~d1_ev~0)|)) [2018-12-08 09:48:22,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 09:48:22 BoogieIcfgContainer [2018-12-08 09:48:22,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 09:48:22,787 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 09:48:22,787 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 09:48:22,788 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 09:48:22,788 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:45:38" (3/4) ... [2018-12-08 09:48:22,791 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 09:48:22,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-12-08 09:48:22,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-12-08 09:48:22,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure method1 [2018-12-08 09:48:22,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-12-08 09:48:22,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-12-08 09:48:22,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 09:48:22,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-12-08 09:48:22,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_z [2018-12-08 09:48:22,798 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_d1 [2018-12-08 09:48:22,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 09:48:22,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-12-08 09:48:22,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-12-08 09:48:22,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_d0 [2018-12-08 09:48:22,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_b1 [2018-12-08 09:48:22,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_b0 [2018-12-08 09:48:22,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-12-08 09:48:22,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-12-08 09:48:22,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-12-08 09:48:22,799 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_method1_triggered [2018-12-08 09:48:22,800 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-12-08 09:48:22,806 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2018-12-08 09:48:22,806 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-08 09:48:22,828 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((!(1 == b1_req_up) && d0_val == d0_val_t) && !(b0_req_up == 1)) && !(z_req_up == 1)) && b0_val_t <= b0_val) && z_val == \old(z_val)) && !(d0_ev == 0)) && b0_ev <= 0) && b1_val_t <= b1_val) && ((((((((2 <= comp_m1_st && d0_ev <= 1) && !(d1_ev == 1)) && !(b1_ev == 0)) && d1_ev <= 1) && !(b0_ev == 0)) && !(d0_ev == 1)) && b1_ev <= 1) && 2 <= z_ev) && !(d1_ev == 0)) && !(b1_ev == 1)) && d1_val_t <= d1_val) || (((((!(d0_ev == 0) && d0_val_t == d0_val) && b0_val_t <= b0_val) && b1_val_t <= b1_val) && (((((((((!(1 == b1_req_up) && !(b0_req_up == 1)) && !(z_req_up == 1)) && 2 <= b0_ev) && 2 <= d1_ev) && 0 == comp_m1_st) && z_val == \old(z_val)) && !(b1_ev == 0)) && !(d0_ev == 1)) && !(b1_ev == 1)) && 2 <= z_ev) && d1_val_t <= d1_val)) || \old(d1_ev) < 2) || \old(d1_req_up) < \old(b1_req_up)) || \old(b1_ev) < 2) || (((z_val == z_val_t && b1_val_t <= b1_val) && (((((((!(1 == b1_req_up) && d0_val == d0_val_t) && !(b0_req_up == 1)) && !(z_req_up == 1)) && b0_val_t <= b0_val) && z_val == \old(z_val)) && (2 <= comp_m1_st && !(d1_ev == 1)) && (((((!(b1_ev == 0) && 2 <= d0_ev) && !(b0_ev == 0)) && b1_ev <= 1) && 2 <= z_ev) && !(d1_ev == 0)) && comp_m1_i <= 0) && !(b0_ev == 1)) && !(b1_ev == 1)) && d1_val_t <= d1_val)) || b0_val_t < 1) || (z_val == z_val_t && (((((d0_val == d0_val_t && b0_val_t <= b0_val) && ((((((!(d1_ev == 1) && 0 == comp_m1_st) && (((2 <= d0_ev && !(b0_ev == 0)) && 2 <= z_ev) && !(d1_ev == 0)) && 2 <= b1_ev) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && !(z_req_up == 1)) && !(b0_ev == 1)) && z_val == \old(z_val)) && b1_val_t <= b1_val) && d1_val_t <= d1_val) || ((((d0_val == d0_val_t && b0_val_t <= b0_val) && b1_val_t <= b1_val) && (((((((!(d1_ev == 1) && 0 == comp_m1_st) && (((((!(b1_ev == 0) && 2 <= d0_ev) && !(b0_ev == 0)) && b1_ev <= 1) && 2 <= z_ev) && !(d1_ev == 0)) && comp_m1_i <= 0) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && !(z_req_up == 1)) && !(b0_ev == 1)) && !(b1_ev == 1)) && z_val == \old(z_val)) && d1_val_t <= d1_val)))) || \old(b1_req_up) < \old(d1_req_up)) || (((((!(d0_ev == 0) && d0_val == d0_val_t) && b0_val_t <= b0_val) && b1_val_t <= b1_val) && d1_val_t <= d1_val) && ((((((((((((d0_ev <= 1 && !(b1_ev == 0)) && !(b0_ev == 0)) && !(d0_ev == 1)) && 2 <= d1_ev) && b1_ev <= 1) && 2 <= z_ev) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && !(z_req_up == 1)) && 0 == comp_m1_st) && z_val == \old(z_val)) && !(b0_ev == 1)) && !(b1_ev == 1))) || (((((((((((!(1 == b1_req_up) && d0_val == d0_val_t) && !(b0_req_up == 1)) && !(z_req_up == 1)) && b0_val_t <= b0_val) && (((((2 <= comp_m1_st && !(d1_ev == 1)) && !(b0_ev == 0)) && !(d0_ev == 1)) && 2 <= z_ev) && !(d1_ev == 0)) && 2 <= b1_ev) && !(d0_ev == 0)) && 0 == z_val_t) && z_val == z_val_t) && !(b0_ev == 1)) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || !(1 == \old(d1_req_up))) || !(\old(d0_req_up) == 1)) || (((((((((((((((!(b0_ev == 0) && !(d0_ev == 1)) && 2 <= d1_ev) && 2 <= z_ev) && 2 <= b1_ev) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && !(z_req_up == 1)) && 0 == comp_m1_st) && z_val == \old(z_val)) && !(d0_ev == 0)) && d0_val == d0_val_t) && b0_ev <= 0) && b0_val_t <= b0_val) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || ((((((!(d0_ev == 0) && d0_val_t == d0_val) && b0_val_t <= b0_val) && z_val == z_val_t) && b1_val_t <= b1_val) && ((((((((((2 <= comp_m1_st && !(1 == b1_req_up)) && !(d1_ev == 1)) && !(b0_req_up == 1)) && !(z_req_up == 1)) && 2 <= b0_ev) && z_val == \old(z_val)) && !(b1_ev == 0)) && !(d0_ev == 1)) && !(b1_ev == 1)) && 2 <= z_ev) && !(d1_ev == 0)) && d1_val_t <= d1_val)) || \old(d0_ev) < 2) || ((((((((((((!(1 == b1_req_up) && d0_val == d0_val_t) && !(b0_req_up == 1)) && !(z_req_up == 1)) && b0_val_t <= b0_val) && !(d0_ev == 0)) && 0 == z_val_t) && z_val == z_val_t) && !(b0_ev == 1)) && b1_val_t <= b1_val) && 2 <= comp_m1_st && (((((d0_ev <= 1 && !(b1_ev == 0)) && !(b0_ev == 0)) && !(d0_ev == 1)) && 2 <= d1_ev) && b1_ev <= 1) && 2 <= z_ev) && !(b1_ev == 1)) && d1_val_t <= d1_val)) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || b1_val_t < 1) || 0 < \old(b0_val)) || !(\old(z_val) == \old(z_val_t))) || 0 < \old(d1_val)) || \old(b0_val) < 0) || \old(b0_ev) < 2) || d0_val_t < 1) || 0 < \old(z_req_up)) || ((((d0_val == d0_val_t && b0_val_t <= b0_val) && (((((((2 <= d1_ev && (((((!(b1_ev == 0) && 2 <= d0_ev) && !(b0_ev == 0)) && b1_ev <= 1) && 2 <= z_ev) && !(d1_ev == 0)) && comp_m1_i <= 0) && 0 == comp_m1_st) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && !(z_req_up == 1)) && !(b0_ev == 1)) && !(b1_ev == 1)) && z_val == \old(z_val)) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || ((((((!(d0_ev == 0) && d0_val_t == d0_val) && ((((((((((!(1 == b1_req_up) && !(d1_ev == 1)) && !(b0_req_up == 1)) && 2 <= b0_ev) && 0 == comp_m1_st) && z_val == \old(z_val)) && !(b1_ev == 0)) && !(d0_ev == 1)) && !(b1_ev == 1)) && 2 <= z_ev) && !(d1_ev == 0)) && z_req_up == \old(z_req_up)) && b0_val_t <= b0_val) && z_val == z_val_t) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || \old(b0_req_up) < \old(d1_req_up)) || !(\old(d0_val) == 0)) || d1_val_t < 1) || \old(z_ev) < 2) || !(0 == \old(z_val_t))) || \old(d1_req_up) + 1 <= \old(b0_req_up)) || (((((((((((((((((!(1 == b1_req_up) && !(d1_ev == 1)) && !(b0_req_up == 1)) && b0_val_t <= b0_val) && 0 == comp_m1_st) && 0 == z_val_t) && z_val == z_val_t) && !(b0_ev == 0)) && !(d1_ev == 0)) && d1_val_t <= d1_val) && d0_val == d0_val_t) && 2 <= b1_ev) && d0_ev <= 0) && !(d0_ev == 0)) && !(b0_ev == 1)) && b1_val_t <= b1_val) && 2 <= z_ev) && z_req_up == \old(z_req_up)) [2018-12-08 09:48:22,829 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(\old(d0_req_up) == 1) || \old(d0_ev) < 2) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || b1_val_t < 1) || 0 < \old(b0_val)) || \old(d1_ev) < 2) || \old(d1_req_up) < \old(b1_req_up)) || \old(b1_ev) < 2) || 0 < \old(d1_val)) || \old(b0_val) < 0) || \old(b0_ev) < 2) || d0_val_t < 1) || 0 < \old(z_req_up)) || \old(b0_req_up) < \old(d1_req_up)) || b0_val_t < 1) || !(\old(d0_val) == 0)) || d1_val_t < 1) || \old(z_ev) < 2) || ((((((((!(d1_ev == 1) && !(d0_ev == 1) && ((!(b0_ev == 0) && comp_m1_i <= 0) && !(b1_ev == 0)) && !(d1_ev == 0)) && 0 == comp_m1_st) || (2 <= comp_m1_st && !(d1_ev == 1) && !(d0_ev == 1) && ((!(b0_ev == 0) && comp_m1_i <= 0) && !(b1_ev == 0)) && !(d1_ev == 0))) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && !(b0_ev == 1)) && !(b1_ev == 1)) && z_val == \old(z_val))) || 0 < \old(z_val)) || !(0 == \old(z_val_t))) || \old(d1_req_up) + 1 <= \old(b0_req_up)) || \old(b1_req_up) < \old(d1_req_up)) || \old(z_val) < 0) || !(1 == \old(d1_req_up)) [2018-12-08 09:48:22,829 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) || (z_val == z_val_t && 2 <= comp_m1_st)) || ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || ((((((((((((((b1_req_up == 1 || b0_ev < 2) || 0 < \old(z_req_up)) || 1 < d1_ev) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 0 < d0_ev) || 1 == d1_ev) || !(z_val == \old(z_val_t))) || b0_val_t < 1) && ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || ((((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || 1 < d1_ev) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 1 == d1_ev) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1) && (((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || ((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || 1 < d1_ev) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 1 == d1_ev) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1)) || !(z_val == \old(z_val_t))))) && (((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) || (2 <= comp_m1_st && z_val == z_val_t)) || (((((((((!(d0_val_t == d0_val) || d0_val_t < 1) || b0_val < b0_val_t) || ((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || b0_val_t < 1) && ((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1)) || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_val_t < 1) && ((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || ((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || 0 < d0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || b0_val_t < 1)))) && (((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || ((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || 0 < d0_ev) || 0 < b0_ev) || b0_val_t < 1) || (2 <= comp_m1_st && z_val == z_val_t)) || (\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)))) && ((((((((((((((((((((((((\old(z_req_up) == 1 || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || 1 == d1_ev)) && ((((((((((((((((((((((((((1 < d1_ev || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || b0_req_up == 1) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || (2 <= comp_m1_st && z_val == z_val_t)) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || 0 == d1_ev) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && ((((((((((((((((((((((((((\old(z_req_up) == 1 || 1 < d1_ev) || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || 1 < b1_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) || (\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)))) && (((((((((((((((((((((((((b1_ev == 0 || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == \old(z_val_t))) || z_val == z_val_t) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && ((((((((((((((((((((((((\old(z_req_up) == 1 || b1_ev == 0) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || d1_ev < 2) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0)) && (((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) && z_val == z_val_t) || ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || !(z_val == \old(z_val_t))) || (((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || 0 == d1_ev) || \old(comp_m1_st) < 2) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || 0 < d0_ev) || 1 == d1_ev) || b0_val_t < 1) && ((((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || !(z_val == \old(z_val_t))) || ((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 1) || \old(z_req_up) == 1) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev))) [2018-12-08 09:48:22,829 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((2 <= comp_m1_st && z_val == z_val_t) || ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || (((((((((((((b1_req_up == 1 || b0_ev < 2) || 0 < \old(z_req_up)) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 0 < d0_ev) || 1 == d1_ev) || !(z_val == \old(z_val_t))) || b0_val_t < 1) && ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || (((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 1 == d1_ev) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1) && (((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || (((((((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 1 == d1_ev) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1)) || !(z_val == \old(z_val_t))))) && ((((((((((((((((((((((((\old(z_req_up) == 1 || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || d1_ev < 2) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up)))) && ((((((((((((((((((((((((((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up)) || \old(z_req_up) == 1) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || ((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || 0 < d0_ev) || 0 < b0_ev) || b0_val_t < 1) || (2 <= comp_m1_st && z_val == z_val_t))) && ((z_val == z_val_t && 2 <= comp_m1_st) || (((((((((!(d0_val_t == d0_val) || d0_val_t < 1) || b0_val < b0_val_t) || ((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || b0_val_t < 1) && ((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1)) || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_val_t < 1) && ((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || ((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || 0 < d0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || b0_val_t < 1)))) && ((((((((((((((((((((((((((\old(z_req_up) == 1 || 1 < d1_ev) || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || 1 < b1_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) || (\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)))) && (((((((((((((((((((((((((b1_ev == 0 || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == \old(z_val_t))) || z_val == z_val_t) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && (((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) && z_val == z_val_t) || ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || !(z_val == \old(z_val_t))) || (((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || 0 == d1_ev) || \old(comp_m1_st) < 2) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || 0 < d0_ev) || 1 == d1_ev) || b0_val_t < 1) && ((((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || !(z_val == \old(z_val_t))) || ((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 1) || \old(z_req_up) == 1) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)))) && (((((((((((((((((((((((((2 <= comp_m1_st && z_val == z_val_t) || b0_req_up == 1) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || 0 == d1_ev) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) [2018-12-08 09:48:22,854 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_db64a9d5-a65d-4410-83a0-1f865f659470/bin-2019/uautomizer/witness.graphml [2018-12-08 09:48:22,854 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 09:48:22,854 INFO L168 Benchmark]: Toolchain (without parser) took 165008.89 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.4 GB). Free memory was 961.4 MB in the beginning and 3.5 GB in the end (delta: -2.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-12-08 09:48:22,854 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:48:22,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.14 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 945.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-08 09:48:22,855 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.46 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:48:22,855 INFO L168 Benchmark]: Boogie Preprocessor took 54.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-08 09:48:22,855 INFO L168 Benchmark]: RCFGBuilder took 273.58 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: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2018-12-08 09:48:22,855 INFO L168 Benchmark]: TraceAbstraction took 164422.79 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 1.1 GB in the beginning and 3.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-12-08 09:48:22,855 INFO L168 Benchmark]: Witness Printer took 66.28 ms. Allocated memory is still 5.4 GB. Free memory is still 3.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:48:22,856 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 174.14 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 945.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.46 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 273.58 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: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 164422.79 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.3 GB). Free memory was 1.1 GB in the beginning and 3.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 66.28 ms. Allocated memory is still 5.4 GB. Free memory is still 3.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: 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: 408]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(\old(d0_req_up) == 1) || \old(d0_ev) < 2) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || b1_val_t < 1) || 0 < \old(b0_val)) || \old(d1_ev) < 2) || \old(d1_req_up) < \old(b1_req_up)) || \old(b1_ev) < 2) || 0 < \old(d1_val)) || \old(b0_val) < 0) || \old(b0_ev) < 2) || d0_val_t < 1) || 0 < \old(z_req_up)) || \old(b0_req_up) < \old(d1_req_up)) || b0_val_t < 1) || !(\old(d0_val) == 0)) || d1_val_t < 1) || \old(z_ev) < 2) || ((((((((!(d1_ev == 1) && !(d0_ev == 1) && ((!(b0_ev == 0) && comp_m1_i <= 0) && !(b1_ev == 0)) && !(d1_ev == 0)) && 0 == comp_m1_st) || (2 <= comp_m1_st && !(d1_ev == 1) && !(d0_ev == 1) && ((!(b0_ev == 0) && comp_m1_i <= 0) && !(b1_ev == 0)) && !(d1_ev == 0))) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && !(b0_ev == 1)) && !(b1_ev == 1)) && z_val == \old(z_val))) || 0 < \old(z_val)) || !(0 == \old(z_val_t))) || \old(d1_req_up) + 1 <= \old(b0_req_up)) || \old(b1_req_up) < \old(d1_req_up)) || \old(z_val) < 0) || !(1 == \old(d1_req_up)) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((1 <= __retres1 || (((((((((!(d0_val_t == d0_val) || d0_val_t < 1) || b0_val < b0_val_t) || ((((((((((((b1_req_up == 1 || b0_ev < 2) || z_req_up == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == comp_m1_st)) || d1_ev < 2) || b0_val_t < 1) && ((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || z_req_up == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == comp_m1_st)) || d1_ev < 2) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1)) || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_val_t < 1) && ((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || ((((((((((((b1_req_up == 1 || b0_ev < 2) || z_req_up == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == comp_m1_st)) || d1_ev < 2) || 0 < d0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || b0_val_t < 1))) && ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || ((((((((((((b1_req_up == 1 || 0 == b0_ev) || z_req_up == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == comp_m1_st)) || d1_ev < 2) || 0 < d0_ev) || 0 < b0_ev) || b0_val_t < 1) || 1 <= __retres1)) && (((((((((((((((((((((((b1_ev == 0 || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || d1_ev < 2) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == z_val_t)) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 0 == __retres1)) && ((((((((((((((((((((((((1 <= __retres1 || b0_req_up == 1) || 0 < comp_m1_i) || !(0 == comp_m1_st)) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < z_req_up) || b0_val < b0_val_t) || 0 == d1_ev) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == z_val_t)) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && (((((((((((((((((((((((0 == __retres1 || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == z_val_t)) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && (0 == __retres1 || ((((((((((((((((((((((((z_req_up == 1 || 1 < d1_ev) || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || 1 < b1_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && ((((((((((((((((((((((((b1_ev == 0 || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) || !(z_val == z_val_t)) && (((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || b1_ev == 0) || 0 == d1_ev) || comp_m1_st < 2) || b1_ev == 1) || z_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 0 < d0_ev) || 1 == d1_ev) || d1_val_t < 1) || !(0 == z_val_t)) || d1_val < d1_val_t) || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || !(z_val == z_val_t)) || b0_val_t < 1)) || 0 == __retres1)) && (1 <= __retres1 || ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || (((((((((((((b1_req_up == 1 || b0_ev < 2) || 0 < z_req_up) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == comp_m1_st)) || 0 < d0_ev) || 1 == d1_ev) || !(z_val == z_val_t)) || b0_val_t < 1) && ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || (((((((((((((b1_req_up == 1 || 0 == b0_ev) || z_req_up == 1) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == comp_m1_st)) || 1 == d1_ev) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1) && (((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || (((((((((((((((((b1_req_up == 1 || b0_ev < 2) || z_req_up == 1) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == comp_m1_st)) || 1 == d1_ev) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1)) || !(z_val == z_val_t)))) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: (((((((((2 <= comp_m1_st && z_val == z_val_t) || ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || (((((((((((((b1_req_up == 1 || b0_ev < 2) || 0 < \old(z_req_up)) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 0 < d0_ev) || 1 == d1_ev) || !(z_val == \old(z_val_t))) || b0_val_t < 1) && ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || (((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 1 == d1_ev) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1) && (((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || (((((((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 1 == d1_ev) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1)) || !(z_val == \old(z_val_t))))) && ((((((((((((((((((((((((\old(z_req_up) == 1 || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || d1_ev < 2) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up)))) && ((((((((((((((((((((((((((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up)) || \old(z_req_up) == 1) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || ((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || 0 < d0_ev) || 0 < b0_ev) || b0_val_t < 1) || (2 <= comp_m1_st && z_val == z_val_t))) && ((z_val == z_val_t && 2 <= comp_m1_st) || (((((((((!(d0_val_t == d0_val) || d0_val_t < 1) || b0_val < b0_val_t) || ((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || b0_val_t < 1) && ((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1)) || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_val_t < 1) && ((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || ((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || 0 < d0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || b0_val_t < 1)))) && ((((((((((((((((((((((((((\old(z_req_up) == 1 || 1 < d1_ev) || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || 1 < b1_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) || (\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)))) && (((((((((((((((((((((((((b1_ev == 0 || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == \old(z_val_t))) || z_val == z_val_t) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && (((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) && z_val == z_val_t) || ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || !(z_val == \old(z_val_t))) || (((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || 0 == d1_ev) || \old(comp_m1_st) < 2) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || 0 < d0_ev) || 1 == d1_ev) || b0_val_t < 1) && ((((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || !(z_val == \old(z_val_t))) || ((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 1) || \old(z_req_up) == 1) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)))) && (((((((((((((((((((((((((2 <= comp_m1_st && z_val == z_val_t) || b0_req_up == 1) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || 0 == d1_ev) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: ((((((((((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) || (z_val == z_val_t && 2 <= comp_m1_st)) || ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || ((((((((((((((b1_req_up == 1 || b0_ev < 2) || 0 < \old(z_req_up)) || 1 < d1_ev) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 0 < d0_ev) || 1 == d1_ev) || !(z_val == \old(z_val_t))) || b0_val_t < 1) && ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || ((((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || 1 < d1_ev) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 1 == d1_ev) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1) && (((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || ((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || 1 < d1_ev) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 1 == d1_ev) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1)) || !(z_val == \old(z_val_t))))) && (((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) || (2 <= comp_m1_st && z_val == z_val_t)) || (((((((((!(d0_val_t == d0_val) || d0_val_t < 1) || b0_val < b0_val_t) || ((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || b0_val_t < 1) && ((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1)) || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_val_t < 1) && ((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || ((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || 0 < d0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || b0_val_t < 1)))) && (((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || ((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || 0 < d0_ev) || 0 < b0_ev) || b0_val_t < 1) || (2 <= comp_m1_st && z_val == z_val_t)) || (\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)))) && ((((((((((((((((((((((((\old(z_req_up) == 1 || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || 1 == d1_ev)) && ((((((((((((((((((((((((((1 < d1_ev || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || b0_req_up == 1) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || (2 <= comp_m1_st && z_val == z_val_t)) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || 0 == d1_ev) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && ((((((((((((((((((((((((((\old(z_req_up) == 1 || 1 < d1_ev) || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || 1 < b1_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) || (\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)))) && (((((((((((((((((((((((((b1_ev == 0 || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == \old(z_val_t))) || z_val == z_val_t) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && ((((((((((((((((((((((((\old(z_req_up) == 1 || b1_ev == 0) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || d1_ev < 2) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0)) && (((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) && z_val == z_val_t) || ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || !(z_val == \old(z_val_t))) || (((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || 0 == d1_ev) || \old(comp_m1_st) < 2) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || 0 < d0_ev) || 1 == d1_ev) || b0_val_t < 1) && ((((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || !(z_val == \old(z_val_t))) || ((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 1) || \old(z_req_up) == 1) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev))) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((z_req_up == 1 || 1 < d1_ev) || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || 1 < b1_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) || 0 == __retres1) && ((((((((((((((((((((((((0 == __retres1 || z_req_up == 1) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == z_val_t)) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && ((1 == __retres1 || !(z_val == z_val_t)) || ((((((((((((((((((((1 < d1_ev || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < z_req_up) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || d1_val < d1_val_t) || !(1 == d0_ev)) || !(d0_val_t == d0_val)) || z_val < 0)) && (((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || !(z_val == z_val_t)) || (((((((((((((b1_req_up == 1 || b0_ev < 2) || z_req_up == 1) || b1_ev == 0) || 0 == d1_ev) || comp_m1_st < 2) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || 0 < d0_ev) || 1 == d1_ev) || b0_val_t < 1) && ((((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || !(z_val == z_val_t)) || ((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 1) || z_req_up == 1) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) || 0 == __retres1)) && (1 == __retres1 || (((((((((((((((((((((z_req_up == 1 || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || !(1 == d1_ev)) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0)) && ((((((((((b1_val < b1_val_t || 1 == __retres1) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || 0 == d0_ev) || ((((((((((((b1_req_up == 1 || 0 < z_req_up) || 1 < d1_ev) || b1_ev == 0) || 0 == d1_ev) || comp_m1_st < 2) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(1 == b0_ev)) || 0 < d0_ev) || !(z_val == z_val_t))) && (1 == __retres1 || ((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || (((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 1) || z_req_up == 1) || b0_val < b0_val_t) || b1_ev == 0) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || !(1 == d1_ev))) && ((((((((((((((((((((((((z_req_up == 1 || b1_ev == 0) || 0 == __retres1) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || d1_ev < 2) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == z_val_t)) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0)) && ((((((((((((((((((((((((1 < d1_ev || 1 == __retres1) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < z_req_up) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == z_val_t)) || !(b1_ev == 1)) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0)) && (((((((((((1 == __retres1 || b1_val < b1_val_t) || d0_val_t < 1) || b0_val < b0_val_t) || (((((((((b1_req_up == 1 || 0 < z_req_up) || 1 < d1_ev) || b1_ev == 0) || 0 == d1_ev) || comp_m1_st < 2) || z_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || !(1 == d0_ev)) || !(1 == b0_ev)) || b0_val_t < 1) || d1_val_t < 1) || !(0 == z_val_t)) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || !(z_val == z_val_t)) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((!(1 == b1_req_up) && d0_val == d0_val_t) && !(b0_req_up == 1)) && !(z_req_up == 1)) && b0_val_t <= b0_val) && z_val == \old(z_val)) && !(d0_ev == 0)) && b0_ev <= 0) && b1_val_t <= b1_val) && ((((((((2 <= comp_m1_st && d0_ev <= 1) && !(d1_ev == 1)) && !(b1_ev == 0)) && d1_ev <= 1) && !(b0_ev == 0)) && !(d0_ev == 1)) && b1_ev <= 1) && 2 <= z_ev) && !(d1_ev == 0)) && !(b1_ev == 1)) && d1_val_t <= d1_val) || (((((!(d0_ev == 0) && d0_val_t == d0_val) && b0_val_t <= b0_val) && b1_val_t <= b1_val) && (((((((((!(1 == b1_req_up) && !(b0_req_up == 1)) && !(z_req_up == 1)) && 2 <= b0_ev) && 2 <= d1_ev) && 0 == comp_m1_st) && z_val == \old(z_val)) && !(b1_ev == 0)) && !(d0_ev == 1)) && !(b1_ev == 1)) && 2 <= z_ev) && d1_val_t <= d1_val)) || \old(d1_ev) < 2) || \old(d1_req_up) < \old(b1_req_up)) || \old(b1_ev) < 2) || (((z_val == z_val_t && b1_val_t <= b1_val) && (((((((!(1 == b1_req_up) && d0_val == d0_val_t) && !(b0_req_up == 1)) && !(z_req_up == 1)) && b0_val_t <= b0_val) && z_val == \old(z_val)) && (2 <= comp_m1_st && !(d1_ev == 1)) && (((((!(b1_ev == 0) && 2 <= d0_ev) && !(b0_ev == 0)) && b1_ev <= 1) && 2 <= z_ev) && !(d1_ev == 0)) && comp_m1_i <= 0) && !(b0_ev == 1)) && !(b1_ev == 1)) && d1_val_t <= d1_val)) || b0_val_t < 1) || (z_val == z_val_t && (((((d0_val == d0_val_t && b0_val_t <= b0_val) && ((((((!(d1_ev == 1) && 0 == comp_m1_st) && (((2 <= d0_ev && !(b0_ev == 0)) && 2 <= z_ev) && !(d1_ev == 0)) && 2 <= b1_ev) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && !(z_req_up == 1)) && !(b0_ev == 1)) && z_val == \old(z_val)) && b1_val_t <= b1_val) && d1_val_t <= d1_val) || ((((d0_val == d0_val_t && b0_val_t <= b0_val) && b1_val_t <= b1_val) && (((((((!(d1_ev == 1) && 0 == comp_m1_st) && (((((!(b1_ev == 0) && 2 <= d0_ev) && !(b0_ev == 0)) && b1_ev <= 1) && 2 <= z_ev) && !(d1_ev == 0)) && comp_m1_i <= 0) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && !(z_req_up == 1)) && !(b0_ev == 1)) && !(b1_ev == 1)) && z_val == \old(z_val)) && d1_val_t <= d1_val)))) || \old(b1_req_up) < \old(d1_req_up)) || (((((!(d0_ev == 0) && d0_val == d0_val_t) && b0_val_t <= b0_val) && b1_val_t <= b1_val) && d1_val_t <= d1_val) && ((((((((((((d0_ev <= 1 && !(b1_ev == 0)) && !(b0_ev == 0)) && !(d0_ev == 1)) && 2 <= d1_ev) && b1_ev <= 1) && 2 <= z_ev) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && !(z_req_up == 1)) && 0 == comp_m1_st) && z_val == \old(z_val)) && !(b0_ev == 1)) && !(b1_ev == 1))) || (((((((((((!(1 == b1_req_up) && d0_val == d0_val_t) && !(b0_req_up == 1)) && !(z_req_up == 1)) && b0_val_t <= b0_val) && (((((2 <= comp_m1_st && !(d1_ev == 1)) && !(b0_ev == 0)) && !(d0_ev == 1)) && 2 <= z_ev) && !(d1_ev == 0)) && 2 <= b1_ev) && !(d0_ev == 0)) && 0 == z_val_t) && z_val == z_val_t) && !(b0_ev == 1)) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || !(1 == \old(d1_req_up))) || !(\old(d0_req_up) == 1)) || (((((((((((((((!(b0_ev == 0) && !(d0_ev == 1)) && 2 <= d1_ev) && 2 <= z_ev) && 2 <= b1_ev) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && !(z_req_up == 1)) && 0 == comp_m1_st) && z_val == \old(z_val)) && !(d0_ev == 0)) && d0_val == d0_val_t) && b0_ev <= 0) && b0_val_t <= b0_val) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || ((((((!(d0_ev == 0) && d0_val_t == d0_val) && b0_val_t <= b0_val) && z_val == z_val_t) && b1_val_t <= b1_val) && ((((((((((2 <= comp_m1_st && !(1 == b1_req_up)) && !(d1_ev == 1)) && !(b0_req_up == 1)) && !(z_req_up == 1)) && 2 <= b0_ev) && z_val == \old(z_val)) && !(b1_ev == 0)) && !(d0_ev == 1)) && !(b1_ev == 1)) && 2 <= z_ev) && !(d1_ev == 0)) && d1_val_t <= d1_val)) || \old(d0_ev) < 2) || ((((((((((((!(1 == b1_req_up) && d0_val == d0_val_t) && !(b0_req_up == 1)) && !(z_req_up == 1)) && b0_val_t <= b0_val) && !(d0_ev == 0)) && 0 == z_val_t) && z_val == z_val_t) && !(b0_ev == 1)) && b1_val_t <= b1_val) && 2 <= comp_m1_st && (((((d0_ev <= 1 && !(b1_ev == 0)) && !(b0_ev == 0)) && !(d0_ev == 1)) && 2 <= d1_ev) && b1_ev <= 1) && 2 <= z_ev) && !(b1_ev == 1)) && d1_val_t <= d1_val)) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || b1_val_t < 1) || 0 < \old(b0_val)) || !(\old(z_val) == \old(z_val_t))) || 0 < \old(d1_val)) || \old(b0_val) < 0) || \old(b0_ev) < 2) || d0_val_t < 1) || 0 < \old(z_req_up)) || ((((d0_val == d0_val_t && b0_val_t <= b0_val) && (((((((2 <= d1_ev && (((((!(b1_ev == 0) && 2 <= d0_ev) && !(b0_ev == 0)) && b1_ev <= 1) && 2 <= z_ev) && !(d1_ev == 0)) && comp_m1_i <= 0) && 0 == comp_m1_st) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && !(z_req_up == 1)) && !(b0_ev == 1)) && !(b1_ev == 1)) && z_val == \old(z_val)) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || ((((((!(d0_ev == 0) && d0_val_t == d0_val) && ((((((((((!(1 == b1_req_up) && !(d1_ev == 1)) && !(b0_req_up == 1)) && 2 <= b0_ev) && 0 == comp_m1_st) && z_val == \old(z_val)) && !(b1_ev == 0)) && !(d0_ev == 1)) && !(b1_ev == 1)) && 2 <= z_ev) && !(d1_ev == 0)) && z_req_up == \old(z_req_up)) && b0_val_t <= b0_val) && z_val == z_val_t) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || \old(b0_req_up) < \old(d1_req_up)) || !(\old(d0_val) == 0)) || d1_val_t < 1) || \old(z_ev) < 2) || !(0 == \old(z_val_t))) || \old(d1_req_up) + 1 <= \old(b0_req_up)) || (((((((((((((((((!(1 == b1_req_up) && !(d1_ev == 1)) && !(b0_req_up == 1)) && b0_val_t <= b0_val) && 0 == comp_m1_st) && 0 == z_val_t) && z_val == z_val_t) && !(b0_ev == 0)) && !(d1_ev == 0)) && d1_val_t <= d1_val) && d0_val == d0_val_t) && 2 <= b1_ev) && d0_ev <= 0) && !(d0_ev == 0)) && !(b0_ev == 1)) && b1_val_t <= b1_val) && 2 <= z_ev) && z_req_up == \old(z_req_up)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((0 == tmp || z_req_up == 1) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == z_val_t)) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) && (0 == tmp || ((((((((((((((((((((((((z_req_up == 1 || 1 < d1_ev) || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || 1 < b1_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && ((((((((((((((((((((((((z_req_up == 1 || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || d1_ev < 2) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || comp_m1_st < 2) || b0_val_t < 1) || 0 == tmp) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == z_val_t)) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0)) && (0 == tmp || ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || !(z_val == z_val_t)) || (((((((((((((b1_req_up == 1 || b0_ev < 2) || z_req_up == 1) || b1_ev == 0) || 0 == d1_ev) || comp_m1_st < 2) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || 0 < d0_ev) || 1 == d1_ev) || b0_val_t < 1) && ((((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || !(z_val == z_val_t)) || ((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 1) || z_req_up == 1) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 141 locations, 1 error locations. SAFE Result, 164.3s OverallTime, 24 OverallIterations, 3 TraceHistogramMax, 26.5s AutomataDifference, 0.0s DeadEndRemovalTime, 116.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 5183 SDtfs, 12122 SDslu, 8734 SDs, 0 SdLazy, 13943 SolverSat, 4364 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3533 GetRequests, 3221 SyntacticMatches, 6 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53451occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 16.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 47879 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 82268 PreInvPairs, 82628 NumberOfFragments, 30629 HoareAnnotationTreeSize, 82268 FomulaSimplifications, 2043865 FormulaSimplificationTreeSizeReduction, 9.0s HoareSimplificationTime, 52 FomulaSimplificationsInter, 3388099 FormulaSimplificationTreeSizeReductionInter, 106.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 6552 NumberOfCodeBlocks, 6552 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 6507 ConstructedInterpolants, 0 QuantifiedInterpolants, 1572181 SizeOfPredicates, 15 NumberOfNonLiveVariables, 19120 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 45 InterpolantComputations, 13 PerfectInterpolantSequences, 1528/1874 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...