./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_61cda7ac-798f-4043-a5b4-461b42cd7265/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_61cda7ac-798f-4043-a5b4-461b42cd7265/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_61cda7ac-798f-4043-a5b4-461b42cd7265/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_61cda7ac-798f-4043-a5b4-461b42cd7265/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_61cda7ac-798f-4043-a5b4-461b42cd7265/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_61cda7ac-798f-4043-a5b4-461b42cd7265/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb52621d262b2a79ebd79f9601fb8103d2f4f11e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 15:27:40,163 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:27:40,164 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:27:40,171 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:27:40,171 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:27:40,172 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:27:40,173 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:27:40,174 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:27:40,175 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:27:40,176 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:27:40,176 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:27:40,176 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:27:40,177 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:27:40,178 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:27:40,178 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:27:40,179 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:27:40,180 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:27:40,181 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:27:40,182 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:27:40,183 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:27:40,184 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:27:40,185 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:27:40,186 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:27:40,187 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:27:40,187 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:27:40,187 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:27:40,188 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:27:40,189 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:27:40,189 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:27:40,190 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:27:40,190 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:27:40,191 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:27:40,191 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:27:40,191 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:27:40,192 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:27:40,192 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:27:40,192 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_61cda7ac-798f-4043-a5b4-461b42cd7265/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 15:27:40,202 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:27:40,203 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:27:40,203 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 15:27:40,203 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 15:27:40,203 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 15:27:40,204 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 15:27:40,204 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 15:27:40,204 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 15:27:40,204 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 15:27:40,204 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 15:27:40,204 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 15:27:40,204 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 15:27:40,205 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 15:27:40,205 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:27:40,205 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:27:40,205 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:27:40,205 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:27:40,206 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:27:40,206 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 15:27:40,206 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 15:27:40,206 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 15:27:40,206 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:27:40,206 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:27:40,207 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:27:40,207 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 15:27:40,207 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:27:40,207 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:27:40,207 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 15:27:40,207 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 15:27:40,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:27:40,207 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:27:40,208 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 15:27:40,208 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 15:27:40,208 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 15:27:40,208 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 15:27:40,208 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 15:27:40,208 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 15:27:40,208 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_61cda7ac-798f-4043-a5b4-461b42cd7265/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb52621d262b2a79ebd79f9601fb8103d2f4f11e [2018-11-18 15:27:40,234 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:27:40,243 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:27:40,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:27:40,246 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:27:40,247 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:27:40,247 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_61cda7ac-798f-4043-a5b4-461b42cd7265/bin-2019/utaipan/../../sv-benchmarks/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c [2018-11-18 15:27:40,286 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_61cda7ac-798f-4043-a5b4-461b42cd7265/bin-2019/utaipan/data/5c8c17495/c4775648272b44d58971cb42f7c04a97/FLAG227d6aa9c [2018-11-18 15:27:40,635 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:27:40,635 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_61cda7ac-798f-4043-a5b4-461b42cd7265/sv-benchmarks/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c [2018-11-18 15:27:40,642 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_61cda7ac-798f-4043-a5b4-461b42cd7265/bin-2019/utaipan/data/5c8c17495/c4775648272b44d58971cb42f7c04a97/FLAG227d6aa9c [2018-11-18 15:27:41,054 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_61cda7ac-798f-4043-a5b4-461b42cd7265/bin-2019/utaipan/data/5c8c17495/c4775648272b44d58971cb42f7c04a97 [2018-11-18 15:27:41,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:27:41,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:27:41,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:27:41,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:27:41,061 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:27:41,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:27:41" (1/1) ... [2018-11-18 15:27:41,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44c74022 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:41, skipping insertion in model container [2018-11-18 15:27:41,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:27:41" (1/1) ... [2018-11-18 15:27:41,071 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:27:41,094 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:27:41,235 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:27:41,238 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:27:41,262 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:27:41,271 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:27:41,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:41 WrapperNode [2018-11-18 15:27:41,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:27:41,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:27:41,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:27:41,272 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:27:41,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:41" (1/1) ... [2018-11-18 15:27:41,281 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:41" (1/1) ... [2018-11-18 15:27:41,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:27:41,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:27:41,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:27:41,286 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:27:41,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:41" (1/1) ... [2018-11-18 15:27:41,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:41" (1/1) ... [2018-11-18 15:27:41,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:41" (1/1) ... [2018-11-18 15:27:41,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:41" (1/1) ... [2018-11-18 15:27:41,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:41" (1/1) ... [2018-11-18 15:27:41,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:41" (1/1) ... [2018-11-18 15:27:41,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:41" (1/1) ... [2018-11-18 15:27:41,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:27:41,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:27:41,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:27:41,363 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:27:41,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_61cda7ac-798f-4043-a5b4-461b42cd7265/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:27:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-18 15:27:41,396 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-18 15:27:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-18 15:27:41,396 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-18 15:27:41,396 INFO L130 BoogieDeclarations]: Found specification of procedure method1 [2018-11-18 15:27:41,396 INFO L138 BoogieDeclarations]: Found implementation of procedure method1 [2018-11-18 15:27:41,397 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-18 15:27:41,397 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-18 15:27:41,397 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-18 15:27:41,397 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-18 15:27:41,397 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 15:27:41,397 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 15:27:41,397 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-18 15:27:41,397 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-18 15:27:41,397 INFO L130 BoogieDeclarations]: Found specification of procedure update_z [2018-11-18 15:27:41,398 INFO L138 BoogieDeclarations]: Found implementation of procedure update_z [2018-11-18 15:27:41,398 INFO L130 BoogieDeclarations]: Found specification of procedure update_d1 [2018-11-18 15:27:41,398 INFO L138 BoogieDeclarations]: Found implementation of procedure update_d1 [2018-11-18 15:27:41,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 15:27:41,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 15:27:41,398 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-18 15:27:41,398 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-18 15:27:41,398 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-18 15:27:41,398 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-18 15:27:41,398 INFO L130 BoogieDeclarations]: Found specification of procedure update_d0 [2018-11-18 15:27:41,399 INFO L138 BoogieDeclarations]: Found implementation of procedure update_d0 [2018-11-18 15:27:41,399 INFO L130 BoogieDeclarations]: Found specification of procedure update_b1 [2018-11-18 15:27:41,399 INFO L138 BoogieDeclarations]: Found implementation of procedure update_b1 [2018-11-18 15:27:41,399 INFO L130 BoogieDeclarations]: Found specification of procedure update_b0 [2018-11-18 15:27:41,399 INFO L138 BoogieDeclarations]: Found implementation of procedure update_b0 [2018-11-18 15:27:41,399 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-18 15:27:41,399 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-18 15:27:41,399 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-18 15:27:41,399 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-18 15:27:41,399 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-18 15:27:41,400 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-18 15:27:41,400 INFO L130 BoogieDeclarations]: Found specification of procedure is_method1_triggered [2018-11-18 15:27:41,400 INFO L138 BoogieDeclarations]: Found implementation of procedure is_method1_triggered [2018-11-18 15:27:41,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:27:41,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:27:41,400 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-18 15:27:41,400 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-18 15:27:41,710 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:27:41,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:27:41 BoogieIcfgContainer [2018-11-18 15:27:41,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:27:41,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 15:27:41,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 15:27:41,713 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 15:27:41,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 03:27:41" (1/3) ... [2018-11-18 15:27:41,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b41bdec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:27:41, skipping insertion in model container [2018-11-18 15:27:41,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:27:41" (2/3) ... [2018-11-18 15:27:41,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b41bdec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:27:41, skipping insertion in model container [2018-11-18 15:27:41,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:27:41" (3/3) ... [2018-11-18 15:27:41,716 INFO L112 eAbstractionObserver]: Analyzing ICFG bist_cell_true-unreach-call_false-termination.cil.c [2018-11-18 15:27:41,721 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 15:27:41,726 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 15:27:41,735 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 15:27:41,756 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 15:27:41,756 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 15:27:41,756 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 15:27:41,756 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:27:41,756 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:27:41,756 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 15:27:41,756 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:27:41,756 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 15:27:41,768 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2018-11-18 15:27:41,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 15:27:41,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:27:41,773 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:27:41,774 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:27:41,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:41,778 INFO L82 PathProgramCache]: Analyzing trace with hash -320612236, now seen corresponding path program 1 times [2018-11-18 15:27:41,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:27:41,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:41,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:41,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:41,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:27:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:27:41,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:27:41,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:27:41,965 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:27:41,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 15:27:41,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:27:41,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:27:41,982 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2018-11-18 15:27:42,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:27:42,117 INFO L93 Difference]: Finished difference Result 269 states and 371 transitions. [2018-11-18 15:27:42,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:27:42,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-11-18 15:27:42,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:27:42,129 INFO L225 Difference]: With dead ends: 269 [2018-11-18 15:27:42,129 INFO L226 Difference]: Without dead ends: 136 [2018-11-18 15:27:42,133 INFO L604 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-11-18 15:27:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-18 15:27:42,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-11-18 15:27:42,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-18 15:27:42,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 181 transitions. [2018-11-18 15:27:42,168 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 181 transitions. Word has length 58 [2018-11-18 15:27:42,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:27:42,170 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 181 transitions. [2018-11-18 15:27:42,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 15:27:42,170 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 181 transitions. [2018-11-18 15:27:42,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 15:27:42,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:27:42,174 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:27:42,174 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:27:42,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:42,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1265937460, now seen corresponding path program 1 times [2018-11-18 15:27:42,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:27:42,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:42,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:42,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:42,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:27:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:42,321 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 15:27:42,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:27:42,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:27:42,322 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2018-11-18 15:27:42,324 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [149], [150], [151], [153], [156], [160], [161], [162], [166], [172], [175], [180], [198], [223], [232], [238], [240], [242], [244], [249], [252], [258], [261], [267], [273], [279], [285], [289], [295], [302], [309], [316], [323], [325], [326], [329], [348], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [363], [364], [365], [366], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [401], [402], [403] [2018-11-18 15:27:42,348 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:27:42,348 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:27:42,461 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:27:42,462 INFO L272 AbstractInterpreter]: Visited 14 different actions 14 times. Never merged. Never widened. Performed 307 root evaluator evaluations with a maximum evaluation depth of 1. Performed 307 inverse root evaluator evaluations with a maximum inverse evaluation depth of 1. Never found a fixpoint. Largest state had 47 variables. [2018-11-18 15:27:42,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:42,471 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:27:42,567 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 86.41% of their original sizes. [2018-11-18 15:27:42,567 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:27:42,577 INFO L415 sIntCurrentIteration]: We unified 126 AI predicates to 126 [2018-11-18 15:27:42,578 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:27:42,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:27:42,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-18 15:27:42,579 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:27:42,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:27:42,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:27:42,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:27:42,580 INFO L87 Difference]: Start difference. First operand 136 states and 181 transitions. Second operand 3 states. [2018-11-18 15:27:42,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:27:42,803 INFO L93 Difference]: Finished difference Result 263 states and 356 transitions. [2018-11-18 15:27:42,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:27:42,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2018-11-18 15:27:42,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:27:42,806 INFO L225 Difference]: With dead ends: 263 [2018-11-18 15:27:42,806 INFO L226 Difference]: Without dead ends: 140 [2018-11-18 15:27:42,807 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 126 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:27:42,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-18 15:27:42,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2018-11-18 15:27:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-18 15:27:42,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 182 transitions. [2018-11-18 15:27:42,822 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 182 transitions. Word has length 127 [2018-11-18 15:27:42,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:27:42,822 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 182 transitions. [2018-11-18 15:27:42,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:27:42,823 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 182 transitions. [2018-11-18 15:27:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-18 15:27:42,825 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:27:42,825 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:27:42,826 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:27:42,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:42,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1636557112, now seen corresponding path program 1 times [2018-11-18 15:27:42,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:27:42,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:42,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:42,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:42,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:27:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 15:27:42,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:27:42,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:27:42,989 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 133 with the following transitions: [2018-11-18 15:27:42,989 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [149], [150], [151], [153], [156], [160], [161], [162], [166], [172], [175], [180], [198], [217], [221], [222], [223], [232], [238], [240], [242], [244], [249], [252], [258], [261], [267], [273], [279], [285], [289], [292], [295], [302], [309], [316], [323], [325], [326], [329], [348], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [363], [364], [365], [366], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [401], [402], [403] [2018-11-18 15:27:42,992 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:27:42,993 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:27:43,027 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:27:43,027 INFO L272 AbstractInterpreter]: Visited 21 different actions 21 times. Never merged. Never widened. Performed 362 root evaluator evaluations with a maximum evaluation depth of 3. Performed 362 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-11-18 15:27:43,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:43,030 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:27:43,089 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 81.22% of their original sizes. [2018-11-18 15:27:43,090 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:27:43,121 INFO L415 sIntCurrentIteration]: We unified 131 AI predicates to 131 [2018-11-18 15:27:43,121 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:27:43,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:27:43,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2018-11-18 15:27:43,122 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:27:43,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:27:43,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:27:43,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:27:43,123 INFO L87 Difference]: Start difference. First operand 137 states and 182 transitions. Second operand 6 states. [2018-11-18 15:27:43,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:27:43,429 INFO L93 Difference]: Finished difference Result 269 states and 364 transitions. [2018-11-18 15:27:43,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:27:43,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2018-11-18 15:27:43,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:27:43,431 INFO L225 Difference]: With dead ends: 269 [2018-11-18 15:27:43,431 INFO L226 Difference]: Without dead ends: 146 [2018-11-18 15:27:43,432 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:27:43,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-18 15:27:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2018-11-18 15:27:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-18 15:27:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 188 transitions. [2018-11-18 15:27:43,444 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 188 transitions. Word has length 132 [2018-11-18 15:27:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:27:43,444 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 188 transitions. [2018-11-18 15:27:43,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:27:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 188 transitions. [2018-11-18 15:27:43,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-18 15:27:43,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:27:43,447 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:27:43,450 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:27:43,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:43,451 INFO L82 PathProgramCache]: Analyzing trace with hash 510651692, now seen corresponding path program 1 times [2018-11-18 15:27:43,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:27:43,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:43,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:43,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:43,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:27:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 15:27:43,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:27:43,549 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:27:43,549 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 138 with the following transitions: [2018-11-18 15:27:43,550 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [149], [150], [151], [153], [156], [160], [161], [162], [166], [172], [175], [180], [198], [209], [213], [214], [217], [221], [222], [223], [232], [238], [240], [242], [244], [249], [252], [258], [261], [267], [273], [279], [285], [289], [292], [295], [299], [302], [309], [316], [323], [325], [326], [329], [348], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [363], [364], [365], [366], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [401], [402], [403] [2018-11-18 15:27:43,553 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:27:43,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:27:43,571 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:27:43,571 INFO L272 AbstractInterpreter]: Visited 28 different actions 28 times. Never merged. Never widened. Performed 417 root evaluator evaluations with a maximum evaluation depth of 3. Performed 417 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-11-18 15:27:43,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:43,573 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:27:43,611 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 78.06% of their original sizes. [2018-11-18 15:27:43,611 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:27:43,661 INFO L415 sIntCurrentIteration]: We unified 136 AI predicates to 136 [2018-11-18 15:27:43,661 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:27:43,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:27:43,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2018-11-18 15:27:43,662 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:27:43,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:27:43,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:27:43,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:27:43,663 INFO L87 Difference]: Start difference. First operand 143 states and 188 transitions. Second operand 9 states. [2018-11-18 15:27:44,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:27:44,208 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2018-11-18 15:27:44,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:27:44,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2018-11-18 15:27:44,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:27:44,209 INFO L225 Difference]: With dead ends: 275 [2018-11-18 15:27:44,209 INFO L226 Difference]: Without dead ends: 152 [2018-11-18 15:27:44,210 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:27:44,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-18 15:27:44,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2018-11-18 15:27:44,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-18 15:27:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 194 transitions. [2018-11-18 15:27:44,222 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 194 transitions. Word has length 137 [2018-11-18 15:27:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:27:44,223 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 194 transitions. [2018-11-18 15:27:44,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:27:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 194 transitions. [2018-11-18 15:27:44,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-18 15:27:44,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:27:44,225 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:27:44,225 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:27:44,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:44,225 INFO L82 PathProgramCache]: Analyzing trace with hash 2085783982, now seen corresponding path program 1 times [2018-11-18 15:27:44,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:27:44,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:44,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:44,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:44,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:27:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:44,342 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 15:27:44,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:27:44,342 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:27:44,342 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 143 with the following transitions: [2018-11-18 15:27:44,342 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [149], [150], [151], [153], [156], [160], [161], [162], [166], [172], [175], [180], [198], [201], [205], [206], [209], [213], [214], [217], [221], [222], [223], [232], [238], [240], [242], [244], [249], [252], [258], [261], [267], [273], [279], [285], [289], [292], [295], [299], [302], [306], [309], [316], [323], [325], [326], [329], [348], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [363], [364], [365], [366], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [401], [402], [403] [2018-11-18 15:27:44,344 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:27:44,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:27:44,371 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:27:44,371 INFO L272 AbstractInterpreter]: Visited 35 different actions 35 times. Never merged. Never widened. Performed 472 root evaluator evaluations with a maximum evaluation depth of 3. Performed 472 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-11-18 15:27:44,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:44,383 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:27:44,430 INFO L227 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 75.71% of their original sizes. [2018-11-18 15:27:44,431 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:27:44,491 INFO L415 sIntCurrentIteration]: We unified 141 AI predicates to 141 [2018-11-18 15:27:44,491 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:27:44,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:27:44,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 20 [2018-11-18 15:27:44,492 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:27:44,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 15:27:44,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 15:27:44,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-18 15:27:44,493 INFO L87 Difference]: Start difference. First operand 149 states and 194 transitions. Second operand 12 states. [2018-11-18 15:27:45,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:27:45,177 INFO L93 Difference]: Finished difference Result 281 states and 376 transitions. [2018-11-18 15:27:45,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:27:45,177 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 142 [2018-11-18 15:27:45,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:27:45,177 INFO L225 Difference]: With dead ends: 281 [2018-11-18 15:27:45,177 INFO L226 Difference]: Without dead ends: 158 [2018-11-18 15:27:45,178 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 141 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-18 15:27:45,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-18 15:27:45,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2018-11-18 15:27:45,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-18 15:27:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 200 transitions. [2018-11-18 15:27:45,188 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 200 transitions. Word has length 142 [2018-11-18 15:27:45,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:27:45,188 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 200 transitions. [2018-11-18 15:27:45,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 15:27:45,188 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 200 transitions. [2018-11-18 15:27:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 15:27:45,189 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:27:45,189 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:27:45,189 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:27:45,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:45,190 INFO L82 PathProgramCache]: Analyzing trace with hash -172508272, now seen corresponding path program 1 times [2018-11-18 15:27:45,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:27:45,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:45,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:45,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:45,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:27:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-18 15:27:45,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:27:45,255 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:27:45,255 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-11-18 15:27:45,255 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [145], [147], [148], [149], [150], [151], [153], [156], [160], [161], [162], [166], [172], [175], [180], [198], [201], [205], [206], [209], [213], [214], [217], [221], [222], [223], [232], [238], [240], [242], [244], [249], [252], [258], [261], [267], [273], [279], [285], [289], [292], [295], [299], [302], [306], [309], [313], [316], [323], [325], [326], [329], [348], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [363], [364], [365], [366], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [401], [402], [403] [2018-11-18 15:27:45,257 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:27:45,257 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:27:45,274 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:27:45,275 INFO L272 AbstractInterpreter]: Visited 38 different actions 38 times. Never merged. Never widened. Performed 519 root evaluator evaluations with a maximum evaluation depth of 3. Performed 519 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-11-18 15:27:45,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:45,276 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:27:45,305 INFO L227 lantSequenceWeakener]: Weakened 32 states. On average, predicates are now at 71.97% of their original sizes. [2018-11-18 15:27:45,306 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:27:45,375 INFO L415 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2018-11-18 15:27:45,375 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:27:45,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:27:45,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [5] total 16 [2018-11-18 15:27:45,376 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:27:45,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 15:27:45,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 15:27:45,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-18 15:27:45,376 INFO L87 Difference]: Start difference. First operand 155 states and 200 transitions. Second operand 13 states. [2018-11-18 15:27:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:27:46,244 INFO L93 Difference]: Finished difference Result 280 states and 373 transitions. [2018-11-18 15:27:46,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:27:46,244 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 147 [2018-11-18 15:27:46,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:27:46,246 INFO L225 Difference]: With dead ends: 280 [2018-11-18 15:27:46,246 INFO L226 Difference]: Without dead ends: 157 [2018-11-18 15:27:46,247 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 146 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-18 15:27:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-18 15:27:46,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-11-18 15:27:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-18 15:27:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 203 transitions. [2018-11-18 15:27:46,256 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 203 transitions. Word has length 147 [2018-11-18 15:27:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:27:46,257 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 203 transitions. [2018-11-18 15:27:46,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 15:27:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 203 transitions. [2018-11-18 15:27:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 15:27:46,258 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:27:46,259 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:27:46,259 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:27:46,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:46,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2120572754, now seen corresponding path program 1 times [2018-11-18 15:27:46,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:27:46,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:46,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:46,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:46,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:27:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 15:27:46,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:27:46,361 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:27:46,362 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-11-18 15:27:46,362 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [143], [147], [148], [149], [150], [151], [153], [156], [160], [161], [162], [166], [172], [175], [180], [198], [201], [205], [206], [209], [213], [214], [217], [221], [222], [223], [232], [238], [240], [242], [244], [249], [252], [258], [261], [267], [273], [279], [285], [289], [292], [295], [299], [302], [306], [309], [313], [316], [323], [325], [326], [329], [348], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [363], [364], [365], [366], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [401], [402], [403] [2018-11-18 15:27:46,363 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:27:46,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:27:46,395 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:27:46,395 INFO L272 AbstractInterpreter]: Visited 54 different actions 54 times. Never merged. Never widened. Performed 639 root evaluator evaluations with a maximum evaluation depth of 3. Performed 639 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-11-18 15:27:46,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:46,403 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:27:46,455 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 73.9% of their original sizes. [2018-11-18 15:27:46,455 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:27:46,645 INFO L415 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2018-11-18 15:27:46,645 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:27:46,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:27:46,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [10] total 28 [2018-11-18 15:27:46,645 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:27:46,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 15:27:46,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 15:27:46,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-11-18 15:27:46,646 INFO L87 Difference]: Start difference. First operand 157 states and 203 transitions. Second operand 20 states. [2018-11-18 15:27:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:27:48,055 INFO L93 Difference]: Finished difference Result 305 states and 405 transitions. [2018-11-18 15:27:48,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 15:27:48,056 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 147 [2018-11-18 15:27:48,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:27:48,057 INFO L225 Difference]: With dead ends: 305 [2018-11-18 15:27:48,057 INFO L226 Difference]: Without dead ends: 182 [2018-11-18 15:27:48,058 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 146 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-11-18 15:27:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-18 15:27:48,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-11-18 15:27:48,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-18 15:27:48,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 225 transitions. [2018-11-18 15:27:48,071 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 225 transitions. Word has length 147 [2018-11-18 15:27:48,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:27:48,072 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 225 transitions. [2018-11-18 15:27:48,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 15:27:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 225 transitions. [2018-11-18 15:27:48,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 15:27:48,073 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:27:48,073 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:27:48,074 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:27:48,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:48,074 INFO L82 PathProgramCache]: Analyzing trace with hash 214169488, now seen corresponding path program 1 times [2018-11-18 15:27:48,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:27:48,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:48,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:48,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:48,075 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:27:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 15:27:48,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:27:48,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:27:48,145 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-11-18 15:27:48,146 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [143], [147], [148], [149], [150], [151], [153], [156], [160], [161], [162], [166], [172], [175], [180], [198], [201], [205], [206], [209], [213], [214], [217], [221], [222], [223], [232], [238], [240], [242], [244], [249], [252], [258], [261], [267], [273], [279], [285], [287], [289], [292], [295], [299], [302], [306], [309], [313], [316], [323], [325], [326], [329], [348], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [363], [364], [365], [366], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [401], [402], [403] [2018-11-18 15:27:48,148 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:27:48,148 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:27:48,186 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:27:48,186 INFO L272 AbstractInterpreter]: Visited 73 different actions 73 times. Never merged. Never widened. Performed 798 root evaluator evaluations with a maximum evaluation depth of 3. Performed 798 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-11-18 15:27:48,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:48,199 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:27:48,264 INFO L227 lantSequenceWeakener]: Weakened 66 states. On average, predicates are now at 73.92% of their original sizes. [2018-11-18 15:27:48,264 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:27:48,533 INFO L415 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2018-11-18 15:27:48,533 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:27:48,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:27:48,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [5] total 30 [2018-11-18 15:27:48,533 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:27:48,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-18 15:27:48,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-18 15:27:48,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2018-11-18 15:27:48,534 INFO L87 Difference]: Start difference. First operand 182 states and 225 transitions. Second operand 27 states. [2018-11-18 15:27:50,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:27:50,057 INFO L93 Difference]: Finished difference Result 304 states and 392 transitions. [2018-11-18 15:27:50,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 15:27:50,057 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 147 [2018-11-18 15:27:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:27:50,058 INFO L225 Difference]: With dead ends: 304 [2018-11-18 15:27:50,058 INFO L226 Difference]: Without dead ends: 184 [2018-11-18 15:27:50,059 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 148 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2018-11-18 15:27:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-18 15:27:50,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-11-18 15:27:50,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-18 15:27:50,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 226 transitions. [2018-11-18 15:27:50,069 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 226 transitions. Word has length 147 [2018-11-18 15:27:50,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:27:50,069 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 226 transitions. [2018-11-18 15:27:50,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-18 15:27:50,069 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 226 transitions. [2018-11-18 15:27:50,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-18 15:27:50,071 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:27:50,071 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:27:50,071 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:27:50,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:50,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1356671954, now seen corresponding path program 1 times [2018-11-18 15:27:50,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:27:50,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:50,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:50,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:50,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:27:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:50,174 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 15:27:50,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:27:50,174 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:27:50,174 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2018-11-18 15:27:50,174 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [94], [96], [100], [106], [110], [115], [117], [118], [123], [130], [143], [147], [148], [149], [150], [151], [153], [156], [160], [161], [162], [166], [172], [175], [180], [198], [201], [205], [206], [209], [213], [214], [217], [221], [222], [223], [232], [238], [240], [242], [244], [249], [252], [258], [261], [267], [273], [279], [285], [287], [289], [292], [295], [299], [302], [306], [309], [313], [316], [323], [325], [326], [329], [348], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [363], [364], [365], [366], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [401], [402], [403] [2018-11-18 15:27:50,176 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:27:50,176 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:27:50,205 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:27:50,205 INFO L272 AbstractInterpreter]: Visited 76 different actions 76 times. Never merged. Never widened. Performed 807 root evaluator evaluations with a maximum evaluation depth of 3. Performed 807 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2018-11-18 15:27:50,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:50,215 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:27:50,268 INFO L227 lantSequenceWeakener]: Weakened 68 states. On average, predicates are now at 73.89% of their original sizes. [2018-11-18 15:27:50,268 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:27:50,515 INFO L415 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2018-11-18 15:27:50,515 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:27:50,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:27:50,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [8] total 35 [2018-11-18 15:27:50,516 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:27:50,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-18 15:27:50,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 15:27:50,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2018-11-18 15:27:50,517 INFO L87 Difference]: Start difference. First operand 184 states and 226 transitions. Second operand 29 states. [2018-11-18 15:27:52,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:27:52,830 INFO L93 Difference]: Finished difference Result 374 states and 496 transitions. [2018-11-18 15:27:52,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 15:27:52,830 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 147 [2018-11-18 15:27:52,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:27:52,831 INFO L225 Difference]: With dead ends: 374 [2018-11-18 15:27:52,831 INFO L226 Difference]: Without dead ends: 255 [2018-11-18 15:27:52,832 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 148 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2018-11-18 15:27:52,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-11-18 15:27:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-11-18 15:27:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-18 15:27:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 303 transitions. [2018-11-18 15:27:52,841 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 303 transitions. Word has length 147 [2018-11-18 15:27:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:27:52,842 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 303 transitions. [2018-11-18 15:27:52,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-18 15:27:52,842 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 303 transitions. [2018-11-18 15:27:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-18 15:27:52,843 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:27:52,843 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:27:52,843 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:27:52,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:52,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1426170490, now seen corresponding path program 1 times [2018-11-18 15:27:52,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:27:52,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:52,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:52,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:52,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:27:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-18 15:27:52,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:27:52,920 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:27:52,920 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 170 with the following transitions: [2018-11-18 15:27:52,921 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [19], [30], [42], [46], [65], [69], [78], [79], [82], [88], [94], [96], [100], [106], [108], [110], [115], [117], [118], [123], [130], [143], [147], [148], [149], [150], [151], [153], [156], [160], [161], [162], [166], [172], [175], [178], [180], [184], [187], [198], [201], [205], [206], [209], [213], [214], [217], [221], [222], [223], [232], [238], [240], [242], [244], [249], [252], [258], [261], [267], [273], [279], [285], [287], [289], [292], [295], [299], [302], [306], [309], [313], [316], [323], [325], [326], [329], [348], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [401], [402], [403] [2018-11-18 15:27:52,922 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:27:52,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:27:52,955 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:27:52,955 INFO L272 AbstractInterpreter]: Visited 100 different actions 100 times. Never merged. Never widened. Performed 973 root evaluator evaluations with a maximum evaluation depth of 3. Performed 973 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 48 variables. [2018-11-18 15:27:52,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:52,958 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:27:53,014 INFO L227 lantSequenceWeakener]: Weakened 100 states. On average, predicates are now at 71.69% of their original sizes. [2018-11-18 15:27:53,014 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:27:53,478 INFO L415 sIntCurrentIteration]: We unified 168 AI predicates to 168 [2018-11-18 15:27:53,478 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:27:53,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:27:53,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [6] total 44 [2018-11-18 15:27:53,478 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:27:53,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-18 15:27:53,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-18 15:27:53,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1458, Unknown=0, NotChecked=0, Total=1560 [2018-11-18 15:27:53,479 INFO L87 Difference]: Start difference. First operand 255 states and 303 transitions. Second operand 40 states. [2018-11-18 15:27:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:27:58,105 INFO L93 Difference]: Finished difference Result 532 states and 696 transitions. [2018-11-18 15:27:58,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-18 15:27:58,105 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 169 [2018-11-18 15:27:58,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:27:58,107 INFO L225 Difference]: With dead ends: 532 [2018-11-18 15:27:58,107 INFO L226 Difference]: Without dead ends: 340 [2018-11-18 15:27:58,108 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 172 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=1768, Unknown=0, NotChecked=0, Total=1892 [2018-11-18 15:27:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-18 15:27:58,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 331. [2018-11-18 15:27:58,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-11-18 15:27:58,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 399 transitions. [2018-11-18 15:27:58,126 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 399 transitions. Word has length 169 [2018-11-18 15:27:58,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:27:58,126 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 399 transitions. [2018-11-18 15:27:58,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-18 15:27:58,126 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 399 transitions. [2018-11-18 15:27:58,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-18 15:27:58,127 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:27:58,128 INFO L375 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, 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] [2018-11-18 15:27:58,128 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:27:58,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:58,128 INFO L82 PathProgramCache]: Analyzing trace with hash -566323802, now seen corresponding path program 1 times [2018-11-18 15:27:58,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:27:58,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:58,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:58,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:58,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:27:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 15:27:58,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:27:58,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:27:58,189 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:27:58,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:27:58,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:27:58,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:27:58,190 INFO L87 Difference]: Start difference. First operand 331 states and 399 transitions. Second operand 3 states. [2018-11-18 15:27:58,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:27:58,222 INFO L93 Difference]: Finished difference Result 585 states and 731 transitions. [2018-11-18 15:27:58,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:27:58,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2018-11-18 15:27:58,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:27:58,224 INFO L225 Difference]: With dead ends: 585 [2018-11-18 15:27:58,224 INFO L226 Difference]: Without dead ends: 343 [2018-11-18 15:27:58,225 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:27:58,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-11-18 15:27:58,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 337. [2018-11-18 15:27:58,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-18 15:27:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 405 transitions. [2018-11-18 15:27:58,242 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 405 transitions. Word has length 176 [2018-11-18 15:27:58,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:27:58,243 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 405 transitions. [2018-11-18 15:27:58,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:27:58,243 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 405 transitions. [2018-11-18 15:27:58,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-18 15:27:58,244 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:27:58,244 INFO L375 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, 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] [2018-11-18 15:27:58,244 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:27:58,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:58,244 INFO L82 PathProgramCache]: Analyzing trace with hash 591669452, now seen corresponding path program 1 times [2018-11-18 15:27:58,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:27:58,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:58,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:27:58,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:27:58,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:27:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:27:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-18 15:27:58,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:27:58,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:27:58,368 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 178 with the following transitions: [2018-11-18 15:27:58,369 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [15], [17], [18], [19], [22], [25], [34], [39], [46], [65], [71], [74], [78], [79], [82], [88], [94], [96], [100], [106], [108], [110], [115], [117], [118], [123], [130], [135], [139], [140], [143], [147], [148], [149], [150], [151], [153], [156], [160], [161], [162], [166], [172], [175], [178], [180], [184], [187], [198], [201], [205], [206], [209], [213], [214], [217], [221], [222], [223], [232], [238], [240], [242], [244], [249], [252], [258], [261], [267], [273], [279], [285], [287], [289], [292], [295], [299], [302], [306], [309], [313], [316], [320], [323], [325], [326], [329], [348], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [399], [400], [401], [402], [403] [2018-11-18 15:27:58,370 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:27:58,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:27:58,398 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:27:58,398 INFO L272 AbstractInterpreter]: Visited 105 different actions 105 times. Never merged. Never widened. Performed 985 root evaluator evaluations with a maximum evaluation depth of 3. Performed 985 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 48 variables. [2018-11-18 15:27:58,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:27:58,402 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:27:58,469 INFO L227 lantSequenceWeakener]: Weakened 103 states. On average, predicates are now at 69.48% of their original sizes. [2018-11-18 15:27:58,469 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:27:59,043 INFO L415 sIntCurrentIteration]: We unified 176 AI predicates to 176 [2018-11-18 15:27:59,043 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:27:59,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:27:59,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [44] imperfect sequences [11] total 53 [2018-11-18 15:27:59,043 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:27:59,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-18 15:27:59,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-18 15:27:59,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1756, Unknown=0, NotChecked=0, Total=1892 [2018-11-18 15:27:59,044 INFO L87 Difference]: Start difference. First operand 337 states and 405 transitions. Second operand 44 states. [2018-11-18 15:28:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:28:03,716 INFO L93 Difference]: Finished difference Result 590 states and 727 transitions. [2018-11-18 15:28:03,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-18 15:28:03,716 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 177 [2018-11-18 15:28:03,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:28:03,718 INFO L225 Difference]: With dead ends: 590 [2018-11-18 15:28:03,718 INFO L226 Difference]: Without dead ends: 342 [2018-11-18 15:28:03,719 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 185 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=2540, Unknown=0, NotChecked=0, Total=2756 [2018-11-18 15:28:03,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-11-18 15:28:03,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 333. [2018-11-18 15:28:03,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-11-18 15:28:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 395 transitions. [2018-11-18 15:28:03,737 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 395 transitions. Word has length 177 [2018-11-18 15:28:03,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:28:03,737 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 395 transitions. [2018-11-18 15:28:03,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-18 15:28:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 395 transitions. [2018-11-18 15:28:03,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 15:28:03,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:28:03,739 INFO L375 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, 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] [2018-11-18 15:28:03,739 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:28:03,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:28:03,739 INFO L82 PathProgramCache]: Analyzing trace with hash -928682347, now seen corresponding path program 1 times [2018-11-18 15:28:03,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:28:03,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:28:03,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:28:03,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:28:03,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:28:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:28:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-18 15:28:03,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:28:03,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:28:03,799 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:28:03,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:28:03,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:28:03,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:28:03,800 INFO L87 Difference]: Start difference. First operand 333 states and 395 transitions. Second operand 3 states. [2018-11-18 15:28:03,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:28:03,825 INFO L93 Difference]: Finished difference Result 590 states and 725 transitions. [2018-11-18 15:28:03,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:28:03,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2018-11-18 15:28:03,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:28:03,827 INFO L225 Difference]: With dead ends: 590 [2018-11-18 15:28:03,827 INFO L226 Difference]: Without dead ends: 346 [2018-11-18 15:28:03,828 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:28:03,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-11-18 15:28:03,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 340. [2018-11-18 15:28:03,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-18 15:28:03,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 405 transitions. [2018-11-18 15:28:03,845 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 405 transitions. Word has length 178 [2018-11-18 15:28:03,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:28:03,846 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 405 transitions. [2018-11-18 15:28:03,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:28:03,846 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 405 transitions. [2018-11-18 15:28:03,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 15:28:03,847 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:28:03,847 INFO L375 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, 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] [2018-11-18 15:28:03,847 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:28:03,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:28:03,848 INFO L82 PathProgramCache]: Analyzing trace with hash 638075603, now seen corresponding path program 1 times [2018-11-18 15:28:03,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:28:03,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:28:03,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:28:03,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:28:03,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:28:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:28:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 15:28:03,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:28:03,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:28:03,933 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 179 with the following transitions: [2018-11-18 15:28:03,934 INFO L202 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [15], [17], [18], [19], [22], [25], [34], [37], [48], [53], [65], [71], [74], [78], [79], [82], [88], [94], [96], [100], [106], [108], [110], [115], [117], [118], [123], [130], [135], [139], [140], [143], [147], [148], [149], [150], [151], [153], [156], [160], [161], [162], [166], [172], [175], [178], [180], [184], [187], [198], [201], [205], [206], [209], [213], [214], [217], [221], [222], [223], [232], [238], [240], [242], [244], [249], [252], [258], [261], [267], [273], [279], [285], [287], [289], [292], [295], [299], [302], [306], [309], [313], [316], [320], [323], [325], [326], [329], [348], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [399], [400], [401], [402], [403] [2018-11-18 15:28:03,935 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:28:03,935 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:28:04,036 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 15:28:04,036 INFO L272 AbstractInterpreter]: Visited 122 different actions 177 times. Merged at 11 different actions 17 times. Never widened. Performed 1859 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1859 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 1 different actions. Largest state had 48 variables. [2018-11-18 15:28:04,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:28:04,039 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 15:28:04,188 INFO L227 lantSequenceWeakener]: Weakened 127 states. On average, predicates are now at 71.52% of their original sizes. [2018-11-18 15:28:04,188 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 15:28:05,086 INFO L415 sIntCurrentIteration]: We unified 177 AI predicates to 177 [2018-11-18 15:28:05,086 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 15:28:05,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:28:05,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [53] imperfect sequences [7] total 58 [2018-11-18 15:28:05,086 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:28:05,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-18 15:28:05,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-18 15:28:05,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2572, Unknown=0, NotChecked=0, Total=2756 [2018-11-18 15:28:05,087 INFO L87 Difference]: Start difference. First operand 340 states and 405 transitions. Second operand 53 states. [2018-11-18 15:28:13,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:28:13,330 INFO L93 Difference]: Finished difference Result 500 states and 601 transitions. [2018-11-18 15:28:13,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-18 15:28:13,331 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 178 [2018-11-18 15:28:13,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:28:13,331 INFO L225 Difference]: With dead ends: 500 [2018-11-18 15:28:13,331 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 15:28:13,334 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 201 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=563, Invalid=5289, Unknown=0, NotChecked=0, Total=5852 [2018-11-18 15:28:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 15:28:13,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 15:28:13,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 15:28:13,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 15:28:13,335 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2018-11-18 15:28:13,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:28:13,335 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:28:13,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-18 15:28:13,335 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:28:13,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 15:28:13,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 15:28:13,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:28:13,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:28:13,805 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2018-11-18 15:28:13,924 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2018-11-18 15:28:14,143 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 131 [2018-11-18 15:28:14,266 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2018-11-18 15:28:14,452 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-11-18 15:28:14,565 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2018-11-18 15:28:14,709 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 72 [2018-11-18 15:28:14,966 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2018-11-18 15:28:15,290 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 78 [2018-11-18 15:28:15,529 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2018-11-18 15:28:15,818 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 72 [2018-11-18 15:28:15,999 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2018-11-18 15:28:16,172 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 97 [2018-11-18 15:28:16,527 WARN L180 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2018-11-18 15:28:16,672 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 106 [2018-11-18 15:28:16,984 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2018-11-18 15:28:17,400 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 135 [2018-11-18 15:28:17,792 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 95 [2018-11-18 15:28:17,931 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 106 [2018-11-18 15:28:18,202 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 131 [2018-11-18 15:28:18,404 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2018-11-18 15:28:18,607 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 129 [2018-11-18 15:28:18,793 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 129 [2018-11-18 15:28:19,112 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 144 [2018-11-18 15:28:19,429 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 86 [2018-11-18 15:28:19,431 INFO L421 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 373 388) the Hoare annotation is: (or (not (= ~z_ev~0 2)) (or (= ~comp_m1_st~0 0) (= ~comp_m1_st~0 2)) (< 0 ~comp_m1_i~0) (let ((.cse0 (not (= 0 ~z_val_t~0)))) (and (or (not (= ~z_req_up~0 0)) .cse0) (or .cse0 (not (= ~z_req_up~0 1))))) (let ((.cse1 (not (= 2 ~d0_ev~0))) (.cse2 (not (= ~b1_ev~0 2))) (.cse3 (not (= 1 ~b1_val~0))) (.cse4 (not (= ~z_val~0 0))) (.cse5 (not (= 2 ~d1_ev~0))) (.cse6 (not (= 2 ~b0_ev~0))) (.cse7 (not (= 1 ~d1_val~0))) (.cse8 (not (= 0 ~d1_req_up~0))) (.cse9 (not (= 0 ~b1_req_up~0))) (.cse10 (not (= 0 ~b0_req_up~0))) (.cse11 (not (= ~d0_req_up~0 0))) (.cse12 (not (= ~b0_val~0 1)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 0 |old(~comp_m1_st~0)|)) .cse10 .cse11 .cse12) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 2 |old(~comp_m1_st~0)|)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) (not (= ~d0_val~0 1))) [2018-11-18 15:28:19,431 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 384) no Hoare annotation was computed. [2018-11-18 15:28:19,431 INFO L425 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 373 388) no Hoare annotation was computed. [2018-11-18 15:28:19,431 INFO L421 ceAbstractionStarter]: At program point L378(line 378) the Hoare annotation is: (or (not (= ~z_ev~0 2)) (or (= ~comp_m1_st~0 0) (= ~comp_m1_st~0 2)) (< 0 ~comp_m1_i~0) (let ((.cse0 (not (= 0 ~z_val_t~0)))) (and (or (not (= ~z_req_up~0 0)) .cse0) (or .cse0 (not (= ~z_req_up~0 1))))) (let ((.cse1 (not (= 2 ~d0_ev~0))) (.cse2 (not (= ~b1_ev~0 2))) (.cse3 (not (= 1 ~b1_val~0))) (.cse4 (not (= ~z_val~0 0))) (.cse5 (not (= 2 ~d1_ev~0))) (.cse6 (not (= 2 ~b0_ev~0))) (.cse7 (not (= 1 ~d1_val~0))) (.cse8 (not (= 0 ~d1_req_up~0))) (.cse9 (not (= 0 ~b1_req_up~0))) (.cse10 (not (= 0 ~b0_req_up~0))) (.cse11 (not (= ~d0_req_up~0 0))) (.cse12 (not (= ~b0_val~0 1)))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 0 |old(~comp_m1_st~0)|)) .cse10 .cse11 .cse12) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 2 |old(~comp_m1_st~0)|)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) (not (= ~d0_val~0 1))) [2018-11-18 15:28:19,431 INFO L425 ceAbstractionStarter]: For program point L380-2(lines 373 388) no Hoare annotation was computed. [2018-11-18 15:28:19,431 INFO L425 ceAbstractionStarter]: For program point L378-1(line 378) no Hoare annotation was computed. [2018-11-18 15:28:19,431 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 254 268) no Hoare annotation was computed. [2018-11-18 15:28:19,432 INFO L421 ceAbstractionStarter]: At program point L265(lines 257 267) the Hoare annotation is: (let ((.cse4 (not (= 2 ~d0_ev~0))) (.cse0 (not (= ~z_ev~0 2))) (.cse17 (= exists_runnable_thread_~__retres1~1 1)) (.cse5 (not (= ~b1_ev~0 2))) (.cse6 (not (= 1 ~b1_val~0))) (.cse7 (not (= ~z_val~0 0))) (.cse8 (not (= 2 ~d1_ev~0))) (.cse9 (not (= 2 ~b0_ev~0))) (.cse10 (not (= 1 ~d1_val~0))) (.cse2 (not (= ~z_req_up~0 0))) (.cse11 (not (= 0 ~d1_req_up~0))) (.cse12 (not (= 0 ~b1_req_up~0))) (.cse1 (< 0 ~comp_m1_i~0)) (.cse13 (not (= 0 ~comp_m1_st~0))) (.cse14 (not (= 0 ~b0_req_up~0))) (.cse15 (not (= ~d0_req_up~0 0))) (.cse16 (not (= ~b0_val~0 1))) (.cse18 (not (= ~d0_val~0 1)))) (and (or .cse0 .cse1 (let ((.cse3 (not (= 0 ~z_val_t~0)))) (and (or .cse2 .cse3) (or .cse3 (not (= ~z_req_up~0 1))))) (and (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 2 ~comp_m1_st~0)) .cse10 .cse11 .cse12 .cse14 .cse15 .cse16)) (or (and .cse17 (= ~comp_m1_st~0 0)) (and (= exists_runnable_thread_~__retres1~1 0) (= ~comp_m1_st~0 2))) .cse18) (or .cse4 .cse0 .cse17 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse2 .cse11 .cse12 .cse1 .cse13 .cse14 .cse15 .cse16 .cse18))) [2018-11-18 15:28:19,432 INFO L428 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 254 268) the Hoare annotation is: true [2018-11-18 15:28:19,432 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 263) no Hoare annotation was computed. [2018-11-18 15:28:19,432 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 254 268) no Hoare annotation was computed. [2018-11-18 15:28:19,432 INFO L425 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2018-11-18 15:28:19,432 INFO L425 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2018-11-18 15:28:19,432 INFO L425 ceAbstractionStarter]: For program point L81-2(lines 78 86) no Hoare annotation was computed. [2018-11-18 15:28:19,432 INFO L425 ceAbstractionStarter]: For program point L69(lines 41 91) no Hoare annotation was computed. [2018-11-18 15:28:19,432 INFO L421 ceAbstractionStarter]: At program point method1ENTRY(lines 36 92) the Hoare annotation is: (or (not (= ~z_ev~0 2)) (not (= 1 ~b1_val~0)) (let ((.cse0 (= ~z_val_t~0 0))) (or (and .cse0 (= ~z_req_up~0 0)) (and (= ~z_req_up~0 1) .cse0))) (not (= 1 ~d1_val~0)) (< 0 ~comp_m1_i~0) (let ((.cse1 (not (= 0 ~d1_req_up~0))) (.cse2 (not (= 2 ~d0_ev~0))) (.cse3 (not (= ~b1_ev~0 2))) (.cse4 (not (= ~z_val~0 0))) (.cse5 (not (= 0 |old(~z_val_t~0)|))) (.cse6 (not (= 0 ~b1_req_up~0))) (.cse7 (not (= 2 ~d1_ev~0))) (.cse8 (not (= 2 ~b0_ev~0)))) (and (or (not (= |old(~z_req_up~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= |old(~z_req_up~0)| 1)) .cse8))) (not (= 0 ~b0_req_up~0)) (not (= ~d0_req_up~0 0)) (not (= ~b0_val~0 1)) (not (= ~d0_val~0 1))) [2018-11-18 15:28:19,432 INFO L425 ceAbstractionStarter]: For program point method1FINAL(lines 36 92) no Hoare annotation was computed. [2018-11-18 15:28:19,432 INFO L425 ceAbstractionStarter]: For program point L70(lines 70 74) no Hoare annotation was computed. [2018-11-18 15:28:19,432 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2018-11-18 15:28:19,432 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 41 91) no Hoare annotation was computed. [2018-11-18 15:28:19,432 INFO L425 ceAbstractionStarter]: For program point method1EXIT(lines 36 92) no Hoare annotation was computed. [2018-11-18 15:28:19,432 INFO L425 ceAbstractionStarter]: For program point L63(lines 63 67) no Hoare annotation was computed. [2018-11-18 15:28:19,432 INFO L425 ceAbstractionStarter]: For program point L63-2(lines 41 91) no Hoare annotation was computed. [2018-11-18 15:28:19,433 INFO L425 ceAbstractionStarter]: For program point L51(lines 41 91) no Hoare annotation was computed. [2018-11-18 15:28:19,433 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2018-11-18 15:28:19,433 INFO L425 ceAbstractionStarter]: For program point L349-1(lines 343 371) no Hoare annotation was computed. [2018-11-18 15:28:19,433 INFO L421 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 340 372) the Hoare annotation is: (let ((.cse5 (not (= ~z_req_up~0 0))) (.cse6 (not (= 0 ~d1_req_up~0))) (.cse3 (not (= ~z_val~0 0))) (.cse7 (not (= 0 ~b1_req_up~0)))) (let ((.cse9 (not (= 0 ~comp_m1_st~0))) (.cse1 (not (= |old(~z_ev~0)| 2))) (.cse0 (= ~z_ev~0 2)) (.cse15 (= ~d1_ev~0 2)) (.cse14 (= ~b1_ev~0 2)) (.cse16 (= ~b0_ev~0 2)) (.cse17 (= ~d0_ev~0 2)) (.cse8 (< 0 ~comp_m1_i~0)) (.cse18 (let ((.cse19 (not (= 2 |old(~d0_ev~0)|))) (.cse20 (not (= |old(~b1_ev~0)| 2))) (.cse21 (not (= 0 ~z_val_t~0))) (.cse22 (not (= 2 |old(~d1_ev~0)|))) (.cse23 (not (= 2 |old(~b0_ev~0)|)))) (and (or .cse5 .cse6 .cse19 .cse20 .cse3 .cse21 .cse7 .cse22 .cse23) (or .cse6 .cse19 .cse20 .cse3 .cse21 .cse7 .cse22 (not (= ~z_req_up~0 1)) .cse23)))) (.cse2 (not (= 1 ~b1_val~0))) (.cse4 (not (= 1 ~d1_val~0))) (.cse10 (not (= 0 ~b0_req_up~0))) (.cse11 (not (= ~d0_req_up~0 0))) (.cse12 (not (= ~b0_val~0 1))) (.cse13 (not (= ~d0_val~0 1)))) (and (or (and (= ~b1_ev~0 1) (= ~b0_ev~0 1) (= ~d0_ev~0 1) (= ~d1_ev~0 1) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~b1_ev~0)| 1)) .cse7 .cse8 (not (= 1 |old(~d0_ev~0)|)) .cse9 .cse10 (not (= 1 |old(~b0_ev~0)|)) .cse11 .cse12 .cse13 (not (= 1 |old(~d1_ev~0)|))) (or .cse1 .cse2 .cse4 (and .cse14 .cse15 .cse16 .cse17 .cse0) .cse8 .cse18 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse1 (and .cse0 (and .cse15 .cse14 .cse16 .cse17)) .cse8 .cse18 (or .cse2 (not (= 2 ~comp_m1_st~0)) .cse4 .cse10 .cse11 .cse12) .cse13)))) [2018-11-18 15:28:19,433 INFO L425 ceAbstractionStarter]: For program point L364-1(lines 340 372) no Hoare annotation was computed. [2018-11-18 15:28:19,433 INFO L425 ceAbstractionStarter]: For program point L354-1(lines 343 371) no Hoare annotation was computed. [2018-11-18 15:28:19,433 INFO L425 ceAbstractionStarter]: For program point L344-1(lines 343 371) no Hoare annotation was computed. [2018-11-18 15:28:19,433 INFO L425 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 340 372) no Hoare annotation was computed. [2018-11-18 15:28:19,433 INFO L425 ceAbstractionStarter]: For program point L359-1(lines 343 371) no Hoare annotation was computed. [2018-11-18 15:28:19,433 INFO L425 ceAbstractionStarter]: For program point init_threadsEXIT(lines 241 253) no Hoare annotation was computed. [2018-11-18 15:28:19,433 INFO L428 ceAbstractionStarter]: At program point init_threadsENTRY(lines 241 253) the Hoare annotation is: true [2018-11-18 15:28:19,433 INFO L425 ceAbstractionStarter]: For program point L245-1(lines 241 253) no Hoare annotation was computed. [2018-11-18 15:28:19,433 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 483 501) the Hoare annotation is: (or (< 0 |old(~comp_m1_i~0)|) (<= ~comp_m1_i~0 0)) [2018-11-18 15:28:19,433 INFO L421 ceAbstractionStarter]: At program point L493(line 493) the Hoare annotation is: (< 0 |old(~comp_m1_i~0)|) [2018-11-18 15:28:19,433 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 483 501) no Hoare annotation was computed. [2018-11-18 15:28:19,433 INFO L425 ceAbstractionStarter]: For program point L491(lines 491 497) no Hoare annotation was computed. [2018-11-18 15:28:19,433 INFO L425 ceAbstractionStarter]: For program point L489(lines 486 500) no Hoare annotation was computed. [2018-11-18 15:28:19,434 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 483 501) no Hoare annotation was computed. [2018-11-18 15:28:19,434 INFO L421 ceAbstractionStarter]: At program point L488(line 488) the Hoare annotation is: (or (< 0 |old(~comp_m1_i~0)|) (<= ~comp_m1_i~0 0)) [2018-11-18 15:28:19,434 INFO L421 ceAbstractionStarter]: At program point L488-1(line 488) the Hoare annotation is: (or (and (= ~z_val~0 0) (= ~d1_ev~0 2) (= ~b1_ev~0 2) (= ~d0_val~0 0) (= ~b0_val~0 0) (= ~b0_ev~0 2) (= ~b1_req_up~0 1) (= ~z_req_up~0 0) (= ~b0_val_t~0 1) (= ~d0_ev~0 2) (= ~d1_req_up~0 1) (= ~b0_req_up~0 1) (= ~d0_val_t~0 1) (= ~d1_val_t~0 1) (= ~b1_val~0 0) (= ~b1_val_t~0 1) (= ~z_ev~0 2) (= ~comp_m1_i~0 0) (= ~d0_req_up~0 1) (= ~d1_val~0 0)) (< 0 |old(~comp_m1_i~0)|)) [2018-11-18 15:28:19,434 INFO L425 ceAbstractionStarter]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2018-11-18 15:28:19,434 INFO L425 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2018-11-18 15:28:19,434 INFO L428 ceAbstractionStarter]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2018-11-18 15:28:19,434 INFO L425 ceAbstractionStarter]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2018-11-18 15:28:19,434 INFO L425 ceAbstractionStarter]: For program point L187-1(lines 187 192) no Hoare annotation was computed. [2018-11-18 15:28:19,434 INFO L425 ceAbstractionStarter]: For program point update_zEXIT(lines 183 197) no Hoare annotation was computed. [2018-11-18 15:28:19,434 INFO L421 ceAbstractionStarter]: At program point update_zENTRY(lines 183 197) the Hoare annotation is: (let ((.cse7 (not (= 2 ~comp_m1_st~0)))) (let ((.cse0 (not (= |old(~z_ev~0)| 2))) (.cse1 (= ~z_req_up~0 1)) (.cse4 (not (= |old(~z_req_up~0)| 1))) (.cse3 (not (= 0 ~z_val_t~0))) (.cse2 (< 0 ~comp_m1_i~0)) (.cse5 (let ((.cse8 (not (= 2 ~d0_ev~0))) (.cse9 (not (= ~b1_ev~0 2))) (.cse10 (not (= 1 ~b1_val~0))) (.cse11 (not (= |old(~z_val~0)| 0))) (.cse12 (not (= 2 ~d1_ev~0))) (.cse13 (not (= 2 ~b0_ev~0))) (.cse14 (not (= 1 ~d1_val~0))) (.cse15 (not (= 0 ~d1_req_up~0))) (.cse16 (not (= 0 ~b1_req_up~0))) (.cse17 (not (= 0 ~b0_req_up~0))) (.cse18 (not (= ~d0_req_up~0 0))) (.cse19 (not (= ~b0_val~0 1)))) (and (or .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= 0 ~comp_m1_st~0)) .cse17 .cse18 .cse19) (or .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse7 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.cse6 (not (= ~d0_val~0 1)))) (and (or .cse0 (and (or .cse1 (= ~z_req_up~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0)) .cse2 (and (or (not (= |old(~z_req_up~0)| 0)) .cse3) (or .cse3 .cse4)) .cse5 .cse6) (or .cse0 .cse1 .cse4 .cse7 .cse3 .cse2 .cse5 .cse6)))) [2018-11-18 15:28:19,434 INFO L425 ceAbstractionStarter]: For program point update_zFINAL(lines 183 197) no Hoare annotation was computed. [2018-11-18 15:28:19,434 INFO L421 ceAbstractionStarter]: At program point update_d1ENTRY(lines 168 182) the Hoare annotation is: (or (not (= ~z_ev~0 2)) (not (= 1 ~b1_val~0)) (not (= ~z_val~0 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 0 ~b0_ev~0)) (not (= 0 |old(~d1_val~0)|)) (not (= ~z_req_up~0 0)) (and (= ~d1_ev~0 2) (= ~d1_req_up~0 1) (= ~d1_val~0 0)) (not (= ~d1_val_t~0 1)) (not (= 0 ~b1_req_up~0)) (not (= ~b1_ev~0 0)) (not (= 0 ~b0_req_up~0)) (not (= ~d0_req_up~0 0)) (not (= ~b0_val~0 1)) (not (= 0 ~d0_ev~0)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val~0 1))) [2018-11-18 15:28:19,434 INFO L425 ceAbstractionStarter]: For program point L172-1(lines 172 177) no Hoare annotation was computed. [2018-11-18 15:28:19,434 INFO L425 ceAbstractionStarter]: For program point update_d1FINAL(lines 168 182) no Hoare annotation was computed. [2018-11-18 15:28:19,434 INFO L425 ceAbstractionStarter]: For program point update_d1EXIT(lines 168 182) no Hoare annotation was computed. [2018-11-18 15:28:19,434 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 15:28:19,434 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 15:28:19,435 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:28:19,435 INFO L425 ceAbstractionStarter]: For program point L397(lines 397 402) no Hoare annotation was computed. [2018-11-18 15:28:19,435 INFO L428 ceAbstractionStarter]: At program point L395(line 395) the Hoare annotation is: true [2018-11-18 15:28:19,435 INFO L425 ceAbstractionStarter]: For program point L395-1(line 395) no Hoare annotation was computed. [2018-11-18 15:28:19,435 INFO L425 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 389 407) no Hoare annotation was computed. [2018-11-18 15:28:19,435 INFO L428 ceAbstractionStarter]: At program point L404(lines 393 406) the Hoare annotation is: true [2018-11-18 15:28:19,435 INFO L428 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 389 407) the Hoare annotation is: true [2018-11-18 15:28:19,435 INFO L425 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 389 407) no Hoare annotation was computed. [2018-11-18 15:28:19,435 INFO L421 ceAbstractionStarter]: At program point evalENTRY(lines 269 306) the Hoare annotation is: (let ((.cse19 (not (= |old(~z_req_up~0)| 0))) (.cse20 (not (= 0 ~d1_req_up~0))) (.cse13 (not (= 2 ~d0_ev~0))) (.cse14 (not (= ~b1_ev~0 2))) (.cse15 (not (= ~z_val~0 0))) (.cse21 (not (= 0 ~b1_req_up~0))) (.cse17 (not (= 2 ~d1_ev~0))) (.cse18 (not (= 2 ~b0_ev~0))) (.cse16 (= ~z_req_up~0 0)) (.cse23 (= ~z_val_t~0 0))) (let ((.cse4 (and (= ~z_req_up~0 1) .cse23)) (.cse3 (and .cse23 .cse16)) (.cse7 (let ((.cse22 (not (= 0 |old(~z_val_t~0)|)))) (and (or .cse19 .cse20 .cse13 .cse14 .cse15 .cse22 .cse21 .cse17 .cse18) (or .cse20 .cse13 .cse14 .cse15 .cse22 .cse21 .cse17 (not (= |old(~z_req_up~0)| 1)) .cse18)))) (.cse0 (not (= ~z_ev~0 2))) (.cse1 (not (= 1 ~b1_val~0))) (.cse5 (= ~comp_m1_st~0 0)) (.cse2 (not (= 1 ~d1_val~0))) (.cse6 (< 0 ~comp_m1_i~0)) (.cse8 (not (= 0 |old(~comp_m1_st~0)|))) (.cse9 (not (= 0 ~b0_req_up~0))) (.cse10 (not (= ~d0_req_up~0 0))) (.cse11 (not (= ~b0_val~0 1))) (.cse12 (not (= ~d0_val~0 1)))) (and (or .cse0 .cse1 .cse2 (and (or .cse3 .cse4) .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (and (or .cse4 .cse3) (or .cse5 (= ~comp_m1_st~0 2))) .cse6 .cse7 (or .cse1 (not (= 2 |old(~comp_m1_st~0)|)) .cse2 .cse9 .cse10 .cse11) .cse12) (or .cse13 .cse0 .cse14 .cse1 .cse15 (and .cse16 .cse5) .cse17 .cse18 .cse2 .cse19 .cse20 .cse21 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2018-11-18 15:28:19,435 INFO L425 ceAbstractionStarter]: For program point L289(lines 289 296) no Hoare annotation was computed. [2018-11-18 15:28:19,435 INFO L421 ceAbstractionStarter]: At program point L285(lines 275 300) the Hoare annotation is: (let ((.cse13 (not (= |old(~z_req_up~0)| 0))) (.cse14 (not (= 0 ~d1_req_up~0))) (.cse0 (not (= 2 ~d0_ev~0))) (.cse2 (not (= ~b1_ev~0 2))) (.cse4 (not (= ~z_val~0 0))) (.cse15 (not (= 0 ~b1_req_up~0))) (.cse10 (not (= 2 ~d1_ev~0))) (.cse11 (not (= 2 ~b0_ev~0)))) (let ((.cse1 (not (= ~z_ev~0 2))) (.cse6 (= ~comp_m1_st~0 2)) (.cse9 (= ~comp_m1_st~0 0)) (.cse16 (< 0 ~comp_m1_i~0)) (.cse22 (let ((.cse24 (not (= 0 |old(~z_val_t~0)|)))) (and (or .cse13 .cse14 .cse0 .cse2 .cse4 .cse24 .cse15 .cse10 .cse11) (or .cse14 .cse0 .cse2 .cse4 .cse24 .cse15 .cse10 (not (= |old(~z_req_up~0)| 1)) .cse11)))) (.cse17 (not (= 0 |old(~comp_m1_st~0)|))) (.cse3 (not (= 1 ~b1_val~0))) (.cse12 (not (= 1 ~d1_val~0))) (.cse18 (not (= 0 ~b0_req_up~0))) (.cse19 (not (= ~d0_req_up~0 0))) (.cse20 (not (= ~b0_val~0 1))) (.cse21 (not (= ~d0_val~0 1))) (.cse8 (= ~z_req_up~0 0)) (.cse7 (= ~z_req_up~0 1)) (.cse5 (= ~z_val_t~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7) (and .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse1 .cse3 .cse9 .cse12 .cse16 .cse22 .cse17 .cse18 .cse19 .cse20 .cse21 .cse7) (let ((.cse23 (or (and .cse5 .cse8) (and .cse7 .cse5)))) (or .cse1 (and .cse23 .cse6) (and .cse23 .cse9) .cse16 .cse22 (and (or .cse3 .cse12 .cse17 .cse18 .cse19 .cse20) (or .cse3 (not (= 2 |old(~comp_m1_st~0)|)) .cse12 .cse18 .cse19 .cse20)) .cse21))))) [2018-11-18 15:28:19,435 INFO L425 ceAbstractionStarter]: For program point L275-1(lines 275 300) no Hoare annotation was computed. [2018-11-18 15:28:19,435 INFO L421 ceAbstractionStarter]: At program point L292(line 292) the Hoare annotation is: (let ((.cse19 (= ~z_ev~0 2))) (let ((.cse0 (not .cse19)) (.cse4 (not (= 1 ~b1_val~0))) (.cse1 (and (let ((.cse18 (= ~z_val_t~0 0))) (or (and .cse18 (= ~z_req_up~0 0)) (and (= ~z_req_up~0 1) .cse18))) (= ~b1_val~0 1) .cse19)) (.cse5 (not (= 1 ~d1_val~0))) (.cse2 (< 0 ~comp_m1_i~0)) (.cse3 (let ((.cse10 (not (= 0 ~d1_req_up~0))) (.cse11 (not (= 2 ~d0_ev~0))) (.cse12 (not (= ~b1_ev~0 2))) (.cse13 (not (= ~z_val~0 0))) (.cse14 (not (= 0 |old(~z_val_t~0)|))) (.cse15 (not (= 0 ~b1_req_up~0))) (.cse16 (not (= 2 ~d1_ev~0))) (.cse17 (not (= 2 ~b0_ev~0)))) (and (or (not (= |old(~z_req_up~0)| 0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= |old(~z_req_up~0)| 1)) .cse17)))) (.cse6 (not (= 0 ~b0_req_up~0))) (.cse7 (not (= ~d0_req_up~0 0))) (.cse8 (not (= ~b0_val~0 1))) (.cse9 (not (= ~d0_val~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 (or .cse4 (not (= 2 |old(~comp_m1_st~0)|)) .cse5 .cse6 .cse7 .cse8) .cse9) (or .cse0 .cse4 .cse1 .cse5 .cse2 .cse3 (not (= 0 |old(~comp_m1_st~0)|)) .cse6 .cse7 .cse8 .cse9)))) [2018-11-18 15:28:19,435 INFO L425 ceAbstractionStarter]: For program point evalEXIT(lines 269 306) no Hoare annotation was computed. [2018-11-18 15:28:19,435 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 284) no Hoare annotation was computed. [2018-11-18 15:28:19,436 INFO L425 ceAbstractionStarter]: For program point L280-1(lines 275 300) no Hoare annotation was computed. [2018-11-18 15:28:19,436 INFO L425 ceAbstractionStarter]: For program point L278(line 278) no Hoare annotation was computed. [2018-11-18 15:28:19,436 INFO L421 ceAbstractionStarter]: At program point L276(line 276) the Hoare annotation is: (let ((.cse13 (not (= |old(~z_req_up~0)| 0))) (.cse14 (not (= 0 ~d1_req_up~0))) (.cse0 (not (= 2 ~d0_ev~0))) (.cse2 (not (= ~b1_ev~0 2))) (.cse4 (not (= ~z_val~0 0))) (.cse15 (not (= 0 ~b1_req_up~0))) (.cse10 (not (= 2 ~d1_ev~0))) (.cse11 (not (= 2 ~b0_ev~0)))) (let ((.cse1 (not (= ~z_ev~0 2))) (.cse6 (= ~comp_m1_st~0 2)) (.cse9 (= ~comp_m1_st~0 0)) (.cse16 (< 0 ~comp_m1_i~0)) (.cse22 (let ((.cse24 (not (= 0 |old(~z_val_t~0)|)))) (and (or .cse13 .cse14 .cse0 .cse2 .cse4 .cse24 .cse15 .cse10 .cse11) (or .cse14 .cse0 .cse2 .cse4 .cse24 .cse15 .cse10 (not (= |old(~z_req_up~0)| 1)) .cse11)))) (.cse17 (not (= 0 |old(~comp_m1_st~0)|))) (.cse3 (not (= 1 ~b1_val~0))) (.cse12 (not (= 1 ~d1_val~0))) (.cse18 (not (= 0 ~b0_req_up~0))) (.cse19 (not (= ~d0_req_up~0 0))) (.cse20 (not (= ~b0_val~0 1))) (.cse21 (not (= ~d0_val~0 1))) (.cse8 (= ~z_req_up~0 0)) (.cse7 (= ~z_req_up~0 1)) (.cse5 (= ~z_val_t~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7) (and .cse8 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse1 .cse3 .cse9 .cse12 .cse16 .cse22 .cse17 .cse18 .cse19 .cse20 .cse21 .cse7) (let ((.cse23 (or (and .cse5 .cse8) (and .cse7 .cse5)))) (or .cse1 (and .cse23 .cse6) (and .cse23 .cse9) .cse16 .cse22 (and (or .cse3 .cse12 .cse17 .cse18 .cse19 .cse20) (or .cse3 (not (= 2 |old(~comp_m1_st~0)|)) .cse12 .cse18 .cse19 .cse20)) .cse21))))) [2018-11-18 15:28:19,436 INFO L421 ceAbstractionStarter]: At program point L301(lines 269 306) the Hoare annotation is: (let ((.cse22 (= ~z_val~0 0)) (.cse23 (= ~b1_ev~0 2))) (let ((.cse2 (= ~z_val_t~0 0)) (.cse3 (= ~comp_m1_st~0 2)) (.cse1 (= ~z_req_up~0 1)) (.cse24 (= ~z_ev~0 2)) (.cse19 (not (= |old(~z_req_up~0)| 0))) (.cse20 (not (= 0 ~d1_req_up~0))) (.cse14 (not (= 2 ~d0_ev~0))) (.cse15 (not .cse23)) (.cse16 (not .cse22)) (.cse21 (not (= 0 ~b1_req_up~0))) (.cse17 (not (= 2 ~d1_ev~0))) (.cse18 (not (= 2 ~b0_ev~0)))) (let ((.cse5 (let ((.cse25 (not (= 0 |old(~z_val_t~0)|)))) (and (or .cse19 .cse20 .cse14 .cse15 .cse16 .cse25 .cse21 .cse17 .cse18) (or .cse20 .cse14 .cse15 .cse16 .cse25 .cse21 .cse17 (not (= |old(~z_req_up~0)| 1)) .cse18)))) (.cse0 (not .cse24)) (.cse6 (not (= 1 ~b1_val~0))) (.cse12 (and .cse22 .cse23 .cse2 .cse3 (= ~d0_ev~0 2) .cse1 (= ~b1_val~0 1) .cse24)) (.cse7 (not (= 1 ~d1_val~0))) (.cse4 (< 0 ~comp_m1_i~0)) (.cse13 (not (= 0 |old(~comp_m1_st~0)|))) (.cse8 (not (= 0 ~b0_req_up~0))) (.cse9 (not (= ~d0_req_up~0 0))) (.cse10 (not (= ~b0_val~0 1))) (.cse11 (not (= ~d0_val~0 1)))) (and (or .cse0 (and (or (and .cse1 .cse2) (and .cse2 (= ~z_req_up~0 0))) (or (= ~comp_m1_st~0 0) .cse3)) .cse4 .cse5 (or .cse6 (not (= 2 |old(~comp_m1_st~0)|)) .cse7 .cse8 .cse9 .cse10) .cse11) (or .cse0 .cse6 .cse12 .cse7 .cse4 .cse5 .cse13 .cse8 .cse9 .cse10 .cse11) (or .cse14 .cse0 .cse15 .cse6 .cse16 .cse12 .cse17 .cse18 .cse7 .cse19 .cse20 .cse21 .cse4 .cse13 .cse8 .cse9 .cse10 .cse11))))) [2018-11-18 15:28:19,436 INFO L421 ceAbstractionStarter]: At program point update_d0ENTRY(lines 153 167) the Hoare annotation is: (or (not (= ~z_ev~0 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= 1 ~b1_val~0)) (not (= ~z_val~0 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 ~d1_ev~0)) (and (= ~d0_val~0 0) (= ~d0_req_up~0 1)) (not (= 0 ~b0_ev~0)) (not (= 0 ~d1_val~0)) (not (= |old(~d0_val~0)| 0)) (not (= ~z_req_up~0 0)) (not (= ~d1_val_t~0 1)) (not (= 0 ~b1_req_up~0)) (not (= ~b1_ev~0 0)) (not (= 0 ~b0_req_up~0)) (not (= ~b0_val~0 1)) (not (= 1 ~d1_req_up~0)) (not (= ~d0_val_t~0 1))) [2018-11-18 15:28:19,436 INFO L425 ceAbstractionStarter]: For program point L157-1(lines 157 162) no Hoare annotation was computed. [2018-11-18 15:28:19,436 INFO L425 ceAbstractionStarter]: For program point update_d0FINAL(lines 153 167) no Hoare annotation was computed. [2018-11-18 15:28:19,436 INFO L425 ceAbstractionStarter]: For program point update_d0EXIT(lines 153 167) no Hoare annotation was computed. [2018-11-18 15:28:19,436 INFO L425 ceAbstractionStarter]: For program point L142-1(lines 142 147) no Hoare annotation was computed. [2018-11-18 15:28:19,436 INFO L425 ceAbstractionStarter]: For program point update_b1EXIT(lines 138 152) no Hoare annotation was computed. [2018-11-18 15:28:19,436 INFO L421 ceAbstractionStarter]: At program point update_b1ENTRY(lines 138 152) the Hoare annotation is: (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 2 ~d0_ev~0)) (not (= ~z_ev~0 2)) (not (= ~d0_req_up~0 1)) (not (= ~z_val~0 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 ~d1_ev~0)) (not (= 0 ~b0_ev~0)) (not (= 0 ~d1_val~0)) (not (= ~d0_val~0 0)) (not (= ~z_req_up~0 0)) (and (= ~b1_req_up~0 1) (= ~b1_val~0 0)) (not (= 1 ~b1_val_t~0)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 0 ~b0_req_up~0)) (not (= ~b0_val~0 1)) (not (= 1 ~d1_req_up~0)) (not (= ~d0_val_t~0 1))) [2018-11-18 15:28:19,436 INFO L425 ceAbstractionStarter]: For program point update_b1FINAL(lines 138 152) no Hoare annotation was computed. [2018-11-18 15:28:19,436 INFO L425 ceAbstractionStarter]: For program point L127-1(lines 127 132) no Hoare annotation was computed. [2018-11-18 15:28:19,436 INFO L425 ceAbstractionStarter]: For program point update_b0EXIT(lines 123 137) no Hoare annotation was computed. [2018-11-18 15:28:19,437 INFO L421 ceAbstractionStarter]: At program point update_b0ENTRY(lines 123 137) the Hoare annotation is: (or (not (= 1 ~b1_req_up~0)) (not (= 1 ~b0_val_t~0)) (not (= 2 ~d0_ev~0)) (not (= ~z_ev~0 2)) (not (= ~d0_req_up~0 1)) (and (= ~b0_val~0 0) (= ~b0_ev~0 2) (= ~b0_req_up~0 1)) (not (= ~b1_ev~0 2)) (not (= ~z_val~0 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 ~d1_ev~0)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 ~d1_val~0)) (not (= ~d0_val~0 0)) (not (= ~z_req_up~0 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 ~b1_val~0)) (not (= 1 ~d1_req_up~0)) (not (= ~d0_val_t~0 1))) [2018-11-18 15:28:19,437 INFO L425 ceAbstractionStarter]: For program point update_b0FINAL(lines 123 137) no Hoare annotation was computed. [2018-11-18 15:28:19,437 INFO L421 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (and (= ~z_val~0 0) (= ~b1_ev~0 1) (= ~b0_ev~0 1) (= ~z_req_up~0 0) (= ~b0_req_up~0 0) (= ~d0_val~0 1) (= ~d0_ev~0 1) (= ~d1_req_up~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (= ~d1_val~0 1) (= ~d1_ev~0 1) (= ~d0_req_up~0 0) (= ~z_ev~0 2)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) [2018-11-18 15:28:19,437 INFO L421 ceAbstractionStarter]: At program point L415(line 415) the Hoare annotation is: (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (and (= ~z_val~0 0) (= ~d1_ev~0 2) (= ~b1_ev~0 2) (= ~d0_val~0 0) (= ~b0_val~0 0) (= ~b0_ev~0 2) (= ~b1_req_up~0 1) (= ~z_req_up~0 0) (= ~d0_ev~0 2) (= ~d1_req_up~0 1) (= ~b0_req_up~0 1) (= ~b1_val~0 0) (= ~z_ev~0 2) (= ~d0_req_up~0 1) (= ~d1_val~0 0)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) [2018-11-18 15:28:19,437 INFO L421 ceAbstractionStarter]: At program point L415-1(line 415) the Hoare annotation is: (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (and (= ~b1_ev~0 0) (= ~z_val~0 0) (= ~d1_ev~0 0) (= ~z_req_up~0 0) (= ~b0_req_up~0 0) (= ~d0_val~0 1) (= ~b0_ev~0 0) (= ~d1_req_up~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (= ~d1_val~0 1) (= ~d0_req_up~0 0) (= ~d0_ev~0 0) (= ~z_ev~0 2)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) [2018-11-18 15:28:19,437 INFO L425 ceAbstractionStarter]: For program point start_simulationEXIT(lines 408 450) no Hoare annotation was computed. [2018-11-18 15:28:19,437 INFO L421 ceAbstractionStarter]: At program point L436(line 436) the Hoare annotation is: (let ((.cse0 (= ~b1_ev~0 2)) (.cse9 (let ((.cse13 (= ~z_val~0 0)) (.cse14 (= ~d1_ev~0 2)) (.cse15 (= ~z_val_t~0 0))) (or (and .cse13 .cse14 .cse15 (= ~z_req_up~0 0)) (and .cse13 .cse14 (= ~z_req_up~0 1) .cse15)))) (.cse1 (= ~b0_ev~0 2)) (.cse2 (= ~b0_req_up~0 0)) (.cse3 (= ~d0_val~0 1)) (.cse4 (= ~d0_ev~0 2)) (.cse5 (= ~d1_req_up~0 0)) (.cse6 (= ~b0_val~0 1)) (.cse7 (= ~b1_val~0 1)) (.cse8 (= ~b1_req_up~0 0)) (.cse10 (= ~d1_val~0 1)) (.cse11 (= ~d0_req_up~0 0)) (.cse12 (= ~z_ev~0 2))) (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (and (and .cse0 .cse1 .cse2 .cse3 (= ~comp_m1_st~0 2) .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (and .cse0 .cse9 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1)))) [2018-11-18 15:28:19,437 INFO L421 ceAbstractionStarter]: At program point L434(line 434) the Hoare annotation is: (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) (and (= ~d1_req_up~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (let ((.cse0 (= ~z_val_t~0 0))) (or (and (= ~z_req_up~0 1) .cse0) (and .cse0 (= ~z_req_up~0 0)))) (= ~d1_val~0 1) (= ~d0_req_up~0 0) (= ~z_ev~0 2) (let ((.cse1 (= ~z_val~0 0)) (.cse2 (= ~d1_ev~0 2)) (.cse3 (= ~b1_ev~0 2)) (.cse4 (= ~b0_ev~0 2)) (.cse5 (= ~b0_req_up~0 0)) (.cse6 (= ~d0_val~0 1)) (.cse7 (= ~d0_ev~0 2))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ~comp_m1_st~0 0) .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~comp_m1_st~0 2) .cse7)))) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) [2018-11-18 15:28:19,437 INFO L421 ceAbstractionStarter]: At program point L434-1(line 434) the Hoare annotation is: (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) (and (= ~d1_req_up~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (let ((.cse0 (= ~z_val_t~0 0))) (or (and (= ~z_req_up~0 1) .cse0) (and .cse0 (= ~z_req_up~0 0)))) (= ~d1_val~0 1) (= ~d0_req_up~0 0) (= ~z_ev~0 2) (let ((.cse1 (= ~z_val~0 0)) (.cse2 (= ~d1_ev~0 2)) (.cse3 (= ~b1_ev~0 2)) (.cse4 (= ~b0_ev~0 2)) (.cse5 (= ~b0_req_up~0 0)) (.cse6 (= ~d0_val~0 1)) (.cse7 (= ~d0_ev~0 2))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ~comp_m1_st~0 0) .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~comp_m1_st~0 2) .cse7)))) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) [2018-11-18 15:28:19,438 INFO L421 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) (and (= ~d1_req_up~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (let ((.cse0 (= ~z_val_t~0 0))) (or (and (= ~z_req_up~0 1) .cse0) (and .cse0 (= ~z_req_up~0 0)))) (= ~d1_val~0 1) (= ~d0_req_up~0 0) (= ~z_ev~0 2) (let ((.cse1 (= ~z_val~0 0)) (.cse2 (= ~d1_ev~0 2)) (.cse3 (= ~b1_ev~0 2)) (.cse4 (= ~b0_ev~0 2)) (.cse5 (= ~b0_req_up~0 0)) (.cse6 (= ~d0_val~0 1)) (.cse7 (= ~d0_ev~0 2))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ~comp_m1_st~0 0) .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~comp_m1_st~0 2) .cse7)))) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) [2018-11-18 15:28:19,438 INFO L425 ceAbstractionStarter]: For program point L430-1(line 430) no Hoare annotation was computed. [2018-11-18 15:28:19,438 INFO L421 ceAbstractionStarter]: At program point L426(line 426) the Hoare annotation is: (let ((.cse4 (= ~z_req_up~0 0)) (.cse0 (= ~z_val~0 0)) (.cse1 (= ~d1_ev~0 2))) (let ((.cse2 (= ~b1_ev~0 2)) (.cse16 (let ((.cse17 (= ~z_val_t~0 0))) (or (and .cse0 .cse1 .cse17 .cse4) (and .cse0 .cse1 (= ~z_req_up~0 1) .cse17)))) (.cse3 (= ~b0_ev~0 2)) (.cse5 (= ~b0_req_up~0 0)) (.cse6 (= ~comp_m1_st~0 0)) (.cse7 (= ~d0_val~0 1)) (.cse8 (= ~d0_ev~0 2)) (.cse9 (= ~d1_req_up~0 0)) (.cse10 (= ~b0_val~0 1)) (.cse11 (= ~b1_val~0 1)) (.cse12 (= ~b1_req_up~0 0)) (.cse13 (= ~d1_val~0 1)) (.cse14 (= ~d0_req_up~0 0)) (.cse15 (= ~z_ev~0 2))) (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (= 2 |old(~d1_ev~0)|)) (and .cse2 .cse16 .cse3 .cse5 .cse7 (= ~comp_m1_st~0 2) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (and .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))))) [2018-11-18 15:28:19,438 INFO L425 ceAbstractionStarter]: For program point L426-1(line 426) no Hoare annotation was computed. [2018-11-18 15:28:19,438 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 444) no Hoare annotation was computed. [2018-11-18 15:28:19,438 INFO L421 ceAbstractionStarter]: At program point L422-2(lines 419 444) the Hoare annotation is: (let ((.cse4 (= ~z_req_up~0 0)) (.cse0 (= ~z_val~0 0)) (.cse1 (= ~d1_ev~0 2))) (let ((.cse2 (= ~b1_ev~0 2)) (.cse16 (let ((.cse17 (= ~z_val_t~0 0))) (or (and .cse0 .cse1 .cse17 .cse4) (and .cse0 .cse1 (= ~z_req_up~0 1) .cse17)))) (.cse3 (= ~b0_ev~0 2)) (.cse5 (= ~b0_req_up~0 0)) (.cse6 (= ~comp_m1_st~0 0)) (.cse7 (= ~d0_val~0 1)) (.cse8 (= ~d0_ev~0 2)) (.cse9 (= ~d1_req_up~0 0)) (.cse10 (= ~b0_val~0 1)) (.cse11 (= ~b1_val~0 1)) (.cse12 (= ~b1_req_up~0 0)) (.cse13 (= ~d1_val~0 1)) (.cse14 (= ~d0_req_up~0 0)) (.cse15 (= ~z_ev~0 2))) (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (= 2 |old(~d1_ev~0)|)) (and .cse2 .cse16 .cse3 .cse5 .cse7 (= ~comp_m1_st~0 2) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (and .cse2 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))))) [2018-11-18 15:28:19,438 INFO L421 ceAbstractionStarter]: At program point L418(line 418) the Hoare annotation is: (or (and (= ~z_val~0 0) (= ~b1_ev~0 1) (= ~b0_ev~0 1) (= ~z_req_up~0 0) (= ~b0_req_up~0 0) (= ~comp_m1_st~0 0) (= ~d0_val~0 1) (= ~d0_ev~0 1) (= ~d1_req_up~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (= ~d1_val~0 1) (= ~d1_ev~0 1) (= ~d0_req_up~0 0) (= ~z_ev~0 2)) (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) [2018-11-18 15:28:19,438 INFO L421 ceAbstractionStarter]: At program point start_simulationENTRY(lines 408 450) the Hoare annotation is: (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (and (= ~z_val~0 0) (= ~d1_ev~0 2) (= ~b1_ev~0 2) (= ~d0_val~0 0) (= ~b0_val~0 0) (= ~b0_ev~0 2) (= ~b1_req_up~0 1) (= ~z_req_up~0 0) (= ~d0_ev~0 2) (= ~d1_req_up~0 1) (= ~b0_req_up~0 1) (= ~b1_val~0 0) (= ~z_ev~0 2) (= ~d0_req_up~0 1) (= ~d1_val~0 0)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) [2018-11-18 15:28:19,438 INFO L421 ceAbstractionStarter]: At program point L416(line 416) the Hoare annotation is: (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (and (= ~b1_ev~0 0) (= ~z_val~0 0) (= ~d1_ev~0 0) (= ~z_req_up~0 0) (= ~b0_req_up~0 0) (= ~d0_val~0 1) (= ~b0_ev~0 0) (= ~d1_req_up~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (= ~d1_val~0 1) (= ~d0_req_up~0 0) (= ~d0_ev~0 0) (= ~z_ev~0 2)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) [2018-11-18 15:28:19,439 INFO L421 ceAbstractionStarter]: At program point L445(lines 408 450) the Hoare annotation is: (let ((.cse0 (= ~z_val~0 0)) (.cse1 (= ~d1_ev~0 2)) (.cse2 (= ~b1_ev~0 2)) (.cse3 (= ~b0_ev~0 2)) (.cse4 (= ~b0_req_up~0 0)) (.cse5 (= ~d0_ev~0 2)) (.cse6 (= ~d1_req_up~0 0)) (.cse7 (= ~b1_req_up~0 0)) (.cse8 (= ~d0_req_up~0 0)) (.cse9 (= ~z_ev~0 2))) (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~d0_val~0 1) .cse5 .cse6 (= ~b0_val~0 1) .cse7 .cse8 .cse9) (not (= 2 |old(~d1_ev~0)|)) (and .cse0 .cse1 .cse2 .cse3 (= ~z_req_up~0 0) .cse4 (= ~comp_m1_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1)))) [2018-11-18 15:28:19,439 INFO L425 ceAbstractionStarter]: For program point L439(lines 439 443) no Hoare annotation was computed. [2018-11-18 15:28:19,439 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-18 15:28:19,439 INFO L421 ceAbstractionStarter]: At program point L435(line 435) the Hoare annotation is: (let ((.cse0 (= ~b1_ev~0 2)) (.cse9 (let ((.cse13 (= ~z_val~0 0)) (.cse14 (= ~d1_ev~0 2)) (.cse15 (= ~z_val_t~0 0))) (or (and .cse13 .cse14 .cse15 (= ~z_req_up~0 0)) (and .cse13 .cse14 (= ~z_req_up~0 1) .cse15)))) (.cse1 (= ~b0_ev~0 2)) (.cse2 (= ~b0_req_up~0 0)) (.cse3 (= ~d0_val~0 1)) (.cse4 (= ~d0_ev~0 2)) (.cse5 (= ~d1_req_up~0 0)) (.cse6 (= ~b0_val~0 1)) (.cse7 (= ~b1_val~0 1)) (.cse8 (= ~b1_req_up~0 0)) (.cse10 (= ~d1_val~0 1)) (.cse11 (= ~d0_req_up~0 0)) (.cse12 (= ~z_ev~0 2))) (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) (and (and .cse0 .cse1 .cse2 .cse3 (= ~comp_m1_st~0 2) .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (not (= 2 |old(~d0_ev~0)|)) (not (= |old(~z_ev~0)| 2)) (not (= |old(~d0_req_up~0)| 1)) (not (= |old(~b1_ev~0)| 2)) (not (= |old(~z_val~0)| 0)) (not (= ~comp_m1_i~0 0)) (not (= 2 |old(~d1_ev~0)|)) (not (= 2 |old(~b0_ev~0)|)) (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (and .cse0 .cse9 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12) (not (= |old(~d0_val~0)| 0)) (not (= |old(~z_req_up~0)| 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1)))) [2018-11-18 15:28:19,439 INFO L425 ceAbstractionStarter]: For program point L423(line 423) no Hoare annotation was computed. [2018-11-18 15:28:19,439 INFO L421 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 307 339) the Hoare annotation is: (let ((.cse0 (not (= |old(~z_ev~0)| 2))) (.cse6 (not (= 1 ~b1_val~0))) (.cse7 (not (= ~z_val~0 0))) (.cse10 (not (= 1 ~d1_val~0))) (.cse2 (not (= ~z_req_up~0 0))) (.cse11 (not (= 0 ~d1_req_up~0))) (.cse12 (not (= 0 ~b1_req_up~0))) (.cse13 (not (= 0 ~b0_req_up~0))) (.cse1 (= ~z_ev~0 2)) (.cse14 (not (= ~d0_req_up~0 0))) (.cse15 (not (= ~b0_val~0 1))) (.cse16 (not (= ~d0_val~0 1)))) (and (or .cse0 (and .cse1 (and (= ~d1_ev~0 2) (= ~b1_ev~0 2) (= ~b0_ev~0 2) (= ~d0_ev~0 2))) (< 0 ~comp_m1_i~0) (let ((.cse3 (not (= 0 ~z_val_t~0)))) (and (or .cse2 .cse3) (or .cse3 (not (= ~z_req_up~0 1))))) (let ((.cse4 (not (= 2 |old(~d0_ev~0)|))) (.cse5 (not (= |old(~b1_ev~0)| 2))) (.cse8 (not (= 2 |old(~d1_ev~0)|))) (.cse9 (not (= 2 |old(~b0_ev~0)|)))) (and (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= 0 ~comp_m1_st~0)) .cse13 .cse14 .cse15) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= 2 ~comp_m1_st~0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) .cse16) (or .cse0 .cse6 .cse7 (not (= ~comp_m1_i~0 0)) (not (= 0 |old(~d1_ev~0)|)) (not (= 0 |old(~b0_ev~0)|)) .cse10 .cse2 .cse11 .cse12 (not (= |old(~b1_ev~0)| 0)) .cse13 (and (= ~b1_ev~0 0) (= ~d1_ev~0 0) (= ~b0_ev~0 0) (= ~d0_ev~0 0) .cse1) .cse14 .cse15 (not (= 0 |old(~d0_ev~0)|)) .cse16))) [2018-11-18 15:28:19,439 INFO L425 ceAbstractionStarter]: For program point L316-1(lines 310 338) no Hoare annotation was computed. [2018-11-18 15:28:19,439 INFO L425 ceAbstractionStarter]: For program point L331-1(lines 307 339) no Hoare annotation was computed. [2018-11-18 15:28:19,439 INFO L425 ceAbstractionStarter]: For program point L321-1(lines 310 338) no Hoare annotation was computed. [2018-11-18 15:28:19,440 INFO L425 ceAbstractionStarter]: For program point L311-1(lines 310 338) no Hoare annotation was computed. [2018-11-18 15:28:19,440 INFO L425 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 307 339) no Hoare annotation was computed. [2018-11-18 15:28:19,440 INFO L425 ceAbstractionStarter]: For program point L326-1(lines 310 338) no Hoare annotation was computed. [2018-11-18 15:28:19,440 INFO L421 ceAbstractionStarter]: At program point L225(line 225) the Hoare annotation is: (let ((.cse3 (not (= 2 |old(~d0_ev~0)|))) (.cse0 (not (= |old(~z_ev~0)| 2))) (.cse4 (not (= |old(~b1_ev~0)| 2))) (.cse6 (not (= |old(~z_val~0)| 0))) (.cse7 (not (= 2 |old(~d1_ev~0)|))) (.cse8 (not (= 2 |old(~b0_ev~0)|))) (.cse1 (not (= |old(~z_req_up~0)| 0)))) (and (or .cse0 (< 0 ~comp_m1_i~0) (let ((.cse2 (not (= 0 ~z_val_t~0)))) (and (or .cse1 .cse2) (or .cse2 (not (= |old(~z_req_up~0)| 1))))) (let ((.cse5 (not (= 1 |old(~b1_val~0)|))) (.cse9 (not (= 1 |old(~d1_val~0)|))) (.cse10 (not (= 0 |old(~d1_req_up~0)|))) (.cse11 (not (= 0 |old(~b1_req_up~0)|))) (.cse12 (not (= 0 |old(~b0_req_up~0)|))) (.cse13 (not (= |old(~d0_req_up~0)| 0))) (.cse14 (not (= |old(~b0_val~0)| 1)))) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 ~comp_m1_st~0)) .cse12 .cse13 .cse14) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 2 ~comp_m1_st~0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) (not (= |old(~d0_val~0)| 1))) (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) .cse3 .cse0 (not (= |old(~d0_req_up~0)| 1)) .cse4 .cse6 (not (= ~comp_m1_i~0 0)) .cse7 .cse8 (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) .cse1 (and (= ~b1_ev~0 0) (= ~z_val~0 0) (= ~d1_ev~0 2) (= ~z_req_up~0 0) (= ~b0_req_up~0 0) (= ~d0_val~0 1) (= ~d1_req_up~0 1) (= ~b0_ev~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (= ~d0_req_up~0 0) (= ~d0_ev~0 0) (= ~z_ev~0 2) (= ~d1_val~0 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))))) [2018-11-18 15:28:19,440 INFO L425 ceAbstractionStarter]: For program point L223(lines 201 239) no Hoare annotation was computed. [2018-11-18 15:28:19,440 INFO L421 ceAbstractionStarter]: At program point L211(line 211) the Hoare annotation is: (let ((.cse3 (not (= 2 |old(~d0_ev~0)|))) (.cse0 (not (= |old(~z_ev~0)| 2))) (.cse4 (not (= |old(~b1_ev~0)| 2))) (.cse6 (not (= |old(~z_val~0)| 0))) (.cse7 (not (= 2 |old(~d1_ev~0)|))) (.cse8 (not (= 2 |old(~b0_ev~0)|))) (.cse1 (not (= |old(~z_req_up~0)| 0)))) (and (or .cse0 (< 0 ~comp_m1_i~0) (let ((.cse2 (not (= 0 ~z_val_t~0)))) (and (or .cse1 .cse2) (or .cse2 (not (= |old(~z_req_up~0)| 1))))) (let ((.cse5 (not (= 1 |old(~b1_val~0)|))) (.cse9 (not (= 1 |old(~d1_val~0)|))) (.cse10 (not (= 0 |old(~d1_req_up~0)|))) (.cse11 (not (= 0 |old(~b1_req_up~0)|))) (.cse12 (not (= 0 |old(~b0_req_up~0)|))) (.cse13 (not (= |old(~d0_req_up~0)| 0))) (.cse14 (not (= |old(~b0_val~0)| 1)))) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 ~comp_m1_st~0)) .cse12 .cse13 .cse14) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 2 ~comp_m1_st~0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) (not (= |old(~d0_val~0)| 1))) (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) .cse3 .cse0 (not (= |old(~d0_req_up~0)| 1)) .cse4 .cse6 (not (= ~comp_m1_i~0 0)) .cse7 .cse8 (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) .cse1 (and (= ~z_val~0 0) (= ~d1_ev~0 2) (= ~d0_val~0 0) (= ~b1_req_up~0 1) (= ~z_req_up~0 0) (= ~b0_req_up~0 0) (= ~d0_ev~0 2) (= ~d1_req_up~0 1) (= ~b0_ev~0 0) (= ~b1_val~0 0) (= ~b0_val~0 1) (= ~z_ev~0 2) (= ~d0_req_up~0 1) (= ~d1_val~0 0)) (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))))) [2018-11-18 15:28:19,440 INFO L425 ceAbstractionStarter]: For program point L209(lines 201 239) no Hoare annotation was computed. [2018-11-18 15:28:19,440 INFO L421 ceAbstractionStarter]: At program point L232(line 232) the Hoare annotation is: (let ((.cse8 (not (= 2 |old(~d0_ev~0)|))) (.cse9 (not (= |old(~b1_ev~0)| 2))) (.cse10 (not (= |old(~z_val~0)| 0))) (.cse11 (not (= 2 |old(~d1_ev~0)|))) (.cse12 (not (= 2 |old(~b0_ev~0)|))) (.cse3 (not (= 2 ~comp_m1_st~0)))) (let ((.cse0 (not (= |old(~z_ev~0)| 2))) (.cse1 (= ~z_req_up~0 1)) (.cse5 (< 0 ~comp_m1_i~0)) (.cse13 (not (= |old(~z_req_up~0)| 0))) (.cse4 (not (= 0 ~z_val_t~0))) (.cse2 (not (= |old(~z_req_up~0)| 1))) (.cse6 (let ((.cse14 (not (= 1 |old(~b1_val~0)|))) (.cse15 (not (= 1 |old(~d1_val~0)|))) (.cse16 (not (= 0 |old(~d1_req_up~0)|))) (.cse17 (not (= 0 |old(~b1_req_up~0)|))) (.cse18 (not (= 0 |old(~b0_req_up~0)|))) (.cse19 (not (= |old(~d0_req_up~0)| 0))) (.cse20 (not (= |old(~b0_val~0)| 1)))) (and (or .cse8 .cse9 .cse14 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 (not (= 0 ~comp_m1_st~0)) .cse18 .cse19 .cse20) (or .cse8 .cse9 .cse14 .cse10 .cse11 .cse12 .cse3 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)))) (.cse7 (not (= |old(~d0_val~0)| 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) .cse8 .cse0 (not (= |old(~d0_req_up~0)| 1)) .cse9 .cse10 (not (= ~comp_m1_i~0 0)) .cse11 .cse12 (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) .cse13 (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) (or .cse0 (and (= ~d1_req_up~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (or .cse1 (= ~z_req_up~0 0)) (= ~d1_val~0 1) (= ~d0_req_up~0 0) (= ~z_ev~0 2) (and (= ~z_val~0 0) (= ~d1_ev~0 2) (= ~b1_ev~0 2) (= ~b0_ev~0 2) (= ~b0_req_up~0 0) (= ~d0_val~0 1) (= ~d0_ev~0 2))) .cse5 (and (or .cse13 .cse4) (or .cse4 .cse2)) .cse6 .cse7)))) [2018-11-18 15:28:19,440 INFO L425 ceAbstractionStarter]: For program point L230(lines 198 240) no Hoare annotation was computed. [2018-11-18 15:28:19,441 INFO L421 ceAbstractionStarter]: At program point L218(line 218) the Hoare annotation is: (let ((.cse3 (not (= 2 |old(~d0_ev~0)|))) (.cse0 (not (= |old(~z_ev~0)| 2))) (.cse4 (not (= |old(~b1_ev~0)| 2))) (.cse6 (not (= |old(~z_val~0)| 0))) (.cse7 (not (= 2 |old(~d1_ev~0)|))) (.cse8 (not (= 2 |old(~b0_ev~0)|))) (.cse1 (not (= |old(~z_req_up~0)| 0)))) (and (or .cse0 (< 0 ~comp_m1_i~0) (let ((.cse2 (not (= 0 ~z_val_t~0)))) (and (or .cse1 .cse2) (or .cse2 (not (= |old(~z_req_up~0)| 1))))) (let ((.cse5 (not (= 1 |old(~b1_val~0)|))) (.cse9 (not (= 1 |old(~d1_val~0)|))) (.cse10 (not (= 0 |old(~d1_req_up~0)|))) (.cse11 (not (= 0 |old(~b1_req_up~0)|))) (.cse12 (not (= 0 |old(~b0_req_up~0)|))) (.cse13 (not (= |old(~d0_req_up~0)| 0))) (.cse14 (not (= |old(~b0_val~0)| 1)))) (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= 0 ~comp_m1_st~0)) .cse12 .cse13 .cse14) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= 2 ~comp_m1_st~0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) (not (= |old(~d0_val~0)| 1))) (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) .cse3 .cse0 (not (= |old(~d0_req_up~0)| 1)) .cse4 .cse6 (not (= ~comp_m1_i~0 0)) .cse7 (and (= ~b1_ev~0 0) (= ~z_val~0 0) (= ~d1_ev~0 2) (= ~d0_val~0 0) (= ~z_req_up~0 0) (= ~b0_req_up~0 0) (= ~d1_req_up~0 1) (= ~b0_ev~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (= ~z_ev~0 2) (= ~d0_req_up~0 1) (= ~d1_val~0 0)) .cse8 (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) .cse1 (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))))) [2018-11-18 15:28:19,441 INFO L425 ceAbstractionStarter]: For program point L216(lines 201 239) no Hoare annotation was computed. [2018-11-18 15:28:19,441 INFO L421 ceAbstractionStarter]: At program point update_channelsENTRY(lines 198 240) the Hoare annotation is: (let ((.cse0 (not (= 2 |old(~d0_ev~0)|))) (.cse2 (not (= |old(~b1_ev~0)| 2))) (.cse3 (not (= |old(~z_val~0)| 0))) (.cse4 (not (= 2 |old(~d1_ev~0)|))) (.cse5 (not (= 2 |old(~b0_ev~0)|))) (.cse16 (not (= 2 ~comp_m1_st~0)))) (let ((.cse1 (not (= |old(~z_ev~0)| 2))) (.cse14 (= ~z_req_up~0 1)) (.cse11 (= ~z_req_up~0 0)) (.cse13 (= ~z_ev~0 2)) (.cse7 (= ~z_val~0 0)) (.cse8 (= ~d1_ev~0 2)) (.cse9 (= ~b1_ev~0 2)) (.cse10 (= ~b0_ev~0 2)) (.cse12 (= ~d0_ev~0 2)) (.cse18 (< 0 ~comp_m1_i~0)) (.cse6 (not (= |old(~z_req_up~0)| 0))) (.cse17 (not (= 0 ~z_val_t~0))) (.cse15 (not (= |old(~z_req_up~0)| 1))) (.cse19 (let ((.cse21 (not (= 1 |old(~b1_val~0)|))) (.cse22 (not (= 1 |old(~d1_val~0)|))) (.cse23 (not (= 0 |old(~d1_req_up~0)|))) (.cse24 (not (= 0 |old(~b1_req_up~0)|))) (.cse25 (not (= 0 |old(~b0_req_up~0)|))) (.cse26 (not (= |old(~d0_req_up~0)| 0))) (.cse27 (not (= |old(~b0_val~0)| 1)))) (and (or .cse0 .cse2 .cse21 .cse3 .cse4 .cse5 .cse22 .cse23 .cse24 (not (= 0 ~comp_m1_st~0)) .cse25 .cse26 .cse27) (or .cse0 .cse2 .cse21 .cse3 .cse4 .cse5 .cse16 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27)))) (.cse20 (not (= |old(~d0_val~0)| 1)))) (and (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) .cse0 .cse1 (not (= |old(~d0_req_up~0)| 1)) .cse2 .cse3 (not (= ~comp_m1_i~0 0)) .cse4 .cse5 (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) .cse6 (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (and .cse7 .cse8 .cse9 (= ~d0_val~0 0) (= ~b0_val~0 0) .cse10 (= ~b1_req_up~0 1) .cse11 .cse12 (= ~d1_req_up~0 1) (= ~b0_req_up~0 1) (= ~b1_val~0 0) .cse13 (= ~d0_req_up~0 1) (= ~d1_val~0 0)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) (or .cse1 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse1 (and (= ~d1_req_up~0 0) (= ~b0_val~0 1) (= ~b1_val~0 1) (= ~b1_req_up~0 0) (or .cse14 .cse11) (= ~d1_val~0 1) (= ~d0_req_up~0 0) .cse13 (and .cse7 .cse8 .cse9 .cse10 (= ~b0_req_up~0 0) (= ~d0_val~0 1) .cse12)) .cse18 (and (or .cse6 .cse17) (or .cse17 .cse15)) .cse19 .cse20)))) [2018-11-18 15:28:19,442 INFO L421 ceAbstractionStarter]: At program point L204(line 204) the Hoare annotation is: (let ((.cse1 (not (= |old(~z_ev~0)| 2))) (.cse6 (not (= |old(~z_req_up~0)| 0))) (.cse0 (not (= 2 |old(~d0_ev~0)|))) (.cse2 (not (= |old(~b1_ev~0)| 2))) (.cse3 (not (= |old(~z_val~0)| 0))) (.cse4 (not (= 2 |old(~d1_ev~0)|))) (.cse5 (not (= 2 |old(~b0_ev~0)|)))) (and (or (not (= 1 |old(~b1_req_up~0)|)) (not (= 1 ~b0_val_t~0)) .cse0 .cse1 (not (= |old(~d0_req_up~0)| 1)) (and (= ~z_val~0 0) (= ~d1_ev~0 2) (= ~b1_ev~0 2) (= ~d0_val~0 0) (= ~b0_val~0 0) (= ~b0_ev~0 2) (= ~b1_req_up~0 1) (= ~z_req_up~0 0) (= ~d0_ev~0 2) (= ~d1_req_up~0 1) (= ~b0_req_up~0 1) (= ~b1_val~0 0) (= ~z_ev~0 2) (= ~d0_req_up~0 1) (= ~d1_val~0 0)) .cse2 .cse3 (not (= ~comp_m1_i~0 0)) .cse4 .cse5 (not (= |old(~b0_val~0)| 0)) (not (= 0 |old(~d1_val~0)|)) (not (= |old(~d0_val~0)| 0)) .cse6 (not (= 1 ~b1_val_t~0)) (not (= 1 |old(~b0_req_up~0)|)) (not (= ~d1_val_t~0 1)) (not (= 0 |old(~b1_val~0)|)) (not (= 1 |old(~d1_req_up~0)|)) (not (= ~d0_val_t~0 1))) (or .cse1 (< 0 ~comp_m1_i~0) (let ((.cse7 (not (= 0 ~z_val_t~0)))) (and (or .cse6 .cse7) (or .cse7 (not (= |old(~z_req_up~0)| 1))))) (let ((.cse8 (not (= 1 |old(~b1_val~0)|))) (.cse9 (not (= 1 |old(~d1_val~0)|))) (.cse10 (not (= 0 |old(~d1_req_up~0)|))) (.cse11 (not (= 0 |old(~b1_req_up~0)|))) (.cse12 (not (= 0 |old(~b0_req_up~0)|))) (.cse13 (not (= |old(~d0_req_up~0)| 0))) (.cse14 (not (= |old(~b0_val~0)| 1)))) (and (or .cse0 .cse2 .cse8 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11 (not (= 0 ~comp_m1_st~0)) .cse12 .cse13 .cse14) (or .cse0 .cse2 .cse8 .cse3 .cse4 .cse5 (not (= 2 ~comp_m1_st~0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) (not (= |old(~d0_val~0)| 1))))) [2018-11-18 15:28:19,442 INFO L425 ceAbstractionStarter]: For program point update_channelsEXIT(lines 198 240) no Hoare annotation was computed. [2018-11-18 15:28:19,442 INFO L425 ceAbstractionStarter]: For program point L202(lines 201 239) no Hoare annotation was computed. [2018-11-18 15:28:19,442 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 117) no Hoare annotation was computed. [2018-11-18 15:28:19,442 INFO L425 ceAbstractionStarter]: For program point is_method1_triggeredFINAL(lines 93 122) no Hoare annotation was computed. [2018-11-18 15:28:19,442 INFO L421 ceAbstractionStarter]: At program point L119(lines 96 121) the Hoare annotation is: (or (not (= ~z_ev~0 2)) (not (= 1 ~b1_val~0)) (not (= ~z_val~0 0)) (not (= 1 ~d1_val~0)) (= is_method1_triggered_~__retres1~0 1) (not (= ~z_req_up~0 0)) (not (= 0 ~d1_req_up~0)) (not (= ~b1_ev~0 1)) (not (= 0 ~b1_req_up~0)) (< 0 ~comp_m1_i~0) (not (= 1 ~d0_ev~0)) (not (= 0 ~b0_req_up~0)) (not (= 1 ~b0_ev~0)) (not (= ~d0_req_up~0 0)) (not (= ~b0_val~0 1)) (not (= ~d0_val~0 1)) (not (= 1 ~d1_ev~0))) [2018-11-18 15:28:19,442 INFO L425 ceAbstractionStarter]: For program point is_method1_triggeredEXIT(lines 93 122) no Hoare annotation was computed. [2018-11-18 15:28:19,442 INFO L425 ceAbstractionStarter]: For program point L109(lines 109 114) no Hoare annotation was computed. [2018-11-18 15:28:19,442 INFO L428 ceAbstractionStarter]: At program point is_method1_triggeredENTRY(lines 93 122) the Hoare annotation is: true [2018-11-18 15:28:19,442 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 115) no Hoare annotation was computed. [2018-11-18 15:28:19,443 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 116) no Hoare annotation was computed. [2018-11-18 15:28:19,443 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:28:19,443 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (<= ~comp_m1_i~0 0) [2018-11-18 15:28:19,443 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 15:28:19,443 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 15:28:19,443 INFO L425 ceAbstractionStarter]: For program point init_modelFINAL(lines 451 482) no Hoare annotation was computed. [2018-11-18 15:28:19,443 INFO L425 ceAbstractionStarter]: For program point init_modelEXIT(lines 451 482) no Hoare annotation was computed. [2018-11-18 15:28:19,443 INFO L421 ceAbstractionStarter]: At program point init_modelENTRY(lines 451 482) the Hoare annotation is: (or (< 0 |old(~comp_m1_i~0)|) (<= ~comp_m1_i~0 0)) [2018-11-18 15:28:19,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 03:28:19 BoogieIcfgContainer [2018-11-18 15:28:19,470 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 15:28:19,471 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:28:19,471 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:28:19,471 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:28:19,471 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:27:41" (3/4) ... [2018-11-18 15:28:19,483 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 15:28:19,488 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-18 15:28:19,488 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-18 15:28:19,488 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure method1 [2018-11-18 15:28:19,488 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-18 15:28:19,488 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-18 15:28:19,489 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 15:28:19,489 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-18 15:28:19,489 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_z [2018-11-18 15:28:19,489 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_d1 [2018-11-18 15:28:19,489 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 15:28:19,489 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-18 15:28:19,489 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-18 15:28:19,489 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_d0 [2018-11-18 15:28:19,489 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_b1 [2018-11-18 15:28:19,489 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_b0 [2018-11-18 15:28:19,489 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-18 15:28:19,489 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-18 15:28:19,490 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-18 15:28:19,490 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_method1_triggered [2018-11-18 15:28:19,490 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-18 15:28:19,499 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2018-11-18 15:28:19,499 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 15:28:19,518 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(1 == \old(b1_req_up)) || !(1 == b0_val_t)) || !(2 == \old(d0_ev))) || !(\old(z_ev) == 2)) || !(\old(d0_req_up) == 1)) || !(\old(b1_ev) == 2)) || !(\old(z_val) == 0)) || !(comp_m1_i == 0)) || (((((((((((((((z_val == 0 && d1_ev == 2) && b1_ev == 2) && b0_ev == 2) && z_req_up == 0) && b0_req_up == 0) && comp_m1_st == 0) && d0_val == 1) && d0_ev == 2) && d1_req_up == 0) && b0_val == 1) && b1_val == 1) && b1_req_up == 0) && d1_val == 1) && d0_req_up == 0) && z_ev == 2)) || !(2 == \old(d1_ev))) || (((((((((((((b1_ev == 2 && ((((z_val == 0 && d1_ev == 2) && z_val_t == 0) && z_req_up == 0) || (((z_val == 0 && d1_ev == 2) && z_req_up == 1) && z_val_t == 0))) && b0_ev == 2) && b0_req_up == 0) && d0_val == 1) && comp_m1_st == 2) && d0_ev == 2) && d1_req_up == 0) && b0_val == 1) && b1_val == 1) && b1_req_up == 0) && d1_val == 1) && d0_req_up == 0) && z_ev == 2)) || !(2 == \old(b0_ev))) || !(\old(b0_val) == 0)) || !(0 == \old(d1_val))) || (((((((((((((b1_ev == 2 && ((((z_val == 0 && d1_ev == 2) && z_val_t == 0) && z_req_up == 0) || (((z_val == 0 && d1_ev == 2) && z_req_up == 1) && z_val_t == 0))) && b0_ev == 2) && b0_req_up == 0) && comp_m1_st == 0) && d0_val == 1) && d0_ev == 2) && d1_req_up == 0) && b0_val == 1) && b1_val == 1) && b1_req_up == 0) && d1_val == 1) && d0_req_up == 0) && z_ev == 2)) || !(\old(d0_val) == 0)) || !(\old(z_req_up) == 0)) || !(1 == b1_val_t)) || !(1 == \old(b0_req_up))) || !(d1_val_t == 1)) || !(0 == \old(b1_val))) || !(1 == \old(d1_req_up))) || !(d0_val_t == 1) [2018-11-18 15:28:19,519 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(1 == \old(b1_req_up)) || !(1 == b0_val_t)) || !(2 == \old(d0_ev))) || !(\old(z_ev) == 2)) || !(\old(d0_req_up) == 1)) || !(\old(b1_ev) == 2)) || !(\old(z_val) == 0)) || !(comp_m1_i == 0)) || (((((((((((z_val == 0 && d1_ev == 2) && b1_ev == 2) && b0_ev == 2) && b0_req_up == 0) && d0_val == 1) && d0_ev == 2) && d1_req_up == 0) && b0_val == 1) && b1_req_up == 0) && d0_req_up == 0) && z_ev == 2)) || !(2 == \old(d1_ev))) || (((((((((((z_val == 0 && d1_ev == 2) && b1_ev == 2) && b0_ev == 2) && z_req_up == 0) && b0_req_up == 0) && comp_m1_st == 0) && d0_ev == 2) && d1_req_up == 0) && b1_req_up == 0) && d0_req_up == 0) && z_ev == 2)) || !(2 == \old(b0_ev))) || !(\old(b0_val) == 0)) || !(0 == \old(d1_val))) || !(\old(d0_val) == 0)) || !(\old(z_req_up) == 0)) || !(1 == b1_val_t)) || !(1 == \old(b0_req_up))) || !(d1_val_t == 1)) || !(0 == \old(b1_val))) || !(1 == \old(d1_req_up))) || !(d0_val_t == 1) [2018-11-18 15:28:19,519 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(2 == d0_ev) || !(z_ev == 2)) || !(b1_ev == 2)) || !(1 == b1_val)) || !(z_val == 0)) || ((z_val_t == 0 && comp_m1_st == 2) && z_req_up == 1)) || (z_req_up == 0 && comp_m1_st == 0)) || !(2 == d1_ev)) || !(2 == b0_ev)) || !(1 == d1_val)) || !(\old(z_req_up) == 0)) || !(0 == d1_req_up)) || !(0 == b1_req_up)) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1)) && (((((((((((!(z_ev == 2) || !(1 == b1_val)) || comp_m1_st == 0) || !(1 == d1_val)) || 0 < comp_m1_i) || (((((((((!(\old(z_req_up) == 0) || !(0 == d1_req_up)) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(2 == b0_ev)) && ((((((((!(0 == d1_req_up) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(\old(z_req_up) == 1)) || !(2 == b0_ev)))) || !(0 == \old(comp_m1_st))) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1)) || z_req_up == 1)) && ((((((!(z_ev == 2) || (((z_val_t == 0 && z_req_up == 0) || (z_req_up == 1 && z_val_t == 0)) && comp_m1_st == 2)) || (((z_val_t == 0 && z_req_up == 0) || (z_req_up == 1 && z_val_t == 0)) && comp_m1_st == 0)) || 0 < comp_m1_i) || (((((((((!(\old(z_req_up) == 0) || !(0 == d1_req_up)) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(2 == b0_ev)) && ((((((((!(0 == d1_req_up) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(\old(z_req_up) == 1)) || !(2 == b0_ev)))) || ((((((!(1 == b1_val) || !(1 == d1_val)) || !(0 == \old(comp_m1_st))) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) && (((((!(1 == b1_val) || !(2 == \old(comp_m1_st))) || !(1 == d1_val)) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)))) || !(d0_val == 1)) [2018-11-18 15:28:19,520 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(z_ev == 2) || (((z_req_up == 1 && z_val_t == 0) || (z_val_t == 0 && z_req_up == 0)) && (comp_m1_st == 0 || comp_m1_st == 2))) || 0 < comp_m1_i) || (((((((((!(\old(z_req_up) == 0) || !(0 == d1_req_up)) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(2 == b0_ev)) && ((((((((!(0 == d1_req_up) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(\old(z_req_up) == 1)) || !(2 == b0_ev)))) || ((((!(1 == b1_val) || !(2 == \old(comp_m1_st))) || !(1 == d1_val)) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1)) && ((((((((((!(z_ev == 2) || !(1 == b1_val)) || (((((((z_val == 0 && b1_ev == 2) && z_val_t == 0) && comp_m1_st == 2) && d0_ev == 2) && z_req_up == 1) && b1_val == 1) && z_ev == 2)) || !(1 == d1_val)) || 0 < comp_m1_i) || (((((((((!(\old(z_req_up) == 0) || !(0 == d1_req_up)) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(2 == b0_ev)) && ((((((((!(0 == d1_req_up) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(\old(z_req_up) == 1)) || !(2 == b0_ev)))) || !(0 == \old(comp_m1_st))) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1))) && (((((((((((((((((!(2 == d0_ev) || !(z_ev == 2)) || !(b1_ev == 2)) || !(1 == b1_val)) || !(z_val == 0)) || (((((((z_val == 0 && b1_ev == 2) && z_val_t == 0) && comp_m1_st == 2) && d0_ev == 2) && z_req_up == 1) && b1_val == 1) && z_ev == 2)) || !(2 == d1_ev)) || !(2 == b0_ev)) || !(1 == d1_val)) || !(\old(z_req_up) == 0)) || !(0 == d1_req_up)) || !(0 == b1_req_up)) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1)) [2018-11-18 15:28:19,554 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_61cda7ac-798f-4043-a5b4-461b42cd7265/bin-2019/utaipan/witness.graphml [2018-11-18 15:28:19,554 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:28:19,555 INFO L168 Benchmark]: Toolchain (without parser) took 38497.24 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 841.0 MB). Free memory was 959.1 MB in the beginning and 1.4 GB in the end (delta: -477.3 MB). Peak memory consumption was 363.6 MB. Max. memory is 11.5 GB. [2018-11-18 15:28:19,555 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:28:19,555 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.93 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 943.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 15:28:19,556 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.23 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:28:19,556 INFO L168 Benchmark]: Boogie Preprocessor took 76.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 943.0 MB in the beginning and 1.2 GB in the end (delta: -256.4 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-18 15:28:19,556 INFO L168 Benchmark]: RCFGBuilder took 348.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2018-11-18 15:28:19,556 INFO L168 Benchmark]: TraceAbstraction took 37758.96 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 639.1 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -270.2 MB). Peak memory consumption was 905.8 MB. Max. memory is 11.5 GB. [2018-11-18 15:28:19,556 INFO L168 Benchmark]: Witness Printer took 83.29 ms. Allocated memory is still 1.9 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:28:19,558 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 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 212.93 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 943.0 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.23 ms. Allocated memory is still 1.0 GB. Free memory is still 943.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 943.0 MB in the beginning and 1.2 GB in the end (delta: -256.4 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 348.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37758.96 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 639.1 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -270.2 MB). Peak memory consumption was 905.8 MB. Max. memory is 11.5 GB. * Witness Printer took 83.29 ms. Allocated memory is still 1.9 GB. Free memory is still 1.4 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: ((((((((((((((((((((!(1 == \old(b1_req_up)) || !(1 == b0_val_t)) || !(2 == \old(d0_ev))) || !(\old(z_ev) == 2)) || !(\old(d0_req_up) == 1)) || !(\old(b1_ev) == 2)) || !(\old(z_val) == 0)) || !(comp_m1_i == 0)) || (((((((((((z_val == 0 && d1_ev == 2) && b1_ev == 2) && b0_ev == 2) && b0_req_up == 0) && d0_val == 1) && d0_ev == 2) && d1_req_up == 0) && b0_val == 1) && b1_req_up == 0) && d0_req_up == 0) && z_ev == 2)) || !(2 == \old(d1_ev))) || (((((((((((z_val == 0 && d1_ev == 2) && b1_ev == 2) && b0_ev == 2) && z_req_up == 0) && b0_req_up == 0) && comp_m1_st == 0) && d0_ev == 2) && d1_req_up == 0) && b1_req_up == 0) && d0_req_up == 0) && z_ev == 2)) || !(2 == \old(b0_ev))) || !(\old(b0_val) == 0)) || !(0 == \old(d1_val))) || !(\old(d0_val) == 0)) || !(\old(z_req_up) == 0)) || !(1 == b1_val_t)) || !(1 == \old(b0_req_up))) || !(d1_val_t == 1)) || !(0 == \old(b1_val))) || !(1 == \old(d1_req_up))) || !(d0_val_t == 1) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((!(z_ev == 2) || 0 < comp_m1_i) || ((!(z_req_up == 0) || !(0 == z_val_t)) && (!(0 == z_val_t) || !(z_req_up == 1)))) || (((((((((((((!(2 == d0_ev) || !(b1_ev == 2)) || !(1 == b1_val)) || !(z_val == 0)) || !(2 == d1_ev)) || !(2 == b0_ev)) || !(1 == d1_val)) || !(0 == d1_req_up)) || !(0 == b1_req_up)) || !(0 == comp_m1_st)) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) && ((((((((((((!(2 == d0_ev) || !(b1_ev == 2)) || !(1 == b1_val)) || !(z_val == 0)) || !(2 == d1_ev)) || !(2 == b0_ev)) || !(2 == comp_m1_st)) || !(1 == d1_val)) || !(0 == d1_req_up)) || !(0 == b1_req_up)) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)))) || (__retres1 == 1 && comp_m1_st == 0) || (__retres1 == 0 && comp_m1_st == 2)) || !(d0_val == 1)) && (((((((((((((((((!(2 == d0_ev) || !(z_ev == 2)) || __retres1 == 1) || !(b1_ev == 2)) || !(1 == b1_val)) || !(z_val == 0)) || !(2 == d1_ev)) || !(2 == b0_ev)) || !(1 == d1_val)) || !(z_req_up == 0)) || !(0 == d1_req_up)) || !(0 == b1_req_up)) || 0 < comp_m1_i) || !(0 == comp_m1_st)) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1)) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: ((((((!(z_ev == 2) || (((z_req_up == 1 && z_val_t == 0) || (z_val_t == 0 && z_req_up == 0)) && (comp_m1_st == 0 || comp_m1_st == 2))) || 0 < comp_m1_i) || (((((((((!(\old(z_req_up) == 0) || !(0 == d1_req_up)) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(2 == b0_ev)) && ((((((((!(0 == d1_req_up) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(\old(z_req_up) == 1)) || !(2 == b0_ev)))) || ((((!(1 == b1_val) || !(2 == \old(comp_m1_st))) || !(1 == d1_val)) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1)) && ((((((((((!(z_ev == 2) || !(1 == b1_val)) || (((((((z_val == 0 && b1_ev == 2) && z_val_t == 0) && comp_m1_st == 2) && d0_ev == 2) && z_req_up == 1) && b1_val == 1) && z_ev == 2)) || !(1 == d1_val)) || 0 < comp_m1_i) || (((((((((!(\old(z_req_up) == 0) || !(0 == d1_req_up)) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(2 == b0_ev)) && ((((((((!(0 == d1_req_up) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(\old(z_req_up) == 1)) || !(2 == b0_ev)))) || !(0 == \old(comp_m1_st))) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1))) && (((((((((((((((((!(2 == d0_ev) || !(z_ev == 2)) || !(b1_ev == 2)) || !(1 == b1_val)) || !(z_val == 0)) || (((((((z_val == 0 && b1_ev == 2) && z_val_t == 0) && comp_m1_st == 2) && d0_ev == 2) && z_req_up == 1) && b1_val == 1) && z_ev == 2)) || !(2 == d1_ev)) || !(2 == b0_ev)) || !(1 == d1_val)) || !(\old(z_req_up) == 0)) || !(0 == d1_req_up)) || !(0 == b1_req_up)) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1)) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(2 == d0_ev) || !(z_ev == 2)) || !(b1_ev == 2)) || !(1 == b1_val)) || !(z_val == 0)) || ((z_val_t == 0 && comp_m1_st == 2) && z_req_up == 1)) || (z_req_up == 0 && comp_m1_st == 0)) || !(2 == d1_ev)) || !(2 == b0_ev)) || !(1 == d1_val)) || !(\old(z_req_up) == 0)) || !(0 == d1_req_up)) || !(0 == b1_req_up)) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1)) && (((((((((((!(z_ev == 2) || !(1 == b1_val)) || comp_m1_st == 0) || !(1 == d1_val)) || 0 < comp_m1_i) || (((((((((!(\old(z_req_up) == 0) || !(0 == d1_req_up)) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(2 == b0_ev)) && ((((((((!(0 == d1_req_up) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(\old(z_req_up) == 1)) || !(2 == b0_ev)))) || !(0 == \old(comp_m1_st))) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1)) || z_req_up == 1)) && ((((((!(z_ev == 2) || (((z_val_t == 0 && z_req_up == 0) || (z_req_up == 1 && z_val_t == 0)) && comp_m1_st == 2)) || (((z_val_t == 0 && z_req_up == 0) || (z_req_up == 1 && z_val_t == 0)) && comp_m1_st == 0)) || 0 < comp_m1_i) || (((((((((!(\old(z_req_up) == 0) || !(0 == d1_req_up)) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(2 == b0_ev)) && ((((((((!(0 == d1_req_up) || !(2 == d0_ev)) || !(b1_ev == 2)) || !(z_val == 0)) || !(0 == \old(z_val_t))) || !(0 == b1_req_up)) || !(2 == d1_ev)) || !(\old(z_req_up) == 1)) || !(2 == b0_ev)))) || ((((((!(1 == b1_val) || !(1 == d1_val)) || !(0 == \old(comp_m1_st))) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)) && (((((!(1 == b1_val) || !(2 == \old(comp_m1_st))) || !(1 == d1_val)) || !(0 == b0_req_up)) || !(d0_req_up == 0)) || !(b0_val == 1)))) || !(d0_val == 1)) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (((((((((((((((!(z_ev == 2) || !(1 == b1_val)) || !(z_val == 0)) || !(1 == d1_val)) || __retres1 == 1) || !(z_req_up == 0)) || !(0 == d1_req_up)) || !(b1_ev == 1)) || !(0 == b1_req_up)) || 0 < comp_m1_i) || !(1 == d0_ev)) || !(0 == b0_req_up)) || !(1 == b0_ev)) || !(d0_req_up == 0)) || !(b0_val == 1)) || !(d0_val == 1)) || !(1 == d1_ev) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(1 == \old(b1_req_up)) || !(1 == b0_val_t)) || !(2 == \old(d0_ev))) || !(\old(z_ev) == 2)) || !(\old(d0_req_up) == 1)) || !(\old(b1_ev) == 2)) || !(\old(z_val) == 0)) || !(comp_m1_i == 0)) || (((((((((((((((z_val == 0 && d1_ev == 2) && b1_ev == 2) && b0_ev == 2) && z_req_up == 0) && b0_req_up == 0) && comp_m1_st == 0) && d0_val == 1) && d0_ev == 2) && d1_req_up == 0) && b0_val == 1) && b1_val == 1) && b1_req_up == 0) && d1_val == 1) && d0_req_up == 0) && z_ev == 2)) || !(2 == \old(d1_ev))) || (((((((((((((b1_ev == 2 && ((((z_val == 0 && d1_ev == 2) && z_val_t == 0) && z_req_up == 0) || (((z_val == 0 && d1_ev == 2) && z_req_up == 1) && z_val_t == 0))) && b0_ev == 2) && b0_req_up == 0) && d0_val == 1) && comp_m1_st == 2) && d0_ev == 2) && d1_req_up == 0) && b0_val == 1) && b1_val == 1) && b1_req_up == 0) && d1_val == 1) && d0_req_up == 0) && z_ev == 2)) || !(2 == \old(b0_ev))) || !(\old(b0_val) == 0)) || !(0 == \old(d1_val))) || (((((((((((((b1_ev == 2 && ((((z_val == 0 && d1_ev == 2) && z_val_t == 0) && z_req_up == 0) || (((z_val == 0 && d1_ev == 2) && z_req_up == 1) && z_val_t == 0))) && b0_ev == 2) && b0_req_up == 0) && comp_m1_st == 0) && d0_val == 1) && d0_ev == 2) && d1_req_up == 0) && b0_val == 1) && b1_val == 1) && b1_req_up == 0) && d1_val == 1) && d0_req_up == 0) && z_ev == 2)) || !(\old(d0_val) == 0)) || !(\old(z_req_up) == 0)) || !(1 == b1_val_t)) || !(1 == \old(b0_req_up))) || !(d1_val_t == 1)) || !(0 == \old(b1_val))) || !(1 == \old(d1_req_up))) || !(d0_val_t == 1) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 143 locations, 1 error locations. SAFE Result, 37.6s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 25.6s AutomataDifference, 0.0s DeadEndRemovalTime, 6.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2403 SDtfs, 1591 SDslu, 16983 SDs, 0 SdLazy, 12398 SolverSat, 572 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 22 DeclaredPredicates, 1690 GetRequests, 1411 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=340occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 11 AbstIntIterations, 11 AbstIntStrong, 0.9941144499547515 AbsIntWeakeningRatio, 0.6162294081757169 AbsIntAvgWeakeningVarsNumRemoved, 11.294081757169005 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 42 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 744 PreInvPairs, 801 NumberOfFragments, 8068 HoareAnnotationTreeSize, 744 FomulaSimplifications, 8122 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 52 FomulaSimplificationsInter, 11061 FormulaSimplificationTreeSizeReductionInter, 5.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2062 NumberOfCodeBlocks, 2062 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2048 ConstructedInterpolants, 0 QuantifiedInterpolants, 525052 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 3 PerfectInterpolantSequences, 416/556 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...